Public report of googlemaps/android-maps-utils, published 14 November 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.4). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 14 November 2026, 13:34 UTC · Survey ID cd_d06637c8933b4c2c9286d29ac05cd9c2
googlemaps/android-maps-utils
Measured 14 November 2026, 13:34 UTC, at code version 4df2704
Knowledge freshness is not measured: Freshness signal contradicted by repo activity.
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
Up 3 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: 28,047 lines of product code in 12 projects, tests not counted · Estimated rebuild effort: about 0.3 person-years · Weakest lens: Accessibility, 46
Findings by how serious they are
3 critical210 serious147 minor
8 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Canine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
14 November 2026, 13:34 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds the Canine Code Analyzer. It is open to any tool that
implements it, and today the Canine Code Analyzer is the only one that does.
The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
52of 52 dimensions measured by tools.
220of 360 findings point to an exact file and line, so you can open each one in the code. The other 140 concern the repository as a whole, such as missing documentation.
52dimensions across 7 lenses, read from 28,047 lines of product code in 12 projects.
googlemaps/android-maps-utils falls short of our standard for production, held back most by its Accessibility lens, the interface's usability with a keyboard or assistive technology. It scores 60 out of 100 and is rated Adequate, and all three of its critical findings are security problems.
Accessibility, at 46, is the weakest lens and counts most in the score. The best first step is adding text alternatives, worth about 11 points. Structuring the pages comes next, worth about 7 points. Raising Accessibility to 70 would lift the score to about 70.
One password or key is open to anyone who can read the repository. One pipeline step installs packages that can change without warning. Replacing the exposed password or key and pinning what the pipeline installs would close both risks. Correcting the flagged pipeline settings would fix the weakness in the build pipeline's configuration.
The product code is 28,047 lines, about €49,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.
God Classes · FileTooLong: android/Units.kt library/src/main/java/com/google/maps/android/Units.kt
Code Duplication · Edited copy of a member (111 corresponding lines) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt
Code Duplication · Edited copy of a member (51 corresponding lines) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt
Code Duplication · Edited copy of a member (34 corresponding lines) clustering/src/main/java/com/google/maps/android/clustering/algo/FlatKdTree.kt
Code Duplication · Edited copy of a member (48 corresponding lines) build-logic/convention/src/main/kotlin/BomPublishingConventionPlugin.kt
Code Duplication · Edited copy of a member (24 corresponding lines) data/src/main/java/com/google/maps/android/data/renderer/mapview/MapViewRenderer.kt
Code Duplication · Edited copy of a member (31 corresponding lines) data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt
Code Duplication · Edited copy of a member (21 corresponding lines) clustering/src/main/java/com/google/maps/android/quadtree/PointQuadTree.kt
Code Duplication · Edited copy of a member (37 corresponding lines) library/src/main/java/com/google/maps/android/location/LocationManager.kt
Code Duplication · Edited copy of a member (17 corresponding lines) library/src/main/java/com/google/maps/android/Units.kt
Code Duplication · Edited copy of a member (18 corresponding lines) data/src/main/java/com/google/maps/android/renderer/GoogleMapRenderer.kt
Code Duplication · Edited copies of one member (3 members, 10+ corresponding lines) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt
Code Duplication · Edited copies of one member (3 members, 9+ corresponding lines) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt
Code Duplication · Edited copy of a member (8 corresponding lines) data/src/main/java/com/google/maps/android/data/renderer/mapper/GpxMapper.kt
Code Duplication · Edited copies of one member (4 members, 11+ corresponding lines) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt
Code Duplication · Edited copy of a member (15 corresponding lines) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt
Code Duplication · Edited copy of a member (5 corresponding lines) data/src/main/java/com/google/maps/android/data/kml/KmlLayer.kt
Code Duplication · Edited copy of a member (11 corresponding lines) data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt
Code Duplication · Edited copies of one member (4 members, 1+ corresponding lines) clustering/src/main/java/com/google/maps/android/clustering/algo/NonHierarchicalDistanceBasedAlgorithm.kt
Code Duplication · Edited copy of a member (19 corresponding lines) demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java
Code Duplication · Edited copy of a member (18 corresponding lines) demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java
Code Duplication · Edited copies of one member (4 members, 24+ corresponding lines) demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java
Code Duplication · Edited copy of a member (11 corresponding lines) demo/src/main/java/com/google/maps/android/utils/demo/ZIndexDemoActivity.kt
We compare every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 38 findings
These 38 critical or serious findings were in the previous survey, on 26 October 2026, and are gone from this one.
Code Duplication · Edited copy of a member (28 corresponding lines) demo/src/main/java/com/google/maps/android/utils/demo/CustomAdvancedMarkerClusteringDemoActivity.java
A11y enforcement · Accessibility enforcement below the top rung
Rebuild cost: about €49,000 · Estimate
Cost to rebuild
€16,000 to €81,000, for 270 to 856 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 60. 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: 28,047 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
Raises the score by about 11 points · Medium effort · Text alternatives
2
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
Raises the score by about 7 points · Medium effort · Page structure
3
Resolve the 2 Off-boarding risk finding(s) in Bus Factor.
Raises the score by about 2 points · Low effort · Bus Factor
Diagnosis: what the measurements show together
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €49,000 to build again, about 0.3 person-years of work. Its weakest lens is Accessibility, at 46 (Weak). Accessibility is about whether the interface is built so that everyone can use it, including people who can't see the screen or can't use a mouse. Because the weakest lens counts most in the score, work on Accessibility also moves the score most.
Based on: the rebuild estimate · the Accessibility grade · how much each lens counts
What to do: Start with the Accessibility actions in Top priorities.
If you do one thing first · First action
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video. Of all the actions in this report, it raises the score most for the work it takes: about 11 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
97 modules, with 126 dependencies between them. 4 loops run through 19 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 57 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.
StreetViewJavaHelper uses com.google.maps.android, so a change to com.google.maps.android can break StreetViewJavaHelper, while a change to StreetViewJavaHelper can't break com.google.maps.android.
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.
9→36 clustering.ClusterManager uses clusteringpart of a loop✕
Connections
3 pairs of types, where a type in clustering.ClusterManager uses a type in clustering.
clustering.ClusterManager uses clustering, so a change to clustering can break clustering.ClusterManager, while a change to clustering.ClusterManager can't break clustering.
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.
collections.CircleManager uses collections.MapObjectManager, so a change to collections.MapObjectManager can break collections.CircleManager, while a change to collections.CircleManager can't break collections.MapObjectManager.
Position
Below the diagonal: collections.CircleManager uses a module listed above it, which is the healthy direction.
collections.GroundOverlayManager uses collections.MapObjectManager, so a change to collections.MapObjectManager can break collections.GroundOverlayManager, while a change to collections.GroundOverlayManager can't break collections.MapObjectManager.
Position
Below the diagonal: collections.GroundOverlayManager uses a module listed above it, which is the healthy direction.
collections.MarkerManager uses collections.MapObjectManager, so a change to collections.MapObjectManager can break collections.MarkerManager, while a change to collections.MarkerManager can't break collections.MapObjectManager.
Position
Below the diagonal: collections.MarkerManager uses a module listed above it, which is the healthy direction.
collections.PolygonManager uses collections.MapObjectManager, so a change to collections.MapObjectManager can break collections.PolygonManager, while a change to collections.PolygonManager can't break collections.MapObjectManager.
Position
Below the diagonal: collections.PolygonManager uses a module listed above it, which is the healthy direction.
collections.PolylineManager uses collections.MapObjectManager, so a change to collections.MapObjectManager can break collections.PolylineManager, while a change to collections.PolylineManager can't break collections.MapObjectManager.
Position
Below the diagonal: collections.PolylineManager uses a module listed above it, which is the healthy direction.
data.renderer.mapper uses data.parser.geojson, so a change to data.parser.geojson can break data.renderer.mapper, while a change to data.renderer.mapper can't break data.parser.geojson.
Position
Below the diagonal: data.renderer.mapper uses a module listed above it, which is the healthy direction.
data.renderer.mapper uses data.parser.kml, so a change to data.parser.kml can break data.renderer.mapper, while a change to data.renderer.mapper can't break data.parser.kml.
Position
Below the diagonal: data.renderer.mapper uses a module listed above it, which is the healthy direction.
data.renderer.mapper uses data.renderer.model, so a change to data.renderer.model can break data.renderer.mapper, while a change to data.renderer.mapper can't break data.renderer.model.
Position
Below the diagonal: data.renderer.mapper uses a module listed above it, which is the healthy direction.
heatmaps.HeatmapTileProvider uses geometry, so a change to geometry can break heatmaps.HeatmapTileProvider, while a change to heatmaps.HeatmapTileProvider can't break geometry.
Position
Below the diagonal: heatmaps.HeatmapTileProvider uses a module listed above it, which is the healthy direction.
18→27 heatmaps.HeatmapTileProvider uses heatmapspart of a loop✕
Connections
5 pairs of types, where a type in heatmaps.HeatmapTileProvider uses a type in heatmaps.
heatmaps.HeatmapTileProvider uses heatmaps, so a change to heatmaps can break heatmaps.HeatmapTileProvider, while a change to heatmaps.HeatmapTileProvider can't break heatmaps.
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.
quadtree.PointQuadTree uses geometry, so a change to geometry can break quadtree.PointQuadTree, while a change to quadtree.PointQuadTree can't break geometry.
Position
Below the diagonal: quadtree.PointQuadTree uses a module listed above it, which is the healthy direction.
renderer.model uses renderer.model.MapObject, so a change to renderer.model.MapObject can break renderer.model, while a change to renderer.model can't break renderer.model.MapObject.
Position
Below the diagonal: renderer.model uses a module listed above it, which is the healthy direction.
com.google.maps.android uses StreetViewJavaHelper, so a change to StreetViewJavaHelper can break com.google.maps.android, while a change to com.google.maps.android can't break StreetViewJavaHelper.
Position
Below the diagonal: com.google.maps.android uses a module listed above it, which is the healthy direction.
clustering.algo.NonHierarchicalDistanceBasedAlgorithm uses geometry, so a change to geometry can break clustering.algo.NonHierarchicalDistanceBasedAlgorithm, while a change to clustering.algo.NonHierarchicalDistanceBasedAlgorithm can't break geometry.
Position
Below the diagonal: clustering.algo.NonHierarchicalDistanceBasedAlgorithm uses a module listed above it, which is the healthy direction.
clustering.algo.NonHierarchicalDistanceBasedAlgorithm uses projection, so a change to projection can break clustering.algo.NonHierarchicalDistanceBasedAlgorithm, while a change to clustering.algo.NonHierarchicalDistanceBasedAlgorithm can't break projection.
Position
Below the diagonal: clustering.algo.NonHierarchicalDistanceBasedAlgorithm uses a module listed above it, which is the healthy direction.
clustering.algo.NonHierarchicalDistanceBasedAlgorithm uses quadtree.PointQuadTree, so a change to quadtree.PointQuadTree can break clustering.algo.NonHierarchicalDistanceBasedAlgorithm, while a change to clustering.algo.NonHierarchicalDistanceBasedAlgorithm can't break quadtree.PointQuadTree.
Position
Below the diagonal: clustering.algo.NonHierarchicalDistanceBasedAlgorithm uses a module listed above it, which is the healthy direction.
24→36 clustering.algo.NonHierarchicalDistanceBasedAlgorithm uses clusteringpart of a loop✕
Connections
1 pair of types, where a type in clustering.algo.NonHierarchicalDistanceBasedAlgorithm uses a type in clustering.
clustering.algo.NonHierarchicalDistanceBasedAlgorithm uses clustering, so a change to clustering can break clustering.algo.NonHierarchicalDistanceBasedAlgorithm, while a change to clustering.algo.NonHierarchicalDistanceBasedAlgorithm can't break clustering.
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.
clustering.algo.SuperClusterAlgorithm uses projection, so a change to projection can break clustering.algo.SuperClusterAlgorithm, while a change to clustering.algo.SuperClusterAlgorithm can't break projection.
Position
Below the diagonal: clustering.algo.SuperClusterAlgorithm uses a module listed above it, which is the healthy direction.
25→28 clustering.algo.SuperClusterAlgorithm uses clustering.algopart of a loop✕
Connections
1 pair of types, where a type in clustering.algo.SuperClusterAlgorithm uses a type in clustering.algo.
clustering.algo.SuperClusterAlgorithm uses clustering.algo, so a change to clustering.algo can break clustering.algo.SuperClusterAlgorithm, while a change to clustering.algo.SuperClusterAlgorithm can't break clustering.algo.
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.
collections uses collections.CircleManager, so a change to collections.CircleManager can break collections, while a change to collections can't break collections.CircleManager.
Position
Below the diagonal: collections uses a module listed above it, which is the healthy direction.
collections uses collections.GroundOverlayManager, so a change to collections.GroundOverlayManager can break collections, while a change to collections can't break collections.GroundOverlayManager.
Position
Below the diagonal: collections uses a module listed above it, which is the healthy direction.
collections uses collections.MarkerManager, so a change to collections.MarkerManager can break collections, while a change to collections can't break collections.MarkerManager.
Position
Below the diagonal: collections uses a module listed above it, which is the healthy direction.
collections uses collections.PolygonManager, so a change to collections.PolygonManager can break collections, while a change to collections can't break collections.PolygonManager.
Position
Below the diagonal: collections uses a module listed above it, which is the healthy direction.
collections uses collections.PolylineManager, so a change to collections.PolylineManager can break collections, while a change to collections can't break collections.PolylineManager.
Position
Below the diagonal: collections uses a module listed above it, which is the healthy direction.
heatmaps uses heatmaps.HeatmapTileProvider, so a change to heatmaps.HeatmapTileProvider can break heatmaps, while a change to heatmaps can't break heatmaps.HeatmapTileProvider.
Position
Below the diagonal: heatmaps uses a module listed above it, which is the healthy direction.
heatmaps uses quadtree.PointQuadTree, so a change to quadtree.PointQuadTree can break heatmaps, while a change to heatmaps can't break quadtree.PointQuadTree.
Position
Below the diagonal: heatmaps uses a module listed above it, which is the healthy direction.
clustering.algo uses clustering.ClusterManager, so a change to clustering.ClusterManager can break clustering.algo, while a change to clustering.algo can't break clustering.ClusterManager.
Position
Below the diagonal: clustering.algo uses a module listed above it, which is the healthy direction.
clustering.algo uses clustering.algo.NonHierarchicalDistanceBasedAlgorithm, so a change to clustering.algo.NonHierarchicalDistanceBasedAlgorithm can break clustering.algo, while a change to clustering.algo can't break clustering.algo.NonHierarchicalDistanceBasedAlgorithm.
Position
Below the diagonal: clustering.algo uses a module listed above it, which is the healthy direction.
clustering.algo uses clustering.algo.SuperClusterAlgorithm, so a change to clustering.algo.SuperClusterAlgorithm can break clustering.algo, while a change to clustering.algo can't break clustering.algo.SuperClusterAlgorithm.
Position
Below the diagonal: clustering.algo uses a module listed above it, which is the healthy direction.
28→36 clustering.algo uses clusteringpart of a loop✕
Connections
10 pairs of types, where a type in clustering.algo uses a type in clustering.
clustering.view.ClusterRendererMultipleItems uses geometry, so a change to geometry can break clustering.view.ClusterRendererMultipleItems, while a change to clustering.view.ClusterRendererMultipleItems can't break geometry.
Position
Below the diagonal: clustering.view.ClusterRendererMultipleItems uses a module listed above it, which is the healthy direction.
clustering.view.ClusterRendererMultipleItems uses projection, so a change to projection can break clustering.view.ClusterRendererMultipleItems, while a change to clustering.view.ClusterRendererMultipleItems can't break projection.
Position
Below the diagonal: clustering.view.ClusterRendererMultipleItems uses a module listed above it, which is the healthy direction.
clustering.view.ClusterRendererMultipleItems uses collections, so a change to collections can break clustering.view.ClusterRendererMultipleItems, while a change to clustering.view.ClusterRendererMultipleItems can't break collections.
Position
Below the diagonal: clustering.view.ClusterRendererMultipleItems uses a module listed above it, which is the healthy direction.
29→36 clustering.view.ClusterRendererMultipleItems uses clusteringpart of a loop✕
Connections
3 pairs of types, where a type in clustering.view.ClusterRendererMultipleItems uses a type in clustering.
clustering.view.ClusterRendererMultipleItems uses clustering, so a change to clustering can break clustering.view.ClusterRendererMultipleItems, while a change to clustering.view.ClusterRendererMultipleItems can't break clustering.
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.
clustering.view.DefaultAdvancedMarkersClusterRenderer uses geometry, so a change to geometry can break clustering.view.DefaultAdvancedMarkersClusterRenderer, while a change to clustering.view.DefaultAdvancedMarkersClusterRenderer can't break geometry.
Position
Below the diagonal: clustering.view.DefaultAdvancedMarkersClusterRenderer uses a module listed above it, which is the healthy direction.
clustering.view.DefaultAdvancedMarkersClusterRenderer uses projection, so a change to projection can break clustering.view.DefaultAdvancedMarkersClusterRenderer, while a change to clustering.view.DefaultAdvancedMarkersClusterRenderer can't break projection.
Position
Below the diagonal: clustering.view.DefaultAdvancedMarkersClusterRenderer uses a module listed above it, which is the healthy direction.
clustering.view.DefaultAdvancedMarkersClusterRenderer uses collections, so a change to collections can break clustering.view.DefaultAdvancedMarkersClusterRenderer, while a change to clustering.view.DefaultAdvancedMarkersClusterRenderer can't break collections.
Position
Below the diagonal: clustering.view.DefaultAdvancedMarkersClusterRenderer uses a module listed above it, which is the healthy direction.
30→36 clustering.view.DefaultAdvancedMarkersClusterRenderer uses clusteringpart of a loop✕
Connections
3 pairs of types, where a type in clustering.view.DefaultAdvancedMarkersClusterRenderer uses a type in clustering.
clustering.view.DefaultAdvancedMarkersClusterRenderer uses clustering, so a change to clustering can break clustering.view.DefaultAdvancedMarkersClusterRenderer, while a change to clustering.view.DefaultAdvancedMarkersClusterRenderer can't break clustering.
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.
clustering.view.DefaultClusterRenderer uses geometry, so a change to geometry can break clustering.view.DefaultClusterRenderer, while a change to clustering.view.DefaultClusterRenderer can't break geometry.
Position
Below the diagonal: clustering.view.DefaultClusterRenderer uses a module listed above it, which is the healthy direction.
clustering.view.DefaultClusterRenderer uses projection, so a change to projection can break clustering.view.DefaultClusterRenderer, while a change to clustering.view.DefaultClusterRenderer can't break projection.
Position
Below the diagonal: clustering.view.DefaultClusterRenderer uses a module listed above it, which is the healthy direction.
clustering.view.DefaultClusterRenderer uses collections, so a change to collections can break clustering.view.DefaultClusterRenderer, while a change to clustering.view.DefaultClusterRenderer can't break collections.
Position
Below the diagonal: clustering.view.DefaultClusterRenderer uses a module listed above it, which is the healthy direction.
31→36 clustering.view.DefaultClusterRenderer uses clusteringpart of a loop✕
Connections
3 pairs of types, where a type in clustering.view.DefaultClusterRenderer uses a type in clustering.
clustering.view.DefaultClusterRenderer uses clustering, so a change to clustering can break clustering.view.DefaultClusterRenderer, while a change to clustering.view.DefaultClusterRenderer can't break clustering.
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.
data.kml uses collections.GroundOverlayManager, so a change to collections.GroundOverlayManager can break data.kml, while a change to data.kml can't break collections.GroundOverlayManager.
Position
Below the diagonal: data.kml uses a module listed above it, which is the healthy direction.
data.kml uses collections.MarkerManager, so a change to collections.MarkerManager can break data.kml, while a change to data.kml can't break collections.MarkerManager.
Position
Below the diagonal: data.kml uses a module listed above it, which is the healthy direction.
data.kml uses collections.PolygonManager, so a change to collections.PolygonManager can break data.kml, while a change to data.kml can't break collections.PolygonManager.
Position
Below the diagonal: data.kml uses a module listed above it, which is the healthy direction.
data.kml uses collections.PolylineManager, so a change to collections.PolylineManager can break data.kml, while a change to data.kml can't break collections.PolylineManager.
Position
Below the diagonal: data.kml uses a module listed above it, which is the healthy direction.
data.kml uses data.renderer.mapview, so a change to data.renderer.mapview can break data.kml, while a change to data.kml can't break data.renderer.mapview.
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.
clustering.view uses clustering.ClusterManager, so a change to clustering.ClusterManager can break clustering.view, while a change to clustering.view can't break clustering.ClusterManager.
Position
Below the diagonal: clustering.view uses a module listed above it, which is the healthy direction.
clustering.view uses clustering.view.ClusterRendererMultipleItems, so a change to clustering.view.ClusterRendererMultipleItems can break clustering.view, while a change to clustering.view can't break clustering.view.ClusterRendererMultipleItems.
Position
Below the diagonal: clustering.view uses a module listed above it, which is the healthy direction.
clustering.view uses clustering.view.DefaultAdvancedMarkersClusterRenderer, so a change to clustering.view.DefaultAdvancedMarkersClusterRenderer can break clustering.view, while a change to clustering.view can't break clustering.view.DefaultAdvancedMarkersClusterRenderer.
Position
Below the diagonal: clustering.view uses a module listed above it, which is the healthy direction.
clustering.view uses clustering.view.DefaultClusterRenderer, so a change to clustering.view.DefaultClusterRenderer can break clustering.view, while a change to clustering.view can't break clustering.view.DefaultClusterRenderer.
Position
Below the diagonal: clustering.view uses a module listed above it, which is the healthy direction.
33→36 clustering.view uses clusteringpart of a loop✕
Connections
7 pairs of types, where a type in clustering.view uses a type in clustering.
data.renderer uses data.renderer.model, so a change to data.renderer.model can break data.renderer, while a change to data.renderer can't break data.renderer.model.
Position
Below the diagonal: data.renderer uses a module listed above it, which is the healthy direction.
clustering uses clustering.ClusterManager, so a change to clustering.ClusterManager can break clustering, while a change to clustering can't break clustering.ClusterManager.
Position
Below the diagonal: clustering uses a module listed above it, which is the healthy direction.
clustering uses collections.MarkerManager, so a change to collections.MarkerManager can break clustering, while a change to clustering can't break collections.MarkerManager.
Position
Below the diagonal: clustering uses a module listed above it, which is the healthy direction.
data.renderer.mapview uses data.renderer.model, so a change to data.renderer.model can break data.renderer.mapview, while a change to data.renderer.mapview can't break data.renderer.model.
Position
Below the diagonal: data.renderer.mapview uses a module listed above it, which is the healthy direction.
data.renderer.mapview uses collections.GroundOverlayManager, so a change to collections.GroundOverlayManager can break data.renderer.mapview, while a change to data.renderer.mapview can't break collections.GroundOverlayManager.
Position
Below the diagonal: data.renderer.mapview uses a module listed above it, which is the healthy direction.
data.renderer.mapview uses collections.MarkerManager, so a change to collections.MarkerManager can break data.renderer.mapview, while a change to data.renderer.mapview can't break collections.MarkerManager.
Position
Below the diagonal: data.renderer.mapview uses a module listed above it, which is the healthy direction.
data.renderer.mapview uses collections.PolygonManager, so a change to collections.PolygonManager can break data.renderer.mapview, while a change to data.renderer.mapview can't break collections.PolygonManager.
Position
Below the diagonal: data.renderer.mapview uses a module listed above it, which is the healthy direction.
data.renderer.mapview uses collections.PolylineManager, so a change to collections.PolylineManager can break data.renderer.mapview, while a change to data.renderer.mapview can't break collections.PolylineManager.
Position
Below the diagonal: data.renderer.mapview uses a module listed above it, which is the healthy direction.
data.renderer.mapview uses collections, so a change to collections can break data.renderer.mapview, while a change to data.renderer.mapview can't break collections.
Position
Below the diagonal: data.renderer.mapview uses a module listed above it, which is the healthy direction.
data.renderer.mapview uses data.renderer, so a change to data.renderer can break data.renderer.mapview, while a change to data.renderer.mapview can't break data.renderer.
Position
Below the diagonal: data.renderer.mapview uses a module listed above it, which is the healthy direction.
data.geojson uses data.parser.geojson, so a change to data.parser.geojson can break data.geojson, while a change to data.geojson can't break data.parser.geojson.
Position
Below the diagonal: data.geojson uses a module listed above it, which is the healthy direction.
data.geojson uses data.renderer.model, so a change to data.renderer.model can break data.geojson, while a change to data.geojson can't break data.renderer.model.
Position
Below the diagonal: data.geojson uses a module listed above it, which is the healthy direction.
data.geojson uses collections.GroundOverlayManager, so a change to collections.GroundOverlayManager can break data.geojson, while a change to data.geojson can't break collections.GroundOverlayManager.
Position
Below the diagonal: data.geojson uses a module listed above it, which is the healthy direction.
data.geojson uses collections.MarkerManager, so a change to collections.MarkerManager can break data.geojson, while a change to data.geojson can't break collections.MarkerManager.
Position
Below the diagonal: data.geojson uses a module listed above it, which is the healthy direction.
data.geojson uses collections.PolygonManager, so a change to collections.PolygonManager can break data.geojson, while a change to data.geojson can't break collections.PolygonManager.
Position
Below the diagonal: data.geojson uses a module listed above it, which is the healthy direction.
data.geojson uses collections.PolylineManager, so a change to collections.PolylineManager can break data.geojson, while a change to data.geojson can't break collections.PolylineManager.
Position
Below the diagonal: data.geojson uses a module listed above it, which is the healthy direction.
data.geojson uses data.renderer.mapview, so a change to data.renderer.mapview can break data.geojson, while a change to data.geojson can't break data.renderer.mapview.
Position
Below the diagonal: data.geojson uses a module listed above it, which is the healthy direction.
ktx.utils.geojson uses collections, so a change to collections can break ktx.utils.geojson, while a change to ktx.utils.geojson can't break collections.
Position
Below the diagonal: ktx.utils.geojson uses a module listed above it, which is the healthy direction.
ktx.utils.geojson uses data.geojson, so a change to data.geojson can break ktx.utils.geojson, while a change to ktx.utils.geojson can't break data.geojson.
Position
Below the diagonal: ktx.utils.geojson uses a module listed above it, which is the healthy direction.
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A05:2025 — Injection
33
High / Critical
A03:2025 — Software Supply Chain Failures
4
Medium
A07:2025 — Authentication Failures
2
High / Critical
Roadmap
Top priorities: Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video; Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh; Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
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.
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 — 3
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 — 210
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 — 147
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 8
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 52 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.
Every figure here is one of two kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10.
What we checked — 52 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, 220 of 360 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.java, .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.
D12 Dependency Hygiene — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Currency was graded against Maven Central, but whether an artifact is DEPRECATED is not: Maven Central publishes no deprecation marker, exactly as rubygems.org does not. Whether one is UNMAINTAINED is not graded either — no registry publishes a maintenance status, and release age does not stand in for one. Two of this dimension's four signals are therefore unread on a Gradle tree, and its score reflects currency alone.
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D24 Comment Value — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
D32 Data Compliance (PII/GDPR) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `clustering/src/main/java/com/google/maps/android/clustering/ClusterManager.kt`, `data/src/main/java/com/google/maps/android/data/Layer.kt`, `data/src/main/java/com/google/maps/android/data/kml/KmlUrlSanitizer.kt`, `library/src/main/java/com/google/maps/android/Units.kt`, `library/src/main/java/com/google/maps/android/ktx/model/CameraPosition.kt`, … (+5 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.
D34 Knowledge Freshness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. File-level freshness contradicts repo activity: 90 commits in the last 90 days, yet 50 of 89 significant files carry no living knowledge. Those two readings cannot both be true, so the per-file recency signal is treated as unreliable here and freshness is not scored for this run.
AXB1 Runtime evidence locked — no reproducible boot — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Subject: 1 markup document(s) — HTML, Razor, JSX, Vue, Svelte or server templates. The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. We then boot it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
C2 Access Controls — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
GD1 Unfinished & placeholder code — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby or Scala was found, and this repository's Java, 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 — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and this repository's Kotlin is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D11 Test Reliability: Flakiness is inferred from history/markers — we run the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 REDACTED Scanning: REDACTED detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
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.
D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
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").
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.
AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
+ 7 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 13 bodies over 15 down to 15 or less in Cyclomatic Complexity — start with SuperClusterAlgorithm.buildIndex (cyclomatic 29), RenderTask.run (cyclomatic 24), RenderTask.run (cyclomatic 21). — 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 13 together lifts Cyclomatic Complexity from 8.3 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.
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.
+ 15 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 22 bodies over 15 down to 15 or less in Cognitive Complexity — start with SuperClusterAlgorithm.buildIndex (cognitive 69), MapViewRenderer.addGeometry (cognitive 56), RenderTask.run (cognitive 51). — 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 22 together lifts Cognitive Complexity from 6.6 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes9.0 / 10Stronggated by 15 serious findings✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 5 ClassTooLong finding(s) in God Classes — start with ClusterRendererMultipleItems.kt, DefaultAdvancedMarkersClusterRenderer.kt, DefaultClusterRenderer.kt. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 5 FileTooLong finding(s) in God Classes — start with ClusterRendererMultipleItems.kt, DefaultAdvancedMarkersClusterRenderer.kt, DefaultClusterRenderer.kt. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 4 TooManyMethods finding(s) in God Classes — start with ClusterRendererMultipleItems.kt, DefaultAdvancedMarkersClusterRenderer.kt, DefaultClusterRenderer.kt. — One of this dimension's main actionable groups (4 warning-level).
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.
62 duplicated block group(s) detected. 9.3 % of the production lines (2,598 of 28,047) are in a reported copy. A further 22 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 18 of the 84 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.
+ 54 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 5 Duplicated block (12 lines × 2) finding(s) in Code Duplication — start with DefaultAdvancedMarkersClusterRenderer.kt (2), CentroidNonHierarchicalDistanceBasedAlgorithm.kt, KmlLayer.kt. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 4 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with SuperClusterAlgorithm.kt (2), FlatKdTree.kt, ClusteringDiffDemoActivity.java. — One of this dimension's main actionable groups (4 warning-level).
Resolve the 4 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with DefaultAdvancedMarkersClusterRenderer.kt (2), BomPublishingConventionPlugin.kt, KmlLayer.kt. — One of this dimension's main actionable groups (4 warning-level).
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling8.0 / 10Strong✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
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; 3 module(s) off the main sequence, with abstractness counted on 8 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: .:visual-testing · ×3
What to do
Resolve the 3 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (3 warning-level).
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.
Resolve the 4 Low cohesion finding(s) in Cohesion (LCOM4) — start with ClusterRendererMultipleItems.kt, DefaultAdvancedMarkersClusterRenderer.kt, DefaultClusterRenderer.kt. — One of this dimension's main actionable groups (4 warning-level).
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D11 · Test Reliability10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests pass reliably, with no flakiness.
Method: Suite re-run N times within tiered wall-clock budgets (unit to e2e); tests failing non-deterministically across runs flagged; guarded tests retried when #if guards detected.
What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.
This repository's Gradle dependency graph was RESOLVED BY A BUILD, across every subproject rather than the root alone: 461 artifact(s) resolved, 232 of them gradable against Maven Central, and 128 behind a shipped release. Where a version was requested and a different one won conflict resolution, the RESOLVED version is what is graded — grading the request would recommend an upgrade already applied. Known CVEs in the same graph are a separate question again, reported under D30.
Outdated (compile): com.google.guava:guava · ×128
Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 22 declared JVM dependency artifact(s) use a banned license. Licences were resolved from the POMs Maven Central publishes, over the coordinates this repository's 15 Maven/Gradle manifest(s) declare with a version resolvable from the manifest itself — the same declaration-site closure this analysis reads for dependency currency. The JVM has no lockfile a checkout is guaranteed to carry, so this is deliberately NOT the transitive closure. 8 further coordinate(s) are declared with no version at the declaration site — inherited from a parent POM, a BOM or an unresolved Gradle version reference — and are NOT graded: this verdict covers what the checkout pins, not the full transitive graph. A further 26 coordinate(s) are not published to Maven Central — another repository (Google's Maven hosts androidx), a SNAPSHOT, or a private artifact — so their licences are not readable from here and they are outside this verdict.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Resolve the 4 Hotspot finding(s) in Churn × Complexity Hotspots — start with ClusterRendererMultipleItems.kt, DefaultAdvancedMarkersClusterRenderer.kt, MapViewRenderer.kt. — One of this dimension's main actionable groups (4 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor8.5 / 10Strong✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
12 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt. Counted over 89 of the 211 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Off-boarding risk: anonymized user #1 · ×2
What to do
Resolve the 2 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (2 recommendation-level).
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
24 deducted task-comment markers across 28047 LoC (0.1/KLoC) → score 9.8. 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 24 TodoComment finding(s) in Explicit Debt — start with DefaultAdvancedMarkersClusterRenderer.kt (6), DefaultClusterRenderer.kt (6), ClusterRendererMultipleItems.kt (4). — One of this dimension's main actionable groups (24 warning-level).
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: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
2 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: How far you must trace to follow a call — low indirection and co-located slices read easier.
Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.
Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.
49 % of calls cross a namespace and 15 % go through an interface, but 100 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: small — navigation cost is tolerated.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: REDACTED scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
1 finding(s): 0 critical, 1 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.
REDACTED
REDACTED
What to do
Resolve the 1 REDACTED finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.
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).
33 finding(s): 0 critical, 2 high, 31 medium, 0 low. semgrep hit a parse error in 2 file(s) — `gradlew` (line 74, line 178), `library/src/main/java/com/google/maps/android/Units.kt` (line 80, line 427) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them.
REDACTED
REDACTED
REDACTED
REDACTED
What to do
Resolve the 30 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (30). — One of this dimension's main actionable groups (30 warning-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether 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.
What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.
Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.
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 11 platform declaration(s) and 48 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
✓ On the Gold path — maintain.
Detailed fixes: d44_recommendation.md.
Do you agree with this assessment?
Frontend & cross-cutting dimensions
R = React/JS · M = Maturity · P = Readiness.
AC1 · Text alternatives1.0 / 10Critical✓ Tool-verified
Other · Accessibility — Whether non-text content carries a text alternative — img/area/input[type=image] have alt, a meaningful svg has a title or aria-label, video has a captions track, and object/embed/canvas have a name or fallback content. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: every img/area/input[type=image] checked for alt, svg[role=img] for a title/aria-label, video for a captions <track>. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: image/media elements — img, area, input[type=image], svg, video, object, embed, canvas — across the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and dynamic-attribute elements are skipped. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is NOT read by any producer, so it contributes no element to this population; where such a frontend is present the card discloses it as an analyzer gap rather than scoring around it.
A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content. (×5) — clustering_benchmark_dashboard.html:27, clustering_benchmark_dashboard.html:33, clustering_benchmark_dashboard.html:39, …
What to do
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.
Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. — clustering_benchmark_dashboard.html:2
What to do
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.
Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.
Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
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.
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.
Do you agree with this assessment?
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified
Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.
Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.
Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
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 repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.
Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.
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 & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language's code model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
What to do
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 · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.
Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
Other · Security — Only what this repository's own non-C# files could be read for was assessed — markup this repository SHIPS is scored for third-party script integrity whether or not the repository serves it itself, since a page handed to a consumer runs in that consumer’s origin. Nothing else in this dimension was assessed: the transport, cookie, input-validation and crypto controls are read from a source model that was not loaded for this repository’s language, so their absence here is not a finding about this repository.
Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. On a repository with no .NET source it reads JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Elixir source itself (test, vendored, generated and minified paths not) for the arms that hold whether or not the code serves HTTP: a weak hash or cipher, key material fixed in the source, a TLS client that accepts any certificate, and (JavaScript/TypeScript, Ruby, Scala, Rust and Elixir) an obsolete TLS version; the server controls are not assessed there, and a Dart, Ruby, Scala, Rust or Elixir repository that serves no HTTP of its own is N/A on them. Deterministic.
`https://cdn.jsdelivr.net/npm/chart.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time — the executed bytes can change with nobody touching this repository. — clustering_benchmark_dashboard.html:7
What to do
Pin third-party scripts and verify them: name an exact version in the URL and add an `integrity="sha384-…"` hash alongside `crossorigin="anonymous"` (both are required — an integrity hash on a cross-origin script without `crossorigin` is not evaluated, it blocks the script). Where the vendor ships a continuously-updated loader and publishes no stable hash (tag managers, analytics, chat widgets), Subresource Integrity is not available: constrain it instead with a `Content-Security-Policy` that names the exact origins allowed to execute, and drop the script from the pages that do not need it. Where the page is shipped inside a package that others host, prefer vendoring the asset and serving it from the app’s own origin, so no consumer inherits a third-party dependency they did not choose.
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.
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.
Other · Code Health — Whether suspend functions that make a cancellable request accept or pass on the coroutine's cancellation (adoption curve).
Method: Roslyn scan: every async method (excluding framework-fixed overrides/Blazor handlers) checked for CancellationToken parameter presence. Deterministic, adoption percentage. 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 question: every named async function that itself makes a request an AbortSignal can cancel (global `fetch`, axios and its file-local instances, ky, ofetch) counts, and it is compliant when its parameters or body name a signal or it hands one of its own parameters to the request as options; signatures a framework fixes (JSX event handlers, route and lifecycle exports, request-first handlers, `override`, `'use server'` modules, TanStack `mutationFn`) are exempt unless they take a signal. Deterministic, adoption percentage.
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 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.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether an enhanced `for` leaves the collection it is walking alone — a body that adds to or removes from the very collection the loop is iterating invalidates the fail-fast iterator it is holding, so the next `next()` throws `ConcurrentModificationException` and the remaining elements are never seen. Whether a `for (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.
`catch (e: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. — data/src/main/java/com/google/maps/android/data/renderer/mapper/GeoJsonMapper.kt:216
`catch (Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. — data/src/main/java/com/google/maps/android/data/kml/DefaultKmlUrlSanitizer.java:45
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?
WCAG coverage — what static analysis assessed
Statically assessed 11 of 55 WCAG 2.2 Level A/AA success criteria (20%; ≈22% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 44 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).
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 — 1 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 11 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 — 63 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.
AC2 Forms & labels — No form control/button found in the parsed markup — AC2 not applicable here.
AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
AC5 ARIA correctness — No ARIA usage found in the parsed markup — AC5 not applicable here.
AX1 Captive dependencies — Not applicable: this repository's Java imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's 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 Java code is a Spring, JSR-330 or CDI singleton bean. No class in this Kotlin code is a Spring, JSR-330 or CDI singleton bean. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads.
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — no public interfaces
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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 — ~17138 lines of test source are present (.java, .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.
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.
D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
D21 Naming Consistency — Naming consistency does not read html yet; not measured.
D22 Internal API Consistency — API consistency is measured on C# only; the exposed Java, Kotlin surface was not measured.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only — this repository's production source is .java, .kt, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D25 ADR Conformance — no ADRs to check
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) — 10 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D34 Knowledge Freshness — knowledge concentrated in recent work — freshness signal contradicted by repo activity
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
DM1 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 99 value object(s); 3 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
P12 CI test-gate honesty — 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.
P2 Observability — This repository's JVM source (9 module(s), 196 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 — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X18 Disposal-pattern correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X24 Document value interpolated into markup unescaped — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X30 Support guard that admits what it rejects — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X4 Structured logging — 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.
TodoComment data/src/test/java/com/google/maps/android/data/parser/kml/KmlParserTest.kt:74— // TODO: Test the gx:Tour when implemented — 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 data/src/main/java/com/google/maps/android/data/renderer/mapper/GeoJsonMapper.kt:136— // TODO: Marker styling (marker-color, marker-size, marker-symbol) — 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 data/src/main/java/com/google/maps/android/data/renderer/mapper/KmlMapper.kt:247— // TODO: Map other properties like heading, hotSpot if needed — 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 data/src/main/java/com/google/maps/android/data/renderer/mapper/KmlMapper.kt:267— // TODO: Handle outline property — 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 clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:840— // TODO: try to remove this. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:904— // TODO: try to remove this. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:777— // TODO: try to remove this. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:841— // TODO: try to remove this. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:781— // TODO: try to remove this. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:845— // TODO: try to remove this. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:1059— // TODO: consider adding anchor(.5, .5) (Individual markers will overlap more often) — 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 clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:1116— // TODO: consider adding anchor(.5, .5) (Individual markers will overlap more often) — 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 clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:996— // TODO: consider adding anchor(.5, .5) (Individual markers will overlap more often) — 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 clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:1053— // TODO: consider adding anchor(.5, .5) (Individual markers will overlap more often) — 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 clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:1003— // TODO: consider adding anchor(.5, .5) (Individual markers will overlap more often) — 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 clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:1067— // TODO: consider adding anchor(.5, .5) (Individual markers will overlap more often) — 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 clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:509— // TODO: Add some padding, so that markers can animate in from off-screen. — 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 clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:513— // TODO: Add some padding, so that markers can animate in from off-screen. — 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 clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:572— // TODO: drop animation based on speed of device & number of markers to animate. — 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 clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:576— // TODO: drop animation based on speed of device & number of markers to animate. — 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 clustering/src/main/java/com/google/maps/android/clustering/algo/NonHierarchicalDistanceBasedAlgorithm.kt:121— // TODO - Can this be optimized to update the item in-place if the location hasn't changed? — 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 clustering/src/main/java/com/google/maps/android/clustering/algo/NonHierarchicalDistanceBasedAlgorithm.kt:214— // TODO: Use a span that takes into account the visual size of the marker, not just its — 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 clustering/src/main/java/com/google/maps/android/clustering/algo/PreCachingAlgorithmDecorator.kt:33— // TODO: evaluate maxSize parameter for LruCache. — 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 clustering/src/main/java/com/google/maps/android/clustering/algo/PreCachingAlgorithmDecorator.kt:90— // TODO: Check if requests are already in-flight. — 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.
AC1 · Text alternatives· <canvas> without a text alternative · ×5
<canvas> without a text alternative clustering_benchmark_dashboard.html:27— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative clustering_benchmark_dashboard.html:33— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative clustering_benchmark_dashboard.html:39— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative clustering_benchmark_dashboard.html:45— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative clustering_benchmark_dashboard.html:51— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
ClassTooLong: ClusterRendererMultipleItems clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:76— ClassTooLong — 686 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 286 over it, 1.72× 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: DefaultAdvancedMarkersClusterRenderer clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:72— ClassTooLong — 572 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. The bar is 400 significant lines; this is 172 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: DefaultClusterRenderer clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:71— ClassTooLong — 571 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. The bar is 400 significant lines; this is 171 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: SuperClusterAlgorithm clustering/src/main/java/com/google/maps/android/clustering/algo/SuperClusterAlgorithm.kt:71— ClassTooLong — 486 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 86 over it, 1.22× 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: KmlLayer data/src/main/java/com/google/maps/android/data/kml/KmlLayer.kt:44— ClassTooLong — 454 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 54 over it, 1.14× 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.
FileTooLong: view/ClusterRendererMultipleItems.kt clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt— FileTooLong — 741 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: ClusterRendererMultipleItems (76-1382). The bar is 500 significant lines; this is 241 over it, 1.48× 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: view/DefaultAdvancedMarkersClusterRenderer.kt clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt— FileTooLong — 623 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: DefaultAdvancedMarkersClusterRenderer (72-1242). The bar is 500 significant lines; this is 123 over it, 1.25× 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: view/DefaultClusterRenderer.kt clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt— FileTooLong — 621 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: DefaultClusterRenderer (71-1250). The bar is 500 significant lines; this is 121 over it, 1.24× 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: android/Units.kt library/src/main/java/com/google/maps/android/Units.kt— FileTooLong — 521 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 21 over it, 1.04× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: algo/SuperClusterAlgorithm.kt clustering/src/main/java/com/google/maps/android/clustering/algo/SuperClusterAlgorithm.kt— FileTooLong — 502 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: SuperClusterAlgorithm (71-773). The bar is 500 significant lines; this is 2 over it, 1.00× 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.
Duplicated block (12 lines × 2) clustering/src/main/java/com/google/maps/android/clustering/algo/CentroidNonHierarchicalDistanceBasedAlgorithm.kt:64— clustering/src/main/java/com/google/maps/android/clustering/algo/CentroidNonHierarchicalDistanceBasedAlgorithm.kt:64-75 | clustering/src/main/java/com/google/maps/android/clustering/algo/ContinuousZoomEuclideanCentroidAlgorithm.kt:92-103 — 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 `clustering/src/main/java/com/google/maps/android/clustering/algo/CentroidNonHierarchicalDistanceBasedAlgorithm.kt:64` 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 (12 lines × 2) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:269— clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:269-280 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:277-288 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt` as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 491 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (12 lines × 2) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:1150— clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:1150-1161 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:1158-1169 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt` as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 491 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 `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:1150` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) data/src/main/java/com/google/maps/android/data/kml/KmlLayer.kt:148— data/src/main/java/com/google/maps/android/data/kml/KmlLayer.kt:148-159 | data/src/main/java/com/google/maps/android/data/kml/KmlLayer.kt:244-255 — 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 `data/src/main/java/com/google/maps/android/data/kml/KmlLayer.kt:148` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) demo/src/main/java/com/google/maps/android/utils/demo/ZIndexDemoActivity.kt:304— demo/src/main/java/com/google/maps/android/utils/demo/ZIndexDemoActivity.kt:304-315 | demo/src/main/java/com/google/maps/android/utils/demo/ZIndexDemoActivity.kt:320-331 — 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 `demo/src/main/java/com/google/maps/android/utils/demo/ZIndexDemoActivity.kt:304` 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.
Hotspot: clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:490— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in RenderTask.run at line 490. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 14:41:13 -07:00' --until='2026-11-13 14:41:13 -07:00' --full-history --no-merges -- clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:480— clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in RenderTask.run at line 480. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 14:41:13 -07:00' --until='2026-11-13 14:41:13 -07:00' --full-history --no-merges -- clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: data/src/main/java/com/google/maps/android/data/renderer/mapview/MapViewRenderer.kt data/src/main/java/com/google/maps/android/data/renderer/mapview/MapViewRenderer.kt:156— data/src/main/java/com/google/maps/android/data/renderer/mapview/MapViewRenderer.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in MapViewRenderer.addGeometry at line 156. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 14:41:13 -07:00' --until='2026-11-13 14:41:13 -07:00' --full-history --no-merges -- data/src/main/java/com/google/maps/android/data/renderer/mapview/MapViewRenderer.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:940— clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in DefaultClusterRenderer.onClusterItemUpdated at line 940. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 14:41:13 -07:00' --until='2026-11-13 14:41:13 -07:00' --full-history --no-merges -- clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
TooManyMethods: ClusterRendererMultipleItems clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:76— TooManyMethods — 36 methods. The bar is 30 methods; this is 6 over it, 1.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: DefaultAdvancedMarkersClusterRenderer clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:72— TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: DefaultClusterRenderer clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:71— TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: KmlLayer data/src/main/java/com/google/maps/android/data/kml/KmlLayer.kt:44— TooManyMethods — 33 methods. The bar is 30 methods; this is 3 over it, 1.10× 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 (9 lines × 2) clustering/src/main/java/com/google/maps/android/clustering/algo/FlatKdTree.kt:142— clustering/src/main/java/com/google/maps/android/clustering/algo/FlatKdTree.kt:142-150 | clustering/src/main/java/com/google/maps/android/clustering/algo/FlatKdTree.kt:211-219 — 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 `clustering/src/main/java/com/google/maps/android/clustering/algo/FlatKdTree.kt:142` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) clustering/src/main/java/com/google/maps/android/clustering/algo/SuperClusterAlgorithm.kt:425— clustering/src/main/java/com/google/maps/android/clustering/algo/SuperClusterAlgorithm.kt:425-433 | clustering/src/main/java/com/google/maps/android/clustering/algo/SuperClusterAlgorithm.kt:502-510 — 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 `clustering/src/main/java/com/google/maps/android/clustering/algo/SuperClusterAlgorithm.kt:425` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (9 lines × 2) clustering/src/main/java/com/google/maps/android/clustering/algo/SuperClusterAlgorithm.kt:449— clustering/src/main/java/com/google/maps/android/clustering/algo/SuperClusterAlgorithm.kt:449-457 | clustering/src/main/java/com/google/maps/android/clustering/algo/SuperClusterAlgorithm.kt:535-543 — 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 `clustering/src/main/java/com/google/maps/android/clustering/algo/SuperClusterAlgorithm.kt:449` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:287— demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:287-295 | demo/src/main/java/com/google/maps/android/utils/demo/CustomMarkerClusteringDemoActivity.java:136-144 — before extracting anything, compare `demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java` and `demo/src/main/java/com/google/maps/android/utils/demo/CustomMarkerClusteringDemoActivity.java` as WHOLE FILES: this scan already matched 6 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 `demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:287` 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 (7 lines × 2) build-logic/convention/src/main/kotlin/BomPublishingConventionPlugin.kt:30— build-logic/convention/src/main/kotlin/BomPublishingConventionPlugin.kt:30-36 | build-logic/convention/src/main/kotlin/PublishingConventionPlugin.kt:84-90 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:471— clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:471-477 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:479-485 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt` as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 491 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.
Duplicated block (7 lines × 2) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:745— clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:745-751 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:749-755 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt` as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 491 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.
Duplicated block (7 lines × 2) data/src/main/java/com/google/maps/android/data/kml/KmlLayer.kt:362— data/src/main/java/com/google/maps/android/data/kml/KmlLayer.kt:362-368 | data/src/main/java/com/google/maps/android/data/renderer/mapper/KmlMapper.kt:280-286 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Low cohesion: ClusterRendererMultipleItems (LCOM4 5) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:76— ClusterRendererMultipleItems's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: DefaultAdvancedMarkersClusterRenderer (LCOM4 5) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:72— DefaultAdvancedMarkersClusterRenderer's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: DefaultClusterRenderer (LCOM4 5) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:71— DefaultClusterRenderer's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: Builder (LCOM4 5) heatmaps/src/main/java/com/google/maps/android/heatmaps/HeatmapTileProvider.kt:63— Builder's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Duplicated block (26 lines × 2) build-logic/convention/src/main/kotlin/BomPublishingConventionPlugin.kt:45— build-logic/convention/src/main/kotlin/BomPublishingConventionPlugin.kt:45-70 | build-logic/convention/src/main/kotlin/PublishingConventionPlugin.kt:104-129 — 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 `build-logic/convention/src/main/kotlin/BomPublishingConventionPlugin.kt:45` 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 (26 lines × 2) data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt:299— data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt:299-324 | data/src/main/java/com/google/maps/android/data/kml/KmlLayer.kt:405-430 — 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 (26 lines × 2) demo/src/main/java/com/google/maps/android/utils/demo/CustomAdvancedMarkerClusteringDemoActivity.java:198— demo/src/main/java/com/google/maps/android/utils/demo/CustomAdvancedMarkerClusteringDemoActivity.java:198-223 | demo/src/main/java/com/google/maps/android/utils/demo/CustomMarkerClusteringDemoActivity.java:220-245 — before extracting anything, compare `demo/src/main/java/com/google/maps/android/utils/demo/CustomAdvancedMarkerClusteringDemoActivity.java` and `demo/src/main/java/com/google/maps/android/utils/demo/CustomMarkerClusteringDemoActivity.java` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 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. 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) clustering/src/main/java/com/google/maps/android/clustering/algo/ContinuousZoomEuclideanCentroidAlgorithm.kt:40— clustering/src/main/java/com/google/maps/android/clustering/algo/ContinuousZoomEuclideanCentroidAlgorithm.kt:40-52 | clustering/src/main/java/com/google/maps/android/clustering/algo/NonHierarchicalDistanceBasedAlgorithm.kt:138-150 — 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 `clustering/src/main/java/com/google/maps/android/clustering/algo/ContinuousZoomEuclideanCentroidAlgorithm.kt:40` 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) demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:211— demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:211-223 | demo/src/main/java/com/google/maps/android/utils/demo/CustomMarkerClusteringDemoActivity.java:63-75 — before extracting anything, compare `demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java` and `demo/src/main/java/com/google/maps/android/utils/demo/CustomMarkerClusteringDemoActivity.java` as WHOLE FILES: this scan already matched 6 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. 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) demo/src/main/java/com/google/maps/android/utils/demo/BigClusteringDemoActivity.java:47— demo/src/main/java/com/google/maps/android/utils/demo/BigClusteringDemoActivity.java:47-59 | demo/src/main/java/com/google/maps/android/utils/demo/VisibleClusteringDemoActivity.java:57-69 — before extracting anything, compare `demo/src/main/java/com/google/maps/android/utils/demo/BigClusteringDemoActivity.java` and `demo/src/main/java/com/google/maps/android/utils/demo/VisibleClusteringDemoActivity.java` as WHOLE FILES: 93% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (8 lines × 3) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:283— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:283-290 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:245-252 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:253-260 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (8 lines × 3) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:967— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:967-974 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:904-911 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:908-915 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:917` calls `zIndex` and `clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:975` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (8 lines × 3) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:273— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:273-280 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:235-242 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:243-250 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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.
Off the main sequence: .:visual-testing — .:visual-testing: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: .:library — .:library: abstractness 0.08, instability 0.00, distance 0.92 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.
Off the main sequence: .:ui — .:ui: abstractness 0.13, instability 0.00, distance 0.88 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.
RenderTask.run (cyclomatic 21) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:480— RenderTask.run has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
RenderTask.run (cyclomatic 21) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:488— RenderTask.run has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
RenderTask.run (cognitive 36) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:480— RenderTask.run has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 6, loops 4 (6 pts), error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RenderTask.run (cognitive 36) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:488— RenderTask.run has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 6, loops 4 (6 pts), error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CreateMarkerTask.perform (cognitive 25) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:1105— CreateMarkerTask.perform has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 1 (2 pts) (nesting depth added 14). 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.
CreateMarkerTask.perform (cognitive 25) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:1119— CreateMarkerTask.perform has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 1 (2 pts) (nesting depth added 14). 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.
D4 · Code Duplication· Edited copy of a member (18 corresponding lines) · ×2
Edited copy of a member (18 corresponding lines) data/src/main/java/com/google/maps/android/renderer/GoogleMapRenderer.kt:111— data/src/main/java/com/google/maps/android/renderer/GoogleMapRenderer.kt:111-128 | data/src/main/java/com/google/maps/android/renderer/GoogleMapRenderer.kt:130-149 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:144— demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:144-161 | demo/src/main/java/com/google/maps/android/utils/demo/CustomMarkerClusteringDemoActivity.java:198-216 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (11 corresponding lines) · ×2
Edited copy of a member (11 corresponding lines) data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt:371— data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt:371-381 | data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt:383-394 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) demo/src/main/java/com/google/maps/android/utils/demo/ZIndexDemoActivity.kt:405— demo/src/main/java/com/google/maps/android/utils/demo/ZIndexDemoActivity.kt:405-415 | demo/src/main/java/com/google/maps/android/utils/demo/ZIndexDemoActivity.kt:419-435 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (24 lines × 2) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:210— clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:210-233 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:218-241 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt` as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 491 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. 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 (24 lines × 2) library/src/main/java/com/google/maps/android/location/LocationManager.kt:50— library/src/main/java/com/google/maps/android/location/LocationManager.kt:50-73 | library/src/main/java/com/google/maps/android/location/LocationManager.kt:105-128 — 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 `library/src/main/java/com/google/maps/android/location/LocationManager.kt:50` 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 × 3) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:689— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:689-702 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:653-666 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:657-670 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (14 lines × 3) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:1074— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:1074-1087 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:1011-1024 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:1025-1038 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (12 lines × 3) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:293— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:293-304 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:255-266 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:263-274 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (12 lines × 3) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:366— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:366-377 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:320-331 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:328-339 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (11 lines × 3) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:1358— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:1358-1368 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:1218-1228 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:1226-1236 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 3) demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:151— demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:151-161 | demo/src/main/java/com/google/maps/android/utils/demo/CustomAdvancedMarkerClusteringDemoActivity.java:184-194 | demo/src/main/java/com/google/maps/android/utils/demo/CustomMarkerClusteringDemoActivity.java:206-216 — before extracting anything, compare `demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java` and `demo/src/main/java/com/google/maps/android/utils/demo/CustomAdvancedMarkerClusteringDemoActivity.java` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 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 `demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:151` 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 (10 lines × 2) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:696— clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:696-705 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:700-709 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt` as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 491 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.
Duplicated block (10 lines × 2) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:713— clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:713-722 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:717-726 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt` as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 491 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.
Duplicated block (8 lines × 2) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:1194— clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:1194-1201 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:1202-1209 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt` as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 491 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.
Duplicated block (8 lines × 2) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:1203— clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:1203-1210 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:1211-1218 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt` as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 491 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.
Duplicated block (14 lines × 2) visual-testing/src/main/java/com/google/maps/android/visualtesting/GeminiVisualTestHelper.kt:106— visual-testing/src/main/java/com/google/maps/android/visualtesting/GeminiVisualTestHelper.kt:106-119 | visual-testing/src/main/java/com/google/maps/android/visualtesting/GeminiVisualTestHelper.kt:246-259 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14 lines × 2) demo/src/main/java/com/google/maps/android/utils/demo/StreetViewDemoJavaActivity.java:78— demo/src/main/java/com/google/maps/android/utils/demo/StreetViewDemoJavaActivity.java:78-91 | demo/src/main/java/com/google/maps/android/utils/demo/StreetViewDemoJavaActivity.java:103-116 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `demo/src/main/java/com/google/maps/android/utils/demo/StreetViewDemoJavaActivity.java:78` 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.
Swallowed exception (caught, then discarded) data/src/main/java/com/google/maps/android/data/renderer/mapper/GeoJsonMapper.kt:216— `catch (e: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) data/src/main/java/com/google/maps/android/data/kml/DefaultKmlUrlSanitizer.java:45— `catch (Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
AC3 · Page structure· Page without a main landmark · ×1
Page without a main landmark clustering_benchmark_dashboard.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
SuperClusterAlgorithm.buildIndex (cyclomatic 29) clustering/src/main/java/com/google/maps/android/clustering/algo/SuperClusterAlgorithm.kt:372— SuperClusterAlgorithm.buildIndex 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.
RenderTask.run (cyclomatic 24) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:490— RenderTask.run 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.
GeoJsonMapper.toFeature (cyclomatic 21) data/src/main/java/com/google/maps/android/data/renderer/mapper/GeoJsonMapper.kt:82— GeoJsonMapper.toFeature has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
GeoJsonMapper.parseColor (cyclomatic 21) data/src/main/java/com/google/maps/android/data/renderer/mapper/GeoJsonMapper.kt:154— GeoJsonMapper.parseColor has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
MapViewRenderer.addGeometry (cyclomatic 21) data/src/main/java/com/google/maps/android/data/renderer/mapview/MapViewRenderer.kt:156— MapViewRenderer.addGeometry has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
coverage_history.cmd_render (cyclomatic 20) .github/scripts/coverage_history.py:390— coverage_history.cmd_render has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ClusterRendererMultipleItems.onClusterItemUpdated (cyclomatic 16) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:996— ClusterRendererMultipleItems.onClusterItemUpdated 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.
CreateMarkerTask.perform (cyclomatic 16) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:1168— CreateMarkerTask.perform 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.
DefaultAdvancedMarkersClusterRenderer.onClusterItemUpdated (cyclomatic 16) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:933— DefaultAdvancedMarkersClusterRenderer.onClusterItemUpdated 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.
DefaultClusterRenderer.onClusterItemUpdated (cyclomatic 16) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:940— DefaultClusterRenderer.onClusterItemUpdated 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.
compare_baseline_profiles.main (cyclomatic 16) .github/scripts/compare_baseline_profiles.py:56— compare_baseline_profiles.main 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.
SuperClusterAlgorithm.buildIndex (cognitive 69) clustering/src/main/java/com/google/maps/android/clustering/algo/SuperClusterAlgorithm.kt:372— SuperClusterAlgorithm.buildIndex has cognitive complexity 69 (threshold 15). Drivers by points: if/else 37 (54 pts), loops 7 (15 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MapViewRenderer.addGeometry (cognitive 56) data/src/main/java/com/google/maps/android/data/renderer/mapview/MapViewRenderer.kt:156— MapViewRenderer.addGeometry has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (40 pts), error handling 3 (15 pts), match/switch 1 (nesting depth added 36). 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.
RenderTask.run (cognitive 51) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:490— RenderTask.run has cognitive complexity 51 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 6 (15 pts), boolean chains 6, error handling 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CreateMarkerTask.perform (cognitive 50) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:1168— CreateMarkerTask.perform has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (36 pts), loops 3 (13 pts), boolean chains 1 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
PolyUtil.locationIndexOnEdgeOrPath (cognitive 31) library/src/main/java/com/google/maps/android/PolyUtil.kt:201— PolyUtil.locationIndexOnEdgeOrPath has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GeoJsonMapper.toFeature (cognitive 28) data/src/main/java/com/google/maps/android/data/renderer/mapper/GeoJsonMapper.kt:82— GeoJsonMapper.toFeature has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 12, 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.
coverage_history.cmd_render (cognitive 26) .github/scripts/coverage_history.py:390— coverage_history.cmd_render has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 9 (13 pts), if/else 6 (9 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ContinuousZoomEuclideanCentroidAlgorithm.getClusters (cognitive 22) clustering/src/main/java/com/google/maps/android/clustering/algo/ContinuousZoomEuclideanCentroidAlgorithm.kt:36— ContinuousZoomEuclideanCentroidAlgorithm.getClusters has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 5 (8 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ClusterRendererMultipleItems.onClusterItemUpdated (cognitive 21) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:996— ClusterRendererMultipleItems.onClusterItemUpdated has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DefaultAdvancedMarkersClusterRenderer.onClusterItemUpdated (cognitive 21) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:933— DefaultAdvancedMarkersClusterRenderer.onClusterItemUpdated has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DefaultClusterRenderer.onClusterItemUpdated (cognitive 21) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:940— DefaultClusterRenderer.onClusterItemUpdated has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
check_agent_leftovers.main (cognitive 21) .github/scripts/check_agent_leftovers.py:126— check_agent_leftovers.main has cognitive complexity 21 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 5 (9 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
HeatmapTileProvider.convolve (cognitive 20) heatmaps/src/main/java/com/google/maps/android/heatmaps/HeatmapTileProvider.kt:357— HeatmapTileProvider.convolve has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 2 (6 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
compare_baseline_profiles.main (cognitive 18) .github/scripts/compare_baseline_profiles.py:56— compare_baseline_profiles.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
coverage_history.collect (cognitive 18) .github/scripts/coverage_history.py:148— coverage_history.collect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FlatKdTree.queryRange (cognitive 17) clustering/src/main/java/com/google/maps/android/clustering/algo/FlatKdTree.kt:114— FlatKdTree.queryRange has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
triage_issue.main (cognitive 17) .github/scripts/triage_issue.py:61— triage_issue.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 1 (2 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.
PointQuadTree.remove (cognitive 16) clustering/src/main/java/com/google/maps/android/quadtree/PointQuadTree.kt:120— PointQuadTree.remove has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MethodTooLong: SuperClusterAlgorithm.buildIndex clustering/src/main/java/com/google/maps/android/clustering/algo/SuperClusterAlgorithm.kt:372— MethodTooLong — buildIndex runs 158 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 58 over it, 1.58× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D4 · Code Duplication· Edited copy of a member (111 corresponding lines) · ×1
Edited copy of a member (111 corresponding lines) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:480— clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:480-594 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:488-598 — These two members are one piece of code written twice and then edited apart: 111 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (51 corresponding lines) · ×1
Edited copy of a member (51 corresponding lines) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:1105— clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:1105-1161 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:1119-1169 — These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (34 corresponding lines) · ×1
Edited copy of a member (34 corresponding lines) clustering/src/main/java/com/google/maps/android/clustering/algo/FlatKdTree.kt:123— clustering/src/main/java/com/google/maps/android/clustering/algo/FlatKdTree.kt:123-156 | clustering/src/main/java/com/google/maps/android/clustering/algo/FlatKdTree.kt:188-225 — These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (48 corresponding lines) · ×1
Edited copy of a member (48 corresponding lines) build-logic/convention/src/main/kotlin/BomPublishingConventionPlugin.kt:24— build-logic/convention/src/main/kotlin/BomPublishingConventionPlugin.kt:24-71 | build-logic/convention/src/main/kotlin/PublishingConventionPlugin.kt:74-129 — These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (24 corresponding lines) · ×1
Edited copy of a member (24 corresponding lines) data/src/main/java/com/google/maps/android/data/renderer/mapview/MapViewRenderer.kt:334— data/src/main/java/com/google/maps/android/data/renderer/mapview/MapViewRenderer.kt:334-357 | data/src/main/java/com/google/maps/android/data/renderer/mapview/MapViewRenderer.kt:369-403 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (31 corresponding lines) · ×1
Edited copy of a member (31 corresponding lines) data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt:177— data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt:177-207 | data/src/main/java/com/google/maps/android/data/kml/KmlLayer.kt:370-400 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (21 corresponding lines) · ×1
Edited copy of a member (21 corresponding lines) clustering/src/main/java/com/google/maps/android/quadtree/PointQuadTree.kt:59— clustering/src/main/java/com/google/maps/android/quadtree/PointQuadTree.kt:59-83 | clustering/src/main/java/com/google/maps/android/quadtree/PointQuadTree.kt:120-140 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (37 corresponding lines) · ×1
Edited copy of a member (37 corresponding lines) library/src/main/java/com/google/maps/android/location/LocationManager.kt:48— library/src/main/java/com/google/maps/android/location/LocationManager.kt:48-84 | library/src/main/java/com/google/maps/android/location/LocationManager.kt:103-139 — These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (17 corresponding lines) · ×1
Edited copy of a member (17 corresponding lines) library/src/main/java/com/google/maps/android/Units.kt:865— library/src/main/java/com/google/maps/android/Units.kt:865-881 | library/src/main/java/com/google/maps/android/Units.kt:983-999 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 10+ corresponding lines) · ×1
Edited copies of one member (3 members, 10+ corresponding lines) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:966— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:966-975 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:903-912 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:907-919 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 9+ corresponding lines) · ×1
Edited copies of one member (3 members, 9+ corresponding lines) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:282— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:282-290 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:244-252 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:252-260 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (8 corresponding lines) · ×1
Edited copy of a member (8 corresponding lines) data/src/main/java/com/google/maps/android/data/renderer/mapper/GpxMapper.kt:64— data/src/main/java/com/google/maps/android/data/renderer/mapper/GpxMapper.kt:64-73 | data/src/main/java/com/google/maps/android/data/renderer/mapper/GpxMapper.kt:75-82 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 11+ corresponding lines) · ×1
Edited copies of one member (4 members, 11+ corresponding lines) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:1357— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:1357-1370 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:1217-1229 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:1225-1237 | ui/src/main/java/com/google/maps/android/ui/AnimationUtil.kt:77-87 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (15 corresponding lines) · ×1
Edited copy of a member (15 corresponding lines) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:776— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:776-790 | clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:800-814 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (5 corresponding lines) · ×1
Edited copy of a member (5 corresponding lines) data/src/main/java/com/google/maps/android/data/kml/KmlLayer.kt:448— data/src/main/java/com/google/maps/android/data/kml/KmlLayer.kt:448-452 | data/src/main/java/com/google/maps/android/data/kml/KmlLayer.kt:454-458 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 1+ corresponding lines) · ×1
Edited copies of one member (4 members, 1+ corresponding lines) clustering/src/main/java/com/google/maps/android/clustering/algo/NonHierarchicalDistanceBasedAlgorithm.kt:204— clustering/src/main/java/com/google/maps/android/clustering/algo/NonHierarchicalDistanceBasedAlgorithm.kt:204-204 | clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:1380-1380 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:1240-1240 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:1248-1248 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Duplicated block (70 lines × 2) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:520— clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:520-589 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:524-593 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt` as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 491 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 `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:520` 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 (45 lines × 3) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:997— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:997-1041 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:934-978 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:941-985 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. 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 (44 lines × 2) data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt:521— data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt:521-564 | data/src/main/java/com/google/maps/android/data/kml/KmlLayer.kt:650-693 — 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 (35 lines × 3) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:389— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:389-423 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:343-377 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:351-385 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. 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 (31–33 lines × 2) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:484— clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:484-516 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:490-520 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt` as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 491 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 `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:484` 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 (30 lines × 3) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:817— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:817-846 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:754-783 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:758-787 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. 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 (29–30 lines × 2) data/src/main/java/com/google/maps/android/data/DataLayerLoader.kt:146— data/src/main/java/com/google/maps/android/data/DataLayerLoader.kt:146-174 | data/src/main/java/com/google/maps/android/data/DataLayerLoader.kt:176-205 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `data/src/main/java/com/google/maps/android/data/DataLayerLoader.kt:176` 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 (28 lines × 2) clustering/src/main/java/com/google/maps/android/clustering/algo/ContinuousZoomEuclideanCentroidAlgorithm.kt:62— clustering/src/main/java/com/google/maps/android/clustering/algo/ContinuousZoomEuclideanCentroidAlgorithm.kt:62-89 | clustering/src/main/java/com/google/maps/android/clustering/algo/NonHierarchicalDistanceBasedAlgorithm.kt:152-179 — 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 `clustering/src/main/java/com/google/maps/android/clustering/algo/ContinuousZoomEuclideanCentroidAlgorithm.kt:62` 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 (26 lines × 3) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:334— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:334-359 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:288-313 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:296-321 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. 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 (25 lines × 2) data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt:178— data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt:178-202 | data/src/main/java/com/google/maps/android/data/kml/KmlLayer.kt:371-395 — 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 (21 lines × 3) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:852— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:852-872 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:789-809 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:793-813 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. 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–21 lines × 2) data/src/main/java/com/google/maps/android/data/renderer/mapview/MapViewRenderer.kt:163— data/src/main/java/com/google/maps/android/data/renderer/mapview/MapViewRenderer.kt:163-182 | data/src/main/java/com/google/maps/android/data/renderer/mapview/MapViewRenderer.kt:185-205 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `data/src/main/java/com/google/maps/android/data/renderer/mapview/MapViewRenderer.kt:185` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (18 lines × 2) clustering/src/main/java/com/google/maps/android/clustering/algo/SuperClusterAlgorithm.kt:579— clustering/src/main/java/com/google/maps/android/clustering/algo/SuperClusterAlgorithm.kt:579-596 | clustering/src/main/java/com/google/maps/android/clustering/algo/SuperClusterAlgorithm.kt:624-641 — 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 `clustering/src/main/java/com/google/maps/android/clustering/algo/SuperClusterAlgorithm.kt:579` 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 (14–16 lines × 2) clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:1126— clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:1126-1139 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:1137-1152 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt` as WHOLE FILES: this scan already matched 27 separate duplicated blocks between them, totalling at least 491 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 `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:1126` 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. 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 (9–12 lines × 3) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:552— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:552-563 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:557-565 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:561-569 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 `clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:552` 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, `clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:564` calls `d` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:566` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10–11 lines × 2) data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt:135— data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt:135-145 | data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt:149-158 — 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 `data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt:135` 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 (5–7 lines × 2) data/src/main/java/com/google/maps/android/data/renderer/mapview/MapViewRenderer.kt:339— data/src/main/java/com/google/maps/android/data/renderer/mapview/MapViewRenderer.kt:339-343 | data/src/main/java/com/google/maps/android/data/renderer/mapview/MapViewRenderer.kt:374-380 — 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 `data/src/main/java/com/google/maps/android/data/renderer/mapview/MapViewRenderer.kt:339` 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) library/src/main/java/com/google/maps/android/PolyUtil.kt:453— library/src/main/java/com/google/maps/android/PolyUtil.kt:453-458 | library/src/main/java/com/google/maps/android/PolyUtil.kt:462-467 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18 lines × 3) clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:900— clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:900-917 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:837-854 | clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt:841-858 — before extracting anything, compare `clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt` and `clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt` as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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.
D4 · Code Duplication· Edited copy of a member (19 corresponding lines) · ×1
Edited copy of a member (19 corresponding lines) demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:274— demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:274-295 | demo/src/main/java/com/google/maps/android/utils/demo/CustomMarkerClusteringDemoActivity.java:126-144 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 24+ corresponding lines) · ×1
Edited copies of one member (4 members, 24+ corresponding lines) demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:97— demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:97-125 | demo/src/main/java/com/google/maps/android/utils/demo/CustomAdvancedMarkerClusteringDemoActivity.java:125-153 | demo/src/main/java/com/google/maps/android/utils/demo/CustomMarkerClusteringDemoActivity.java:154-179 | demo/src/main/java/com/google/maps/android/utils/demo/ZoomClusteringDemoActivity.java:43-66 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Duplicated block (20 lines × 2) demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:99— demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:99-118 | demo/src/main/java/com/google/maps/android/utils/demo/CustomAdvancedMarkerClusteringDemoActivity.java:127-146 — before extracting anything, compare `demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java` and `demo/src/main/java/com/google/maps/android/utils/demo/CustomAdvancedMarkerClusteringDemoActivity.java` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 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 `demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:99` 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 (17–18 lines × 3) demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:103— demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:103-120 | demo/src/main/java/com/google/maps/android/utils/demo/CustomAdvancedMarkerClusteringDemoActivity.java:131-148 | demo/src/main/java/com/google/maps/android/utils/demo/CustomMarkerClusteringDemoActivity.java:158-174 — before extracting anything, compare `demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java` and `demo/src/main/java/com/google/maps/android/utils/demo/CustomAdvancedMarkerClusteringDemoActivity.java` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 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 `demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:103` 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 (16 lines × 2) demo/src/main/java/com/google/maps/android/utils/demo/PolySimplifyDemoActivity.java:89— demo/src/main/java/com/google/maps/android/utils/demo/PolySimplifyDemoActivity.java:89-104 | demo/src/main/java/com/google/maps/android/utils/demo/PolySimplifyDemoActivity.java:108-123 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13–14 lines × 2) demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:145— demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:145-157 | demo/src/main/java/com/google/maps/android/utils/demo/CustomMarkerClusteringDemoActivity.java:199-212 — before extracting anything, compare `demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java` and `demo/src/main/java/com/google/maps/android/utils/demo/CustomMarkerClusteringDemoActivity.java` as WHOLE FILES: this scan already matched 6 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.
Duplicated block (11 lines × 2) demo/src/main/java/com/google/maps/android/utils/demo/CustomMarkerClusteringDemoActivity.java:157— demo/src/main/java/com/google/maps/android/utils/demo/CustomMarkerClusteringDemoActivity.java:157-167 | demo/src/main/java/com/google/maps/android/utils/demo/ZoomClusteringDemoActivity.java:46-56 — 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `cluster` to `Cluster<Person>` in one and `Cluster<MyItem>` 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 (7–8 lines × 2) demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:275— demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:275-282 | demo/src/main/java/com/google/maps/android/utils/demo/CustomMarkerClusteringDemoActivity.java:127-133 — before extracting anything, compare `demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java` and `demo/src/main/java/com/google/maps/android/utils/demo/CustomMarkerClusteringDemoActivity.java` as WHOLE FILES: this scan already matched 6 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 `demo/src/main/java/com/google/maps/android/utils/demo/ClusteringDiffDemoActivity.java:275` 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 (7 lines × 3) demo/src/main/java/com/google/maps/android/utils/demo/BigClusteringDemoActivity.java:49— demo/src/main/java/com/google/maps/android/utils/demo/BigClusteringDemoActivity.java:49-55 | demo/src/main/java/com/google/maps/android/utils/demo/ClusteringViewModel.java:41-47 | demo/src/main/java/com/google/maps/android/utils/demo/VisibleClusteringDemoActivity.java:59-65 — before extracting anything, compare `demo/src/main/java/com/google/maps/android/utils/demo/BigClusteringDemoActivity.java` and `demo/src/main/java/com/google/maps/android/utils/demo/VisibleClusteringDemoActivity.java` as WHOLE FILES: 93% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `demo/src/main/java/com/google/maps/android/utils/demo/BigClusteringDemoActivity.java:49` 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.
Third-party script without Subresource Integrity clustering_benchmark_dashboard.html:7— `https://cdn.jsdelivr.net/npm/chart.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time — the executed bytes can change with nobody touching this repository.
Duplicated predicate clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt:573— `!zoomingIn && zoomDelta > -3 && onScreen && animate` appears character-identically in 2 files — clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt, clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.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 clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:368— `currentBuckets.isEmpty() || size <= currentBuckets[0]` appears character-identically in 3 files — clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt, clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt, clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.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 build-logic/convention/src/main/kotlin/BomPublishingConventionPlugin.kt:31— `findProperty("signing.keyId")?.toString()?.isNotBlank() == true || findProperty("signing.secretKeyRingFile")?.toString()?.isNotBlank() == tr…` appears character-identically in 2 files — build-logic/convention/src/main/kotlin/BomPublishingConventionPlugin.kt, build-logic/convention/src/main/kotlin/PublishingConventionPlugin.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 clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:967— `item.title != null && item.snippet != null` appears character-identically in 3 files — clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt, clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt, clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.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 clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:1033— `itemZIndex != null && marker.zIndex != itemZIndex` appears character-identically in 3 files — clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt, clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt, clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.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 data/src/main/java/com/google/maps/android/data/parser/geojson/GeoJsonParser.kt:208— `lng.isFinite() && lat.isFinite() && (alt == null || alt.isFinite())` appears character-identically in 2 files — data/src/main/java/com/google/maps/android/data/parser/geojson/GeoJsonParser.kt, data/src/main/java/com/google/maps/android/data/parser/kml/LatLngAltSerializer.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 clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:495— `mAnimate && sphericalMercatorProjection != null` appears character-identically in 3 files — clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt, clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt, clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.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 clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:888— `mCreateMarkerTasks.isEmpty() && mOnScreenCreateMarkerTasks.isEmpty() && mOnScreenRemoveMarkerTasks.isEmpty() && mRemoveMarkerTasks.isEmpty()…` appears character-identically in 3 files — clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt, clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt, clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.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 data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt:182— `mManagersMap == null && ( mMarkerManager != null || mPolygonManager != null || mPolylineManager != null || mGroundOverlayManager != null )` appears character-identically in 2 files — data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt, data/src/main/java/com/google/maps/android/data/kml/KmlLayer.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 data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt:303— `map != null && mManagersMap != null && map !== mManagersMap` appears character-identically in 2 files — data/src/main/java/com/google/maps/android/data/geojson/GeoJsonLayer.kt, data/src/main/java/com/google/maps/android/data/kml/KmlLayer.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 clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt:511— `shouldRenderAsCluster(c) && visibleBounds.contains(c.position)` appears character-identically in 3 files — clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt, clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt, clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.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.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 8 significant file(s) lose their only recent owner: library/src/main/java/com/google/maps/android/FlexiblePolyline.kt, build-logic/convention/src/main/kotlin/PublishingConventionPlugin.kt, data/build.gradle.kts, clustering/build.gradle.kts, heatmaps/build.gradle.kts, collections/build.gradle.kts, ui/build.gradle.kts, visual-testing/build.gradle.kts. Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 4 significant file(s) lose their only recent owner: clustering/src/main/java/com/google/maps/android/clustering/view/ClusterRendererMultipleItems.kt, clustering/src/main/java/com/google/maps/android/clustering/view/DefaultAdvancedMarkersClusterRenderer.kt, clustering/src/main/java/com/google/maps/android/clustering/view/DefaultClusterRenderer.kt, library/src/main/java/com/google/maps/android/PolyUtil.kt. Pair on, review, or document these before any departure.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 2 of 10 project(s) overshoot their size bounds, lowering Project Cohesion to 7.3/10. The most over is `data` (6875 LoC, 170 module-visible types across 15 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.
D28 · Secrets (history)· Rotate the exposed credentials · ×1
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
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 10 file(s) — `clustering/src/main/java/com/google/maps/android/clustering/ClusterManager.kt`, `data/src/main/java/com/google/maps/android/data/Layer.kt`, `data/src/main/java/com/google/maps/android/data/kml/KmlUrlSanitizer.kt`, `library/src/main/java/com/google/maps/android/Units.kt`, `library/src/main/java/com/google/maps/android/ktx/model/CameraPosition.kt`, … (+5 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
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 01a1da44-6c4a-767d-99eb-0664189def7f · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 3 · Warnings: 210 · Recommendations: 19 · Info: 128 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 14-11-2026 @ 13:34 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.