{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"BoundedLocalCache.remap (cyclomatic 48): BoundedLocalCache.remap has cyclomatic complexity 48 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3075}}}],"partialFingerprints":{"codehealthFindingId/v1":"d323de894f3f9d0138ea0b2325ae0ee591fe16e1abc68dc44aa720371fe9fed2"}},{"ruleId":"D1","level":"warning","message":{"text":"regret.analyze (cyclomatic 47): regret.analyze has cyclomatic complexity 47 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/regret.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae78f4c72797fc09d23515df195389943cd779a4882984c2d368d9f74d1f266"}},{"ruleId":"D1","level":"warning","message":{"text":"regret.hints (cyclomatic 38): regret.hints has cyclomatic complexity 38 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/regret.py"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be41cb7cd04332c89a964de92b7429b4be838aa5354a1daedcb3aca04acc33c"}},{"ruleId":"D1","level":"warning","message":{"text":"BoundedLocalCache.put (cyclomatic 36): BoundedLocalCache.put has cyclomatic complexity 36 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cbffcdcfb877e5164fd9383d17bbe447b682467d85158be1a25c504e69fd4c"}},{"ruleId":"D1","level":"warning","message":{"text":"walker.extract_balanced_json (cyclomatic 32): walker.extract_balanced_json has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/walker.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"452be77f1f6c2467e8476ca066bb0246a2c9f4193bc6c5b34800688756004a9d"}},{"ruleId":"D1","level":"warning","message":{"text":"verify.extract_balanced_json (cyclomatic 31): verify.extract_balanced_json has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/verify.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbb1f1a4629cbb578f53f94cd6a6b016f81e9886706d02b85487f8ef858f7be"}},{"ruleId":"D1","level":"warning","message":{"text":"BoundedLocalCache.refreshIfNeeded (cyclomatic 27): BoundedLocalCache.refreshIfNeeded has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4057dbbef3cf29ade6e0d3c68da79e4573acf94e0eff056917ac4bba71398de"}},{"ruleId":"D1","level":"warning","message":{"text":"census.do_parse (cyclomatic 27): census.do_parse has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/census.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0669fe376e3e2371dd8f10570497edd09a71dde5f14ae0739315a5eea27d1e01"}},{"ruleId":"D1","level":"warning","message":{"text":"walker.main (cyclomatic 26): walker.main has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/walker.py"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cea26e956ceea4a41266f0145070ae0153e673dddfbb789d0f083edae4ea837"}},{"ruleId":"D1","level":"warning","message":{"text":"tenants.cmd_cell (cyclomatic 25): tenants.cmd_cell has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/tenants.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"706678623ea8221eaa25c0318f968b1fc6ec19381c6e0ce29bc7a048e9efee93"}},{"ruleId":"D1","level":"warning","message":{"text":"verify.main (cyclomatic 24): verify.main 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/verify.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e261737e248c815ff3f93a14610620f805da5718c478caa1a0e4f216ebd978c"}},{"ruleId":"D1","level":"warning","message":{"text":"ablate.summarize (cyclomatic 23): ablate.summarize has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-minimize/ablate.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a6d36079368162399399fec0fcb7ae6a0cfde03ab0e75bb9f40220f5a40093"}},{"ruleId":"D1","level":"warning","message":{"text":"StripedBuffer.expandOrRetry (cyclomatic 22): StripedBuffer.expandOrRetry has cyclomatic complexity 22 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/StripedBuffer.java"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78d4ba497930fb3e87496c5518297cca494eeca3d3b189e00d58fbc532b6e98"}},{"ruleId":"D1","level":"warning","message":{"text":"corner.main (cyclomatic 22): corner.main has cyclomatic complexity 22 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/corner.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1e3f84cc3a54c1f557bdafdb87bc0c111b1254df97ad31965d5b15336b3e99"}},{"ruleId":"D1","level":"warning","message":{"text":"BoundedLocalCache.evictFromMain (cyclomatic 21): BoundedLocalCache.evictFromMain 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"1375032ce11cd7f4010dd22c3216b35ff899b5aaf60bab9e50b1f175f807351c"}},{"ruleId":"D1","level":"warning","message":{"text":"recover-agent.main (cyclomatic 21): recover-agent.main 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/hooks/recover-agent.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b251be6f07232b649604c9d8ee035853bec67794c0c97da1ed79104ca274a2f3"}},{"ruleId":"D1","level":"warning","message":{"text":"regret.main (cyclomatic 21): regret.main has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/regret.py"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92e188c8162a04b34cb9225a6062c28c7b5250247648c3fefa497a70899272d"}},{"ruleId":"D1","level":"warning","message":{"text":"ablate.main (cyclomatic 21): ablate.main 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-minimize/ablate.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"679eaf8bb87677b2bc0220eadf40e2f292d1e3e92c9e2620f06570a264a36412"}},{"ruleId":"D1","level":"warning","message":{"text":"startwin.cell_rows (cyclomatic 20): startwin.cell_rows 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/startwin.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9241595f2c13a749fe24da5aa7348bda568df4886cacd2bd4039e11fd6700445"}},{"ruleId":"D1","level":"warning","message":{"text":"BoundedLocalCache.doComputeIfAbsent (cyclomatic 19): BoundedLocalCache.doComputeIfAbsent has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":2899}}}],"partialFingerprints":{"codehealthFindingId/v1":"58901429004f40b9f32e0558ccfc79312ee7d9cfa4d76aca4eed33a1d5fe7918"}},{"ruleId":"D1","level":"warning","message":{"text":"regret.group (cyclomatic 18): regret.group has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/regret.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"1516b4d7cc5b698e9488f89341881765a44104d054040fbf11e9d4af399434c0"}},{"ruleId":"D1","level":"warning","message":{"text":"a1_tenant.main (cyclomatic 18): a1_tenant.main has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/a1_tenant.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba947e4f0ba471c180593b8f7b5cd0b60684bdf9f4c0d6b24d6e6bc2b5230de"}},{"ruleId":"D1","level":"warning","message":{"text":"regret.anchors (cyclomatic 17): regret.anchors has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/regret.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b4d9645b6e91eb5aca513827f6e821e29d6c6aaf808b21a09731b6fd3c71da"}},{"ruleId":"D1","level":"warning","message":{"text":"search.cmd_shrink (cyclomatic 17): search.cmd_shrink has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/search.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fb46d9cc6670753603eaf840a9fbc686c9512c38029a50f56c583c75c86bb5"}},{"ruleId":"D1","level":"warning","message":{"text":"sweep.main (cyclomatic 17): sweep.main has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/sweep.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce5b3df63d0e01a206e53f22f17e2dfa80f6149d81c9526883bd3b2984d7db2"}},{"ruleId":"D1","level":"warning","message":{"text":"adaptive-window.html.chapters.forEach() (cyclomatic 17): adaptive-window.html.chapters.forEach() has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 7880). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wiki/adaptive-window.html"},"region":{"startLine":7871}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd8cf32d846a77198100645e7bbbd53146147381b6be4c3973561940da8918a"}},{"ruleId":"D1","level":"warning","message":{"text":"BoundedLocalCache.replace (cyclomatic 16): BoundedLocalCache.replace has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":2789}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc5f08c83c9da87dc83322d3bf8731e7b6154f7758710cb1f265074faadfe44"}},{"ruleId":"D1","level":"warning","message":{"text":"LoadingCacheView.tryComputeRefresh (cyclomatic 16): LoadingCacheView.tryComputeRefresh has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncLoadingCache.java"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"b333a6e294fefce19e2db6b7b9e60c6574cb55fdc30813c59a30332e9f1c0cb6"}},{"ruleId":"D1","level":"warning","message":{"text":"DensityClimber.route (cyclomatic 16): DensityClimber.route has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/WindowClimber.java"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"761292bf1cb1b78a409107a7fce62ad3f882060fb40d24605c9bdef8968aa51d"}},{"ruleId":"D1","level":"warning","message":{"text":"CacheProxy.putAll (cyclomatic 16): CacheProxy.putAll 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c9905b5e8e339c9e6811f1a898348ef0dd82abd0e2ecaf56a891a1f5e30e72"}},{"ruleId":"D1","level":"warning","message":{"text":"regret.report_arm (cyclomatic 16): regret.report_arm has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/regret.py"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"067221ea9f517dfbebefc7b402582ae42411741e23e5b4725fccb356274fb8eb"}},{"ruleId":"D1","level":"warning","message":{"text":"search.reductions (cyclomatic 16): search.reductions 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/search.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1251251362e1b881e440f80d975349fae0860c292a5e9988a813defe2453365a"}},{"ruleId":"D1","level":"warning","message":{"text":"walker.apply_invariants (cyclomatic 16): walker.apply_invariants 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/walker.py"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9421bdc923ab22356aef6344dcb254fa1b2cbc14b5bffa9976cef278a464ea"}},{"ruleId":"D1","level":"warning","message":{"text":"blindlock.analyze (cyclomatic 16): blindlock.analyze 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/blindlock.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9a6b28acc794d243cd2edc0bff4d0dff846b08bcf357e6338d7e4ee7c18001"}},{"ruleId":"D1","level":"warning","message":{"text":"lcs2lirs.main (cyclomatic 16): lcs2lirs.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/lcs2lirs.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97888bd0a83b465e731e95cd4c61101c56e10b7200a2622ba548fb4d539223e"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedLocalCache.remap (cognitive 75): BoundedLocalCache.remap has cognitive complexity 75 (threshold 15). Drivers by points: if/else 34 (53 pts), boolean chains 13, ternaries 3 (8 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3075}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da9378358e9af58c3c6443cc1d112480550e2449e312fa6a80624bf109add6e"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedLocalCache.put (cognitive 69): BoundedLocalCache.put has cognitive complexity 69 (threshold 15). Drivers by points: if/else 23 (48 pts), ternaries 5 (12 pts), boolean chains 8, loops 1 (nesting depth added 32). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d53f1340943bcf57560594af2d6d24534b3d4937312686c5c9d819ad030ae18"}},{"ruleId":"D2","level":"warning","message":{"text":"regret.analyze (cognitive 59): regret.analyze has cognitive complexity 59 (threshold 15). Drivers by points: if/else 20 (32 pts), ternaries 12 (15 pts), loops 7, boolean chains 5 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/regret.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"333e4f851283d3a010b3c53af3a653ea5a3795dc4672fcb695afca9039da8183"}},{"ruleId":"D2","level":"warning","message":{"text":"walker.extract_balanced_json (cognitive 58): walker.extract_balanced_json has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (42 pts), loops 4 (6 pts), error handling 2 (5 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 35). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/walker.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a13963314c074d918423c254b65ed3f6be9176861f81e4cc023beddb89e910"}},{"ruleId":"D2","level":"warning","message":{"text":"regret.hints (cognitive 54): regret.hints has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 12, ternaries 4 (9 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/regret.py"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f9f63fe329961326a8c75d6405afe4d7ce3e4e38ee4d2a60fa9f1146807b49"}},{"ruleId":"D2","level":"warning","message":{"text":"verify.extract_balanced_json (cognitive 54): verify.extract_balanced_json has cognitive complexity 54 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 4 (6 pts), error handling 2 (5 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 32). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/verify.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9985560a2c21050e4c8947d95d7476769bacfe5917ac6587148e392baa4f45"}},{"ruleId":"D2","level":"warning","message":{"text":"census.do_parse (cognitive 54): census.do_parse has cognitive complexity 54 (threshold 15). Drivers by points: ternaries 9 (27 pts), if/else 5 (10 pts), loops 4 (9 pts), boolean chains 8 (nesting depth added 28). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/census.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd6e796baa8e495512667f5c744a54a494bb86e7a2c25824df43035a7ef090a"}},{"ruleId":"D2","level":"warning","message":{"text":"startwin.cell_rows (cognitive 48): startwin.cell_rows has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 8 (23 pts), if/else 5 (16 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/startwin.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"027faf05345defc923d71356d5f2ee4498e3f6ff20aed9df3378b696206f5ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"corner.main (cognitive 46): corner.main has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 7 (21 pts), if/else 5 (12 pts), loops 4 (8 pts), boolean chains 5 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/corner.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85f0557496af2341aee2fb4156e8ed7affda4ed60ea8a09eebc92811891af27"}},{"ruleId":"D2","level":"warning","message":{"text":"tenants.cmd_cell (cognitive 43): tenants.cmd_cell has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 7 (14 pts), boolean chains 5, loops 3 (5 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/tenants.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"342104d98c3ee394e860e34102a2ea47827eae7db01722f482145e3f7f4c0bd2"}},{"ruleId":"D2","level":"warning","message":{"text":"StripedBuffer.expandOrRetry (cognitive 42): StripedBuffer.expandOrRetry has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (35 pts), boolean chains 6, loops 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/StripedBuffer.java"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b2eefc7b42a6055ded783d5b50a7062dd55101095d14fbedcc74744937ab4a"}},{"ruleId":"D2","level":"warning","message":{"text":"walker.main (cognitive 42): walker.main has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (28 pts), ternaries 4 (8 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/walker.py"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a5af83713b25a1c7d9215d7dfbb79749c637812b263f5746690c10ade4ecf6"}},{"ruleId":"D2","level":"warning","message":{"text":"a1_tenant.main (cognitive 36): a1_tenant.main has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (20 pts), ternaries 3 (6 pts), boolean chains 5, loops 2 (5 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/a1_tenant.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e8fc25edc7cf5985e25449e6e1b89beb07b06dbf821646bfca38af85795acc"}},{"ruleId":"D2","level":"warning","message":{"text":"verify.main (cognitive 35): verify.main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 4, error handling 1 (3 pts), loops 2 (3 pts), ternaries 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/verify.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f02bcff5f0c050f02df3c0b1674884997c2845e2a1f79582a91a6b985fefe7f"}},{"ruleId":"D2","level":"warning","message":{"text":"ablate.main (cognitive 34): ablate.main has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 6 (11 pts), ternaries 5 (8 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-minimize/ablate.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"277be520febb12e029361c1cb10142c1e03648969847c5dc682382e192016607"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedLocalCache.refreshIfNeeded (cognitive 33): BoundedLocalCache.refreshIfNeeded has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 8, error handling 2 (3 pts), ternaries 3 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"2028073cabae0323c5a32c0c95771269f175900e3947aa8433d9fe2bee74cadb"}},{"ruleId":"D2","level":"warning","message":{"text":"workload.generate (cognitive 33): workload.generate has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 7 (15 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/workload.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7344e40aa28a42518061a120b1d636aa8572301e016e9a58e7c4be9324d740b"}},{"ruleId":"D2","level":"warning","message":{"text":"ablate.summarize (cognitive 33): ablate.summarize has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (21 pts), ternaries 3 (5 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 13). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-minimize/ablate.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1867502063994ecffe6500279d462ade9804e279f41866cf73cc1d0c931f0c7d"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedLocalCache.evictFromMain (cognitive 32): BoundedLocalCache.evictFromMain has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ead174294dc026b5a913bb652c085ab6f7096f72cd502d5f3f853d2f90ff3b"}},{"ruleId":"D2","level":"warning","message":{"text":"lcs2lirs.main (cognitive 32): lcs2lirs.main has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (23 pts), ternaries 1 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/lcs2lirs.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e863060472d49031cdf442a35df3a20fb4fcbfa9a6b30464120ca9b7bc034f"}},{"ruleId":"D2","level":"warning","message":{"text":"AddTask.run (cognitive 30): AddTask.run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (25 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":2030}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3b30064f3b07177b6706fa45fe16fa3ec79b824aaa0f8c245eefc5c99a0be0"}},{"ruleId":"D2","level":"warning","message":{"text":"FeedbackWindowTinyLfuPolicy.adapt (cognitive 30): FeedbackWindowTinyLfuPolicy.adapt has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackWindowTinyLfuPolicy.java"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"852c69130e317424b7b76e74965ce9ae15e02758de957ab225a0bc07b819fc80"}},{"ruleId":"D2","level":"warning","message":{"text":"recover-agent.main (cognitive 30): recover-agent.main has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4 (8 pts), boolean chains 4, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/hooks/recover-agent.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8845726478e590ff9802c922f5b2d404a2f7c1616d2d7b6a34dbcf5c38ad62"}},{"ruleId":"D2","level":"warning","message":{"text":"repeat.main (cognitive 30): repeat.main has cognitive complexity 30 (threshold 15). Drivers by points: if/else 4 (17 pts), loops 4 (10 pts), ternaries 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/repeat.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"14323e40253fed505bbea0b63790957c6b7ef845dfe537aaf4169fbf77529960"}},{"ruleId":"D2","level":"warning","message":{"text":"descent.main (cognitive 28): descent.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (14 pts), ternaries 2 (8 pts), loops 3 (6 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/descent.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c874223a204975485a1618bbce4ce5cbcfdeedec4214e6c7d286849c4ee3155b"}},{"ruleId":"D2","level":"warning","message":{"text":"gen_adv.gen_shieldtrap (cognitive 28): gen_adv.gen_shieldtrap has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 4 (10 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen_adv.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d22fe274fa18aae84e3dbf512b3525812cbef7e4373f838c40ca641884d70c"}},{"ruleId":"D2","level":"warning","message":{"text":"kvcache.main (cognitive 28): kvcache.main has cognitive complexity 28 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 5 (11 pts), ternaries 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/kvcache.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdab986a37ec58a6fa085d20015a45a2b155b1efaf2c58a6a663a801e362027"}},{"ruleId":"D2","level":"warning","message":{"text":"search.cmd_shrink (cognitive 27): search.cmd_shrink has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 5 (12 pts), if/else 4 (7 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/search.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ea75036e3d8309dbd283d40ddec2c6bafd3ec398e3398569b246a16f17894a"}},{"ruleId":"D2","level":"warning","message":{"text":"probe.main (cognitive 27): probe.main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 5 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/probe.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18ad938476092eb7f8f2d546390d5768c7ed4fb3420a70f2c1965275f845120"}},{"ruleId":"D2","level":"warning","message":{"text":"sweep.main (cognitive 27): sweep.main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 3 (8 pts), loops 2 (3 pts), boolean chains 2, error handling 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/sweep.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"849f0347acd4485fa7ef861ab0e711546647b0838255a469daf8c9ac9338fc18"}},{"ruleId":"D2","level":"warning","message":{"text":"search.reductions (cognitive 26): search.reductions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/search.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cbc9b11f27c3883b041572256467215627760333ea2598d431043a91c43e00"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedLocalCache.doComputeIfAbsent (cognitive 25): BoundedLocalCache.doComputeIfAbsent has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 4, ternaries 1 (2 pts), error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":2899}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d4c0f3bb652d571bd5360fa734d502a07ba669b0bef5439f427277ab68d0d4"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateTask.run (cognitive 25): UpdateTask.run has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (25 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":2118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7542caca0f7a76b3f07fe68b47986fd8cb73d4c9ff732d9ac2686e73738aa8d2"}},{"ruleId":"D2","level":"warning","message":{"text":"regret.fmt_row (cognitive 25): regret.fmt_row has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/regret.py"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96be8c1551addded46b296a37884547deba976b3e6a2c7e5f7541013a771606"}},{"ruleId":"D2","level":"warning","message":{"text":"run.main (cognitive 25): run.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (9 pts), boolean chains 2, loops 2, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/run.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f584cc97dc4e83dd5ffe8bb9d99dc5ecef7266ae22146a3739f1403bbe3fb4"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeFactory.getClassName (cognitive 24): NodeFactory.getClassName has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/NodeFactory.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e7745db85903af4bc74c46cb450ebb8426fd3c5e1b30a49665310d3ffa1b4b"}},{"ruleId":"D2","level":"warning","message":{"text":"regret.anchors (cognitive 24): regret.anchors has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/regret.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7458df621670725da92c501238aac8bd167d1cfc3d0f1333d752ab9aee72169f"}},{"ruleId":"D2","level":"warning","message":{"text":"regret.main (cognitive 24): regret.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 7, ternaries 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/regret.py"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b23ea6193de914d2e7f0ccb35a1f242c35ae5258bdd2042f1dc97eb47d99851"}},{"ruleId":"D2","level":"warning","message":{"text":"CacheProxy.putAll (cognitive 22): CacheProxy.putAll has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 3 (5 pts), loops 3 (4 pts), boolean chains 2, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"51babc1afdbc9b3c0df0a18ccc56e1ad03090db766ce9252b75315a9421702a6"}},{"ruleId":"D2","level":"warning","message":{"text":"ClockProPlusPolicy.runHandCold (cognitive 22): ClockProPlusPolicy.runHandCold has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d527beac86eaed8ef097df4a982f1a7d53251286749434d4c8a10ad5e157b76b"}},{"ruleId":"D2","level":"warning","message":{"text":"blindlock.analyze (cognitive 22): blindlock.analyze has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, ternaries 2 (3 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/blindlock.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0e490b7e57e5f0d03f69f49b3664131572014354b99a7dc0dfb45e560e41b8"}},{"ruleId":"D2","level":"warning","message":{"text":"byworkload.read_inputs (cognitive 22): byworkload.read_inputs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/byworkload.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace1408de6ac655e9882f6736d9c6949ecf1b99357fe6b0ed7941e06d247ec3c"}},{"ruleId":"D2","level":"warning","message":{"text":"gate.main (cognitive 22): gate.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (8 pts), ternaries 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gate.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"14405bcbc8885645203ae57e64a311cdc92f16450755072fe9a21d24d12d2654"}},{"ruleId":"D2","level":"warning","message":{"text":"gen_jam.main (cognitive 22): gen_jam.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (7 pts), loops 4 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen_jam.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc588e5b86c7ca305a318e4ad5dbd480d487123730b2c36a7949fde883d7a38"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowTinyLfuPolicy.evictFromMain (cognitive 21): WindowTinyLfuPolicy.evictFromMain has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/WindowTinyLfuPolicy.java"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e6e7f9a425b7133729a2e4d8d32b871d1df5fb321fa4beca91dc7242399365"}},{"ruleId":"D2","level":"warning","message":{"text":"floors.main (cognitive 21): floors.main has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (8 pts), ternaries 3 (7 pts), if/else 2 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/floors.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"683ae1141cb6706806140c53b1aa4b7d2f8d06beedfd752ff5204ec70cb1c475"}},{"ruleId":"D2","level":"warning","message":{"text":"harness.run (cognitive 21): harness.run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts), ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/harness.py"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a9f0258f9aa44a726ce86c0432e90a369ef8c9fc6c59641ee81de9a277458f"}},{"ruleId":"D2","level":"warning","message":{"text":"real.main (cognitive 21): real.main has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (8 pts), ternaries 3 (7 pts), if/else 2 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/real.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f96ac5408c2fee2313b78f93df648d255121e581e58d7c6bcf6f401a685da7"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedVarExpiration.putIfAbsentAsync (cognitive 20): BoundedVarExpiration.putIfAbsentAsync has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4746}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f7179a73189d95880bd10fdcab4f447e921499b689aeb23980c6f010741b48"}},{"ruleId":"D2","level":"warning","message":{"text":"AsMapView.putIfAbsent (cognitive 20): AsMapView.putIfAbsent has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df515029c0637f02e9901feb8613e24f4c3ea87e9fe0b1e9359bf0e43dcfcfb"}},{"ruleId":"D2","level":"warning","message":{"text":"regret.report_arm (cognitive 20): regret.report_arm has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 7 (9 pts), if/else 5 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/regret.py"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"1201e201f3c827b2824fcde2459ac6ee05e6261c3c90226e233ee0722ec591fc"}},{"ruleId":"D2","level":"warning","message":{"text":"search.cmd_pair (cognitive 20): search.cmd_pair has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4, ternaries 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/search.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f00d060891d2de9ac11ccdf5da027a4066837e284d21762e7ca7a87b1848a85"}},{"ruleId":"D2","level":"warning","message":{"text":"tenants.cmd_dedicated (cognitive 20): tenants.cmd_dedicated has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/tenants.py"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"a694e0e2c8ff0a7a8447fef9cc738ee19ed4a4f9f62ac4d695913eb7adc0f738"}},{"ruleId":"D2","level":"warning","message":{"text":"run.main (cognitive 20): run.main has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 6, loops 3 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/run.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"92798bc25bfec47205268d8f32de5a69630d5df66ae2df21d83f025427a4883b"}},{"ruleId":"D2","level":"warning","message":{"text":"walker.apply_invariants (cognitive 20): walker.apply_invariants has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 7, loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/walker.py"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6a4843d8e1712006d13e81d93d8660700dd3f62e3bbbd5fa6d25c666a3dbb3"}},{"ruleId":"D2","level":"warning","message":{"text":"gen_h4c1.main (cognitive 20): gen_h4c1.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (5 pts), ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen_h4c1.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a749264e8c3bd6e658b7561d2c5e22c33d7706b0a7e318e04aa76c094e7c452"}},{"ruleId":"D2","level":"warning","message":{"text":"LoadingCacheView.tryComputeRefresh (cognitive 19): LoadingCacheView.tryComputeRefresh has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 3 (5 pts), boolean chains 3, error handling 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncLoadingCache.java"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0262e8dbd81901a68e9f5d4ff76a19d7c2ed432d0db0b02f495791f8c8664d24"}},{"ruleId":"D2","level":"warning","message":{"text":"DensityClimber.route (cognitive 19): DensityClimber.route has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 2 (5 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/WindowClimber.java"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b19b409c7bf1b40db6399ff2d15e172b0c6cd86409c2156ab1ae0de30bd181"}},{"ruleId":"D2","level":"warning","message":{"text":"regret.evaluate_cell (cognitive 19): regret.evaluate_cell has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (9 pts), if/else 5 (8 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/regret.py"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"79062a0b066d9bd4cd2417b88d3ecb844651a3a2e849ab6092719a459db8a944"}},{"ruleId":"D2","level":"warning","message":{"text":"marginal.main (cognitive 19): marginal.main has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 3 (6 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/marginal.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9424fd914c64a97de32c2afe2d60f2a05036219514e3b006ea4871d8c88157"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedLocalCache.expireAfterWriteEntries (cognitive 18): BoundedLocalCache.expireAfterWriteEntries has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"da497424706415f46dcab60938acfd94e7ae6cea54ee5967ca1a68d90f9d4e2e"}},{"ruleId":"D2","level":"warning","message":{"text":"AsMapView.computeIfAbsent (cognitive 18): AsMapView.computeIfAbsent has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0ffdc590beee02050e3e0a28bc9b79a7401799d203fdf0d5bb9fb6c82edff0"}},{"ruleId":"D2","level":"warning","message":{"text":"CacheProxy.get (cognitive 18): CacheProxy.get has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f68068ab8653e2753ebc9f29fee1f91c4a64eaaf613b57fbab61585b0c382a"}},{"ruleId":"D2","level":"warning","message":{"text":"tenants.anchor_sweep (cognitive 18): tenants.anchor_sweep has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (5 pts), loops 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/tenants.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"198ef6c84106c23aab23b9a883aa06a5b7900b0dffa9c9b6d632d80312649e6c"}},{"ruleId":"D2","level":"warning","message":{"text":"run.aggregate (cognitive 18): run.aggregate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 3 (6 pts), loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/run.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"107cf7d8a12541020d139a4c623b1eba8fa692b734264ccb38aa239a37b63595"}},{"ruleId":"D2","level":"warning","message":{"text":"walker.apply_response (cognitive 18): walker.apply_response has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/walker.py"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"715194a6af66dd837d5b050ac01c8c0bf72afc3dabe79febcb7745ba6ad5efb5"}},{"ruleId":"D2","level":"warning","message":{"text":"gen.gen_phases (cognitive 18): gen.gen_phases has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 2 (3 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"241a70927596cf3602f0d10de39e8aaace2c5908dc60bf7755ecbc0f6796f1f5"}},{"ruleId":"D2","level":"warning","message":{"text":"gen.gen_widepin (cognitive 18): gen.gen_widepin has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 2 (3 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"097021b21d37444ae77c20e2133beb632af4e2c21fbf3258c11e7cc69b6564d2"}},{"ruleId":"D2","level":"warning","message":{"text":"pair.read_pairs (cognitive 18): pair.read_pairs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/pair.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"132f0a97bdae485732c4ec780596202cfae231272b175bef7b5d2a17827c3608"}},{"ruleId":"D2","level":"warning","message":{"text":"adaptive-window.html.spy (cognitive 18): adaptive-window.html.spy has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wiki/adaptive-window.html"},"region":{"startLine":8047}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce562ad215c8446e4f818b534701eab85e59c0f225f209a2e6540a850bd53d7"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedLocalCache.replace (cognitive 17): BoundedLocalCache.replace has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":2789}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae70d2480f4ee6af6716771b7bc7ae2a1c74f27a38d6d6ca386acfc91d1d9f90"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalAsyncCache.handleCompletion (cognitive 17): LocalAsyncCache.handleCompletion has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabcb6684faada7c2fe6283d85018b66c13f36d0ff2a745640469d495b22ad6b"}},{"ruleId":"D2","level":"warning","message":{"text":"CacheProxy.removeAll (cognitive 17): CacheProxy.removeAll has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), error handling 3 (5 pts), boolean chains 3, loops 1, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd17db2f9754983b0c891124d2dc86e6046879ddb4b269121fd76519257213f"}},{"ruleId":"D2","level":"warning","message":{"text":"HillClimberFrdPolicy.adapt (cognitive 17): HillClimberFrdPolicy.adapt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b872fa86b0ce757ed8b8f1ecec4e94a854ea16fb5367edabb48ca7ec88b25607"}},{"ruleId":"D2","level":"warning","message":{"text":"Simulator.throwError (cognitive 17): Simulator.throwError has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), error handling 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/Simulator.java"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7462d51af215e4b3a6a3573843f474c4fe2352b9267aaf1befc3543cf94a5ac"}},{"ruleId":"D2","level":"warning","message":{"text":"regret.group (cognitive 17): regret.group has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17. To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/regret.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d193a1c3f649941e7ae93dd086abeee9c410470914d45a86312ee8c4427869"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedLocalCache.evictEntry (cognitive 16): BoundedLocalCache.evictEntry has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f43c3e114e4ac7cf9269d8ac9e3c5c6a4d2b16a940cf88f1a1564158a26f1c"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedLocalCache.expireAfterAccessEntries (cognitive 16): BoundedLocalCache.expireAfterAccessEntries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"a542f62b907ed7e7e15bb26a53b43282ec556efc5783e05ad9d69a24ffc69b00"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedLocalCache.onAccess (cognitive 16): BoundedLocalCache.onAccess has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c50372e0b8af25a0a0702e25128caa3494c1e793f6e0c2444dc08f1fceda381"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedLocalCache.toString (cognitive 16): BoundedLocalCache.toString has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3359}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef7e3773dfc78f83300d220f841468ab9ddac9f70c89eddd7a40d40fec72d29"}},{"ruleId":"D2","level":"warning","message":{"text":"LoadingCacheProxy.getOrLoad (cognitive 16): LoadingCacheProxy.getOrLoad has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (5 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/LoadingCacheProxy.java"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ea80717c99c38e46ad49485ec7924c2390469e9baffd1523c6e9de4e24e86a"}},{"ruleId":"D2","level":"warning","message":{"text":"CacheusPolicy.updateLearningRate (cognitive 16): CacheusPolicy.updateLearningRate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CacheusPolicy.java"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4cc3639fe4536de59804b4d6c9b0242b082e3762ce5a60bba6e9831f3948a0"}},{"ruleId":"D2","level":"warning","message":{"text":"verify.grep_keywords (cognitive 16): verify.grep_keywords has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (4 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/verify.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8631a6384bfc9c8726aac9ddba2d2b74a654b17cf0f131781231a25be6a83f7c"}},{"ruleId":"D2","level":"warning","message":{"text":"gen_adv.gen_regimeramp (cognitive 16): gen_adv.gen_regimeramp has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen_adv.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4591fdba6e93f9596af416985ccf688fbd267e1a7d08a51006fae77065d15a"}},{"ruleId":"D2","level":"warning","message":{"text":"gen_straddle.build (cognitive 16): gen_straddle.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen_straddle.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a594de117ed4b06ab6d298ac2e33c7631c4cf82af3b6a9bdf03cef17b99ed6"}},{"ruleId":"D2","level":"warning","message":{"text":"adaptive-window.html.chapters.forEach() (cognitive 16): adaptive-window.html.chapters.forEach() has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 3, loops 3, ternaries 1 (2 pts) (nesting depth added 4). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 7880). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wiki/adaptive-window.html"},"region":{"startLine":7871}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7aa64d6b1678f9d905887cebaccbe3a5fa607a56789ca4bf2111787e31dd77"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BoundedLocalCache: ClassTooLong \u2014 3094 significant lines (blank, comment-only and punctuation-only lines excluded), 154 methods. The bar is 400 significant lines; this is 2694 over it, 7.74\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"168239246eaa029074070e6472d6ed4f1529ebb21b7a6dce8439091b007bf8fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cache/BoundedLocalCache.java: FileTooLong \u2014 3222 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: BoundedLocalCache (111-5076). The bar is 500 significant lines; this is 2722 over it, 6.44\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ef2fbce90409e40410c8f774ece6c57c1053ba63da0f588b4cafd4615a0833"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BoundedLocalCache: TooManyMethods \u2014 154 methods. The bar is 30 methods; this is 124 over it, 5.13\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e041cb7e5cfa887da73d58f1d4f38cf83ef52c3b92d8327c52520770839081"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LocalAsyncCache: ClassTooLong \u2014 1186 significant lines (blank, comment-only and punctuation-only lines excluded), 12 methods. The bar is 400 significant lines; this is 786 over it, 2.97\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4fdf51e4ba2556184cbccb1c013534ebd0e6028382001daa886cbc2ce2de59"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CacheProxy: ClassTooLong \u2014 1029 significant lines (blank, comment-only and punctuation-only lines excluded), 64 methods. The bar is 400 significant lines; this is 629 over it, 2.57\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1dd7698ce0be480ae936cb362053ec0308caa6bcbc9ef5aa1b7fa0e5a7a920"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cache/LocalAsyncCache.java: FileTooLong \u2014 1227 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: LocalAsyncCache (68-1854). The bar is 500 significant lines; this is 727 over it, 2.45\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2f4bd718991cc2ce452c2c8fafba41cd61ea9a7fe0a0b6666cbba6db61680a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Caffeine: TooManyMethods \u2014 71 methods. The bar is 30 methods; this is 41 over it, 2.37\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/Caffeine.java"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde044274a54a81021ab4d5cae1f2033e81e358b098e0af877b7a65889257aa5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UnboundedLocalCache: ClassTooLong \u2014 896 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods. The bar is 400 significant lines; this is 496 over it, 2.24\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91416f4e834b039b6674597749661dee525d24978f8dcd3bbb2a55f91b0d67f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jcache/CacheProxy.java: FileTooLong \u2014 1091 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: CacheProxy (89-1603). The bar is 500 significant lines; this is 591 over it, 2.18\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c349be16be67d14eb00a56b266585733e4779588deebd4f85b5659a3ae9dc416"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CacheProxy: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.13\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c27580791940bbe5941c0ae0fc2ba48d9c6a0a3191dba093acfc2e9784479f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cache/UnboundedLocalCache.java: FileTooLong \u2014 934 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: UnboundedLocalCache (65-1459). The bar is 500 significant lines; this is 434 over it, 1.87\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f34333ea04a6b62c4c421dc255f84121cc89d4df15ba654155c22f3494c792"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WindowClimber: ClassTooLong \u2014 737 significant lines (blank, comment-only and punctuation-only lines excluded), 9 methods. The bar is 400 significant lines; this is 337 over it, 1.84\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/WindowClimber.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"05578cd27951b2cc01210290dcdc4ce20b16d4d95c4c1836c3dab7c53605e761"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CaffeineConfiguration: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/configuration/CaffeineConfiguration.java"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5c3dcc84a0768420c88a79e76848d9d362cbf5cf8127bede70b9d2f693f388"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PolicyStats: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/PolicyStats.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a1f8a2b61be02f4aeea14f84f8b503f497bf57c9e3ba30bcd36c8dc9d6ed38"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Node: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/Node.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9090f89945a82e823c804e7b94acb89132f2b1b6084fe27fe94e391bd223024e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UnboundedLocalCache: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47830fb616ba2218699d0372f301baef406ce5ff7b1c5a421103b0ae655a3be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cache/WindowClimber.java: FileTooLong \u2014 742 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: WindowClimber (31-1571). The bar is 500 significant lines; this is 242 over it, 1.48\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/WindowClimber.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a21c0745c8fa065819670bde22a2c5f7040c9d4e20f92f82e6ea2135d2f03b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AbstractLinkedDeque: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/AbstractLinkedDeque.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbdd251ef09b19c43d004f087d6e16a2aecbcee6c25541920f8628dedd4980c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: audit-regret/regret.py: FileTooLong \u2014 613 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 113 over it, 1.23\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/regret.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7290498de1a09ebc293c338485507b5273d4306a9540d703c415c3f296b1b8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BoundedLocalCache.remap: MethodTooLong \u2014 remap runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3075}}}],"partialFingerprints":{"codehealthFindingId/v1":"0349ba80fcc7833eed322e0beac71c66fcf3443ac2f64f6527e5fb701fb0914c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BaseMpscLinkedArrayQueue: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/MpscGrowableArrayQueue.java"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a627e2220e7745f1fc1117e7b658b2d462c1f667f6f9ab391222fca75aef09c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: audit-temporal-walk/walker.py: FileTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 83 over it, 1.17\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/walker.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d5cea8d4e404ffecff238053c6368f0fbd59f5843ebc7b9829f5c78cb2f886"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DensityClimber: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/WindowClimber.java"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39aabcc208c83203d59da53b40063d6b4ce2e0eaf04352c837fa84148f166e6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Caffeine: ClassTooLong \u2014 408 significant lines (blank, comment-only and punctuation-only lines excluded), 71 methods. The bar is 400 significant lines; this is 8 over it, 1.02\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/Caffeine.java"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3faa4e61f5a2ec603a9e38f8cc232b530d5ae9d002088d4d0ced471d954cb6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BoundedLocalCache.put: MethodTooLong \u2014 put runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"49529f5b99445ac9245ddbab9fe5e45495b621eab7006c0c13cdb7f23862e5a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3796-3810 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3813-3834 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4002-4016 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4019-4040 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4284-4298 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4301-4322 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3796}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ac6bbeac9f6218d5f6430553d5b76c7cda7301eac80d28f3f2a057d0c9b577"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): .claude/skills/climber-gate/gen.py:35-53 | .claude/skills/climber-gate/gen2.py:42-60 | .claude/skills/climber-gate/gen_adv.py:32-49 | .claude/skills/climber-gate/gen_blindlock.py:38-55 | .claude/skills/climber-gate/gen_straddle.py:39-56 | .claude/skills/climber-gate/mixnoise.py:27-45 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae8214f28f20b7ea15332741ef4584b4eb539c219849d01f9bfd4c1575cd223"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4588-4606 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4633-4651 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4681-4699 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4894-4912 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4588}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81a1564248a34af3f918f5150c7e1fcab76400f71532f7987831efc77cd5a7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:2734-2785 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:2790-2853 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":2734}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f9a69d5a123f86dcc0e553a2cf607c7e7e866bdadeb99d7e4125b61027a420"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (75 corresponding lines): .claude/skills/audit-temporal-walk/verify.py:73-147 | .claude/skills/audit-temporal-walk/walker.py:74-161 \u2014 These two members are one piece of code written twice and then edited apart: 75 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/verify.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a39f2a0fee0218c286d3bc3cefb0d14de931ec14d677c2263ff7ad3563038d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (77 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java:99-175 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CartPolicy.java:102-208 \u2014 These two members are one piece of code written twice and then edited apart: 77 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0f87b9c32c9f860521235ca600310e71f051c8c425e32897f9fe8c36cd9a1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java:655-701 | jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java:728-783 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1b96f4cbf704c75912a46936553297dd99b03b7d2b01920eb5cb1bf9fdc8fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:2640-2682 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:2686-2730 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"2814380200c6d2e40d5b1d3e824d240325c410d49dae068217e38057804036e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4746-4795 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:924-970 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4746}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a65c55aecf2c94b5fee7f7d18b3a6bb5e35fe26893f131e46190c11b895ffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4821-4853 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1147-1182 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4821}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b0bea122160bd5a031f8ee648f146a78ef6df1a95c3b8e8f15bb8f93bcf9ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): .claude/skills/climber-gate/gen_adv.py:180-215 | .claude/skills/climber-gate/gen_adv.py:222-275 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen_adv.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92829ef3514db9bf9b64933c4bd47eed439f64740f756208cfc92683bd53a59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:524-566 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:463-500 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"e142466304c905ccd31ec0fd50ebc6d9d8e6b47a10a0336ebbead664b106c238"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): .claude/skills/climber-gate/gen_adv.py:127-162 | .claude/skills/climber-gate/gen_adv.py:282-317 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen_adv.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e27af257f096befaa900c7fd926bc3c41bd06f4c5730dafdc719056a47e89e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalCacheFactory.java:64-100 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/NodeFactory.java:92-135 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalCacheFactory.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"401db589e36fea6148fa9da8c4f2d35ac8ab0430fc87c4a64fda757c798a8a20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): .claude/skills/audit-temporal-walk/verify.py:318-341 | .claude/skills/audit-temporal-walk/walker.py:464-491 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/verify.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"4442ada17429836d2f39f9aa34c29300a2d47b9ed288be1b880a61e714cad9aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:749-773 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalLoadingCache.java:73-100 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2b74a3ebdc829f5cd33268f1ca5b709282e2f92429fde89e1586239e1c0e7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/ArcPolicy.java:227-236 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java:245-252 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CartPolicy.java:311-318 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/ArcPolicy.java"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfdf068312b5351602a04f001b98b9d9b6d8291c49454893c1cac0dfd7ab0cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:127-143 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:109-125 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a8d61d080c67cb085c03267766da5191350faf539db909e0c821f82f2ede66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:284-337 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:263-302 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f97d8f5343c35ec1d96245138b18de6bc46bb5ca01f21827313bc5d45a8c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/HillClimberWindowTinyLfuPolicy.java:228-257 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/HillClimberWindowTinyLfuPolicy.java:259-286 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/HillClimberWindowTinyLfuPolicy.java"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"63850d306e0b43579fe5a8f38d6662f07cc80e0ec31a8970e5fe465028a08080"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java:1507-1526 | jcache/src/main/java/com/github/benmanes/caffeine/jcache/integration/JCacheLoaderAdapter.java:208-226 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"174f4576db268d9631c89735ccb78667d3236c2fddd9397f372b54b484d01630"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:549-566 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:576-595 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f068c93373b323a53d6c9d523e915facb0c9fd64976d672e0ccbbacf9bd7459"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/kvcache/BailianTraceReader.java:56-80 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/kvcache/MooncakeTraceReader.java:53-74 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/kvcache/BailianTraceReader.java"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e8ec5ba9d7cda8fd185f03eb4c4ac713a4609a03ac62389a2577d785ca9c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): .claude/skills/climber-gate/gen_attacks.py:125-146 | .claude/skills/climber-gate/gen_attacks.py:230-257 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen_attacks.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f17ea74e99e22ee5cc2570831406b2434adaab4c532cf20ca9ff1955333720"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProSimplePolicy.java:127-150 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/DClockPolicy.java:250-269 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackWindowTinyLfuPolicy.java:317-329 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProSimplePolicy.java"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c34856ecd0e175d4e9f6fbd5d88087f7c8d523ded38e6144e9f233b8791025d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/snia/cambridge/CambridgeTraceReader.java:42-57 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/snia/parallel/K5cloudTraceReader.java:39-51 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/snia/cambridge/CambridgeTraceReader.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8700bc2e8e918191e9d68a7564e05101372f6839ad966dffd7d15266fb8bfa84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:420-441 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:181-202 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ad0f79780ca7dc4fc6a502378ca10a1758326d85117776c802edc9f4fdc60c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalCache.java:194-218 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalCache.java:231-252 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalCache.java"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced2b7dec4b4551027dcbb1552157022cecb5a117e10c36cef1e7a47017f7b2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/gradient/Adam.java:51-69 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/gradient/Nadam.java:52-72 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/gradient/Adam.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6c43100b0eabcc3edd602e14177466e9b1bc4afc4bc03d8f85adccbeadbba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java:365-387 | jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java:704-725 | jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java:810-830 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"948e6274628929e277cad2d856785d2520fa6b9bbae45d315d75ef27b6ee70e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): .claude/skills/climber-gate/gen.py:81-101 | .claude/skills/climber-gate/gen.py:122-142 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd7407e805a8e145820d68a79a6f3403ee252df43c966d9db07234e3d4d19b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/snia/keyvalue/ObjectStoreTraceReader.java:47-59 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/thesios/ThesiosTraceReader.java:48-64 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/snia/keyvalue/ObjectStoreTraceReader.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cde9af8d5c0f851ef8bb5ef127a14abaa3f3052d137da080fca0da3f5e8c24c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:341-385 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:306-342 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"8889ed46b9a94fc6a72355178c5ffed13902ddab5c5059419682ac1227979a84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/MpscGrowableArrayQueue.java:336-362 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/MpscGrowableArrayQueue.java:482-499 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/MpscGrowableArrayQueue.java"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"8580452e37e1a0c1a8db383e1c7ba29ae71856ffd7ecfab13917348cc11fcd32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java:81-97 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:78-101 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:73-96 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/LirsPolicy.java:97-114 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ee517aa9a61b071e460749cb92f9f3f8ef8cc130d22921c9f9582ab3b26f1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:489-507 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:510-535 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecf4e7893aec396f7eba7345aea6a0770d846c68c13b9b7bedea4090fc50d72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java:67-78 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:62-75 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:57-70 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1df2b017f5fd881725727127787608d1655921a32439dfd6abc487d7f38558"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/two_queue/TuQueuePolicy.java:74-85 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/two_queue/TwoQueuePolicy.java:66-79 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/two_queue/TuQueuePolicy.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dd18d24ef1f2ad225d322fbf196b49db9efa77249016912d0e47980a7f459f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/LruWindowTinyLfuPolicy.java:85-107 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/S4WindowTinyLfuPolicy.java:91-107 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/LruWindowTinyLfuPolicy.java"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ad0e380c65d4548f81294abcbd67f7e2d4367b7cec2057c8eb94d0c370b515"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:681-698 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:614-630 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"2634738a258126dd398126d57c619036f2599e507d25e6e7fe54463d8683202e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinySetIndexing.java:42-53 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinySetIndexing.java:60-79 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinySetIndexing.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd5a9bf630d632763b70fa95c07da8074f79e8eb6f23452a0acda2519b77b18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/CaffeinePolicy.java:43-55 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/GuavaPolicy.java:42-53 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/CaffeinePolicy.java"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b5224b5c5cd1bcad7cbb44fe0facdab15024d99ddffd2df034096b19aa7ce5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:1848-1863 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:1867-1884 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2c57fa1a9413846eaa09c2bcafb0248aea9f7db8afcbbabf4667ccc80f0af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/greedy_dual/CampPolicy.java:92-107 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/greedy_dual/GdsfPolicy.java:75-90 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/greedy_dual/CampPolicy.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e8f582b14c337efd491435e734224869aa5b21a4163b908aa72cb27e839508"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 21\u002B corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/HillClimberWindowTinyLfuPolicy.java:189-209 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/FullySegmentedWindowTinyLfuPolicy.java:178-198 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/LruWindowTinyLfuPolicy.java:110-132 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/S4WindowTinyLfuPolicy.java:154-176 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 21 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/HillClimberWindowTinyLfuPolicy.java"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c219f37212316e785f81daae717186b421ac20c775f1087758083e4e95a85a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 16\u002B corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3700-3715 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4112-4128 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1669-1685 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:669-684 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:1061-1076 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 16 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\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3700}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae4ee430db87cd085efa384ff37807ccafb4411eed7316092102c693a92edc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1641-1653 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:1033-1045 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc09f17adabe77757a13a24c1c76b89976fb44323ab3e571ca174d2d17a086e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/S4LruPolicy.java:121-134 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/S4WindowTinyLfuPolicy.java:138-151 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/S4LruPolicy.java"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"084de7986532da8725962eaa0520a3e009013414037b776eb9ded1e74eea47db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:496-506 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:511-521 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:523-533 \u2014 These 3 members are one piece of code written 3 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ccbb974e416c9dfac50796c344b9bb6babc869813534c96b823c3d9c2b9fb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java:211-223 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:310-317 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:282-289 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"413b8be068b32429cd9d1fdc3bb94a1e76868f764f6a1b2832a0dc7e3271de14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/Cache2kPolicy.java:66-78 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/CaffeinePolicy.java:58-70 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/CoherencePolicy.java:95-108 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/GuavaPolicy.java:56-68 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/Cache2kPolicy.java"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b263ba9121973d09e31b8745d1ed7866b3302033cbd7fbc8991cb4ad7fd4cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/greedy_dual/CampPolicy.java:228-236 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/greedy_dual/GdsfPolicy.java:178-186 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/greedy_dual/CampPolicy.java"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"921bdd05ad9891f3df553bb7506a8b82a5eeb68717d7a17e9d047730a5253b89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java:73-83 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCacheSketch.java:74-88 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCacheWithGhostCache.java:77-87 \u2014 These 3 members are one piece of code written 3 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa3f75b6bcbd4ac7ce3d6772787ab21efc85fbf058c21e698638e7d6feb423b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/sim/MiniSimClimber.java:205-215 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/sim/MiniSimClimber.java:218-228 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/sim/MiniSimClimber.java"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7ad486ef8186023d310f78bb60a40caed95226a9a10dc3a84c316dbef8339e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/LinkedDeque.java:139-149 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LinkedDeque.java:150-160 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LinkedDeque.java"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f7b47da211c4023bc1f2644faa973aa357c8dfacdd3915bf3e98a0d91d0647"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:447-461 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:538-551 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:555-574 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b05cb55469f972611f7c1e25ccad69258bcc6cec4a0642dc57e1284fe5679f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java:186-203 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:281-302 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:255-274 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"468e1fef4c2bc76e57dfc6b15f8ce626dd4e66abac01d0f003fca1aaf17887b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:155-173 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:135-153 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c14e45b4ebe107efcfbc7e9c5a81604e1163a3533b3a06ac3e252c7c2c3ba0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/FrequentlyUsedPolicy.java:54-62 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/S4LruPolicy.java:62-73 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/FrequentlyUsedPolicy.java"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3538be87422caf228fa4efc8ec8b230ee9b74f4d845b812f82367227a5655981"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:385-393 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:2324-2338 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:2399-2410 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1fd0cb6ce529656a2ccaac80cbc7cd730f1d80c4aa69721a00ceb1a114e32e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/Caffeine.java:1161-1173 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/Caffeine.java:1219-1232 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/Caffeine.java"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac0838b33dba0e353575d836e5f2213b7e77d742412abf983b9e298d4c62c79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/FrequencySketch.java:224-231 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/ClimberResetCountMin4.java:86-104 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/PeriodicResetCountMin4.java:78-95 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/FrequencySketch.java"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"61398c4ef1317c059a4c6ba4471552374dd8f2d455ae81459220bea6fab0285f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): guava/src/main/java/com/github/benmanes/caffeine/guava/CaffeinatedGuavaLoadingCache.java:61-74 | guava/src/main/java/com/github/benmanes/caffeine/guava/CaffeinatedGuavaLoadingCache.java:78-91 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"guava/src/main/java/com/github/benmanes/caffeine/guava/CaffeinatedGuavaLoadingCache.java"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dee1c84b8d9dc4878a3513b84ecc4fa7b8c2db03f7db731f6febf3ba82b13d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java:98-109 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCacheSketch.java:103-112 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6edde17b8f620fe86d8e61062936b78f960bd16eb3fbe0936dcf765c33b3a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProSimplePolicy.java:153-164 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/DClockPolicy.java:95-109 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProSimplePolicy.java"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"134ccd20f3d3de2d134f4e6d2fc8babcae28246fd1e2d2a7660ca262876b2585"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3891-3903 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3923-3935 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3938-3950 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4142-4154 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3891}}}],"partialFingerprints":{"codehealthFindingId/v1":"608d70ce8392da3b390d4e9ad29b06f6d01113ef1aae7bdeefce51cd5a7c7836"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:131-153 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:113-133 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f365609453715728f0e4cf5b9a9d0cf48a00b03394a4c62a84c54c61508fbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProSimplePolicy.java:172-192 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProSimplePolicy.java:201-217 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProSimplePolicy.java"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c694c9cba0306bf597f31081552f81bc45b2e95110c93e22860aa9e72efffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java:125-143 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:210-230 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:155-176 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:188-208 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ca3f5425ccb78a419506266f5b5ec898251158e247f3bf9c55ebfbd4c349e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:261-282 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:241-261 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdd00953e9cd664a910d52338a0df6c1829b2696a638614117ac8de21b05874"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java:39-47 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCacheSketch.java:39-47 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCacheWithGhostCache.java:42-51 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0a70d8d9ea880cf08ae3a16bd379e47e9f0d6ef408871e5c4ffa38e2f222b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/gradient/Adam.java:39-48 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/gradient/AmsGrad.java:40-48 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/gradient/Nadam.java:40-49 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/gradient/Stochastic.java:52-59 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/gradient/Adam.java"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d33c20e2078cc78b6f5e865042a95e699cf1c4d195b27b7c7a83240ca9bf68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/StripedBuffer.java:240-252 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/StripedBuffer.java:255-267 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/StripedBuffer.java"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"204c8d075c10003dc5e7f148499bb8f3faf6621f5ce6097165a3f6ccac413974"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:569-577 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:503-511 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"de03bb6631c56edf7d3591d9730db05523528ecdbf5ce45c904bac56b6448737"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4132-4139 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1688-1695 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:1080-1087 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a21baa2698e59bdf526c187a577078a8d93f580247af42af7f46d08eea748b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1496-1507 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1510-1521 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1533-1544 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27743648a5d6dfc961cabe8396be9c7ca06fbe53f719eb57873f6b94bab4555"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/S4LruPolicy.java:97-109 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/S4WindowTinyLfuPolicy.java:124-136 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/S4LruPolicy.java"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd09f1408524a686706f8d8b2ae6df1ad2f3158f0be9151e7f0c0792d4d68994"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/CoherencePolicy.java:142-147 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/ExpiringMapPolicy.java:92-97 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/TCachePolicy.java:100-105 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/CoherencePolicy.java"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f24a22f009998c2c3e40a00adc3dba4b783695c841c5c653bfb3c17d4c0b6c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/ClimberResetCountMin4.java:51-62 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/PeriodicResetCountMin4.java:45-55 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/ClimberResetCountMin4.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f3c99368de0606eef4b4c3168d874a635619ad97ccbf9764d1ae9285992207"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:2856-2866 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:248-256 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":2856}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0278c0341aa91458eaf732d8c6c83b877227169dedabcb9f2f8d5f90d396121"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncLoadingCache.java:84-97 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalLoadingCache.java:133-146 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncLoadingCache.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c370602a4459fe88f9911b84305b27576fd197c8cb384b7f3399c75d84ee7f0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/tinycache/TinyCachePolicy.java:33-39 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/tinycache/TinyCacheWithGhostCachePolicy.java:33-39 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/tinycache/TinyCachePolicy.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2d182ad8e33a4a44e51d599145a2788309c7ac26fcb33115672c6871bf7c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:858-868 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:884-893 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:896-906 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"8159e13d5dee6489d448658a47ee52a99ec8642b27509c6da812db5e5f70ebb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/ClimberResetCountMin4.java:42-48 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/PeriodicResetCountMin4.java:36-42 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/ClimberResetCountMin4.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b314f34c9b16b346b83db7930be9d731ae30a19ea7fe1fdfd62e9975c1bc5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/ArcPolicy.java:116-130 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/ArcPolicy.java:132-146 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/ArcPolicy.java"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b196125c7ae160145e890f51cc2f1a62d46753a769c6d36a80f901a111232b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:1487-1495 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:1507-1519 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7ad813af8d7af8afbe0308c2da1940daa4fe65ed3ec26cb0614b8e7ea77646"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CacheusPolicy.java:207-221 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CacheusPolicy.java:223-232 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CacheusPolicy.java"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e965b81a6c969933cc2230084fd6420faa7ac09d18e9fffa76df76e641341c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/Caffeine.java:527-537 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/Caffeine.java:806-818 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/Caffeine.java"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ff040c5fe5f57056e7902e272d88b832620c88c93ca631985e7e8d2018d838"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/References.java:69-78 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/References.java:88-97 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/References.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"addb374d14af44e5f9ed60853538cbcb505acfa08f7455833b7f74ac7735f196"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/lrb/LrbTraceReader.java:46-53 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/tragen/TragenTraceReader.java:46-51 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/lrb/LrbTraceReader.java"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d9b9d45b3aa018332dfec797e221e31fab8d31d1fd178bcd5b473fa7284343"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java:1313-1323 | jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java:1326-1337 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"62238171531932143098c3a3662aea08bd21cd9302eca4226548caa56187750c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/FrequentlyUsedPolicy.java:116-127 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/SegmentedLruPolicy.java:133-145 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/FrequentlyUsedPolicy.java"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e66a856cdfebb03b151dcdb0a734c8a2ffdc4ce1b76990670c1ade69c49ff3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/Cache2kPolicy.java:86-93 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/TCachePolicy.java:87-94 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/Cache2kPolicy.java"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea012d636fcae310a983f60033d72650e4ef141704a1bd329f3d889155a12772"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/Ehcache3Policy.java:73-83 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/ExpiringMapPolicy.java:69-81 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/HazelcastPolicy.java:84-93 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/Ehcache3Policy.java"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccc0e829461e3239a67091c39f8f95dcbf8f5458d1b9c7c3b8598431b866b95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/Simulate.java:128-136 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/Rewriter.java:125-132 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/Simulate.java"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7053beee726fad5950ea9a28ba284661f3f44d38121af04ac5155a421ab6dcc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): .claude/skills/climber-gate/gen_attacks.py:16-26 | .claude/skills/climber-gate/a1_tenant.py:36-42 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen_attacks.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a4ec5ceee5f54d5944e902df2f0abb9f4c4bfdc04dda8ea61b0efc18f09e4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:411-422 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:370-381 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"29229af59b99f665aa6e11f131b933cdd1828b8146c8ac4509aba27ab20531cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/tinycache/TinyCacheWithGhostCachePolicy.java:42-54 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/tinycache/TinyCachePolicy.java:42-52 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/tinycache/TinyCacheWithGhostCachePolicy.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff6301ba1c8e26293433499a1d31df5dd9035cfb02661a81a8a5c1c081e1e28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): jcache/src/main/java/com/github/benmanes/caffeine/jcache/event/GuardedCacheEntryEventFilter.java:62-70 | jcache/src/main/java/com/github/benmanes/caffeine/jcache/event/Registration.java:66-74 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/event/GuardedCacheEntryEventFilter.java"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"676b16cb9405364dacb4ad455e690741d1c088986f9e982a9c81cb63f1fde509"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CartPolicy.java:360-374 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/two_queue/TuQueuePolicy.java:201-214 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CartPolicy.java"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"3496a8a7094cdb51adef4f48366153790acb7d6f2699409a0bd3a4089f8de29f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): .claude/skills/audit-temporal-walk/verify.py:349-352 | .claude/skills/audit-temporal-walk/walker.py:328-331 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/verify.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c710edcbbc56e50df635af78ca1ff30b750e5b9ef90d52e6ed5096932b03a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/WindowTinyLfuPolicy.java:230-238 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackWindowTinyLfuPolicy.java:182-190 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/WindowTinyLfuPolicy.java"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc3765fc8a1462b8558a76eddc8668233c2f85c564d0336ba1a752ab241c79a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/CoherencePolicy.java:87-92 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/ExpiringMapPolicy.java:61-66 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/HazelcastPolicy.java:76-81 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/TCachePolicy.java:62-67 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/CoherencePolicy.java"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c820eedf26726eb611a90c5f6848ae5aad0b737269a7de7e26e0433da0c90f4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 6\u002B corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/WindowTinyLfuPolicy.java:126-131 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackWindowTinyLfuPolicy.java:116-121 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/FullySegmentedWindowTinyLfuPolicy.java:85-90 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/LruWindowTinyLfuPolicy.java:72-77 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/RandomWindowTinyLfuPolicy.java:73-78 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/S4WindowTinyLfuPolicy.java:78-83 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 6 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\u0027 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/WindowTinyLfuPolicy.java"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6a29b56df85d30c330736faaa0e102c28c5a474ed670f84cebb299b9e54349"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalCacheFactory.java:102-108 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/NodeFactory.java:138-144 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalCacheFactory.java"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c973756b0ab1877543b6bc0332f79b33506f2f2fb41152b7fdea16b37cb43c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3267-3270 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:621-624 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3267}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc3ce5d130f1aab21e389dbeb733f2740dab50c03a691df8c372c53ba80d9b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3837-3840 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1444-1447 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:1192-1195 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3837}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce26e2b43f2731d13adc0c04c2dc8bc667a4da4aec38289097dfdd34798ff46b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/CountMin4.java:199-203 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/membership/bloom/BloomFilter.java:148-152 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/CountMin4.java"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"86dea50e4b6e5e41b533b4c443987b448c42b0fd6ca8ad5884ce51c5a5c03aef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java:88-91 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CartPolicy.java:91-94 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09f644a4f69f52664ee9211a3d16ad215eb1c7cd04f5143bbd302d153b51894"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java:178-180 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CartPolicy.java:211-213 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"305c57d17764f00ef4892acce2efa47c597daf3dac0627127b67ae5ffc79305f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/S4LruPolicy.java:184-190 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/S4WindowTinyLfuPolicy.java:213-219 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/S4LruPolicy.java"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1d4df8723bd6b63681f878c501e3d55cabc9dcec1ce041cf88c5ed07e2fb2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/BasicSettings.java:156-159 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/membership/bloom/FastFilter.java:77-80 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/BasicSettings.java"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"772e7297328658c5e8865ab976c9544a6f5f4ef2d115869b2dea298091eca80f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 7\u002B corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/greedy_dual/GDWheelPolicy.java:286-292 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProSimplePolicy.java:416-423 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/LinkedPolicy.java:282-288 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/SievePolicy.java:180-186 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/WindowTinyLfuPolicy.java:444-450 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/two_queue/S3FifoPolicy.java:329-335 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/greedy_dual/GDWheelPolicy.java"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"527109be58e9efefb5198361ba9ebde133b67a89b4826250165e39be17cfe3a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3255-3258 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:609-612 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3255}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d686752ec5ffaf95d45567aa9636a66ed3ca65d92787d62e05b56ffdba56021"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3261-3264 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:615-618 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3261}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd64de6bd18bbb23569cff02ef29f04d158b2393b085fa0882066784647c8125"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4043-4046 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1607-1610 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:992-995 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4043}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebaabdc628c6139f8e1005543f09fbc59d94a03632179baa125e0d747d966d2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/HillClimberWindowTinyLfuPolicy.java:288-293 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackWindowTinyLfuPolicy.java:309-314 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/HillClimberWindowTinyLfuPolicy.java"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"200509ac2613db59b6ea22174c7ca8d0cd8b48e2d60a82371f14850210e2ac5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/HillClimberWindowTinyLfuPolicy.java:341-347 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackWindowTinyLfuPolicy.java:362-369 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/HillClimberWindowTinyLfuPolicy.java"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bcaf9a0df89da4418b62408be066d793ecc135ff264b2c90f79fc512c48cf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:492-522 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:431-461 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 277 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 \u2014 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2947e04e4e0ac4a70c533fb808340b4725338362124b482f5c7d877dc9f38a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:165-188 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:147-170 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 277 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 \u2014 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7435adf1b39c2675048bd384082379d16dad60b4721cb20b3c83f658d7ad6831"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java:268-290 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:360-382 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:332-354 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 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 \u2014 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c0ad06843c369a1629e705f4aecb548906fb21e8a4f85ffa81260c65092296"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java:293-315 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:385-407 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:357-379 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 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 \u2014 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1a9947989aef5bd36938cc4c110ac8f028538b34269d59cdccfa172383b825"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:528-550 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:466-488 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 277 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:528\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cef1bf3e56e9427221047d8178b793ab67488cd0851d9487ee00400c72aa7ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:82-101 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:77-96 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 168 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:82\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"67dda096fbf617f7e5999d4d2fa7296cee1666ff21f3389482881f27a13ba280"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java:656-674 | jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java:729-747 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java:656\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"2839ea772d5c966b8e8ce24a464c747f9676fa9921a9d944656e18405542983a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:628-645 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:561-578 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 277 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 \u2014 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e6adefa619d2721e38c7ec234a1c527bd3201f80cb66f79733b809e31c4ae5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java:50-66 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCacheWithGhostCache.java:54-70 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCacheWithGhostCache.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 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 \u2014 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"094d20c2fdd2b1cb699f5a05bce2d094be8606681c12c8c6afd66153aa60181c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:345-361 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:310-326 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 277 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:345\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a845d2dcf93459685809a59c9214753f9f5fb837331bafdb1a4975ba52a0bab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:421-436 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:182-197 \u2014 before extracting anything, compare \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java\u0060 and \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 130 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:421\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:180\u0060 calls \u0060SuppressWarnings\u0060 and \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:419\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b18a609e5c70f42bbca9b9f87ab92cb876a70bfccc876644be210df237a037f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java:134-149 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CartPolicy.java:146-160 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CartPolicy.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java:134\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"75da5ce5b79e59944e217947add8e903ff45cbbaf268ec2be81c8acfb4ed45e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:426-440 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:385-399 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 277 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 \u2014 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c6735493717e2c86c8fc8e000701d565041593bc2ef45e3d17576a10d33abb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): caffeine/src/main/java/com/github/benmanes/caffeine/cache/Async.java:98-111 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:428-441 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:189-202 \u2014 before extracting anything, compare \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java\u0060 and \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 130 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/Async.java:98\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/Async.java"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0242104fe22aa7709c685f9abbce9c1e405ae0f1367a95af9e0ee77528281045"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java:130-143 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:217-230 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:195-208 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 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 \u2014 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9d7e22464ad4444bb11b11906a63717f0f12f616831a37125bb885892a3834"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java:171-184 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:266-279 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:240-253 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 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 \u2014 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a4b41ae427e8e6ce636bb20f55c933568bdecc49d62223a1c1adb8b9101462"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4761-4774 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:936-949 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4761}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adf6073c767d7ecf7949aac95af1ada32fb0e71b5954ed2ef5fd1e1ec6a2248"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): jcache/src/main/java/com/github/benmanes/caffeine/jcache/LoadingCacheProxy.java:65-78 | jcache/src/main/java/com/github/benmanes/caffeine/jcache/LoadingCacheProxy.java:166-179 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060jcache/src/main/java/com/github/benmanes/caffeine/jcache/LoadingCacheProxy.java:65\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/LoadingCacheProxy.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4410838f33d7def689e18a42e9be813c093d5ccb0304ef8f5aaffd2973ed9e4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:129-143 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:111-125 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 277 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:129\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07cd7d08db210ec2b79a3b4395df730def92441e0106c49b0adf6913219d941"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:612-625 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:545-558 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 277 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 \u2014 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"b832740528cb9470dd0774090aa1dd30bbfe23664fc9fbcff01f8035ac9017e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:140-153 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:120-133 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 168 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:140\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b878735663c0e13dc2879382c8cc01f4e3cc0044b4045f991a97af7c7f0c055"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:160-173 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:140-153 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 168 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 \u2014 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"df806828cf1d1f9e26d94cef64ae6b3db4ec854c6da395210273611275fc7eac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:185-198 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:163-176 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 168 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:185\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f64da85ec62950d62137c0cb1e95da2e0debbe8361eea3dbe2319125515d73c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackTinyLfuPolicy.java:92-105 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackWindowTinyLfuPolicy.java:130-143 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackTinyLfuPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackWindowTinyLfuPolicy.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackTinyLfuPolicy.java:92\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackTinyLfuPolicy.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ef101fe6d765fb874310a372af28faea897fa1113a671915280622d0ed9e68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackTinyLfuPolicy.java:137-150 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackWindowTinyLfuPolicy.java:216-229 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackTinyLfuPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackWindowTinyLfuPolicy.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackTinyLfuPolicy.java:137\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackTinyLfuPolicy.java"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3649ed9768ccc55216a7481f4a8fcfca871032636a2ed2b17ca08315f054b93f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4589-4601 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4634-4646 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4682-4694 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4895-4907 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4589}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12e5c2da17f8842c82cb181cbb583e37520e54dca1be68ebb1a0ce4436973b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3821-3834 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4027-4040 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3821\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060action\u0060 to \u0060Consumer\u003C? super K\u003E\u0060 in one and \u0060Consumer\u003C? super V\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3821}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd6b1918ca562d524b8d22cee3c6ae0725e0d3ec91a0b7628daefdc936d97ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4116-4128 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1673-1685 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4116\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4131\u0060 calls \u0060SuppressWarnings\u0060 and \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1688\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f26eb4863cd9ef006ea8652403901b697aa5e9f5d658c97ac202ad19eb657d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:286-298 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:265-277 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 277 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:286\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"9220681d7332db1b2bf92f66caa60e70f2c5ac81e83e0315c75c6963a067717f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:686-698 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:618-630 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 277 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:686\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:683\u0060 calls \u0060add\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:615\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6afa3b864db014fbea32063ab8fe60c78b24405f5a644ebcd187c0eb53e7173"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/gradient/Adam.java:52-64 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/gradient/Nadam.java:53-65 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/gradient/Adam.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"75606a4b058eddca7bdae826d9cac1c478c5c423694c052bf5742f3d7f510d91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3704-3715 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:673-684 \u2014 before extracting anything, compare \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java\u0060 and \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 130 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3704\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3704}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c381083ddd3df0d7548091d25975f51ceca7799856d0cc5d5d89893fac93e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:5002-5013 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:5055-5066 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":5002}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e8825e24857afe448e0423c7680b2063e132f02e92e44f40a1f94c98bbcd40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3299-3309 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1285-1295 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3299}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc20181a3b9128631095bc028faf9ecf0d68ae458e4c586ea17226cf8ef4703"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/ClimberResetCountMin4.java:94-104 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/PeriodicResetCountMin4.java:85-95 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/ClimberResetCountMin4.java:94\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/ClimberResetCountMin4.java"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3a48668b2bbb896ce023d3e61e1b24a53c548d8c44ffc052438f46a2bf6121"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:444-454 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:403-413 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 277 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 \u2014 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"187e1d1560f03a849c20599810bf2bbcdefa71832f994f72a5c9844af04922df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:552-562 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:487-497 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 277 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:552\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:563\u0060 calls \u0060checkState\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:498\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfb2d7a6f442893ead03373423cc51452389b3c8ef6c0d16ba35e4bd218339d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java:191-201 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:262-272 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 132 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"48997781b0049296a145bf1e821d40364a39e9c463e06e4f1c011966686e383c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java:194-203 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:293-302 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:265-274 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java:194\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e595ddc31bd7854ab5709b6a5ef420ba77d74c546972f7743b3f1aa73ee6648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/Cache2kPolicy.java:69-78 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/CaffeinePolicy.java:61-70 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/GuavaPolicy.java:59-68 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/Cache2kPolicy.java:69\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/Cache2kPolicy.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb10540c2a177586f4384e9b3779d4e16169ef92d21957cb79d4d80a40754e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:1063-1072 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:2278-2287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:1063\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee0f1aa016bc0edfaf700552fbf006a9539dde2451a7b6c3af19211c5c7331b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:2754-2763 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:2819-2828 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":2754}}}],"partialFingerprints":{"codehealthFindingId/v1":"1520cf08d1e57abcad623d076e249d52adb92a41d8cead7c9244fa33f2f884d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1148-1157 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1189-1198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1148\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f65c11c4591feeb19905ed8818835903a7b1f153d3368d7a42f6813513cf97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1172-1182 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1207-1217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1172\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cd206efe5fa32dc2a0ed3cf2cd355e4f9148a04d2793e12ca63b41d125bb57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:1380-1389 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:1435-1444 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb54d39eb829960fcd1f104aebc4a62bf3863adf56615dd61d1265bbb412d23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java:86-95 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCacheWithGhostCache.java:96-104 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCacheWithGhostCache.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 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 \u2014 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd761e841adc1b4ffea5944092bb2712fcd9406e1bd15148b4145c342464aa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4079-4087 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1642-1650 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:1034-1042 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:1032\u0060 calls \u0060SuppressWarnings\u0060 and \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4077\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4079}}}],"partialFingerprints":{"codehealthFindingId/v1":"7327540594a99c1d1868ddef01c63115c962fdce77d1cb7dff99de9454e09492"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java:74-80 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCacheSketch.java:75-83 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCacheWithGhostCache.java:78-84 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCacheWithGhostCache.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac96c0aef73d6a9f4c616b2c19a297c630052707913741053294cc7a25740d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/ArcPolicy.java:78-86 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java:66-74 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CartPolicy.java:69-77 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CartPolicy.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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 \u2014 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/ArcPolicy.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"26196eb011ef806fb86f45de0105c5a9b2327ecbd82af425880b09a126fe24fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java:84-92 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:83-91 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:78-86 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java:84\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e39038f740c39c9a8aafcf5749623752154936ac343f07ada51b5e00555ad2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncLoadingCache.java:191-199 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalLoadingCache.java:110-118 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalLoadingCache.java:110\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncLoadingCache.java"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf25a751d3fafe8d084647fa9b76919c9273f8096663ec328b7aae1b213f541"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java:1508-1516 | jcache/src/main/java/com/github/benmanes/caffeine/jcache/integration/JCacheLoaderAdapter.java:209-217 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java:1508\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffad3ce8595c597bc660385e7da548a6b1ef7b7fa9d7c08e5cb1f9c2690c6d4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinySetIndexing.java:44-51 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinySetIndexing.java:62-70 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinySetIndexing.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3301833613051edaf02bf9d62cc9349fdc3780ca8c1d9a955fd9faf2b14d4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3803-3810 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4009-4016 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3803\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060action\u0060 to \u0060Consumer\u003C? super K\u003E\u0060 in one and \u0060Consumer\u003C? super V\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3803}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ece59d5eef6513fc68717f5b8682606fac44e815ba71782c0da6fe3a267a5e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4833-4840 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1198-1205 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4833\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4833}}}],"partialFingerprints":{"codehealthFindingId/v1":"036f1b139f249ccd575af02f570a1702b67ac4b14c72f1f1e07f0a9723b5f379"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java:40-47 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCacheWithGhostCache.java:44-51 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCacheWithGhostCache.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCacheWithGhostCache.java:44\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"340c78180e216d863fe21d0c3b195c8b0277a6d32527a2520ea242214004888d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:570-577 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:504-511 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 277 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 \u2014 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60483b2102b968549dcef1c0e322a4d9c7a936b04186ab54b03808907e4cb7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3814-3820 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4020-4026 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4302-4308 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3814\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060action\u0060 to \u0060Consumer\u003C? super K\u003E\u0060 in one and \u0060Consumer\u003C? super V\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3814}}}],"partialFingerprints":{"codehealthFindingId/v1":"1948d17b1eb3af4d6dcd36c76840f92676c77e3af150881a196558e70eda5ce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:2735-2751 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:2792-2807 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:2735\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":2735}}}],"partialFingerprints":{"codehealthFindingId/v1":"3581bb2762d4df4df75204b6e3ca8e29118bd9caad174c716435ecac3d2cf43d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4133-4139 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:1081-1087 \u2014 before extracting anything, compare \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java\u0060 and \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 130 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 \u2014 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e89471a3a67ad34a3dcf22ee0f4d8257b76dd9d4ab82c79e2a5d32c5e4611b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1152-1158 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1228-1234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1152\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"533e1dfa901f58ff91dda8157541345628f66cc7d27dd36ee5246e47f1f5cccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java:750-756 | jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java:854-860 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java:749\u0060 calls \u0060equals\u0060, \u0060get\u0060 and \u0060jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java:852\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"374cf6916c7212a174ac894a55c55a6fd4436a7b82724de968db5c0a225e1e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/gradient/Adam.java:42-48 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/gradient/Nadam.java:43-49 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/gradient/Adam.java:42\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/gradient/Adam.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c1c0285a7dd434c17f94b05f463cc9e48e25b84348318797b16de567e0c548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3797-3802 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4003-4008 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4285-4290 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3797\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060action\u0060 to \u0060Consumer\u003C? super K\u003E\u0060 in one and \u0060Consumer\u003C? super V\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3797}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae962296dd0835bdeb4b5df81e0949755852504ca19b76b8dbf141ecdb4da59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/gradient/Adam.java:41-46 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/gradient/AmsGrad.java:42-47 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/gradient/Nadam.java:42-47 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/gradient/Adam.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4979862b4d9dedf1b967313c36ecd3a496aa7be1d112768c05df8f19a4a93f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3343-3348 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3365-3370 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3343\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3362\u0060 calls \u0060StringBuilder\u0060 and \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3340\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3343}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe91e50ce06bcaf21e8bdbe01269f77fcb6194f61e5e6b99da35779b9da4400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java:1519-1526 | jcache/src/main/java/com/github/benmanes/caffeine/jcache/integration/JCacheLoaderAdapter.java:221-226 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java:1519\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ca851be17583f91940ca9b7085825b2420b69d6d4b19ab7b718bba7e0c3c78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/ClimberResetCountMin4.java:43-48 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/PeriodicResetCountMin4.java:37-42 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/ClimberResetCountMin4.java"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"492db54b9dc35deb112f5694a34bdb9892a020e5cefb6965ba2913994dd3f073"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3798-3805 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3816-3823 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4004-4011 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4022-4029 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4286-4293 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4304-4311 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3798\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3798}}}],"partialFingerprints":{"codehealthFindingId/v1":"81252f84f90caa27fc6fcd5c88f75df0ac7445e4987c7de26efdb177334d42d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:2740-2744 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:2797-2801 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3109-3113 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:2740\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":2740}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cea310a2c88e21ae6db9a54269b0ee7e1eb6a98c86ff4139260dbbc44f2863"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3313-3317 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3340-3344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3313\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3313}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9c53c066c03358a4912f5ab82f327f3026f32b63422f9b10422f7cc8a651cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4439-4443 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:1270-1275 \u2014 before extracting anything, compare \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java\u0060 and \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 130 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4439\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4439}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1a9df2d4b355b71a1d32c174ade2e1df495bf544d34553b18013d3dd9089c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4457-4462 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:1276-1281 \u2014 before extracting anything, compare \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java\u0060 and \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 130 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4457\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4464\u0060 calls \u0060evicts\u0060 and \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:1283\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4457}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ecc15d5c76785077a0a2519888d0ecb807e1092042b83711f32ab1e114ff7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java:213-217 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:312-316 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:284-288 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java:213\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"df47769162c48f22b295309687468e6ddd733efb0f271bd1d351bc09d1546593"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/corda/CordaTraceReader.java:33-45 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/scarab/ScarabTraceReader.java:34-46 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/corda/CordaTraceReader.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79a7d779ae48e3ce9338622d9ce96d00cd89426dccb1f80e233d403119cbaed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/glcache/GLCacheTraceReader.java:38-63 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/libcachesim/oracle/OracleGeneralTraceReader.java:38-59 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/glcache/GLCacheTraceReader.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb938f1c82e0b5dcf3dc3e2d313fdbd688dade2d6d17e83d79e71f0002480d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:359-368 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:215-224 \u2014 before extracting anything, compare \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java\u0060 and \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 130 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 \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:371\u0060 calls \u0060SuppressWarnings\u0060 and \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:227\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30d09ca724a36fa16dce52c24370465bdedc94b972d9794900d2523186b486b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 9): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3687-3697 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3878-3888 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4099-4109 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1362-1372 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1483-1493 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1656-1666 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:656-666 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:845-855 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:1048-1058 \u2014 there are 9 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 9 sites; resolving a subset leaves the remainder to drift apart. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3687}}}],"partialFingerprints":{"codehealthFindingId/v1":"c482dc813c05d0e4eb702dc6cd0119ce77e36c16dbf8271448637da4198ab432"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3723-3732 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:692-701 \u2014 before extracting anything, compare \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java\u0060 and \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 130 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 \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3723}}}],"partialFingerprints":{"codehealthFindingId/v1":"372c56cdc7ab891d1412dda99041224650c102dafb586536fe312bc1f5b0df82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:3735-3744 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:704-713 \u2014 before extracting anything, compare \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java\u0060 and \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 130 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 \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3735}}}],"partialFingerprints":{"codehealthFindingId/v1":"525951b2f321f074d0bb999d3eef0fa9ca60f23f2ddf31440249c0fffbd70c3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4157-4166 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java:1707-1716 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:1104-1113 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4157}}}],"partialFingerprints":{"codehealthFindingId/v1":"c757d3ab95f3344a7c2b714e7c7eec99fe5231d28dcd1fc641e7375ee5d3b799"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): jcache/src/main/java/com/github/benmanes/caffeine/jcache/EntryProxy.java:36-43 | jcache/src/main/java/com/github/benmanes/caffeine/jcache/event/JCacheEntryEvent.java:74-81 | jcache/src/main/java/com/github/benmanes/caffeine/jcache/processor/EntryProcessorEntry.java:110-117 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/EntryProxy.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5649b40f242017763f7a4de8adce1aa565d957dee199143f415fb183de9926c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/ClimberResetCountMin4.java:65-71 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/PeriodicResetCountMin4.java:58-64 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/ClimberResetCountMin4.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"63035c0592643f7ad559516f354b51a68a0772d7ed9395a4eaa53659f9b111ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/CountMin4.java:209-213 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/membership/bloom/BloomFilter.java:135-139 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/CountMin4.java"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d78c24c5cbdeb35cc3f60cda74c6e655523a81bf11b506836b511605adc55ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java:111-120 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCacheWithGhostCache.java:126-135 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCacheWithGhostCache.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/tinycache/TinyCache.java"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f857dba1a7e031d93f024273c7500627dc6e5c7d75595043423527b833629cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/ArcPolicy.java:261-267 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java:279-285 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CartPolicy.java:351-357 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/MultiQueuePolicy.java:183-189 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/S4LruPolicy.java:193-199 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/HillClimberWindowTinyLfuPolicy.java:350-356 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/two_queue/TuQueuePolicy.java:192-198 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CartPolicy.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/ArcPolicy.java"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"60536fddc5fedf083203d8e4da504bdbc5800b8ddd9133e3a4f29324326804c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/ArcPolicy.java:270-278 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java:288-296 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CartPolicy.java:377-385 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/two_queue/TuQueuePolicy.java:217-225 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CartPolicy.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/ArcPolicy.java"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b262fd4dd77be9ef61c18ee23680cc21841e08f75f5b534a0a57cb82a4fca062"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java:77-86 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CartPolicy.java:80-89 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CartPolicy.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0ce25307fe9923750e2dbc244a0ca80836f1573b19d8ed6074f7a9bfa783ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/greedy_dual/CampPolicy.java:303-311 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/greedy_dual/GDWheelPolicy.java:276-283 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/greedy_dual/CampPolicy.java"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e273f3291862bb61b948dcd7d9be86de021bd0098f3cea1081d7a034dd3ab42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:151-161 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:133-143 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 277 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e75dbad41054864401a2fbfae0a6cdf1282ee7d593877a9552f1e4cbc7ec25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:195-208 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:177-190 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 277 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c621f4b6b6a43710e3f3b0c0f9fb64e0906672cd32658cdc5430e95ca95e94be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:239-252 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:219-232 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 277 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f36d2975fff56ea5db6107f61fb3d9a559ccccc126b8ca2729ff9be043d0c1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:482-489 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:421-428 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 277 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9d5f4b324b8ac6deef5695aadf4cbba1b978de3d6501e57474a772cf7e63a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:717-721 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:649-653 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 277 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e98d7da13e2530b1347a629b5984b28c628849c781e08123ca7578377f66ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/DClockPolicy.java:324-331 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/S4LruPolicy.java:202-209 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/DClockPolicy.java"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3a777a29d45cdc6b5c4e9392ebf3d6a5a81e05180c07c7a4fcff4e90e5a07a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java:156-168 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:223-237 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 132 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"800f9901dc7cb90571cdf8267c0cd49879825a90fd1728cc65dd7a8d72ee8ca4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java:258-265 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:350-357 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java:322-329 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"219e57c342280da62948eba52e0f94f29cac60261847969abc21116e47017da9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/FrequentlyUsedPolicy.java:78-87 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/SegmentedLruPolicy.java:92-101 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/FrequentlyUsedPolicy.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f66d7a6f3b4a9b9d3a1f2cf78ca506d058767e548e9e3ff554009cae4ae831"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 9): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/FrequentlyUsedPolicy.java:198-205 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/FrequentlyUsedPolicy.java:246-253 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/WindowTinyLfuPolicy.java:434-441 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/climbing/HillClimberWindowTinyLfuPolicy.java:359-366 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackTinyLfuPolicy.java:216-223 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackWindowTinyLfuPolicy.java:382-388 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/FullySegmentedWindowTinyLfuPolicy.java:259-266 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/LruWindowTinyLfuPolicy.java:182-189 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/S4WindowTinyLfuPolicy.java:237-243 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackTinyLfuPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackWindowTinyLfuPolicy.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/FrequentlyUsedPolicy.java"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b399d44fcc4056e16c6f12cb3b8a947698ce458513443c23aadbd548438f2972"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/SegmentedLruPolicy.java:191-201 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/two_queue/TwoQueuePolicy.java:220-230 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/SegmentedLruPolicy.java"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21b8896ea3610682624bc1ef63e82f2789e6f8ce64b20a03d2b5daada5fa849"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/CaffeinePolicy.java:78-83 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/GuavaPolicy.java:76-81 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/CaffeinePolicy.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"509fdc9d218a988bbaf1e9dca7a694cada635148662ea3c87ee8d3ec29ff7f26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/WindowTinyLfuPolicy.java:424-431 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackTinyLfuPolicy.java:206-213 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackWindowTinyLfuPolicy.java:372-379 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/FullySegmentedWindowTinyLfuPolicy.java:249-256 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/LruWindowTinyLfuPolicy.java:172-179 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/S4WindowTinyLfuPolicy.java:227-234 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackTinyLfuPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackWindowTinyLfuPolicy.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/WindowTinyLfuPolicy.java"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40d075453661b63e3035726db6367f4945261b9541fff453bafa254014400f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackTinyLfuPolicy.java:246-252 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackWindowTinyLfuPolicy.java:427-433 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackTinyLfuPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackWindowTinyLfuPolicy.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 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 \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackTinyLfuPolicy.java"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ecd46e62135f63924bfea65b662b2ac6392812483a2943ac53efb830046d69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackWindowTinyLfuPolicy.java:159-165 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/segment/S4WindowTinyLfuPolicy.java:110-116 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sketch/feedback/FeedbackWindowTinyLfuPolicy.java"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e50be6477269fbd950c9bda670d708d85e488908a4c895728da7606305f39b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/AccessOrderDeque.java:38-42 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/WriteOrderDeque.java:38-42 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060e\u0060 to \u0060AccessOrder\u003C?\u003E\u0060 in one and \u0060WriteOrder\u003C?\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/AccessOrderDeque.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c944d150f5dcffafc0a4a7cb1f0a90255ff74d66d049c9f8f0a06b527c9715"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java:4390-4398 | caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java:1226-1234 \u2014 before extracting anything, compare \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java\u0060 and \u0060caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 130 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4390}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de5f8a98a1ab736d41a3ee4a4131d1e0a8e43463e74b28d88a798a8d01f343b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/FrequentlyUsedPolicy.java:65-70 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/sampled/SampledPolicy.java:86-91 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/FrequentlyUsedPolicy.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd49c3d7b7a0446c1a63e698ca10ef8b46fceafcf2742c8c6e3a91d7adeca893"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/S4LruPolicy.java:76-81 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/SegmentedLruPolicy.java:84-89 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/linked/S4LruPolicy.java"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ce8d952d10bbe8133e98c6835ccb3e1e547e6d35ace69a844fdaf5fce8154e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/kvcache/BailianTraceReader.java:62-66 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/kvcache/MooncakeTraceReader.java:58-62 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/kvcache/BailianTraceReader.java:62\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/kvcache/BailianTraceReader.java"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"af79bc94cf7ea533d1d9818c8d9a4ebae421164193bbe834ae1a9c073e85acb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java:648-659 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java:581-592 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 277 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 \u2014 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 \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fabac6b02c06c151cf5fc605b800e0a179b44ec105ffb97ded087bf11192c7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java:68-72 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java:63-67 \u2014 before extracting anything, compare \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java\u0060 and \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fd8b987d4469519e5ceaba1bd69e0a6039a0b194ef330c1bd38a794774e956"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/CoherencePolicy.java:143-147 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/ExpiringMapPolicy.java:93-97 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/TCachePolicy.java:101-105 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/product/CoherencePolicy.java"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"011dfbb57118a6274e77cce1773fccfe378f799e25c7374a0713ee8ef08ea83f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/two_queue/S3FifoPolicy.java:248-253 | simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/two_queue/S3FifoPolicy.java:257-262 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/two_queue/S3FifoPolicy.java:248\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/two_queue/S3FifoPolicy.java"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ca25a54d81c930bf6c90cf51de3a0b35463b0202185be0bccdf6b62d0aa4e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47\u201350 lines \u00D7 2): .claude/skills/audit-temporal-walk/verify.py:73-119 | .claude/skills/audit-temporal-walk/walker.py:81-130 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/verify.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"23dcab0eff3a9e0518612533c8af3546524eb452bc6c4d4da9f15f77c6edb9a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201327 lines \u00D7 2): .claude/skills/climber-gate/blind_gen.py:27-50 | .claude/skills/climber-gate/blind_gen.py:54-80 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/blind_gen.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a3bdbe288c73d1391bdb4ed283857ee599be5ba8a84ea9097e3717ccf109a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): .claude/skills/climber-gate/gen_adv.py:127-143 | .claude/skills/climber-gate/gen_adv.py:282-300 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060.claude/skills/climber-gate/gen_adv.py:127\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen_adv.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"784402065d70aa504469910d8dbc357e617c4c1d30f53780e0fbba939bb9803a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): .claude/skills/audit-temporal-walk/verify.py:120-136 | .claude/skills/audit-temporal-walk/walker.py:132-148 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/verify.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca373fa509b9da4a14ca6d7fe751b65580d3bf3ffef7b3103257911f9e76185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): .claude/skills/climber-gate/floors.py:33-56 | .claude/skills/climber-gate/real.py:39-62 \u2014 before extracting anything, compare \u0060.claude/skills/climber-gate/floors.py\u0060 and \u0060.claude/skills/climber-gate/real.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 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 \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/floors.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9182a050b4175daaaf7e9c210796a5b78fea9bad9a0eda702dd7e15e7e764bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 6): .claude/skills/climber-gate/gen.py:39-53 | .claude/skills/climber-gate/gen2.py:46-60 | .claude/skills/climber-gate/gen_adv.py:35-49 | .claude/skills/climber-gate/gen_blindlock.py:41-55 | .claude/skills/climber-gate/gen_straddle.py:42-56 | .claude/skills/climber-gate/mixnoise.py:30-45 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 6 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c936f32e78bd05fa75c5474a7e6921609c6a45c02eb87b1948efc3f0ad5a53c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): .claude/skills/climber-gate/gen_adv.py:147-162 | .claude/skills/climber-gate/gen_adv.py:302-317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen_adv.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0dc27b32c9f36d53fcbba5ee48c06d636ef637e6c21817198920358993f749c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): .claude/skills/audit-temporal-walk/verify.py:318-331 | .claude/skills/audit-temporal-walk/walker.py:464-477 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060.claude/skills/audit-temporal-walk/verify.py:318\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060.claude/skills/audit-temporal-walk/walker.py:478\u0060 calls \u0060str\u0060 and \u0060.claude/skills/audit-temporal-walk/verify.py:332\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/verify.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"9583ee2689f4d239c44f109c75123e0b4a4b2b8a8e3f0252f252caeb7c800ed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): .claude/skills/audit-temporal-walk/verify.py:137-147 | .claude/skills/audit-temporal-walk/walker.py:151-161 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/verify.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"80979986feead4ca9bc79f871231bcd47efda9539bdb00f154cb8b2b62912bed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): .claude/skills/climber-gate/gen_adv.py:102-112 | .claude/skills/climber-gate/gen_adv.py:259-269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen_adv.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aad6623387274ec388efc9a3c446259ea0985e46cfed0773f4a3c2c2120e568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): .claude/skills/climber-gate/gen_adv.py:204-213 | .claude/skills/climber-gate/gen_adv.py:263-272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen_adv.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1bea99f209d1e791b18e216870f7a5829f6e1cb267e582ee9803c235b589a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): .claude/skills/climber-gate/crashnoise.py:102-110 | .claude/skills/climber-gate/gen_jam.py:110-118 | .claude/skills/climber-gate/whisper_mod.py:85-93 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/crashnoise.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1869af960b8d55befb04946994307540efd6fcfd7b774a92035311918f0bab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): .claude/skills/climber-gate/crashnoise.py:74-83 | .claude/skills/climber-gate/mixnoise.py:77-86 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060.claude/skills/climber-gate/crashnoise.py:74\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/crashnoise.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9ddecf98b39cdcde69f512fe2000100977ce8f75179fedaa110a1560a11512"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): .claude/skills/climber-gate/gen.py:93-101 | .claude/skills/climber-gate/gen.py:131-139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060.claude/skills/climber-gate/gen.py:91\u0060 calls \u0060write\u0060 and \u0060.claude/skills/climber-gate/gen.py:130\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8012ce7d4de86dee8438b011db8b5dd2295c8fc1a5cf7229753be8cdbff1d4c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): .claude/skills/climber-gate/gen_jam.py:101-109 | .claude/skills/climber-gate/whisper.py:56-64 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen_jam.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b59f246272242e9b4a9e2e19221b6f90217785c89b40e5c2332d99c3d8da02e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): .claude/skills/climber-gate/crashnoise.py:93-100 | .claude/skills/climber-gate/whisper_mod.py:76-83 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/crashnoise.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"655e815c1003492cbaa950016b43e54820148b02f8e5ee3b6e497d08614d115b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): .claude/skills/climber-gate/gen_attacks.py:137-144 | .claude/skills/climber-gate/gen_attacks.py:246-253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060.claude/skills/climber-gate/gen_attacks.py:137\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/gen_attacks.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4db65b51bb5be5877c673d552bcd3ac30c4a1bfb8485fbd72b663f61ca7529"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): .claude/skills/climber-gate/floors.py:40-45 | .claude/skills/climber-gate/gate.py:196-204 | .claude/skills/climber-gate/real.py:46-51 \u2014 before extracting anything, compare \u0060.claude/skills/climber-gate/floors.py\u0060 and \u0060.claude/skills/climber-gate/real.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 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 \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/floors.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"995b14efd33184a46636ecfd58f1fa48453a84f3978cf7db5b693e3c92460235"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): .claude/skills/climber-gate/floors.py:39-43 | .claude/skills/climber-gate/kvcache.py:89-93 | .claude/skills/climber-gate/real.py:45-49 \u2014 before extracting anything, compare \u0060.claude/skills/climber-gate/floors.py\u0060 and \u0060.claude/skills/climber-gate/real.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 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 \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/floors.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe0ff907f01acb00ac93b14a93c8dc72d2bb434866eb0ac25f8be7c5da33ddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): .claude/skills/audit-temporal-walk/verify.py:332-336 | .claude/skills/audit-temporal-walk/walker.py:479-484 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060.claude/skills/audit-temporal-walk/verify.py:332\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060.claude/skills/audit-temporal-walk/walker.py:478\u0060 calls \u0060str\u0060 and \u0060.claude/skills/audit-temporal-walk/verify.py:331\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/verify.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc2bb2b4d9ef591b1d8092d7be1ee4135c32f81890a940f842ecedc82b05591"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): .claude/skills/climber-gate/admission.py:47-52 | .claude/skills/climber-gate/marginal.py:53-58 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/admission.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6a165b8a3cdb09dce0b8659925c510ed3f8f14f4bffada37cdf630feb29428"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): examples/coalescing-bulkloader-reactor/src/main/java/com/github/benmanes/caffeine/examples/coalescing/bulkloader/CoalescingBulkLoader.java:105-112 | examples/write-behind-rxjava/src/main/java/com/github/benmanes/caffeine/examples/writebehind/rxjava/WriteBehindCacheWriter.java:89-96 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/coalescing-bulkloader-reactor/src/main/java/com/github/benmanes/caffeine/examples/coalescing/bulkloader/CoalescingBulkLoader.java"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec79f353cedc01c4f99bdbf3abe80940c893477fba27bc345ec519b742483b8"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: caffeine:caffeine: caffeine:caffeine: abstractness 0.28, instability 0.00, distance 0.72 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7952ad79a9066ad63832c4cbe06da6b21f16b7181b68097768494157af450ca3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AsMapView (LCOM4 5): AsMapView\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"62dfdda94cce21bf68064b934258c3a8e498b7936f6e43e7829d6ead8fd63612"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BoundedLocalCache (LCOM4 4): BoundedLocalCache\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"314240c50f8237be75058f7bd2a37e74fc69f2cda1a1fe19bfa5e49655a4e790"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LocalAsyncLoadingCache (LCOM4 4): LocalAsyncLoadingCache\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncLoadingCache.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9914b8a1b46a14c7f1dbeca9cf94be7443d6c4a1343750f9342c35e867fc02f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UnboundedLocalCache (LCOM4 4): UnboundedLocalCache\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea33aef1afbf94727cabfaca7bc0a7dc592a6e99ed612eeae5ad724c133971ee"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: intermittentNull: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/issues/Issue568Test.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0348cec59818449a31f41371f1d852aab174b40c4bd4f993131b9f8304734c68"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: resurrect: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/issues/Issue568Test.java"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec75c2ec230a33e5c24033881127200f62eed21109ccbf05b19881d9af316a0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: forEach_modify: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/AsMapTest.java"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"058930ffd74766d1861bf3a10815bf3540229ef960020c15d6064de535c1ef31"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: forEach_modify: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/AsyncAsMapTest.java"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea871d08f5ccbc28b188ebcf2393ee952c67a2fdbdcee45de099178e1e03b3a7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: writes_readyFuture_doNotRecordALoad: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/AsyncAsMapTest.java"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2dafbf1abb7d7e35716d40bbfd6100c492332cf78dd9359f8066dbc5499e0b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: put_readyFuture_doesNotRecordALoad: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/AsyncCacheTest.java"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"da24a530daa1bb82561d2d10958d9a18ea1cc581e61bdfd4483ce8a070af1a35"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: asyncEviction_null: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/AsyncTest.java"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b488d9e47ea7b055125a859ad3417b52960b18d008205aa4e4cc5f28294953fc"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: asyncRemoval_null: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/AsyncTest.java"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a1b75eb6ec3d93adaf3a93d395ef239e4ebbaef463de9fa61f7bd32c85e6e9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: reflectivelyConstruct: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/AsyncTest.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e24c398ff89c2f6abc1c619770633e2ed492090ac53941b3ab7da29753ad265"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: reflectivelyConstruct: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/BoundedBufferTest.java"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bf30ce9a5a51ca68a5250e37fc452f0ef93934be89b0493caad8c1c77165f4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: cleanupTask_allowGc: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/BoundedLocalCacheTest.java"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee16075c4b822967bdffee84030d470fcdae4abc1034b23b31a0dc25d707485d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: clear_complete_doesNotReschedule: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/BoundedLocalCacheTest.java"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdb0b4dbb9a3f31f09fba7d53b35e734a8d1c6b96ec52770f3b8ebb8c794d47"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: drain_nonblocking: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/BoundedLocalCacheTest.java"},"region":{"startLine":3631}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b6d82aa9ef4649019aecb936380af5d6a6446efe5004cbf047afe12eb0571b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: maintenance_recursive_accessOrder: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/BoundedLocalCacheTest.java"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c228a1dba7454fe8adf65038e7067bfb50353ce1ef91c55320146c7a673d815"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: maintenance_recursive_accessOrder_removedTail: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/BoundedLocalCacheTest.java"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"548513d90305c6e33bc92287a302aaafa9b4266649fca14b9c53c3f5f793fe71"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: maintenance_recursive_writeOrder: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/BoundedLocalCacheTest.java"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6f18ef8e01133e53271379811be754bd25c4c98d32adbff0c1d9b842d89331"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: maintenance_recursive_writeOrder_removedTail: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/BoundedLocalCacheTest.java"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73280179eda7bbdacd090eb8e9443aff695c933288676a4ed042199715628b8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: reflectivelyConstruct: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/BoundedLocalCacheTest.java"},"region":{"startLine":8484}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bdfd40809ced16e024da872b0c7118b77b55ed5d0dfd3d7313874a95217bba"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: nullParameters: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/CacheTest.java"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b39e00e2e3da154337d26957ed7a04469a1b8fda4d5b39fac0fbfbd9d86fc1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: nullParameters: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/CaffeineTest.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b126a6e3bd07714030eeb01ae5d630ff9096b3bbd3b78ec2226e847fbd8ad4d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: computeIfAbsent_nullValue: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/ExpireAfterVarTest.java"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bfab1c2939e6ea6b09f9b7e304d1dc550e6cb1848d5c4deb58ac9e69de94568"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: computeIfPresent_absent: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/ExpireAfterVarTest.java"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"080ad5d194ab91c2c1990cfc6415fe800f866a315318f19929e4394966b004a8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: computeIfPresent_nullValue: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/ExpireAfterVarTest.java"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0b6ea152b9ec3e6d8a4902c5295951cc47a1970caedc2996379fad50bf7cd0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: compute_nullValue: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/ExpireAfterVarTest.java"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"350dd860d53b8b7f94f26b6e7a14a516eedd7ae2fa965a61c0df0651753e609a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: merge_nullValue: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/ExpireAfterVarTest.java"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d64b90b4e8e034ad3c43af49fb685c4c57b200686147ec3d94e3db0b3b64229"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: nullPointerExceptions: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/InternerTest.java"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ee70c11d9648387afbd25be5ad5220ba7519c60f04a083f2fae17536e2778a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: concurrent_expiryAccess: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/MultiThreadedTest.java"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78697af3a65fc71cec1c3d388a8bda9b666d395bb4b907b1ef9a6f0e829b96c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: concurrent_expiryCreate: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/MultiThreadedTest.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7214e75fd54c3c9791f168ca89ff5d01fc86c889427859b8eb753f82db7b4dde"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: concurrent_expiryDisabled: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/MultiThreadedTest.java"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3f07bf3eaa03642636a1b96772131dce819e463d33fbb4a51552c6c8ec04a9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: concurrent_expiryWrite: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/MultiThreadedTest.java"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"111d8d2cd7f419e6318e5e94daf4cb1ed943caafaa869d633be0a2b489a8e1fc"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: reference_equality: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/ReferenceTest.java"},"region":{"startLine":1686}}}],"partialFingerprints":{"codehealthFindingId/v1":"589d71f5670690d04c3eabba23b08988bad2173eae35c73638de535f9c248ece"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: disabledFuture_null: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/SchedulerTest.java"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4170ec3104a1603591e89ec628c296bc1c4d41f20b90fe26e1a05b5696aaa77d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: scheduler_null: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/SchedulerTest.java"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a6bd38fb8a58087a733be9e233a27806898f99a3f227db491cebaf2143ef4c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: advance_backwards: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/TimerWheelTest.java"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"123178a2ef7c8468115e98428c9d620e46ed550260af63a0f3aee925fc0cc01f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: advance_doesNotEvictFutureTimers: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/TimerWheelTest.java"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b824ed69a2b7b3f883a32f4d180e0bdf75e3793f62f0c345a9a4b56ea629c85e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: deschedule_fuzzy: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/test/java/com/github/benmanes/caffeine/cache/TimerWheelTest.java"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4af8197d9f4eaffbab4602194310108cba6c0e6b0da254de85fb72b322369b"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: coalescerThrows_keepsWriting: No conventional assertion call was detected, and 7 of 8 tests in \u0060writebehind-rxjava\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/write-behind-rxjava/src/test/java/com/github/benmanes/caffeine/examples/writebehind/rxjava/WriteBehindCacheWriterTest.java"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"280fe0472e56fd20d95817802250f4c6872a630c9c5147d92b6b26497e3c935e"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: emptyBatch_notDelivered: No conventional assertion call was detected, and 7 of 8 tests in \u0060writebehind-rxjava\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/write-behind-rxjava/src/test/java/com/github/benmanes/caffeine/examples/writebehind/rxjava/WriteBehindCacheWriterTest.java"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22edd0369ee952de7cd1242033931ce1606a80a782613de2e1614aecfa3ea5f"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: multipleKeys: No conventional assertion call was detected, and 7 of 8 tests in \u0060writebehind-rxjava\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/write-behind-rxjava/src/test/java/com/github/benmanes/caffeine/examples/writebehind/rxjava/WriteBehindCacheWriterTest.java"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e45959fbf5e389257cbda00d9039d34f9af5225f0ba3e17f2e410538ea42919"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: singleKey: No conventional assertion call was detected, and 7 of 8 tests in \u0060writebehind-rxjava\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/write-behind-rxjava/src/test/java/com/github/benmanes/caffeine/examples/writebehind/rxjava/WriteBehindCacheWriterTest.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed7dd3d985725793e124d9c4886941202bab1ec0fbd3f19ae6d9b6fcf060e76"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: singleKey_mostRecent: No conventional assertion call was detected, and 7 of 8 tests in \u0060writebehind-rxjava\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/write-behind-rxjava/src/test/java/com/github/benmanes/caffeine/examples/writebehind/rxjava/WriteBehindCacheWriterTest.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"754c9b5972e952555cd902f901ffc66ed35c741d8e47fa0f96e9ea7936b8cc60"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: writeActionThrowsError_keepsWriting: No conventional assertion call was detected, and 7 of 8 tests in \u0060writebehind-rxjava\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/write-behind-rxjava/src/test/java/com/github/benmanes/caffeine/examples/writebehind/rxjava/WriteBehindCacheWriterTest.java"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb940b217af0849e66390f344dc5b92c58cb954e5c727ea7e15877c00ff7709"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: writeActionThrows_keepsWriting: No conventional assertion call was detected, and 7 of 8 tests in \u0060writebehind-rxjava\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/write-behind-rxjava/src/test/java/com/github/benmanes/caffeine/examples/writebehind/rxjava/WriteBehindCacheWriterTest.java"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa0e28a0b2b4d5cb646f0c7f24f69cff60746128e25e39cf41ecd5a3b137eaa"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: reflectivelyConstruct: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"guava/src/test/java/com/github/benmanes/caffeine/guava/CaffeinatedGuavaTest.java"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1da68bd0d74c45e467b34d66748a796b1e1e50c0e5c6f18946e0aca957f584"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: reload_interrupted: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"guava/src/test/java/com/github/benmanes/caffeine/guava/CaffeinatedGuavaTest.java"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"6615c328535b99e177c0bf96eacb9bb1462fcf6db602e0a1c0455a8efda36608"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: reload_throwable: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"guava/src/test/java/com/github/benmanes/caffeine/guava/CaffeinatedGuavaTest.java"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30eb645c792a353eefbe5fc737ae97d444b0d7b644ea32f4d210361acc2ebdc"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: equality: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/test/java/com/github/benmanes/caffeine/jcache/configuration/JCacheConfigurationTest.java"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"421f31d30076a3ed56f166b4f4cde79f450fb42819646901cab0ebe05d3d2111"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: register_equality: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/test/java/com/github/benmanes/caffeine/jcache/event/EventDispatcherTest.java"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"2676b7feba3685e8be02b245842801ecae200bea3e794512f81fbbfe3e2db898"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: suppress: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/test/java/com/github/benmanes/caffeine/jcache/event/EventTypeAwareListenerTest.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f292f5382fba5bfbbb7ac1416c4935becedffe30ba62dae7879f97d549b2e1b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: equals: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/test/java/com/github/benmanes/caffeine/jcache/event/GuardedCacheEntryEventFilterTest.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"94366b1979a2f728ea53640b4b9dd877c47d252ed57451f8186171f3d7ac71bd"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: iterable: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/test/java/com/github/benmanes/caffeine/jcache/event/JCacheEntryEventTest.java"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8957c066ce9cc1209fe0c191979c88fcbd3747252ce98f1b554c42b281b84b2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: equals: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/test/java/com/github/benmanes/caffeine/jcache/expiry/JCacheExpiryPolicyTest.java"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"472d78200f193fff1c9b563c169b02b2efabc691d31f8104b9684f4b8485b93d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: equals_other: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/test/java/com/github/benmanes/caffeine/jcache/expiry/JCacheExpiryPolicyTest.java"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e74af169fa7b03a5d1d0a65953d189f4b0d76f7cfd32cd31dc001973afbf07d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: disabled: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/test/java/com/github/benmanes/caffeine/jcache/integration/CacheWriterTest.java"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"474afcf2ed88e54ea0c41084e4d00d2ee4c76014d1c8900d58095aa044f91adf"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: putAll_empty: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/test/java/com/github/benmanes/caffeine/jcache/integration/CacheWriterTest.java"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ad22731fc77f06fcc696a792e2eef42832fcff86a55f01a3a5b04a3d622f58"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: writeThroughDisabled_configuredWriter_neverCalled: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/test/java/com/github/benmanes/caffeine/jcache/integration/CacheWriterTest.java"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a77353695929dd5808d7f1f68ba77fcb7faa4a891bc4c6bbd840d4578256014"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: classLoader_readThrough_notRetained: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/test/java/com/github/benmanes/caffeine/jcache/CacheManagerTest.java"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1630d3988327ba0becf830e613baa8eac9cd573b89a2ea5a110bbeed65dbf9c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: enableManagement_disabled_doesNotTouchJmx: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/test/java/com/github/benmanes/caffeine/jcache/CacheProxyTest.java"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"92871b88eae1e076ba65e4c480e2ef194295ef6cb9afe2026603415a9cdbfa56"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: enableStatistics_disabled_doesNotTouchJmx: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/test/java/com/github/benmanes/caffeine/jcache/CacheProxyTest.java"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb80f67a3707747f42e0af221c91772990381164e126a63885983c9350947267"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: putAll_empty: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/test/java/com/github/benmanes/caffeine/jcache/CacheProxyTest.java"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f7c9fdefb4d4628bcd4db225b1114c8e0075989d6f0d237ae19b018f885765"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: org.openjdk.jol:jol-cli: \u0060org.openjdk.jol:jol-cli\u0060 0.17 is published on Maven Central under \u0060GPL-2.0\u0060, which this policy bans, and this repository declares it in a Maven or Gradle manifest. The licence was read from the artifact\u0027s POM \u0060\u003Clicenses\u003E\u0060 block \u2014 following \u0060\u003Cparent\u003E\u0060 where the POM inherits them \u2014 and normalised to SPDX before it was judged, because Maven publishes the name as free text (\u0060GNU Affero General Public License v3\u0060 is AGPL-3.0). Where a POM lists several licences they are read as a CHOICE, per Maven\u0027s own documentation, so this is charged only because EVERY listed licence is banned. Replace the dependency, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"287d1cc4ba158ab69b7f76acf221b8c6ce57413c30ffebc6e2dbeb1db67f8272"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: org.openjdk.jcstress:jcstress-core: \u0060org.openjdk.jcstress:jcstress-core\u0060 0.16 is published on Maven Central under \u0060GPL-2.0\u0060, which this policy bans, and this repository declares it in a Maven or Gradle manifest. The licence was read from the artifact\u0027s POM \u0060\u003Clicenses\u003E\u0060 block \u2014 following \u0060\u003Cparent\u003E\u0060 where the POM inherits them \u2014 and normalised to SPDX before it was judged, because Maven publishes the name as free text (\u0060GNU Affero General Public License v3\u0060 is AGPL-3.0). Where a POM lists several licences they are read as a CHOICE, per Maven\u0027s own documentation, so this is charged only because EVERY listed licence is banned. Replace the dependency, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cca2ec4b1336fadb332a5753c5625f9a5a1d7a31d4c6d87a1e724e64fed3c28f"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: org.openjdk.jmh:jmh-core: \u0060org.openjdk.jmh:jmh-core\u0060 1.37 is published on Maven Central under \u0060GPL-2.0\u0060, which this policy bans, and this repository declares it in a Maven or Gradle manifest. The licence was read from the artifact\u0027s POM \u0060\u003Clicenses\u003E\u0060 block \u2014 following \u0060\u003Cparent\u003E\u0060 where the POM inherits them \u2014 and normalised to SPDX before it was judged, because Maven publishes the name as free text (\u0060GNU Affero General Public License v3\u0060 is AGPL-3.0). Where a POM lists several licences they are read as a CHOICE, per Maven\u0027s own documentation, so this is charged only because EVERY listed licence is banned. Replace the dependency, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"01583a0c194289959e71817aaeaf053fd4437f5c0bc5d638a8da404c8765d84b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java: caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java changed 69 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in BoundedLocalCache.remap at line 3075. 13 of those changes were fix/bug commits, and the other 56 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 13:18:14 -07:00\u0027 --until=\u00272026-10-25 13:18:14 -07:00\u0027 --full-history --no-merges -- caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3075}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f765876ed128de6a9ed034118713d5cc616c397b2b589e7d3e0ea33c1466a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java: jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in CacheProxy.putAll at line 457. 7 of those changes were fix/bug commits, and the other 23 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 13:18:14 -07:00\u0027 --until=\u00272026-10-25 13:18:14 -07:00\u0027 --full-history --no-merges -- jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/CacheProxy.java"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"b020880910ae113efc50f6c8f58321e396c2fa6b798e0ee2f8567085fed53f24"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncLoadingCache.java: caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncLoadingCache.java changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LoadingCacheView.tryComputeRefresh at line 241. 4 of those changes were fix/bug commits, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 13:18:14 -07:00\u0027 --until=\u00272026-10-25 13:18:14 -07:00\u0027 --full-history --no-merges -- caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncLoadingCache.java\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncLoadingCache.java"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b138e1cbbce50854327e9eea5317bdad8ab89edc8257b1a04726a47559594e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .claude/skills/audit-regret/regret.py: .claude/skills/audit-regret/regret.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in regret.main at line 571. 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-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 13:18:14 -07:00\u0027 --until=\u00272026-10-25 13:18:14 -07:00\u0027 --full-history --no-merges -- .claude/skills/audit-regret/regret.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-regret/regret.py"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58429bfe35d528f4ca87a7ac1f9e5619cf470af4487e5fe45d9d37b0dcf66b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .claude/skills/climber-minimize/ablate.py: .claude/skills/climber-minimize/ablate.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ablate.summarize at line 78. 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-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 13:18:14 -07:00\u0027 --until=\u00272026-10-25 13:18:14 -07:00\u0027 --full-history --no-merges -- .claude/skills/climber-minimize/ablate.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-minimize/ablate.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38cb3a108894798fde030f77eee293cff3849a65388d891a59236ac72600f47"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalCache.java: caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalCache.java changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is LocalCache.notifyOnReplace at line 169), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Crestore coverage lost to recent fixes\u201D; \u201Cfix jcache audit triage\u201D; \u201Cenable jspecify experimental mode (fixes #2004)\u201D; \u201CResolve warnings in NullAway\u0027s JSpecifyExperimental setting (fixes #2004)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 13:18:14 -07:00\u0027 --until=\u00272026-10-25 13:18:14 -07:00\u0027 --full-history --no-merges -- caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalCache.java\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalCache.java"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"742919f51d5c9b928fa7b84459f622779e998217682ca67c2d9e6c8db9403cb4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: jcache/src/main/java/com/github/benmanes/caffeine/jcache/configuration/TypesafeConfigurator.java: jcache/src/main/java/com/github/benmanes/caffeine/jcache/configuration/TypesafeConfigurator.java changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is TypesafeConfigurator.resolveConfig at line 187), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix jcache audit triage\u201D; \u201Crestore coverage lost to recent fixes\u201D; \u201Cminor jcache fixes after audit sweep\u201D; \u201CFix minor defects found by an audit sweep\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 13:18:14 -07:00\u0027 --until=\u00272026-10-25 13:18:14 -07:00\u0027 --full-history --no-merges -- jcache/src/main/java/com/github/benmanes/caffeine/jcache/configuration/TypesafeConfigurator.java\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jcache/src/main/java/com/github/benmanes/caffeine/jcache/configuration/TypesafeConfigurator.java"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"af354d25b99b9ef8d13f6df9a0a30dfaed150dfa038b2695563ab81a72336b74"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/report/csv/CombinedCsvReport.java: simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/report/csv/CombinedCsvReport.java changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is CombinedCsvReport.tabulate at line 67), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix simulator issues found by the audit sweep\u201D; \u201CFix minor defects found by a review sweep\u201D; \u201CFix minor defects found by an audit sweep\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 13:18:14 -07:00\u0027 --until=\u00272026-10-25 13:18:14 -07:00\u0027 --full-history --no-merges -- simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/report/csv/CombinedCsvReport.java\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/report/csv/CombinedCsvReport.java"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e9bacff5df47503370c23a95832e2f1a82c0db2e72693a9117440030fadb54"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: guava/src/main/java/com/github/benmanes/caffeine/guava/CaffeinatedGuavaLoadingCache.java: guava/src/main/java/com/github/benmanes/caffeine/guava/CaffeinatedGuavaLoadingCache.java changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is CaffeinatedGuavaLoadingCache.getAll at line 95), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix issues found by the audit sweep\u201D; \u201CFix minor defects found by a review sweep\u201D; \u201CFix minor defects found by an audit sweep\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 13:18:14 -07:00\u0027 --until=\u00272026-10-25 13:18:14 -07:00\u0027 --full-history --no-merges -- guava/src/main/java/com/github/benmanes/caffeine/guava/CaffeinatedGuavaLoadingCache.java\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"guava/src/main/java/com/github/benmanes/caffeine/guava/CaffeinatedGuavaLoadingCache.java"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bf5aefe0e216878a23be754657071a9d565dc644961f77fc0cc34d2bccaf76"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/Simulator.java: simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/Simulator.java changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is Simulator.throwError at line 159), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cenable jspecify experimental mode (fixes #2004)\u201D; \u201Cfix simulator issues found by the audit sweep\u201D; \u201CFix minor defects found by a review sweep\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 13:18:14 -07:00\u0027 --until=\u00272026-10-25 13:18:14 -07:00\u0027 --full-history --no-merges -- simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/Simulator.java\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/Simulator.java"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"9621249ab727743a022de608f1d46e1c9b341099e8ddcb2b582964e4cf58ffb2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/ClairvoyantTraceReader.java: simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/ClairvoyantTraceReader.java changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is EventIterator.next at line 354), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix simulator issues found by the audit sweep\u201D; \u201CFix minor defects found by a review sweep\u201D; \u201CFix minor defects and refresh the build deps\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 13:18:14 -07:00\u0027 --until=\u00272026-10-25 13:18:14 -07:00\u0027 --full-history --no-merges -- simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/ClairvoyantTraceReader.java\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/ClairvoyantTraceReader.java"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3ba25f87dd9d4828dd79c7e8c89b312eb89ef92ce878b93f1b1d47ecd45418"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cpovirk): run tests in other thread instead of messing with main thread interrupt \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"guava/src/compatibilityTest/java/com/github/benmanes/caffeine/guava/CacheLoadingTest.java"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc03eb8f9a09873787acbc6430826f6fcff20257cccd396c0e5a2eeff986d65b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(user): Confirm with fry@ that this is a reasonable substitute. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"guava/src/compatibilityTest/java/com/github/benmanes/caffeine/guava/LocalLoadingCacheTest.java"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb0cb77dc66a0bb3f1438fa35c89aaa84f296b45fb01f00e727b9b543572ef5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add reliable support for WeakHashMap. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/openjdkTest/java/com/github/benmanes/caffeine/openjdk/collection/MOAT.java"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01038464f04fe0041b9bd69d807eff13a0db2abc50c4152c037494d630e9ae0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: many more removal methods \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/jsr166Test/java/com/github/benmanes/caffeine/jsr166/Collection8Test.java"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"df213a0e2b87d6efa6d2b831c13c5127a504367bd8a6b9bfeb538828e2f60b54"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: many more removal methods \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/jsr166Test/java/com/github/benmanes/caffeine/jsr166/Collection8Test.java"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d0b7eda3c206f91416f242df318c546b2f37aa35ddb2080f3d50611b54100b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: tests with null values \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/eclipseTest/java/com/github/benmanes/caffeine/eclipse/acceptance/UnifiedMapAcceptanceTest.java"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e234543b83e30d107f03328421183bd07002c600b2c43c10ddc171ff997046"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: keyset.removeAll(some collection where one of the keys is associated with null in the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/eclipseTest/java/com/github/benmanes/caffeine/eclipse/acceptance/UnifiedMapAcceptanceTest.java"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd74c433d8145e04f845e0e9e070a5c7cca8d9b236b5ce330b705b369b69066"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: entryset.add(key associated with null) == true \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/eclipseTest/java/com/github/benmanes/caffeine/eclipse/acceptance/UnifiedMapAcceptanceTest.java"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"64443d2242ac0ee2023bbb8040b24644f64d845b412ccd4706ff5ca6ebcc6942"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: entryset.contains(entry with null value) == true \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/eclipseTest/java/com/github/benmanes/caffeine/eclipse/acceptance/UnifiedMapAcceptanceTest.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7a03ac221866109d778a229d3dbcb65f8d6f3b6fbba0cf8f05a72245bb335b"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060simulator/build.gradle.kts\u0060 makes this repository a deployable product (line 8)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/build.gradle.kts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdda02f6a35b4228efeaad33264a836e9ae3c0731dcbfefd8fe7fdf10307e62c"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 6 project(s) overshoot their size bounds, lowering Project Cohesion to 6.7/10. The most over is \u0060simulator\u0060 (21489 LoC, 200 module-visible types across 63 directories). Review these for cohesion \u2014 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0ede2d2117d56efd7c29cb3ae72d60d6c1f783b063cc5260801929f58c427fa7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ff63c66538a807ad43773c5415f6b077fa0d249dbd115093ebc5b01a83a9927"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b95605b80a8952aedce50c1cd8d580840bfce0e45efd8ff36d4eb5e1fad6db5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e8f430954cde2032bcda734c5bcb4f2fe916282b78a57897e9efeb3e32336abf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2f73dd04e1260cfc967671d8e2be22171028542989aebd5c426c2070c1cf273d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dca4fd4771554ce4ce6d240c45cbf9cb397201f534834979cbd2f10059f78d55"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd746b5f2f0e3593cea4027b7ed890f7424e3567f70ff92e51ee998711ca3916"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"481f12bfedd31f5c0c57c328b18d260c89637af92229bbca5bd2aedf40a5d767"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95cb15eec190e6e48cafed35dfab23b5f53af9699b096a071b3ac21d9a07ab22"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbc0a6fdb1857eaec31fb2f365919c5ac4488af2a913df48879664385d448477"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc2f995d1beaaecc97431ba605e06c87e587b6a85de0c3ced18c6d69245ef6e7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"68437c76d0f20f61d84548458874337d44a9eee84e399ee877da03098589789d"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee6fe4db683eeb90935ad3bd5499654aacf9bc1cb68e47df1458236b0297ab31"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5019c0e80b0c36835490896bf87a854a11c17f98ef01a5116ef35edfd85637a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"70683ec56cccab1d89999a47d3d4cf057dbeb67b035c400eb2b1f8b2d6c4750b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bcc60520abe061cdb5130cf4f6224188e429315eeb32698edced308a049ee5ef"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eadfd5bc04f9aeed5c33c3a068442ff45d0eab2a89fa94530a36f15cfea28791"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"849980825f44e1ae370dc91be7b5d7724f7c5c119ecbe25a73087af33a143fed"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4990297dea15651cf8992ad5f99c25f3f88017d64f983b14a6a81fa15bb3367"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b7cc1f41f3dab769a33ca301bd71906432b577e6a3708c9474b91cf447f6c006"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a72504b97c587f18024ea57c6f495bc1f6f15d0e351a13972e1ac58adb96d55e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89e356713f08610d6cd7ec4d0a111af018d5d2aa5d9d9f525bd7bfad674a725f"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"556be188fa5fb845debaba1f85305ceb2a2350dbce12ccd3c92acdca2ff7b0ec"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a411b793e9de3f94d219b9b33b4b3b6cf9b4cf949d869b3ceb1ef11efae4df8"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0dc6fcd0853e98f186b4375d9f38e6de9f4c64f34b59d2478cfa24d40a6b01c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"12dad626d335e02cae78324860c23ac59f020a07574d8a6af8c92f08a2af1b4f"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a4a5bda3d8e72415f400488d9da11f4f9e2aa2ec7b7ecc0e2e4233a71530d42"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da3a5835cd3fdea9caadd489285d4d049f3e7f0427c6a5f200ed11a8db02705b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"23eebc217e0d4150688d51f02a40c500a433aa11815b8ac9afc9a27af0ae848e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c5b0f5e52bac19790a7e81fb343889a4ebc27fc7d7ce9e470c67e20597b64bf"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ca63a85de86594d1447ff381dab5e6929a857c87b92efef97ca212b38871d26"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"157287d0747466dce4a5713a699e88c93e28871dac724616302729755ec97e62"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c748e65d16b17efaad64e52feb287e69e607cce76d083af204468147507f90df"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95b5e141c60d7bad0731636809dffc6674ca8f625a095029d523ea39d4f53aae"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"39758c41e0adbaae9f54b7ec81951da41710eb1be545b10f48ae1f5af0eae5f3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74b3fe6d8dd0e945b887d06e6b2f679fdf8b1c8ca13ea26b9b75a16d3637f8c8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4626370d9ca865c0771d2d548e8d0588f00017440c15d712b5cb14c1963a4a41"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed59ec88d189e90dbb9c1ebacce1d42b6697e3238c56307a3372bd8c30f1bfaa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"071ef8c12b2ce99d7baefca8ce6ea7acafb8149aa4c36e0d3d0cc43a613307d2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"52a05da81d2699a9b88209a237c922fcf2d8bde332de33b2c17fef28ae934847"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f5b8a78cc504d4dd5ebb9006e3bf3fc3388163dfe3b06943f77765baf077bd2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"522703a8687c350cc3f9e96d26a659c1464c9f790847f7a45019ca6a9f261e63"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b2555b12a04a2f7359911c82cab9fb5bd95ccd30cd639899c71d46da87bdc09b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c60ff0b953a9eefd7d4306c9785c40d82964142614e55ec2c976b9d13e55e8ec"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"26f267db95828a15f0d94f47a6ce4e747bb655ea963d6939134e91b9c6f05de8"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"66305d7e081bb2cdf3d9c379b3418fece06dde51c5a2ad98ef76351ebce3b493"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e920d4b8ce8d67f0300a380452ddaf0a5cdf40612126d424a0e8742892e1f7b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d1fe84649190ea857d1a5f307e84ecd971198b1cd4f80d2a58125d1706bbc31e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dba927414de41caf49b6dcca7202ba1732d74d6b91a1f9e35e276243797dc1bd"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce42fcadfe5fba998e3b27a685709b05f30f7976da93596248b0f09561e36e6a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6ef2f316ca631b692d03c475bed7e473e93f3db6fa35d9ef86248c50808e234"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d6bfa84f27111b096b516029e3a66e103fc999aa3a181bf03dbc8897282116d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e920da19034a7b32c9f93be00c435df3b91bf8c3abb6695b3b4f68cb8776bd2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0379ac24b2ae6e966fad407fe06a664a331ccc5e3a590ec3d337a2be18167288"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b20f83d23f4695f98880b33735743cc9988df54ab987406c2cdfe0543b685d67"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a7f7b77c97c63bc5c736b67e7a1a4d3fc75191b72f414d580cd2b4be145dce2b"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0dd33c3be8b907c5bc37aa67c753b1f03a86eaba61d2c82f835538eaa2ff45fa"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"31844b626327370ec9855bbcef174f67b81d780219f553d9f815f941dc2cd779"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8eaf486cce3f8a8e2880516c79f69437ce8aa7bfe8a48056113416d07d868d56"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7899349ea1dd012f9a796d6f80bb1138d1a266f39753a5a710ea78ad959269b6"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e838e2ceeb536f8c74af0a667d067642f67c2745060f2e6e5119e0cf4eefed1a"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"707e4f9bac5ccd8f04705b1720f22cdea7b3f902d4a617c0944320f100b84022"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d3ae311135e7333cc11247094d6f66b1738f9066dd3b44f0a67bc8d1fe105c5e"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fce1e3ba9052f8b900679cad5c4d5b4b88a3c59ca820418b098c168df85c2a25"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"18f736050212af3a9c97329b2eb300e507b0d11e9e0ae82ece3113633acf4335"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b3f4320c0e8e3f11b9667420d9ffd7f6a082b69cebb0756afe2cd548664e024"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8180ded25a79ad01b70a7f4977b9630dbe08d24cdc52b46ea8726193ea17ddfa"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd43b2737187124857b874764b22e2a9ba55d9be0639c60dad2a0e087434e460"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c04d77737ff8cff9642d4f2c95cf79ac2142a5c2e24607968461b95a9bda0625"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9359294dca31f4eb6141e0a9f970ca6f99b09998f04b7d7b4e1662872e7b67a5"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af8758cc740e137c02e5e9de71f06fbf35580f300faa0aa08fa150d572123bfc"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6ffc404136397f96c9f0b50141bd09a3da11b9692d89863765d01b7d547feac"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45f80660d35292258a27c8af7b7cdde4fbd674b4a10e7c1145da14037e0c1530"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b4263d9b751db4f58a1e3188713664812260d74c7437cf264e98ef12c287895"},"taxa":[{"id":"CWE-330","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e662449c99f938a86d5bff1604a5c87d77a0e15a8c3ff23ddc67d1768551c04e"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe274ba5adebde25ca0b3db842e44cbb1aaeb7cfecfbb7215cd452596ba1f4c2"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wiki/adaptive-window.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f73187b8de50cc1ee12b5cf598394b49018f5c980c5e6265bada5ba1089c89"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/openjdkTest/java/com/github/benmanes/caffeine/openjdk/map/InPlaceOpsCollisions.java"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b794739ec5157f48bd025ae93681ccd77fb66bb0dda8fd952a94bb125b0d08"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/openjdkTest/java/com/github/benmanes/caffeine/openjdk/map/InPlaceOpsCollisions.java"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"02957e7404f256cc39aa125ec9274b0e457f6fa6b23d2cb9aed480834a9b1872"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: .github/actions/spelling/README.md links to \u0060dictionary.txt\u0060, but \u0060.github/actions/spelling/dictionary.txt\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/spelling/README.md"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a46eb70b9b7e07f2e3d460cdb6775aceefc0dda7d4e861ab87604ed7b60eade"}},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P4","level":"warning","message":{"text":"No deployment automation: No release automation was found in CI \u2014 neither a deploy stage (Helm/Kubernetes/compose manifests, an orchestrated rollout) nor a publish job that ships the built artifact. Releases appear to be run by hand, which is slower, less repeatable and harder to reverse."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7a7f38718309412c2d2c2c0663260a3d160de9a5a60f3915755be16386d3f1e8"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by Hibernate ddl-auto (no migration path): Hibernate ddl-auto builds the schema from the model at startup and keeps no migration history, so there is no reviewed, repeatable upgrade path for an existing production database \u2014 a renamed column is dropped and re-added rather than migrated. Adopt Flyway or Liquibase, with \u0060ddl-auto\u0060 set to \u0060validate\u0060, so every schema change is a versioned file applied the same way in every environment."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/hibernate/src/main/resources/hibernate.properties"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63bfd151d54613d426abee31df7c0a3bbea139793268c0c763192bcaf2fb58d"}},{"ruleId":"PF1","level":"note","message":{"text":"Benchmarks don\u0027t track allocations: A JMH/Jetpack Benchmark suite exists but nothing turns on its allocation measurement \u2014 allocations (the main way hot code pressures a garbage collector or allocator) aren\u0027t being measured."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/jmh/java/com/github/benmanes/caffeine/DelegationBenchmark.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1d5abacc3e17e3675ab9dcc84812d05e56fafab5c309745e1c3aeb3e265e0c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!(error instanceof CancellationException) \u0026\u0026 !(error instanceof TimeoutException)\u0060 appears character-identically in 3 files \u2014 caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java, caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncLoadingCache.java, caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalLoadingCache.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac02f89896acb0c6863062e95405ca4f985cd8dc1ffb3c8a2be807cefd993c2a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!candidate.isInClock() || !candidate.isInTest()\u0060 appears character-identically in 2 files \u2014 simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java, simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a01134691e4bd90c377063615977eaa98cb22c2ce71c8cc15f1ed34f249b7a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!collection.contains(entry) \u0026\u0026 remove(entry)\u0060 appears character-identically in 3 files \u2014 caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java, caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java, caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4161}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e0643b681807f741b41161233dc1c52f0d9bbde7350da40b1e79993acea430"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!collection.contains(key) \u0026\u0026 remove(key)\u0060 appears character-identically in 2 files \u2014 caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java, caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":3739}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfaff016ca0a3f6345b2638bdd9e35b2e0c01f5b1126fc0c2ada7e760ec4f47"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(bottom == headMain) || (bottom.status == Status.MAIN)\u0060 appears character-identically in 3 files \u2014 simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java, simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/HillClimberFrdPolicy.java, simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/IndicatorFrdPolicy.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/FrdPolicy.java"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da2d58f97631fd767d50eba038a823d861caec81102a1addc71b69f08905919"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(key != null) \u0026\u0026 cache.remove(key, entry.getValue())\u0060 appears character-identically in 2 files \u2014 caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java, caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4138}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f5d27d219bf322dfe030af46ebaaf07de83d7f09b528f822d9d9a0f2aa283e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(minResColdSize \u003E= 1) \u0026\u0026 (minResColdSize \u003C= maxResColdSize)\u0060 appears character-identically in 2 files \u2014 simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java, simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78d7156cbf4463145864d82ce3c70d9fc3f70d216b9d147511f7b33d7d86f06"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(node != null) \u0026\u0026 ((node.type == QueueType.B1) || (node.type == QueueType.B2))\u0060 appears character-identically in 2 files \u2014 simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java, simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CartPolicy.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1335adb8bb1c5664fb63771e9cfcd393531fd87ddfd68475a5914688214a17b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(node != null) \u0026\u0026 ((node.type == QueueType.T1) || (node.type == QueueType.T2))\u0060 appears character-identically in 2 files \u2014 simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java, simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CartPolicy.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/adaptive/CarPolicy.java"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09c845d37f8bb330bda3b4637259f47852e2baf0f047a16715dd26583119864"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(oldValueFuture != null) \u0026\u0026 !oldValueFuture.isDone()\u0060 appears character-identically in 2 files \u2014 caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java, caffeine/src/main/java/com/github/benmanes/caffeine/cache/LocalAsyncCache.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4834}}}],"partialFingerprints":{"codehealthFindingId/v1":"747dc1ecf299d7b9b56424403ab35e8a8fc4617e5ba5b3ccb0214a1c2c1859f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(parser.currentToken() == JsonToken.FIELD_NAME) \u0026\u0026 Objects.equals(parser.currentName(), \u0022hash_ids\u0022)\u0060 appears character-identically in 2 files \u2014 simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/kvcache/BailianTraceReader.java, simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/kvcache/MooncakeTraceReader.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/parser/kvcache/BailianTraceReader.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"537375ae2674783158fa4ccadfc3f14e21b3bd1eba06f41148c1b08dee1b0c5e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(refreshes == null) || refreshes.isEmpty()\u0060 appears character-identically in 2 files \u2014 caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java, caffeine/src/main/java/com/github/benmanes/caffeine/cache/UnboundedLocalCache.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/main/java/com/github/benmanes/caffeine/cache/BoundedLocalCache.java"},"region":{"startLine":4440}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec6b8b96b8ac768ed7fa64ad27c855f29474f9989815a6ec2f4acbca43c7303"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(table != null) \u0026\u0026 (table.length \u003E= maximum)\u0060 appears character-identically in 3 files \u2014 caffeine/src/jmh/java/com/github/benmanes/caffeine/cache/sketch/CountMinSketch.java, caffeine/src/main/java/com/github/benmanes/caffeine/cache/FrequencySketch.java, simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/admission/countmin4/CountMin4.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"caffeine/src/jmh/java/com/github/benmanes/caffeine/cache/sketch/CountMinSketch.java"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d68c3157edb6983d279fe469237c9995970e77fefae244b7ba29f60bfb3b63d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060handCold.marked \u0026\u0026 (coldHand == ColdHand.RESET)\u0060 appears character-identically in 2 files \u2014 simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java, simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0baf638c5e5f5438322bb5d5cdce05b15bcf5cfce73803174db472dcf28f4133"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isResidentCold() || status == Status.COLD_NON_RES\u0060 appears character-identically in 2 files \u2014 simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java, simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df4fac1145df7fea2c0e05efa60897c8340c846896afb1c6aa7b8124822a29e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isResidentCold() || status == Status.HOT\u0060 appears character-identically in 2 files \u2014 simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java, simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c5ba9ac9a4d00c8b7fe1d6cb398ba45cd5da23527960fed5c11ea4f759ad9f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status == Status.COLD_RES || status == Status.COLD_RES_IN_TEST\u0060 appears character-identically in 2 files \u2014 simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java, simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d82c75423c5e6f34d8cc3b6fee43f287b9b0d210189afb94ed78c9d0ffb2e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status == Status.COLD_RES_IN_TEST || status == Status.COLD_NON_RES\u0060 appears character-identically in 2 files \u2014 simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java, simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPolicy.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"simulator/src/main/java/com/github/benmanes/caffeine/cache/simulator/policy/irr/ClockProPlusPolicy.java"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5b619373803bb03ab8e01c63e835d157c682c2b9b5deb11ba8d76e5f1fe5b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(candidate.group in ignoredGroups) \u0026\u0026 (candidate.version != currentVersion)\u0060 appears character-identically in 2 files \u2014 gradle/plugins/build.gradle.kts, gradle/plugins/src/main/kotlin/lifecycle/versions.caffeine.gradle.kts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gradle/plugins/build.gradle.kts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6c0d21a8cc027e8f64cee020926690b27196f8844b6df414072d42d4c1033c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(sys.argv) != 3 or sys.argv[1] not in (\u0022apply\u0022, \u0022verify\u0022, \u0022strip\u0022)\u0060 appears character-identically in 2 files \u2014 .claude/skills/climber-gate/admission_harness.py, .claude/skills/climber-gate/harness.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/admission_harness.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"386075686f40c053696f724933ffc832425e7a8fae34d10a920d72761f0eae30"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060seed \u003C JAVA_LONG_MIN or seed \u003E JAVA_LONG_MAX\u0060 appears character-identically in 2 files \u2014 .claude/skills/climber-gate/pair.py, .claude/skills/climber-gate/run.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/climber-gate/pair.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"919883a5c61626261582572997b033294230e4a7e7abf34754c178256a6537bf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060count_unverified_errors\u0060 returns \u00600\u0060 when \u0060(ValueError, OSError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/audit-temporal-walk/run.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2bd3b9a4e776f1928319f415a2538269f746b1fa3dc3af0dea0ef2975a1af0"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.html"},{"id":"CWE-330","guid":"f811ddf9-2e54-865b-9c76-f97905849790","name":"Use of Insufficiently Random Values","shortDescription":{"text":"Use of Insufficiently Random Values"},"helpUri":"https://cwe.mitre.org/data/definitions/330.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-502","guid":"f7d3b296-aac0-5c5a-b706-e07faba26c36","name":"Deserialization of Untrusted Data","shortDescription":{"text":"Deserialization of Untrusted Data"},"helpUri":"https://cwe.mitre.org/data/definitions/502.html"},{"id":"CWE-676","guid":"550e6fab-2881-3252-8a05-c688a6b19c14","name":"Use of Potentially Dangerous Function","shortDescription":{"text":"Use of Potentially Dangerous Function"},"helpUri":"https://cwe.mitre.org/data/definitions/676.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":78,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}