Public report of jamal-wia/Paginator, published 22 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog 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, 22 October 2026, 19:37 UTC · Survey ID cd_f8e094bf89284627baa747961ecfdb5e
jamal-wia/Paginator
Measured 22 October 2026, 19:32 UTC, at code version c31cac0
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
Down 7 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A medium codebase: 20,666 lines of product code in 12 projects, tests not counted · Estimated rebuild effort: about 0.3 person-years · Weakest lens: Maturity, 41
Findings by how serious they are
4 critical153 serious31 minor
13 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
22 October 2026, 19:32 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
50of 55 dimensions measured by tools. The other 5 are advisory notes from an AI model, which explain the code but don't count towards the score.
170of 188 findings point to an exact file and line, so you can open each one in the code. The other 18 concern the repository as a whole, such as missing documentation.
55dimensions across 6 lenses, read from 20,666 lines of product code in 12 projects.
jamal-wia/Paginator scores 54 out of 100 and is rated Adequate, while four of its six lenses score higher still: Architecture at 98 and Code Health at 93, both rated Exemplary, Performance at 78, rated Strong, and Security and Compliance at 77, rated Adequate.
The score is lower than those four because the weakest lens counts most, and here that is Maturity, which scores 41 and is rated Weak. Its Documentation accuracy dimension scores 0 out of 10, and until that reaches 4, Maturity can't be rated higher than Adequate. The first actions are to resolve the 1 No ADRs found finding(s) in ADR Quality and to reconcile the README with reality: docs/13, and if Maturity rose to 70, the score would rise from 54 to about 63.
Four findings are critical, all in Static Analysis (SAST).
Watchdog couldn't measure 12 dimensions in this code, among them Code Coverage, Test Reliability and Dependency Hygiene, so they are left out of the score. The product code is 20,666 lines, which would take an estimated 0.3 person-years, around €37,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.
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 1 finding
This critical or serious finding was in the previous survey, on 8 October 2026, and is gone from this one.
Supply-chain Provenance & Signing REDACTED
Rebuild cost: about €37,000 · Estimate
Cost to rebuild
€12,000 to €62,000, for 207 to 656 hours of work, about 0.3 person-years for one engineer
Difficulty of the problem
Standard, 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.8 at a score of 54. 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
Medium: 20,666 lines of product code
How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 10 points · Low effort · ADR Quality
2
Reconcile the README with reality: docs/13.
cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/exception/EndOfCursorFeedException.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/exception/EndOfCursorFeedException.kt` does not exist; docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/bookmark/CursorBookmark.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/bookmark/CursorBookmark.kt` does not exist; docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/load/CursorLoadResult.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/load/CursorLoadResult.kt` does not exist; docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPagingCore.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPagingCore.kt` does not exist; docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPaginator.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPaginator.kt` does not exist.
Add a SAST step to CI running what this repository's stack ships: spotbugs with find-sec-bugs — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
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 €37,000 to build again, about 0.3 person-years of work. Its weakest lens is Maturity, at 41 (Weak). Maturity is about how well the project explains and looks after itself, which decides whether a new developer, or a new supplier, can take over. Because the weakest lens counts most in the score, work on Maturity also moves the score most.
Based on: the rebuild estimate · the Maturity grade · how much each lens counts
What to do: Start with the Maturity actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No ADRs found finding(s) in ADR Quality. Of all the actions in this report, it raises the score most for the work it takes: about 10 points for low effort, because it clears the 1 ADR Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways — a layering smell or cycle. A clean layered graph 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.
90 modules, with 183 dependencies between them. 3 loops run through 6 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 50 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.
cursor.MutableCursorPaginator uses cursor.bookmark, so a change to cursor.bookmark can break cursor.MutableCursorPaginator, while a change to cursor.MutableCursorPaginator can't break cursor.bookmark.
Position
Below the diagonal: cursor.MutableCursorPaginator uses a module listed above it, which is the healthy direction.
cursor.cache.reactive uses core.cache.reactive, so a change to core.cache.reactive can break cursor.cache.reactive, while a change to cursor.cache.reactive can't break core.cache.reactive.
Position
Below the diagonal: cursor.cache.reactive uses a module listed above it, which is the healthy direction.
cursor.exception uses cursor.bookmark, so a change to cursor.bookmark can break cursor.exception, while a change to cursor.exception can't break cursor.bookmark.
Position
Below the diagonal: cursor.exception uses a module listed above it, which is the healthy direction.
core.cache.eviction uses core.page, so a change to core.page can break core.cache.eviction, while a change to core.cache.eviction can't break core.page.
Position
Below the diagonal: core.cache.eviction uses a module listed above it, which is the healthy direction.
core.page.PageState uses core.page, so a change to core.page can break core.page.PageState, while a change to core.page.PageState can't break core.page.
Position
Below the diagonal: core.page.PageState uses a module listed above it, which is the healthy direction.
compose.core uses core.page.PageState, so a change to core.page.PageState can break compose.core, while a change to compose.core can't break core.page.PageState.
Position
Below the diagonal: compose.core uses a module listed above it, which is the healthy direction.
cursor.page.CursorPageState uses core.load, so a change to core.load can break cursor.page.CursorPageState, while a change to cursor.page.CursorPageState can't break core.load.
Position
Below the diagonal: cursor.page.CursorPageState uses a module listed above it, which is the healthy direction.
cursor.page.CursorPageState uses cursor.bookmark, so a change to cursor.bookmark can break cursor.page.CursorPageState, while a change to cursor.page.CursorPageState can't break cursor.bookmark.
Position
Below the diagonal: cursor.page.CursorPageState uses a module listed above it, which is the healthy direction.
cursor.page.CursorPageState uses core.page.PageState, so a change to core.page.PageState can break cursor.page.CursorPageState, while a change to cursor.page.CursorPageState can't break core.page.PageState.
Position
Below the diagonal: cursor.page.CursorPageState uses a module listed above it, which is the healthy direction.
17→19 cursor.page.CursorPageState uses cursor.pagepart of a loop✕
Connections
3 pairs of types, where a type in cursor.page.CursorPageState uses a type in cursor.page.
cursor.page.CursorPageState uses cursor.page, so a change to cursor.page can break cursor.page.CursorPageState, while a change to cursor.page.CursorPageState can't break cursor.page.
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.
offset.page.OffsetPageState uses core.load, so a change to core.load can break offset.page.OffsetPageState, while a change to offset.page.OffsetPageState can't break core.load.
Position
Below the diagonal: offset.page.OffsetPageState uses a module listed above it, which is the healthy direction.
offset.page.OffsetPageState uses core.page.PageState, so a change to core.page.PageState can break offset.page.OffsetPageState, while a change to offset.page.OffsetPageState can't break core.page.PageState.
Position
Below the diagonal: offset.page.OffsetPageState uses a module listed above it, which is the healthy direction.
18→20 offset.page.OffsetPageState uses offset.pagepart of a loop✕
Connections
3 pairs of types, where a type in offset.page.OffsetPageState uses a type in offset.page.
offset.page.OffsetPageState uses offset.page, so a change to offset.page can break offset.page.OffsetPageState, while a change to offset.page.OffsetPageState can't break offset.page.
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.
cursor.page uses cursor.page.CursorPageState, so a change to cursor.page.CursorPageState can break cursor.page, while a change to cursor.page can't break cursor.page.CursorPageState.
Position
Below the diagonal: cursor.page uses a module listed above it, which is the healthy direction.
offset.page uses offset.page.OffsetPageState, so a change to offset.page.OffsetPageState can break offset.page, while a change to offset.page can't break offset.page.OffsetPageState.
Position
Below the diagonal: offset.page uses a module listed above it, which is the healthy direction.
cursor.CursorPaginator uses cursor.bookmark, so a change to cursor.bookmark can break cursor.CursorPaginator, while a change to cursor.CursorPaginator can't break cursor.bookmark.
Position
Below the diagonal: cursor.CursorPaginator uses a module listed above it, which is the healthy direction.
cursor.CursorPaginator uses cursor.page, so a change to cursor.page can break cursor.CursorPaginator, while a change to cursor.CursorPaginator can't break cursor.page.
Position
Below the diagonal: cursor.CursorPaginator uses a module listed above it, which is the healthy direction.
cursor.CursorPagingCore uses cursor.bookmark, so a change to cursor.bookmark can break cursor.CursorPagingCore, while a change to cursor.CursorPagingCore can't break cursor.bookmark.
Position
Below the diagonal: cursor.CursorPagingCore uses a module listed above it, which is the healthy direction.
cursor.CursorPagingCore uses cursor.page, so a change to cursor.page can break cursor.CursorPagingCore, while a change to cursor.CursorPagingCore can't break cursor.page.
Position
Below the diagonal: cursor.CursorPagingCore uses a module listed above it, which is the healthy direction.
cursor.cache.persistent uses cursor.bookmark, so a change to cursor.bookmark can break cursor.cache.persistent, while a change to cursor.cache.persistent can't break cursor.bookmark.
Position
Below the diagonal: cursor.cache.persistent uses a module listed above it, which is the healthy direction.
cursor.cache.persistent uses cursor.page, so a change to cursor.page can break cursor.cache.persistent, while a change to cursor.cache.persistent can't break cursor.page.
Position
Below the diagonal: cursor.cache.persistent uses a module listed above it, which is the healthy direction.
offset.Paginator uses offset.bookmark, so a change to offset.bookmark can break offset.Paginator, while a change to offset.Paginator can't break offset.bookmark.
Position
Below the diagonal: offset.Paginator uses a module listed above it, which is the healthy direction.
offset.cache.persistent uses offset.page, so a change to offset.page can break offset.cache.persistent, while a change to offset.cache.persistent can't break offset.page.
Position
Below the diagonal: offset.cache.persistent uses a module listed above it, which is the healthy direction.
cursor uses cursor.MutableCursorPaginator, so a change to cursor.MutableCursorPaginator can break cursor, while a change to cursor can't break cursor.MutableCursorPaginator.
Position
Below the diagonal: cursor uses a module listed above it, which is the healthy direction.
cursor uses cursor.page.CursorPageState, so a change to cursor.page.CursorPageState can break cursor, while a change to cursor can't break cursor.page.CursorPageState.
Position
Below the diagonal: cursor uses a module listed above it, which is the healthy direction.
cursor uses cursor.CursorPaginator, so a change to cursor.CursorPaginator can break cursor, while a change to cursor can't break cursor.CursorPaginator.
Position
Below the diagonal: cursor uses a module listed above it, which is the healthy direction.
cursor uses cursor.CursorPagingCore, so a change to cursor.CursorPagingCore can break cursor, while a change to cursor can't break cursor.CursorPagingCore.
Position
Below the diagonal: cursor uses a module listed above it, which is the healthy direction.
cursor uses cursor.cache.persistent, so a change to cursor.cache.persistent can break cursor, while a change to cursor can't break cursor.cache.persistent.
Position
Below the diagonal: cursor uses a module listed above it, which is the healthy direction.
cursor.cache.eviction uses cursor.bookmark, so a change to cursor.bookmark can break cursor.cache.eviction, while a change to cursor.cache.eviction can't break cursor.bookmark.
Position
Below the diagonal: cursor.cache.eviction uses a module listed above it, which is the healthy direction.
cursor.cache.eviction uses core.cache.eviction, so a change to core.cache.eviction can break cursor.cache.eviction, while a change to cursor.cache.eviction can't break core.cache.eviction.
Position
Below the diagonal: cursor.cache.eviction uses a module listed above it, which is the healthy direction.
cursor.cache.eviction uses cursor.page, so a change to cursor.page can break cursor.cache.eviction, while a change to cursor.cache.eviction can't break cursor.page.
Position
Below the diagonal: cursor.cache.eviction uses a module listed above it, which is the healthy direction.
cursor.cache.eviction uses cursor.cache, so a change to cursor.cache can break cursor.cache.eviction, while a change to cursor.cache.eviction can't break cursor.cache.
Position
Below the diagonal: cursor.cache.eviction uses a module listed above it, which is the healthy direction.
offset uses offset.page.OffsetPageState, so a change to offset.page.OffsetPageState can break offset, while a change to offset can't break offset.page.OffsetPageState.
Position
Below the diagonal: offset uses a module listed above it, which is the healthy direction.
offset uses offset.cache.persistent, so a change to offset.cache.persistent can break offset, while a change to offset can't break offset.cache.persistent.
Position
Below the diagonal: offset uses a module listed above it, which is the healthy direction.
offset.cache.eviction uses core.cache.eviction, so a change to core.cache.eviction can break offset.cache.eviction, while a change to offset.cache.eviction can't break core.cache.eviction.
Position
Below the diagonal: offset.cache.eviction uses a module listed above it, which is the healthy direction.
offset.cache.eviction uses offset.page, so a change to offset.page can break offset.cache.eviction, while a change to offset.cache.eviction can't break offset.page.
Position
Below the diagonal: offset.cache.eviction uses a module listed above it, which is the healthy direction.
offset.cache.eviction uses offset.cache, so a change to offset.cache can break offset.cache.eviction, while a change to offset.cache.eviction can't break offset.cache.
Position
Below the diagonal: offset.cache.eviction uses a module listed above it, which is the healthy direction.
com.jamal_aliev.paginator uses core.logger, so a change to core.logger can break com.jamal_aliev.paginator, while a change to com.jamal_aliev.paginator can't break core.logger.
Position
Below the diagonal: com.jamal_aliev.paginator uses a module listed above it, which is the healthy direction.
com.jamal_aliev.paginator uses offset.page.OffsetPageState, so a change to offset.page.OffsetPageState can break com.jamal_aliev.paginator, while a change to com.jamal_aliev.paginator can't break offset.page.OffsetPageState.
Position
Below the diagonal: com.jamal_aliev.paginator uses a module listed above it, which is the healthy direction.
com.jamal_aliev.paginator uses offset.page, so a change to offset.page can break com.jamal_aliev.paginator, while a change to com.jamal_aliev.paginator can't break offset.page.
Position
Below the diagonal: com.jamal_aliev.paginator uses a module listed above it, which is the healthy direction.
com.jamal_aliev.paginator uses offset, so a change to offset can break com.jamal_aliev.paginator, while a change to com.jamal_aliev.paginator can't break offset.
Position
Below the diagonal: com.jamal_aliev.paginator uses a module listed above it, which is the healthy direction.
cursor.dsl uses cursor.page.CursorPageState, so a change to cursor.page.CursorPageState can break cursor.dsl, while a change to cursor.dsl can't break cursor.page.CursorPageState.
Position
Below the diagonal: cursor.dsl uses a module listed above it, which is the healthy direction.
cursor.dsl uses cursor.cache.persistent, so a change to cursor.cache.persistent can break cursor.dsl, while a change to cursor.dsl can't break cursor.cache.persistent.
Position
Below the diagonal: cursor.dsl uses a module listed above it, which is the healthy direction.
cursor.prefetch uses cursor.bookmark, so a change to cursor.bookmark can break cursor.prefetch, while a change to cursor.prefetch can't break cursor.bookmark.
Position
Below the diagonal: cursor.prefetch uses a module listed above it, which is the healthy direction.
cursor.prefetch uses cursor.page.CursorPageState, so a change to cursor.page.CursorPageState can break cursor.prefetch, while a change to cursor.prefetch can't break cursor.page.CursorPageState.
Position
Below the diagonal: cursor.prefetch uses a module listed above it, which is the healthy direction.
offset.dsl uses offset.page.OffsetPageState, so a change to offset.page.OffsetPageState can break offset.dsl, while a change to offset.dsl can't break offset.page.OffsetPageState.
Position
Below the diagonal: offset.dsl uses a module listed above it, which is the healthy direction.
offset.dsl uses offset.cache.persistent, so a change to offset.cache.persistent can break offset.dsl, while a change to offset.dsl can't break offset.cache.persistent.
Position
Below the diagonal: offset.dsl uses a module listed above it, which is the healthy direction.
offset.prefetch uses offset.page.OffsetPageState, so a change to offset.page.OffsetPageState can break offset.prefetch, while a change to offset.prefetch can't break offset.page.OffsetPageState.
Position
Below the diagonal: offset.prefetch uses a module listed above it, which is the healthy direction.
compose.cursor uses cursor.bookmark, so a change to cursor.bookmark can break compose.cursor, while a change to compose.cursor can't break cursor.bookmark.
Position
Below the diagonal: compose.cursor uses a module listed above it, which is the healthy direction.
compose.cursor uses core.page.PageState, so a change to core.page.PageState can break compose.cursor, while a change to compose.cursor can't break core.page.PageState.
Position
Below the diagonal: compose.cursor uses a module listed above it, which is the healthy direction.
compose.cursor uses cursor.prefetch, so a change to cursor.prefetch can break compose.cursor, while a change to compose.cursor can't break cursor.prefetch.
Position
Below the diagonal: compose.cursor uses a module listed above it, which is the healthy direction.
compose.offset uses core.page.PageState, so a change to core.page.PageState can break compose.offset, while a change to compose.offset can't break core.page.PageState.
Position
Below the diagonal: compose.offset uses a module listed above it, which is the healthy direction.
compose.offset uses offset.prefetch, so a change to offset.prefetch can break compose.offset, while a change to compose.offset can't break offset.prefetch.
Position
Below the diagonal: compose.offset uses a module listed above it, which is the healthy direction.
cursor.extension uses core.cache.reactive, so a change to core.cache.reactive can break cursor.extension, while a change to cursor.extension can't break core.cache.reactive.
Position
Below the diagonal: cursor.extension uses a module listed above it, which is the healthy direction.
cursor.extension uses cursor.bookmark, so a change to cursor.bookmark can break cursor.extension, while a change to cursor.extension can't break cursor.bookmark.
Position
Below the diagonal: cursor.extension uses a module listed above it, which is the healthy direction.
cursor.extension uses cursor.MutableCursorPaginator, so a change to cursor.MutableCursorPaginator can break cursor.extension, while a change to cursor.extension can't break cursor.MutableCursorPaginator.
Position
Below the diagonal: cursor.extension uses a module listed above it, which is the healthy direction.
cursor.extension uses cursor.cache.reactive, so a change to cursor.cache.reactive can break cursor.extension, while a change to cursor.extension can't break cursor.cache.reactive.
Position
Below the diagonal: cursor.extension uses a module listed above it, which is the healthy direction.
cursor.extension uses cursor.page.CursorPageState, so a change to cursor.page.CursorPageState can break cursor.extension, while a change to cursor.extension can't break cursor.page.CursorPageState.
Position
Below the diagonal: cursor.extension uses a module listed above it, which is the healthy direction.
cursor.extension uses cursor.cache, so a change to cursor.cache can break cursor.extension, while a change to cursor.extension can't break cursor.cache.
Position
Below the diagonal: cursor.extension uses a module listed above it, which is the healthy direction.
cursor.extension uses cursor.prefetch, so a change to cursor.prefetch can break cursor.extension, while a change to cursor.extension can't break cursor.prefetch.
Position
Below the diagonal: cursor.extension uses a module listed above it, which is the healthy direction.
offset.extension uses core.cache.reactive, so a change to core.cache.reactive can break offset.extension, while a change to offset.extension can't break core.cache.reactive.
Position
Below the diagonal: offset.extension uses a module listed above it, which is the healthy direction.
offset.extension uses offset.page.OffsetPageState, so a change to offset.page.OffsetPageState can break offset.extension, while a change to offset.extension can't break offset.page.OffsetPageState.
Position
Below the diagonal: offset.extension uses a module listed above it, which is the healthy direction.
offset.extension uses offset.cache, so a change to offset.cache can break offset.extension, while a change to offset.extension can't break offset.cache.
Position
Below the diagonal: offset.extension uses a module listed above it, which is the healthy direction.
offset.extension uses offset.prefetch, so a change to offset.prefetch can break offset.extension, while a change to offset.extension can't break offset.prefetch.
Position
Below the diagonal: offset.extension 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
A03:2025 — Software Supply Chain Failures
5
Medium
A05:2025 — Injection
4
High / Critical
Roadmap
First, establish architectural governance by creating a dedicated folder for Architecture Decision Records to document significant design choices and their consequences. Simultaneously, ensure documentation accuracy by reconciling the README and other guides with the actual codebase, removing references to files that no longer exist. Next, enhance code quality and security by adding a static analysis step to the CI pipeline to automatically fail builds on security regressions. Finally, improve onboarding and maintenance by adding a clear testing section to the README that explains how to run the test suite.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Reconcile the README with reality: docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/exception/EndOfCursorFeedException.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/exception/EndOfCursorFeedException.kt` does not exist; docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/bookmark/CursorBookmark.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/bookmark/CursorBookmark.kt` does not exist; docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/load/CursorLoadResult.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/load/CursorLoadResult.kt` does not exist; docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPagingCore.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPagingCore.kt` does not exist; docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPaginator.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPaginator.kt` does not exist.
Add a SAST step to CI running what this repository's stack ships: spotbugs with find-sec-bugs — 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.
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.
Raise allocation-aware density on the hot paths — currently 8 use(s) across 22,455 production line(s) (~0.4/1k). More of the idioms below on the allocation-heavy paths climbs this toward 10.
Every finding carries one of four grades. Three say how serious it is. The fourth says this
survey could not settle it — and it is a grade, not a gap.
Critical — 4
A definite problem that already costs you something and drags the score down: a
missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here
tends to cause failures elsewhere.
Serious — 153
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 — 31
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 13
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 50 of 55 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 5 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 55 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, 170 of 188 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, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — 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 — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.kt) 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 (JaCoCo XML — the Gradle `jacocoTestReport` task) 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 (JaCoCo XML — the Gradle `jacocoTestReport` task) 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 — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.kt) and this repository declares a JVM test suite (repository root, Gradle), 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.
D12 Dependency Hygiene — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Not scored — 13 Maven/Gradle manifest(s) were read, stating a version for 19 dependency(ies) and leaving 18 to a parent or an imported BOM, but no build resolved the dependency graph, so the outdated signal was not established. NOT a finding that these dependencies are current or healthy.
D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (3 contributor(s) across 363 commit(s) sampled, automation and bot accounts excluded). One of them holds 99% of the history; the other 2 hold 0.5% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
D32 Data Compliance (PII/GDPR) — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `paginator-compose-core/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/core/internal/PrefetchScrollBinder.kt`, `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt`, `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt`, `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyRow.kt`, `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt`, … (+12 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
AX6 Interface segregation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
AXR1 Runtime accessibility — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Boot via AndroidApp (app). the Android app did not build — `./gradlew :app:assembleDebug` exited 1: not in 'org.gradle' namespace)
- Included Builds (No included builds contain this plugin)
- Plugin Repositories (could not resolve plugin artifact 'org.jetbrains.kotlin.android:org.jetbrains.kotlin.an…; runtime evidence skipped (launch chosen because app/build.gradle.kts applies the Android application plugin and gradlew builds it).
C2 Access Controls — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby or Scala was found, and this repository's Kotlin is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and no C#, JavaScript/TypeScript, Java, Dart, Ruby or Scala was found, and this repository's Kotlin is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
S1 Web-Security Posture — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X24 Document value interpolated into markup unescaped — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Scala, Ruby and Python source only, and no C# was loaded and no JavaScript/TypeScript, Java, Scala, Ruby or Python was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
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.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D22 Internal API Consistency: API-surface coherence is an LLM judgement over a sample of the public surface — consistency of intent across the whole API is approximated, not exhaustively verified.
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").
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
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: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
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.
The LLM boundary
LLM-set scores this run (5): D19, D21, D22, D26, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.
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.
+ 9 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 14 bodies over 15 down to 15 or less in Cyclomatic Complexity — start with CursorPaginator.goNextPage (cyclomatic 29), CursorPaginator.goPreviousPage (cyclomatic 24), Paginator.goNextPage (cyclomatic 22). — 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 14 together lifts Cyclomatic Complexity from 8.2 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.
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.
+ 21 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 3 bodies over 30 down to 30 or less in Cognitive Complexity — start with CursorPaginator.goNextPage (cognitive 39), MutablePaginator.addAllElements (cognitive 34), CursorPaginator.goPreviousPage (cognitive 32). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 3 together lifts Cognitive Complexity from 6.4 to about 6.9/10, projected with the scoring formula itself and assuming each lands exactly at 30; 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 Classes8.9 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 5 ClassTooLong finding(s) in God Classes — start with CursorPaginator.kt, Paginator.kt, MainActivity.kt. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 3 FileTooLong finding(s) in God Classes — start with CursorPaginator.kt, MainActivity.kt, Paginator.kt. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 3 MethodTooLong finding(s) in God Classes — start with MainActivity.kt (2), PagingCore.kt. — One of this dimension's main actionable groups (3 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.
80 duplicated block group(s) detected. A further 7 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.
+ 45 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 6 Duplicated block (20 lines × 2) finding(s) in Code Duplication — start with PrefetchOnScroll.kt (3), CursorPaginatorPrefetchController.kt, Paginator.kt. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 5 Duplicated block (13 lines × 2) finding(s) in Code Duplication — start with SnapshotReactiveCache.kt, DataItemCountTracker.kt, PaginatorDataItemCount.kt. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 4 Duplicated block (31 lines × 2) finding(s) in Code Duplication — start with PaginatedGrids.kt (2), PaginatedLazyColumn.kt, SnapshotReactiveCache.kt. — One of this dimension's main actionable groups (4 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.3 / 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.
12 production modules (Gradle), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; edges a convention plugin adds from buildSrc or build-logic are not visible there; 1 module(s) off the main sequence, with abstractness counted on 10 of the 12 (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: :paginator-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.
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: 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: 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.
3 deducted task-comment markers across 20666 LoC (0.0/KLoC) → score 10.0. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
Resolve the 2 TodoComment finding(s) in Explicit Debt — start with Paginator.kt (2). — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 FixmeComment finding(s) in Explicit Debt — start with Paginator.kt. — One of this dimension's main actionable groups (1 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.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.
This repository is well documented: the root README gives an overview of Paginator as a KMP pagination library for Android/iOS/JVM/Web with cursor pagination, bookmarks, infinite scroll, and a complete table of contents (including Why Paginator?, Installation, What each UI artifact does, Quick Start, Migration from 8.x). The architecture/design docs core-concepts.md, dsl-builder.md, interweaving.md, cursor-pagination.md, and reactive-sources.md cover the API surface, DSL builder, weaving meta-rows between data items, cursor vs offset differences, and a reactive-source adapter pipeline. All sections are present in the outline; there is no missing overview, installation, or usage content for any document. The project's documentation is comprehensive and well-structured: the READMEs (each a single page) cover navigation, state/transactions/locks, element-level operations, serialization, caching, prefetching, logging, and extensions; architecture/design docs are separate markdown files. The content is clipped only at the end of each document, so any unshown sections in the outline must not be flagged as missing.
✓ On the Gold path — maintain.
Detailed fixes: d19_recommendation.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.
0 naming inconsistencies across 0 sampled symbols.
✓ On the Gold path — maintain.
Detailed fixes: d21_recommendation.md.
Do you agree with this assessment?
D22 · Internal API ConsistencyWeak◐ Sampled · advisory
What it measures: Whether the internal API surface is consistent and coherent.
Method: Judged by language model at low temperature over a sample of the public API surface (IsPackable or .Contracts types). Sampled, advisory; confidence discounted by model uncertainty.
6 API inconsistencies across a 400-member sample of 274 exposed types.
Duplicate intent across modules with different type parameters. The `paginator-view-offset` and `paginator-view-cursor` modules expose identical extension functions named `bindPaginated` but for different paginator types (Offset vs Cursor). This forces users to import from different packages for conceptually identical operations, increasing cognitive load and import complexity.
Duplicate intent across modules. Similar to `bindPaginated`, `bindToRecyclerView` exists in both offset and cursor view modules with identical signatures relative to their respective paginator types. This creates redundant API surface area.
Duplicate intent across modules. `bindPrefetchToRecyclerView` is duplicated in both offset and cursor view modules.
Redundant state management methods. `Paginator` exposes `saveState` and `restoreState`, while its internal `PagingCore` also exposes identical `saveState` and `restoreState` methods. Since `Paginator` delegates to `PagingCore`, exposing both creates confusion about which layer should be used for serialization. The `Paginator` level likely wraps the `PagingCore` state, but the API surface suggests two independent state mechanisms.
Redundant query methods. Both `Paginator` and `PagingCore` expose `contains(page: Int)` and `get(page: Int)`. Since `PagingCore` is a property of `Paginator`, users can access the core directly, but exposing the same methods on both levels without clear delegation semantics is inconsistent.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 Duplicate intent across modules with different type parameters. The… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Duplicate intent across modules. Similar to `bindPaginated`,… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Duplicate intent across modules. `bindPrefetchToRecyclerView` is… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d22_recommendation.md · top locations in Appendix A, every location in findings.md.
1 of 10 build units (Gradle) 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).
4 finding(s): 0 critical, 4 high, 0 medium, 0 low. 3 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 1 file(s) — `gradlew` (line 177) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them.
REDACTED
REDACTED
What to do
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
No action in Static Analysis (SAST) — all 3 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (3 issue-level, 0 of them charged here).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
Every significant source file has living knowledge — recently and meaningfully worked. Counted over 120 of the 173 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
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.
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.
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 10 platform declaration(s) and 19 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
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 dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 11 of 11 project(s) that lack one — worth up to 2 pts.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/exception/EndOfCursorFeedException.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/exception/EndOfCursorFeedException.kt` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/13. cursor-pagination.md:243
docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/bookmark/CursorBookmark.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/bookmark/CursorBookmark.kt` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/13. cursor-pagination.md:482
docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/load/CursorLoadResult.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/load/CursorLoadResult.kt` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/13. cursor-pagination.md:484
docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPagingCore.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPagingCore.kt` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/13. cursor-pagination.md:486
docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPaginator.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPaginator.kt` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/13. cursor-pagination.md:488
docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/MutableCursorPaginator.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/MutableCursorPaginator.kt` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/13. cursor-pagination.md:490
docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/exception/CursorLoadGuardedException.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/exception/CursorLoadGuardedException.kt` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/13. cursor-pagination.md:525
What to do
Reconcile the README with reality: docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/exception/EndOfCursorFeedException.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/exception/EndOfCursorFeedException.kt` does not exist; docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/bookmark/CursorBookmark.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/bookmark/CursorBookmark.kt` does not exist; docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/load/CursorLoadResult.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/load/CursorLoadResult.kt` does not exist; docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPagingCore.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPagingCore.kt` does not exist; docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPaginator.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPaginator.kt` does not exist.
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.
Do you agree with this assessment?
P10 · Library API & versioning6.0 / 10Adequate✓ Tool-verified
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language 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.
258/284 types (91%) declared in the published library are public. For a library, every public type is a stability contract — keep implementation types off the surface and expose only the intended API.
What to do
Keep implementation types off the public surface (Kotlin: `internal`) so internals can change without breaking consumers.
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 spotbugs with find-sec-bugs (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 3183 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
What to do
Add a SAST step to CI running what this repository's stack ships: spotbugs with find-sec-bugs — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
Enable Dependabot/Renovate or a dependency-review gate.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
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 is written to minimise allocations so it doesn't pressure its host's memory manager — buffer/slice views over copies, object pooling, stack or value-type allocation, and buffer writers. Reward-only: credited where present, never penalised where a simpler style is fine.
Method: Production-source scan: density (per 1k LoC) of allocation-aware APIs — in .NET Span/Memory, ArrayPool/ObjectPool, stackalloc, ValueTask, value-type structs, IBufferWriter, string.Create, SkipLocalsInit; off .NET, with comments and strings blanked, Go's sync.Pool, preallocated slices/maps, Grow, strconv.Append* and buf[:0] reuse; the JVM's NIO buffer views, MemorySegment, primitive collections, pools and literal presizes (plus Kotlin primitive arrays and value classes, Scala AnyVal and @specialized); Swift's reserveCapacity, ContiguousArray, withUnsafe* access and ~Copyable. Activated off .NET on the same floor (400 lines, and benchmarks or 8 uses); Rust and garbage-collected scripting languages are not applicable. Reward-only. Deterministic, syntax/text detection.
What to do
Raise allocation-aware density on the hot paths — currently 8 use(s) across 22,455 production line(s) (~0.4/1k). More of the idioms below on the allocation-heavy paths climbs this toward 10.
Kotlin: on hot paths, use primitive arrays (IntArray, LongArray …) and @JvmInline value classes instead of boxed values, primitive collections (androidx.collection, fastutil) instead of boxed ones, and presize collections and StringBuilders.
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 the language 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 document10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
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.
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.
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 (x in c)` or `c.forEach { … }` leaves the collection it is walking alone — a `mutableListOf`/`ArrayList`, `mutableMapOf`/`HashMap` or `mutableSetOf`/`HashSet` is a `java.util` collection on the JVM and is walked by its own fail-fast iterator, so a body that adds to or removes from the very collection the loop is walking makes the next step throw `ConcurrentModificationException` 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 Kotlin's null safety is not undermined by not-null assertions — `String` cannot hold null and `String?` must be checked before use in every Kotlin module, and each `!!` is a run-time `NullPointerException` the author has told the compiler cannot happen.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
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.
Unscored — 2 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
P12 CI test-gate honesty — 1 observation(s) recorded · Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
X10 Duplicated predicate — 15 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 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.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 62 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 Kotlin 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 Kotlin code is a Spring, JSR-330 or CDI singleton bean.
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — the Android app did not build — `./gradlew :app:assembleDebug` exited 1: not in 'org.gradle' namespace)
- Included Builds (No included builds contain this plugin)
- Plugin Repositories (could not resolve plugin artifact 'org.jetbrains.kotlin.android:org.jetbrains.kotlin.an…; runtime evidence skipped (launch chosen because app/build.gradle.kts applies the Android application plugin and gradlew builds it) This is a statement about this run, not a statement about your application: nothing here says the app is inaccessible, only that it was never run.
C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Room, JPA or MongoDB entity, an Exposed or Ktorm table, or in a SQL CREATE TABLE or ALTER TABLE — and no database or data-store client (Room, Exposed, SQLDelight, Realm, JPA, JDBC, MongoDB, Firebase, …) imported either, so this repository keeps no data at rest for these controls to protect.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C3 Audit Trail — No personal data detected in a persisted data model — no PII-named column (email, first_name, date_of_birth, phone_number, …) or stored credential on a Room, JPA or MongoDB entity, an Exposed or Ktorm table, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store client (Room, Exposed, SQLDelight, Realm, JPA, JDBC, MongoDB, Firebase, …) imported either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Room, JPA or MongoDB entity, an Exposed or Ktorm table, or in a SQL CREATE TABLE or ALTER TABLE — and no database or data-store client (Room, Exposed, SQLDelight, Realm, JPA, JDBC, MongoDB, Firebase, …) imported either, so this repository keeps no personal data whose lifetime a retention limit would bound.
C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Room, JPA or MongoDB entity, an Exposed or Ktorm table, or in a SQL CREATE TABLE or ALTER TABLE — and no database or data-store client (Room, Exposed, SQLDelight, Realm, JPA, JDBC, MongoDB, Firebase, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
D10 Test Quality — ~17126 lines of test source are present (.kt) 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 .kt suite was found but not re-run
D12 Dependency Hygiene — Not scored — 13 Maven/Gradle manifest(s) were read, stating a version for 19 dependency(ies) and leaving 18 to a parent or an imported BOM, but no build resolved the dependency graph, so the outdated signal was not established. NOT a finding that these dependencies are current or healthy.
D14 License Compliance — Not scored — this repository's 19 declared JVM dependency coordinate(s) were read from its 13 Maven/Gradle manifest(s), but Maven Central could not be asked for the licence of 19 of them (HTTP 429 Too Many Requests from https://repo1.maven.org/maven2/org/jetbrains/kotlinx/atomicfu/0.33.0/atomicfu-0.33.0.pom), and a licence verdict over part of a dependency graph is not a licence verdict. Nothing is asserted about this repository's licensing in either direction.
D16 Bus Factor — single-maintainer repository — bus factor is not applicable
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.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ projects each declaring an entity of their own. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
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 (.kt), 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.
D30 Dependency Vulnerabilities — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Gradle build (build.gradle/build.gradle.kts) and a Gradle version catalogue — not scanned yet).
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) — 17 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
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.
D43 Malicious Dependencies — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Gradle build (build.gradle/build.gradle.kts) and a Gradle version catalogue — not scanned yet).
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
D9 Test Distribution — Test source is present (.kt) 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 its unit/integration/BDD/E2E split couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
DM1 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 45 value object(s); 2 domain event(s); its domain events are published by services or handlers — no domain entity raises one
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P2 Observability — This repository's JVM source (10 module(s), 160 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 (JaCoCo XML — the Gradle `jacocoTestReport` task) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for `@Benchmark` in a Java, Kotlin or Scala file importing JMH or kotlinx-benchmark, Jetpack Benchmark's `measureRepeated` in a file importing androidx.benchmark, or JMH/kotlinx-benchmark/androidx.benchmark in a pom.xml, Gradle or sbt build, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
X2 Cancellation propagation — no C# was loaded; this repository's Kotlin was read, and no request in it can be cancelled by a caller (Ktor, OkHttp's newCall or a URL stream, from a suspend function) — a Kotlin request outside a suspend function has no caller's cancellation to honour
X24 Document value interpolated into markup unescaped — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X4 Structured logging — 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 Kotlin was read, and it logs through none that an assembled message defeats: Android's `Log` and Timber, java.util.logging and log4j-api-kotlin take one finished message (as log4net does in C#), or it makes no call through a named logger at all. Calls made through SLF4J, log4j 2 or kotlin-logging (`LoggerFactory.getLogger`, `KotlinLogging.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.
Duplicated block (20 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PrefetchOnScroll.kt:32— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PrefetchOnScroll.kt:32-51 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PrefetchOnScroll.kt:57-76 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PrefetchOnScroll.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PrefetchOnScroll.kt` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 60 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 (20 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PrefetchOnScroll.kt:71— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PrefetchOnScroll.kt:71-90 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PrefetchOnScroll.kt:96-115 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PrefetchOnScroll.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PrefetchOnScroll.kt` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 60 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 (20 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PrefetchOnScroll.kt:110— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PrefetchOnScroll.kt:110-129 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PrefetchOnScroll.kt:135-154 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PrefetchOnScroll.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PrefetchOnScroll.kt` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 60 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 (20 lines × 2) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/prefetch/CursorPaginatorPrefetchController.kt:119— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/prefetch/CursorPaginatorPrefetchController.kt:119-138 | paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/prefetch/PaginatorPrefetchController.kt:240-259 — 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 `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/prefetch/CursorPaginatorPrefetchController.kt:119` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (20 lines × 2) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:249— paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:249-268 | paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:334-353 — 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 `paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:249` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (20 lines × 2) paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindToRecyclerView.kt:75— paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindToRecyclerView.kt:75-94 | paginator-view-offset/src/main/kotlin/com/jamal_aliev/paginator/view/offset/BindToRecyclerView.kt:130-149 — before extracting anything, compare `paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindToRecyclerView.kt` and `paginator-view-offset/src/main/kotlin/com/jamal_aliev/paginator/view/offset/BindToRecyclerView.kt` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 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.
ClassTooLong: CursorPaginator paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:74— ClassTooLong — 817 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 417 over it, 2.04× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Paginator paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:76— ClassTooLong — 776 significant lines (blank, comment-only and punctuation-only lines excluded), 28 methods. The bar is 400 significant lines; this is 376 over it, 1.94× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: MainActivity app/src/main/java/com/jamal_aliev/paginator/MainActivity.kt:88— ClassTooLong — 746 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 346 over it, 1.87× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: PagingCore paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/PagingCore.kt:56— ClassTooLong — 443 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 43 over it, 1.11× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: CursorPagingCore paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPagingCore.kt:51— ClassTooLong — 408 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods. The bar is 400 significant lines; this is 8 over it, 1.02× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (13 lines × 2) paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt:206— paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt:206-218 | paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/reactive/CursorSnapshotReactiveCache.kt:182-194 — before extracting anything, compare `paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt` and `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/reactive/CursorSnapshotReactiveCache.kt` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 102 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 `paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt:206` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/internal/DataItemCountTracker.kt:33— paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/internal/DataItemCountTracker.kt:33-45 | paginator-view-offset/src/main/kotlin/com/jamal_aliev/paginator/view/offset/internal/DataItemCountTracker.kt:38-50 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. 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) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/internal/PaginatorDataItemCount.kt:20— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/internal/PaginatorDataItemCount.kt:20-32 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/internal/PaginatorDataItemCount.kt:29-41 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (13 lines × 2) paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindPrefetchToRecyclerView.kt:70— paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindPrefetchToRecyclerView.kt:70-82 | paginator-view-offset/src/main/kotlin/com/jamal_aliev/paginator/view/offset/BindPrefetchToRecyclerView.kt:83-95 — 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 `paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindPrefetchToRecyclerView.kt:70` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) app/src/main/java/com/jamal_aliev/paginator/MainActivity.kt:516— app/src/main/java/com/jamal_aliev/paginator/MainActivity.kt:516-528 | app/src/main/java/com/jamal_aliev/paginator/MainActivity.kt:596-608 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `app/src/main/java/com/jamal_aliev/paginator/MainActivity.kt:516` 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 (31 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:73— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:73-103 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:74-104 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 146 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 `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:73` 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 (31 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:163— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:163-193 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:164-194 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 146 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 `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:163` 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 (31 lines × 2) paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyColumn.kt:94— paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyColumn.kt:94-124 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyRow.kt:69-99 — before extracting anything, compare `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyColumn.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyRow.kt` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyColumn.kt:94` 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 (31 lines × 2) paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt:233— paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt:233-263 | paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/reactive/CursorSnapshotReactiveCache.kt:209-239 — before extracting anything, compare `paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt` and `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/reactive/CursorSnapshotReactiveCache.kt` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 102 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 `paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt:233` 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) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:66— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:66-87 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:156-177 — 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 `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:66` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (22 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:68— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:68-89 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:158-179 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:68` 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 (22 lines × 2) paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:67— paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:67-88 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:157-178 — 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 `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:67` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (22 lines × 2) paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:68— paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:68-89 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:158-179 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:68` 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 (12 lines × 2) paginator-compose-core/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/core/internal/LazyGridScrollPreservation.kt:33— paginator-compose-core/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/core/internal/LazyGridScrollPreservation.kt:33-44 | paginator-compose-core/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/core/internal/LazyStaggeredGridScrollPreservation.kt:40-51 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `paginator-compose-core/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/core/internal/LazyGridScrollPreservation.kt:33` 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 (12 lines × 2) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:472— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:472-483 | paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:622-633 — 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 `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:472` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:1126— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:1126-1137 | paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:1413-1424 — 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: the declarations holding them bind `block` to `suspend CursorPaginator<K, T>.(` in one and `suspend Paginator<T>.(` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (12 lines × 2) paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindPaginated.kt:60— paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindPaginated.kt:60-71 | paginator-view-offset/src/main/kotlin/com/jamal_aliev/paginator/view/offset/BindPaginated.kt:99-110 — 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 `paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindPaginated.kt:60` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyGrid.kt:134— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyGrid.kt:134-141 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyGrid.kt:134-141 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyGrid.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyGrid.kt` as WHOLE FILES: 87% 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.
Duplicated block (8 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyList.kt:97— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyList.kt:97-104 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyList.kt:96-103 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyList.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyList.kt` as WHOLE FILES: 83% 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.
Duplicated block (8 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyStaggeredGrid.kt:127— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyStaggeredGrid.kt:127-134 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyStaggeredGrid.kt:127-134 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyStaggeredGrid.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyStaggeredGrid.kt` as WHOLE FILES: 87% 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.
Duplicated block (8 lines × 2) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/MutableCursorPaginator.kt:415— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/MutableCursorPaginator.kt:415-422 | paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/MutablePaginator.kt:541-548 — 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 `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/MutableCursorPaginator.kt:415` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `pageState` to `CursorPageState<K, T>` in one and `OffsetPageState<T>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
FileTooLong: cursor/CursorPaginator.kt paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt— FileTooLong — 855 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: CursorPaginator (74-1269). The bar is 500 significant lines; this is 355 over it, 1.71× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: paginator/MainActivity.kt app/src/main/java/com/jamal_aliev/paginator/MainActivity.kt— FileTooLong — 831 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: MainActivity (88-1230). The bar is 500 significant lines; this is 331 over it, 1.66× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: offset/Paginator.kt paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt— FileTooLong — 814 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: Paginator (76-1478). The bar is 500 significant lines; this is 314 over it, 1.63× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
MethodTooLong: MainActivity.PaginatedContent app/src/main/java/com/jamal_aliev/paginator/MainActivity.kt:413— MethodTooLong — PaginatedContent runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34× 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: MainActivity.InspectorBottomSheet app/src/main/java/com/jamal_aliev/paginator/MainActivity.kt:987— MethodTooLong — InspectorBottomSheet runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: PagingCore.findNearContextPage paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/PagingCore.kt:218— MethodTooLong — findNearContextPage runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03× 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.
Duplicated block (21 lines × 2) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:489— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:489-509 | paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:639-659 — 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 `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:489` 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) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:537— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:537-557 | paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:687-707 — 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 `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:537` 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 (21 lines × 2) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt:150— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt:150-170 | paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/extension/PaginatorReactiveExt.kt:138-158 — before extracting anything, compare `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt` and `paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/extension/PaginatorReactiveExt.kt` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 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 `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt:150` 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 (17 lines × 4) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:76— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:76-92 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:78-94 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:77-93 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:78-94 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt` and `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:76` 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 (17 lines × 4) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:166— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:166-182 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:168-184 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:167-183 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:168-184 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt` and `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:166` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (17 lines × 4) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:123— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:123-139 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyRow.kt:112-128 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyColumn.kt:137-153 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyRow.kt:113-129 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt` and `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyRow.kt` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 73 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:123` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:510— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:510-520 | paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:660-670 — 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 `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:510` 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 (11 lines × 2) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt:135— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt:135-146 | paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/extension/PaginatorReactiveExt.kt:125-135 — before extracting anything, compare `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt` and `paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/extension/PaginatorReactiveExt.kt` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 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 `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt:135` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (11 lines × 2) paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindToRecyclerView.kt:26— paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindToRecyclerView.kt:26-36 | paginator-view-offset/src/main/kotlin/com/jamal_aliev/paginator/view/offset/BindToRecyclerView.kt:77-87 — before extracting anything, compare `paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindToRecyclerView.kt` and `paginator-view-offset/src/main/kotlin/com/jamal_aliev/paginator/view/offset/BindToRecyclerView.kt` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 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 `paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindToRecyclerView.kt:26` 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.
TodoComment paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:477— // TODO доработать ReactiveCache так чтобы его можно было исопльзовать как единый источник правды, а сейчас он опциональный и пользователь вынужден реализоывать load который скорее всего будет грузить данные из бекенда и возращать напрямую в L1 кеш и скорее всего эти же данные data слой сохранит в Room поэтому логично бы чтобы этот Room и был источником истины — 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 paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:1138— // TODO Maybe lock here is unnecessary — 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.
TooManyMethods: CursorPagingCore paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPagingCore.kt:51— TooManyMethods — 45 methods. The bar is 30 methods; this is 15 over it, 1.50× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: PagingCore paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/PagingCore.kt:56— TooManyMethods — 42 methods. The bar is 30 methods; this is 12 over it, 1.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (36 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyRow.kt:84— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyRow.kt:84-119 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyRow.kt:85-120 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyRow.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyRow.kt` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 66 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 `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyRow.kt:84` 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 (36 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:75— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:75-110 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:75-110 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 144 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 `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:75` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (32 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:79— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:79-110 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyRow.kt:67-98 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt` and `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyRow.kt` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 73 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:79` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (32 lines × 2) paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindPaginated.kt:85— paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindPaginated.kt:85-116 | paginator-view-offset/src/main/kotlin/com/jamal_aliev/paginator/view/offset/BindPaginated.kt:125-156 — 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. 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: `DataItemCountTracker` names `com.jamal_aliev.paginator.view.cursor.internal.DataItemCountTracker` in one and `com.jamal_aliev.paginator.view.offset.internal.DataItemCountTracker` 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 (23 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyList.kt:43— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyList.kt:43-65 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/BindToLazyList.kt:79-101 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyList.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/BindToLazyList.kt` as WHOLE FILES: 87% 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 (23 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyStaggeredGrid.kt:16— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyStaggeredGrid.kt:16-38 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/BindToLazyStaggeredGrid.kt:16-38 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyStaggeredGrid.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/BindToLazyStaggeredGrid.kt` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 57 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 (19 lines × 2) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:170— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:170-188 | paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:232-250 — 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 `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:170` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (19 lines × 2) paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindPrefetchToRecyclerView.kt:37— paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindPrefetchToRecyclerView.kt:37-55 | paginator-view-offset/src/main/kotlin/com/jamal_aliev/paginator/view/offset/BindPrefetchToRecyclerView.kt:50-68 — 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. 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 (18 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyGrid.kt:49— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyGrid.kt:49-66 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/BindToLazyGrid.kt:56-73 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyGrid.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/BindToLazyGrid.kt` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 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 `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyGrid.kt:49` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (18 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyStaggeredGrid.kt:63— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyStaggeredGrid.kt:63-80 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/BindToLazyStaggeredGrid.kt:69-86 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyStaggeredGrid.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/BindToLazyStaggeredGrid.kt` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 57 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 `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyStaggeredGrid.kt:63` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 2) paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt:314— paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt:314-328 | paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/reactive/CursorSnapshotReactiveCache.kt:290-304 — before extracting anything, compare `paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt` and `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/reactive/CursorSnapshotReactiveCache.kt` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 102 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 `paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt:314` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (15 lines × 2) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt:180— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt:180-194 | paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/extension/PaginatorReactiveExt.kt:168-182 — before extracting anything, compare `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt` and `paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/extension/PaginatorReactiveExt.kt` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 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 `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt:180` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 6) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:64— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:64-74 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:154-164 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:87-97 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyRow.kt:75-85 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:66-76 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:156-166 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt` and `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:64` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:85` calls `CursorJumpScrollEffect` and `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:62` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (11 lines × 6) paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:65— paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:65-75 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:155-165 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyColumn.kt:101-111 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyRow.kt:76-86 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:66-76 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:156-166 — before extracting anything, compare `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:65` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyColumn.kt:99` calls `JumpScrollEffect` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:63` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10 lines × 2) app/src/main/java/com/jamal_aliev/paginator/MainViewModel.kt:225— app/src/main/java/com/jamal_aliev/paginator/MainViewModel.kt:225-234 | app/src/main/java/com/jamal_aliev/paginator/MainViewModel.kt:242-251 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `app/src/main/java/com/jamal_aliev/paginator/MainViewModel.kt:225` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindToRecyclerView.kt:51— paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindToRecyclerView.kt:51-60 | paginator-view-offset/src/main/kotlin/com/jamal_aliev/paginator/view/offset/BindToRecyclerView.kt:105-114 — before extracting anything, compare `paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindToRecyclerView.kt` and `paginator-view-offset/src/main/kotlin/com/jamal_aliev/paginator/view/offset/BindToRecyclerView.kt` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 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 `paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/BindToRecyclerView.kt:51` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:149— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:149-155 | paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:211-217 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:149` 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) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorCrudExt.kt:255— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorCrudExt.kt:255-261 | paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/extension/PaginatorCrudExt.kt:381-387 — 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 `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorCrudExt.kt:255` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPagingCore.kt:349— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPagingCore.kt:349-353 | paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/PagingCore.kt:474-479 — 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 `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPagingCore.kt:349` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (5 lines × 2) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/dsl/CursorPaginatorBuilder.kt:184— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/dsl/CursorPaginatorBuilder.kt:184-188 | paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/dsl/PaginatorBuilder.kt:303-307 — 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: the declarations holding them bind `core` to `CursorPagingCore<K, T>` in one and `PagingCore<T>` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
CursorPaginator.goNextPage (cyclomatic 29) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:408— CursorPaginator.goNextPage has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt holds 3 of the 14 methods over the threshold — including the worst — and 26 of the 59 points over it (44%), 2.2× the next-largest file (paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt at 12). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
CursorPaginator.goPreviousPage (cyclomatic 24) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:566— CursorPaginator.goPreviousPage has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt holds 3 of the 14 methods over the threshold — including the worst — and 26 of the 59 points over it (44%), 2.2× the next-largest file (paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt at 12). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
Paginator.goNextPage (cyclomatic 22) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:589— Paginator.goNextPage has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
PagingCore.findNearContextPage (cyclomatic 19) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/PagingCore.kt:218— PagingCore.findNearContextPage has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
CursorSnapshotReactiveCache.diff (cyclomatic 19) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/reactive/CursorSnapshotReactiveCache.kt:152— CursorSnapshotReactiveCache.diff has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SnapshotReactiveCache.diff (cyclomatic 19) paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt:176— SnapshotReactiveCache.diff has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Paginator.goPreviousPage (cyclomatic 18) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:762— Paginator.goPreviousPage has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
CursorPaginator.jump (cyclomatic 18) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:268— CursorPaginator.jump has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass's cyclomatic complexity CONCENTRATES: paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt holds 3 of the 14 methods over the threshold — including the worst — and 26 of the 59 points over it (44%), 2.2× the next-largest file (paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt at 12). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
Paginator.jump (cyclomatic 17) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:416— Paginator.jump has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PaginatorReactiveExtKt.observe (cyclomatic 17) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/extension/PaginatorReactiveExt.kt:108— PaginatorReactiveExtKt.observe has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PaginatorPrefetchController.onScroll (cyclomatic 17) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/prefetch/PaginatorPrefetchController.kt:174— PaginatorPrefetchController.onScroll has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
CursorPaginatorReactiveExtKt.observe (cyclomatic 17) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt:116— CursorPaginatorReactiveExtKt.observe has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
CursorPaginatorPrefetchController.onScroll (cyclomatic 17) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/prefetch/CursorPaginatorPrefetchController.kt:61— CursorPaginatorPrefetchController.onScroll has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
MainActivity.PaginatedContent (cyclomatic 16) app/src/main/java/com/jamal_aliev/paginator/MainActivity.kt:413— MainActivity.PaginatedContent has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
FixmeComment paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:449— // FIXME пердставим 2 пользователей чата (ранее было загруженно 1,2,3 страницы) и потом один из них вышел из приложения, а второй из них написал первому в этот момент. Вернувшись в приложение пагинатор у перовго загрузит не актуальные данные из L2 кеша — 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.
CursorPaginator.goNextPage (cognitive 39) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:408— CursorPaginator.goNextPage has cognitive complexity 39 (threshold 15). Drivers by points: if/else 26 (35 pts), boolean chains 3, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MutablePaginator.addAllElements (cognitive 34) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/MutablePaginator.kt:380— MutablePaginator.addAllElements has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 3 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
CursorPaginator.goPreviousPage (cognitive 32) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:566— CursorPaginator.goPreviousPage has cognitive complexity 32 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 2, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Paginator.goNextPage (cognitive 29) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:589— Paginator.goNextPage has cognitive complexity 29 (threshold 15). Drivers by points: if/else 22 (27 pts), boolean chains 1, error handling 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
PaginatorPrefetchController.onScroll (cognitive 28) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/prefetch/PaginatorPrefetchController.kt:174— PaginatorPrefetchController.onScroll has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (18 pts), error handling 2 (6 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CursorPaginatorPrefetchController.onScroll (cognitive 28) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/prefetch/CursorPaginatorPrefetchController.kt:61— CursorPaginatorPrefetchController.onScroll has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (18 pts), error handling 2 (6 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CursorPaginator.jump (cognitive 27) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:268— CursorPaginator.jump has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 1, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PagingCore.findNearContextPage (cognitive 26) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/PagingCore.kt:218— PagingCore.findNearContextPage has cognitive complexity 26 (threshold 15). Drivers by points: if/else 22 (26 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
CursorSnapshotReactiveCache.diff (cognitive 26) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/reactive/CursorSnapshotReactiveCache.kt:152— CursorSnapshotReactiveCache.diff has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 6, boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SnapshotReactiveCache.diff (cognitive 26) paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt:176— SnapshotReactiveCache.diff has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 6, boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Paginator.jump (cognitive 25) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:416— Paginator.jump has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18 (24 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Paginator.goPreviousPage (cognitive 23) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:762— Paginator.goPreviousPage has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 1, error handling 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
PaginatorReactiveExtKt.observe (cognitive 22) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/extension/PaginatorReactiveExt.kt:108— PaginatorReactiveExtKt.observe has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 6 (8 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CursorPaginatorReactiveExtKt.observe (cognitive 22) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt:116— CursorPaginatorReactiveExtKt.observe has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 6 (8 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Paginator.jumpForward (cognitive 18) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:196— Paginator.jumpForward has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Paginator.jumpBack) 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.
Paginator.jumpBack (cognitive 18) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:280— Paginator.jumpBack has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Paginator.jumpForward) 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.
CursorPaginator.restartInternal (cognitive 18) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:742— CursorPaginator.restartInternal has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), error handling 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CursorPaginator.refresh (cognitive 18) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:857— CursorPaginator.refresh has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
CursorPagingCore.findNearContextCursor (cognitive 18) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPagingCore.kt:222— CursorPagingCore.findNearContextCursor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RecyclerViewScrollReaderKt.readScrollSignal (cognitive 17) paginator-view-core/src/main/kotlin/com/jamal_aliev/paginator/view/core/internal/RecyclerViewScrollReader.kt:54— RecyclerViewScrollReaderKt.readScrollSignal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
MutablePaginator.removeElement (cognitive 17) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/MutablePaginator.kt:284— MutablePaginator.removeElement has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Paginator.refresh (cognitive 17) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:1024— Paginator.refresh has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
CursorPaginator.jumpForward (cognitive 17) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:135— CursorPaginator.jumpForward has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (CursorPaginator.jumpBack) 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.
CursorPaginator.jumpBack (cognitive 17) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:197— CursorPaginator.jumpBack has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (CursorPaginator.jumpForward) 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.
MutableCursorPaginator.removeElement (cognitive 17) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/MutableCursorPaginator.kt:222— MutableCursorPaginator.removeElement has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
MainActivity.PaginatedContent (cognitive 16) app/src/main/java/com/jamal_aliev/paginator/MainActivity.kt:413— MainActivity.PaginatedContent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D22 · Internal API Consistency· Duplicate intent across modules with different type parameters. The `paginator-view-offset` and `paginator-view-cursor` modules expose identical extension functions named `bindPaginated` but for different paginator types (Offset vs Cursor). This forces users to import from different packages for conceptually identical operations, increasing cognitive load and import complexity. · ×1
Duplicate intent across modules with different type parameters. The `paginator-view-offset` and `paginator-view-cursor` modules expose identical extension functions named `bindPaginated` but for different paginator types (Offset vs Cursor). This forces users to import from different packages for conceptually identical operations, increasing cognitive load and import complexity. — Consolidate into a single `paginator-view` module using generics or a common `Paginator` interface/base class, or clearly document that these are distinct, non-interchangeable APIs for distinct pagination strategies. (signatures: com.jamal_aliev.paginator.view.offset.BindPaginatedKt.bindPaginated(...) | com.jamal_aliev.paginator.view.cursor.BindPaginatedKt.bindPaginated(...))
D22 · Internal API Consistency· Duplicate intent across modules. Similar to `bindPaginated`, `bindToRecyclerView` exists in both offset and cursor view modules with identical signatures relative to their respective paginator types. This creates redundant API surface area. · ×1
Duplicate intent across modules. Similar to `bindPaginated`, `bindToRecyclerView` exists in both offset and cursor view modules with identical signatures relative to their respective paginator types. This creates redundant API surface area. — Unify into a single view module if possible, or ensure the naming convention explicitly distinguishes the strategy (e.g., `bindOffsetToRecyclerView` vs `bindCursorToRecyclerView`) to avoid confusion about which one to use. (signatures: com.jamal_aliev.paginator.view.offset.BindToRecyclerViewKt.bindToRecyclerView(...) | com.jamal_aliev.paginator.view.cursor.BindToRecyclerViewKt.bindToRecyclerView(...))
D22 · Internal API Consistency· Duplicate intent across modules. `bindPrefetchToRecyclerView` is duplicated in both offset and cursor view modules. · ×1
Duplicate intent across modules. `bindPrefetchToRecyclerView` is duplicated in both offset and cursor view modules. — Consolidate into a single module or use distinct names to clarify the specific paginator type they bind to. (signatures: com.jamal_aliev.paginator.view.offset.BindPrefetchToRecyclerViewKt.bindPrefetchToRecyclerView(...) | com.jamal_aliev.paginator.view.cursor.BindPrefetchToRecyclerViewKt.bindPrefetchToRecyclerView(...))
D22 · Internal API Consistency· Redundant state management methods. `Paginator` exposes `saveState` and `restoreState`, while its internal `PagingCore` also exposes identical `saveState` and `restoreState` methods. Since `Paginator` delegates to `PagingCore`, exposing both creates confusion about which layer should be used for serialization. The `Paginator` level likely wraps the `PagingCore` state, but the API surface suggests two independent state mechanisms. · ×1
Redundant state management methods. `Paginator` exposes `saveState` and `restoreState`, while its internal `PagingCore` also exposes identical `saveState` and `restoreState` methods. Since `Paginator` delegates to `PagingCore`, exposing both creates confusion about which layer should be used for serialization. The `Paginator` level likely wraps the `PagingCore` state, but the API surface suggests two independent state mechanisms. — Remove `saveState`/`restoreState` from `PagingCore` if it is an internal implementation detail, or clearly document that `Paginator` is the sole public entry point for state persistence. (signatures: com.jamal_aliev.paginator.offset.Paginator.saveState(...) | com.jamal_aliev.paginator.offset.PagingCore.saveState(...))
D22 · Internal API Consistency· Redundant query methods. Both `Paginator` and `PagingCore` expose `contains(page · ×1
Redundant query methods. Both `Paginator` and `PagingCore` expose `contains(page: Int)` and `get(page: Int)`. Since `PagingCore` is a property of `Paginator`, users can access the core directly, but exposing the same methods on both levels without clear delegation semantics is inconsistent. — Ensure `Paginator` methods explicitly delegate to `PagingCore` and consider removing the public visibility of `PagingCore`'s query methods if they are not intended for direct use. (signatures: com.jamal_aliev.paginator.offset.Paginator.contains(page: Int) | com.jamal_aliev.paginator.offset.PagingCore.contains(page: Int))
D22 · Internal API Consistency· Inconsistent mutation API. `MutablePaginator` has `setElement` and `addElement` as direct methods, while `Paginator` (immutable) exposes these via extension functions in `PaginatorCrudExtKt`. However, `MutablePaginator` also has `replaceAllElements` and `addAllElements`, while the extension functions provide `updateAll`, `updateWhere`, etc. The naming and grouping of CRUD operations differ between the mutable class and the extension functions for the immutable class. · ×1
Inconsistent mutation API. `MutablePaginator` has `setElement` and `addElement` as direct methods, while `Paginator` (immutable) exposes these via extension functions in `PaginatorCrudExtKt`. However, `MutablePaginator` also has `replaceAllElements` and `addAllElements`, while the extension functions provide `updateAll`, `updateWhere`, etc. The naming and grouping of CRUD operations differ between the mutable class and the extension functions for the immutable class. — Align the naming of CRUD operations between `MutablePaginator` and the `PaginatorCrudExtKt` extensions. For example, if `MutablePaginator` uses `setElement`, the extension should likely use `setElement` as well, or vice versa, to provide a consistent mental model regardless of mutability. (signatures: com.jamal_aliev.paginator.offset.extension.PaginatorCrudExtKt.addElement(...) | com.jamal_aliev.paginator.offset.MutablePaginator.setElement(...))
D4 · Code Duplication· Near-duplicate member family (6 members, 31 shared lines) · ×1
Near-duplicate member family (6 members, 31 shared lines) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:52— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:52-110 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:142-200 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:54-112 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:53-111 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:143-201 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:54-112 — These 6 members are variants of one another: a block of 31 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication· Near-duplicate member family (5 members, 16 shared lines) · ×1
Near-duplicate member family (5 members, 16 shared lines) paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:53— paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:53-111 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:143-201 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyColumn.kt:86-153 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:54-112 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:144-202 — These 5 members are variants of one another: a block of 16 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
D4 · Code Duplication· Near-duplicate member family (4 members, 36 shared lines) · ×1
Near-duplicate member family (4 members, 36 shared lines) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:142— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:142-200 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:144-202 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:143-201 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:144-202 — These 4 members are variants of one another: a block of 36 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication· Near-duplicate member family (4 members, 25 shared lines) · ×1
Near-duplicate member family (4 members, 25 shared lines) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:72— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:72-139 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyRow.kt:60-128 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyColumn.kt:86-153 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyRow.kt:61-129 — These 4 members are variants of one another: a block of 25 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Near-duplicate member pair (65 shared lines) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:417— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:417-557 | paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:574-707 — These two members are variants of one another: 65 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (47 shared lines) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt:126— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt:126-194 | paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/extension/PaginatorReactiveExt.kt:116-182 — These two members are variants of one another: 47 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (4 members, 50+ identical tokens) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyGrid.kt:43— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyGrid.kt:43-66 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyStaggeredGrid.kt:57-80 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/BindToLazyGrid.kt:50-73 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/BindToLazyStaggeredGrid.kt:63-86 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (42 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/RememberPrefetchController.kt:34— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/RememberPrefetchController.kt:34-75 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/RememberPrefetchController.kt:58-99 — 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. 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 (38 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:165— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:165-202 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:165-202 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 144 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 `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:165` 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 (35 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:96— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:96-130 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyColumn.kt:110-144 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyColumn.kt` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 66 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 `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:96` 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 (26 lines × 2) paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt:329— paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt:329-354 | paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/reactive/CursorSnapshotReactiveCache.kt:305-330 — before extracting anything, compare `paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt` and `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/reactive/CursorSnapshotReactiveCache.kt` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 102 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 `paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt:329` 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–17 lines × 2) paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/PrefetchController.kt:37— paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/PrefetchController.kt:37-53 | paginator-view-offset/src/main/kotlin/com/jamal_aliev/paginator/view/offset/PrefetchController.kt:52-65 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `paginator-view-cursor/src/main/kotlin/com/jamal_aliev/paginator/view/cursor/PrefetchController.kt:37` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (16 lines × 4) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyGrid.kt:44— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyGrid.kt:44-59 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyStaggeredGrid.kt:58-73 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/BindToLazyGrid.kt:51-66 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/BindToLazyStaggeredGrid.kt:64-79 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyGrid.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/BindToLazyGrid.kt` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 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 `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyGrid.kt:44` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15 lines × 3) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyGrid.kt:153— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyGrid.kt:153-167 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyList.kt:116-130 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyStaggeredGrid.kt:146-160 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
Duplicated block (14 lines × 8) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:58— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:58-71 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:148-161 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:60-73 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:150-163 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:59-72 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:149-162 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:60-73 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:150-163 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt` and `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:58` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14 lines × 4) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:95— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:95-108 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:185-198 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:96-109 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:186-199 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 146 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 `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:95` 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 (14 lines × 2) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:211— paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:211-224 | paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:295-308 — 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 `paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:211` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 6) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:99— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:99-110 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:189-200 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:101-112 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:100-111 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:190-201 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:101-112 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt` and `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:99` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 3) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/eviction/CursorMostRecentPagingCache.kt:112— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/eviction/CursorMostRecentPagingCache.kt:112-122 | paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/eviction/CursorQueuedPagingCache.kt:90-100 | paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/eviction/CursorTimeLimitedPagingCache.kt:109-119 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (10 lines × 3) paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyGrid.kt:152— paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyGrid.kt:152-161 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyList.kt:126-135 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyStaggeredGrid.kt:145-154 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
Duplicated block (7–9 lines × 3) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPagingCore.kt:452— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPagingCore.kt:452-458 | paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPagingCore.kt:729-735 | paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/eviction/CursorContextWindowPagingCache.kt:73-81 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt:301— paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt:301-309 | paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/extension/PaginatorReactiveExt.kt:286-294 — before extracting anything, compare `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt` and `paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/extension/PaginatorReactiveExt.kt` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 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 `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/extension/CursorPaginatorReactiveExt.kt:301` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8 lines × 4) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:87— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:87-94 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyRow.kt:75-82 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyColumn.kt:101-108 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyRow.kt:76-83 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt` and `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyRow.kt` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 73 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:87` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6–7 lines × 3) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:491— paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:491-496 | paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:686-691 | paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:830-836 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:491` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6 lines × 2) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:168— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:168-173 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyColumn.kt:182-187 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyColumn.kt` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 66 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 × 9) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:58— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:58-62 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:148-152 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:60-64 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:150-154 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:59-63 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:149-153 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyColumn.kt:93-97 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:60-64 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:150-154 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt` and `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:58` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyColumn.kt:99` calls `JumpScrollEffect` and `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:64` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (5 lines × 3) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:79— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:79-83 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyRow.kt:67-71 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyRow.kt:68-72 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt` and `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyRow.kt` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 73 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:79` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 4) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyGrid.kt:15— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyGrid.kt:15-23 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyList.kt:15-23 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/BindToLazyGrid.kt:15-23 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/BindToLazyList.kt:15-23 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/BindToLazyGrid.kt` and `paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/BindToLazyGrid.kt` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (17 lines × 2) paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt:138— paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt:138-154 | paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/reactive/CursorSnapshotReactiveCache.kt:114-130 — before extracting anything, compare `paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt` and `paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/reactive/CursorSnapshotReactiveCache.kt` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:715— paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:715-730 | paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:859-874 — 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 `paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt:715` 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 (5 lines × 8) paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:53— paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:53-57 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:143-147 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:55-59 | paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt:145-149 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:54-58 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedGrids.kt:144-148 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:55-59 | paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedStaggeredGrids.kt:145-149 — before extracting anything, compare `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt` and `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt:53` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Off the main sequence: :paginator-core — :paginator-core: abstractness 0.23, instability 0.00, distance 0.77 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.
P12 · CI test-gate honesty· Test suite runs only after the merge · ×1
Test suite runs only after the merge — `REDACTED` run(s) the test suite, but no workflow that runs tests is triggered by a pull request (or a merge queue) — so the suite reports on code that is already on the default branch. A red build there blocks nothing and the only remedy is a revert. Add the pull-request trigger to the workflow that runs your suite so the gate applies before the merge, not after it.
Duplicated predicate paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt:995— `!forceLoading && core.isFilledSuccessState(cachedState)` appears character-identically in 2 files — paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPaginator.kt, paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/MutablePaginator.kt:596— `cache.isStarted && (!core.isFilledSuccessState(cache.getStateOf(cache.startContextPage)) || !core.isFilledSuccessState(cache.getStateOf(cach…` appears character-identically in 2 files — paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/MutablePaginator.kt, paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/Paginator.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPagingCore.kt:454— `current != null && visited.add(current.self)` appears character-identically in 5 files — paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPagingCore.kt, paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/eviction/CursorContextWindowPagingCache.kt, paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/eviction/CursorMostRecentPagingCache.kt, paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/eviction/CursorQueuedPagingCache.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/prefetch/CursorPaginatorPrefetchController.kt:114— `enableBackwardPrefetch && scrollingBackward` appears character-identically in 2 files — paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/prefetch/CursorPaginatorPrefetchController.kt, paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/prefetch/PaginatorPrefetchController.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/prefetch/ScrollWindow.kt:67— `firstVisibleIndex < 0 || lastVisibleIndex < 0` appears character-identically in 3 files — paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/prefetch/ScrollWindow.kt, paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/prefetch/CursorPaginatorPrefetchController.kt, paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/prefetch/PaginatorPrefetchController.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPagingCore.kt:350— `isCapacityUnlimited || data.size <= capacity` appears character-identically in 2 files — paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPagingCore.kt, paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/PagingCore.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPagingCore.kt:361— `isCapacityUnlimited || state.data.size <= capacity` appears character-identically in 2 files — paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPagingCore.kt, paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/PagingCore.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPagingCore.kt:336— `isCapacityUnlimited || state.data.size == capacity` appears character-identically in 2 files — paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPagingCore.kt, paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/PagingCore.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPagingCore.kt:387— `nextState != null && predicate.invoke(nextState)` appears character-identically in 2 files — paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/CursorPagingCore.kt, paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/PagingCore.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/cache/eviction/MostRecentPagingCache.kt:123— `page != justAddedPage && cache.getStateOf(page) != null && (protectedRange == null || page !in protectedRange)` appears character-identically in 2 files — paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/cache/eviction/MostRecentPagingCache.kt, paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/cache/eviction/QueuedPagingCache.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt:174— `pageState != null && !pageState.isProgressState()` appears character-identically in 2 files — paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt, paginator-compose-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/offset/PaginatedLazyColumn.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate paginator-bom/build.gradle.kts:34— `project.findProperty("signing.keyId") != null || project.findProperty("signingInMemoryKey") != null || System.getenv("ORG_GRADLE_PROJECT_sig…` appears character-identically in 10 files — paginator-bom/build.gradle.kts, paginator-compose-core/build.gradle.kts, paginator-compose-cursor/build.gradle.kts, paginator-compose-offset/build.gradle.kts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt:218— `reordered && reorderPolicy == ReorderPolicy.Invalidate` appears character-identically in 2 files — paginator-core/src/commonMain/kotlin/com/jamal_aliev/paginator/core/cache/reactive/SnapshotReactiveCache.kt, paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/reactive/CursorSnapshotReactiveCache.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/eviction/CursorMostRecentPagingCache.kt:95— `self != justAdded && cache.getStateOf(self) != null && (protectedSet == null || self !in protectedSet)` appears character-identically in 2 files — paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/eviction/CursorMostRecentPagingCache.kt, paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/cache/eviction/CursorQueuedPagingCache.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/MutableCursorPaginator.kt:245— `updatedData.size < core.capacity && !core.isCapacityUnlimited` appears character-identically in 2 files — paginator-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/cursor/MutableCursorPaginator.kt, paginator-offset/src/commonMain/kotlin/com/jamal_aliev/paginator/offset/MutablePaginator.kt. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
README/code drift docs/13. cursor-pagination.md:243— docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/exception/EndOfCursorFeedException.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/exception/EndOfCursorFeedException.kt` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/13. cursor-pagination.md:482— docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/bookmark/CursorBookmark.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/bookmark/CursorBookmark.kt` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/13. cursor-pagination.md:484— docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/load/CursorLoadResult.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/load/CursorLoadResult.kt` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/13. cursor-pagination.md:486— docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPagingCore.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPagingCore.kt` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/13. cursor-pagination.md:488— docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPaginator.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/CursorPaginator.kt` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/13. cursor-pagination.md:490— docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/MutableCursorPaginator.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/MutableCursorPaginator.kt` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/13. cursor-pagination.md:525— docs/13. cursor-pagination.md links to `../paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/exception/CursorLoadGuardedException.kt`, but `paginator/src/commonMain/kotlin/com/jamal_aliev/paginator/exception/CursorLoadGuardedException.kt` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 1 of 10 project(s) overshoot their size bounds, lowering Project Cohesion to 8.9/10. The most over is `paginator-offset` (6109 LoC, 44 module-visible types across 11 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.
P10 · Library API & versioning· Large public API surface · ×1
Large public API surface — 258/284 types (91%) declared in the published library are public. For a library, every public type is a stability contract — keep implementation types off the surface and expose only the intended API.
No SAST — No static application security testing detected. For this repository's stack, add spotbugs with find-sec-bugs (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 3183 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.)
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.
none (dependency manifest found, not scanned for vulnerabilities here)
—
none (dependency manifest found, not scanned for vulnerabilities here): not applicable — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Gradle build (build.gradle/build.gradle.kts) and a Gradle version catalogue — not scanned yet).
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. semgrep could not parse 17 file(s) — `paginator-compose-core/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/core/internal/PrefetchScrollBinder.kt`, `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedGrids.kt`, `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyColumn.kt`, `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedLazyRow.kt`, `paginator-compose-cursor/src/commonMain/kotlin/com/jamal_aliev/paginator/compose/cursor/PaginatedStaggeredGrids.kt`, … (+12 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
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.
none (dependency manifest found, not scanned for vulnerabilities here)
—
none (dependency manifest found, not scanned for vulnerabilities here): not applicable — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Gradle build (build.gradle/build.gradle.kts) and a Gradle version catalogue — not scanned yet).
0
—
Run 01a16519-c143-7abc-bc20-ea062458fd40 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 4 · Warnings: 153 · Recommendations: 31 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 22-10-2026 @ 19:32 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.