{"$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":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"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":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"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"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"]}},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"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":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"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":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"PathKt.toPath (cyclomatic 25): PathKt.toPath 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":"okio/src/commonMain/kotlin/okio/internal/Path.kt"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"e839c5a3552ad7b3101929986ac1e6bca038143356fabf632ff4a4a46777cae7"}},{"ruleId":"D1","level":"warning","message":{"text":"ZipFilesKt.readCentralDirectoryZipEntry (cyclomatic 20): ZipFilesKt.readCentralDirectoryZipEntry 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":"okio/src/zlibMain/kotlin/okio/internal/ZipFiles.kt"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02da12261e94189948a1fae1bb1b36fc5cfc7de3d1bac01bac84a1ba7436140"}},{"ruleId":"D1","level":"warning","message":{"text":"Base64Kt.decodeBase64ToArray (cyclomatic 19): Base64Kt.decodeBase64ToArray 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":"okio/src/commonMain/kotlin/okio/Base64.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"240c3bff03aff3f3ace5dfb477d81ed844929ff336681e36e9e9175120e8fe30"}},{"ruleId":"D1","level":"warning","message":{"text":"BufferKt.selectPrefix (cyclomatic 19): BufferKt.selectPrefix 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":"okio/src/commonMain/kotlin/okio/internal/Buffer.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"68418f7a908a1f62b36966d81dbb9671585b13b212422489f8b1bf37556c2272"}},{"ruleId":"D1","level":"warning","message":{"text":"BufferKt.commonReadDecimalLong (cyclomatic 19): BufferKt.commonReadDecimalLong 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":"okio/src/commonMain/kotlin/okio/internal/Buffer.kt"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"361800930e72844decf12952dc6e596b1db51f4fef73ff09482087c4acc2719b"}},{"ruleId":"D1","level":"warning","message":{"text":"Options.buildTrieRecursive (cyclomatic 18): Options.buildTrieRecursive 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":"okio/src/commonMain/kotlin/okio/Options.kt"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"500778e93d5cf839492bceda897c0128a2601b083303cdaf8acd3bd0f3186473"}},{"ruleId":"D2","level":"warning","message":{"text":"BufferKt.selectPrefix (cognitive 65): BufferKt.selectPrefix has cognitive complexity 65 (threshold 15). Drivers by points: if/else 15 (56 pts), loops 3 (9 pts) (nesting depth added 47). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: okio/src/commonMain/kotlin/okio/internal/Buffer.kt holds 7 of the 17 methods over the threshold \u2014 including the worst \u2014 and 89 of the 167 points over it (53%), 3.6\u00D7 the next-largest file (okio/src/zlibMain/kotlin/okio/internal/ZipFiles.kt at 25). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/commonMain/kotlin/okio/internal/Buffer.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"729c4d5b1b022946cbca9b50ab10bf649bd3ba09447d0dac6ce3a56ef9a4aba1"}},{"ruleId":"D2","level":"warning","message":{"text":"PathKt.toPath (cognitive 37): PathKt.toPath has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 8, loops 3, match/switch 1 (3 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":"okio/src/commonMain/kotlin/okio/internal/Path.kt"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8278715e6b4003b6d5a99bc8360e365bd6af655b6ffbcb3098277087524acb"}},{"ruleId":"D2","level":"warning","message":{"text":"Options.buildTrieRecursive (cognitive 36): Options.buildTrieRecursive has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 7 (14 pts), boolean chains 2 (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":"okio/src/commonMain/kotlin/okio/Options.kt"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc1bcc5c947d24fdf26779c90f3aabcb743c0666d31bff279441b62007b780c"}},{"ruleId":"D2","level":"warning","message":{"text":"BufferKt.commonReadDecimalLong (cognitive 31): BufferKt.commonReadDecimalLong has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 5, loops 2 (3 pts) (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: okio/src/commonMain/kotlin/okio/internal/Buffer.kt holds 7 of the 17 methods over the threshold \u2014 including the worst \u2014 and 89 of the 167 points over it (53%), 3.6\u00D7 the next-largest file (okio/src/zlibMain/kotlin/okio/internal/ZipFiles.kt at 25). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/commonMain/kotlin/okio/internal/Buffer.kt"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"645bf6b2e47f32f67d278e58c1ca971ce23e42b12c5497e45e5f8c8d076732f9"}},{"ruleId":"D2","level":"warning","message":{"text":"ZipFilesKt.readCentralDirectoryZipEntry (cognitive 29): ZipFilesKt.readCentralDirectoryZipEntry has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (25 pts), match/switch 2 (3 pts), boolean chains 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":"okio/src/zlibMain/kotlin/okio/internal/ZipFiles.kt"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b046a6e1e9a5ba5ed6b71b977ba6077d2d2291ce15f07e54ce54f80fb465d4"}},{"ruleId":"D2","level":"warning","message":{"text":"BufferKt.commonIndexOfElement (cognitive 25): BufferKt.commonIndexOfElement has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 3 (10 pts), boolean chains 1 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This file is where this pass\u0027s cognitive complexity CONCENTRATES: okio/src/commonMain/kotlin/okio/internal/Buffer.kt holds 7 of the 17 methods over the threshold \u2014 including the worst \u2014 and 89 of the 167 points over it (53%), 3.6\u00D7 the next-largest file (okio/src/zlibMain/kotlin/okio/internal/ZipFiles.kt at 25). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/commonMain/kotlin/okio/internal/Buffer.kt"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a77399e036ed524ca054116461cbadf25b29c496c72e3b9c8d4a85222ec617"}},{"ruleId":"D2","level":"warning","message":{"text":"BufferKt.commonReadHexadecimalUnsignedLong (cognitive 24): BufferKt.commonReadHexadecimalUnsignedLong has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, loops 2 (3 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: okio/src/commonMain/kotlin/okio/internal/Buffer.kt holds 7 of the 17 methods over the threshold \u2014 including the worst \u2014 and 89 of the 167 points over it (53%), 3.6\u00D7 the next-largest file (okio/src/zlibMain/kotlin/okio/internal/ZipFiles.kt at 25). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/commonMain/kotlin/okio/internal/Buffer.kt"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"521006dc49c34017c407367a2e09eb703ad582fbf3ebbee28fcb9166453f0bd8"}},{"ruleId":"D2","level":"warning","message":{"text":"ZipFilesKt.openZip (cognitive 21): ZipFilesKt.openZip has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2, 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":"okio/src/zlibMain/kotlin/okio/internal/ZipFiles.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff95945f9ae8c42a26ad33c0a452731c74447452e70e3eb221a415e2746efd0"}},{"ruleId":"D2","level":"warning","message":{"text":"ZipFilesKt.readOrSkipLocalHeader (cognitive 20): ZipFilesKt.readOrSkipLocalHeader has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 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":"okio/src/zlibMain/kotlin/okio/internal/ZipFiles.kt"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e94e1f934015d419f14845cb89aecb07cb58670160c732fd6f12557812764b"}},{"ruleId":"D2","level":"warning","message":{"text":"Base64Kt.decodeBase64ToArray (cognitive 19): Base64Kt.decodeBase64ToArray has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, loops 2, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/commonMain/kotlin/okio/Base64.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e85625f8b8ef7855b2aa6977034c33431753e8cc4e0e251353daca87b315e63"}},{"ruleId":"D2","level":"warning","message":{"text":"Utf8Kt.utf8Size (cognitive 17): Utf8Kt.utf8Size has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 2, 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":"okio/src/commonMain/kotlin/okio/Utf8.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e318191731a052815669dcf8768f54c34fd2f674d73bcf9f69b129bed8b0c3e"}},{"ruleId":"D2","level":"warning","message":{"text":"BufferKt.commonWriteUtf8 (cognitive 17): BufferKt.commonWriteUtf8 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), match/switch 1 (2 pts) (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: okio/src/commonMain/kotlin/okio/internal/Buffer.kt holds 7 of the 17 methods over the threshold \u2014 including the worst \u2014 and 89 of the 167 points over it (53%), 3.6\u00D7 the next-largest file (okio/src/zlibMain/kotlin/okio/internal/ZipFiles.kt at 25). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/commonMain/kotlin/okio/internal/Buffer.kt"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"240078bcd3d57c74f24bd077eba6b3cd0c42f7119861b313c57d94e4e247d6d7"}},{"ruleId":"D2","level":"warning","message":{"text":"GzipSource.consumeHeader (cognitive 17): GzipSource.consumeHeader has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (17 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":"okio/src/zlibMain/kotlin/okio/GzipSource.kt"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0639f1922394b8c28403ed7d9328954a0b0009287eaf3316220f4e5eb6b2dbe8"}},{"ruleId":"D2","level":"warning","message":{"text":"BufferKt.commonWrite (cognitive 16): BufferKt.commonWrite has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 1, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: okio/src/commonMain/kotlin/okio/internal/Buffer.kt holds 7 of the 17 methods over the threshold \u2014 including the worst \u2014 and 89 of the 167 points over it (53%), 3.6\u00D7 the next-largest file (okio/src/zlibMain/kotlin/okio/internal/ZipFiles.kt at 25). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/commonMain/kotlin/okio/internal/Buffer.kt"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87b165f9a3ab27decabf7221dd60284246f70b8085884257411436a8ad24388"}},{"ruleId":"D2","level":"warning","message":{"text":"BufferKt.commonSeek (cognitive 16): BufferKt.commonSeek has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 2 (4 pts), boolean chains 3 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: okio/src/commonMain/kotlin/okio/internal/Buffer.kt holds 7 of the 17 methods over the threshold \u2014 including the worst \u2014 and 89 of the 167 points over it (53%), 3.6\u00D7 the next-largest file (okio/src/zlibMain/kotlin/okio/internal/ZipFiles.kt at 25). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/commonMain/kotlin/okio/internal/Buffer.kt"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a08ca29a501d2d6ef101501f7a935bb0a02397c28e0b5cc96811875f1f72b35"}},{"ruleId":"D2","level":"warning","message":{"text":"RealBufferedSource.inputStream (cognitive 16): RealBufferedSource.inputStream has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), 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":"okio/src/jvmMain/kotlin/okio/RealBufferedSource.kt"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"997c39dae00dd3e2e8c6f2abf29fcd0a79cc50afda77fe840cbebf7891ee3956"}},{"ruleId":"D2","level":"warning","message":{"text":"FakeFileSystem.open (cognitive 16): FakeFileSystem.open has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 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":"okio-fakefilesystem/src/commonMain/kotlin/okio/fakefilesystem/FakeFileSystem.kt"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"8545b5d7fc6a2688618f345a4f1d45891395628656c3f571c2c0a10bb5a1262c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Buffer: TooManyMethods \u2014 108 methods. The bar is 30 methods; this is 78 over it, 3.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":"okio/src/jvmMain/kotlin/okio/Buffer.kt"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ccd2e5e74b5933861c8e9af62ece4a7edb195cc7459f97cf5df5f9a9d73fcb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Buffer: TooManyMethods \u2014 89 methods. The bar is 30 methods; this is 59 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":"okio/src/nonJvmMain/kotlin/okio/Buffer.kt"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f752361d991b4b10ac40d58e089abeb171e0f0085f14f2596626ad63f17e67f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Buffer: TooManyMethods \u2014 85 methods. The bar is 30 methods; this is 55 over it, 2.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":"okio/src/commonMain/kotlin/okio/Buffer.kt"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"07307052344585b64c81476cd015db111874c60922757d2675afa8e131254b90"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internal/Buffer.kt: FileTooLong \u2014 1087 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 587 over it, 2.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":"okio/src/commonMain/kotlin/okio/internal/Buffer.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39d4606db93bb9f21745758020b84230a2403d871659f1a407a74f924229b19"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ByteString.\u003Cinit\u003E: MethodTooLong \u2014 \u003Cinit\u003E runs 208 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 108 over it, 2.08\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":"okio/src/jvmMain/kotlin/okio/ByteString.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0744bb8c47b17729ff4990ac1fbb66738426e6b9c3dcce7cf3271efe8ee8cd7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RealBufferedSource: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\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":"okio/src/jvmMain/kotlin/okio/RealBufferedSource.kt"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b5927c488b877ee71156d83b379db68fee6c9a31f36018e065c5fea56e9192"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ByteString: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\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":"okio/src/jvmMain/kotlin/okio/ByteString.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7ecd0b9afbda3014bb553052a0557c38fc385048f2ac829def531e8cdc2247"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RealBufferedSource: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\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":"okio/src/nonJvmMain/kotlin/okio/RealBufferedSource.kt"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdc106fa1dfa2a0ad7c6bc571e1262575a27c2a9968cd2a32754fbe59d80c15"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RealBufferedSource: 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":"okio/src/commonMain/kotlin/okio/RealBufferedSource.kt"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40f85515c17129a723a8e7aedb764a11922b819974707d09ddad182a8699c48"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ByteString: 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":"okio/src/appleMain/kotlin/okio/ByteString.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b88e894703ce1a81094ceda7ccfd9579055fbb127a098dd3cf52cba6bc2181"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ByteString: 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":"okio/src/nonAppleMain/kotlin/okio/ByteString.kt"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"88489dc2192c6de35565056c5ba5589c5aacaa65b51f8d26065a25950c8cddbd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ByteString: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\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":"okio/src/commonMain/kotlin/okio/ByteString.kt"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53af310f095fcfc38b635eaefdab8a8133f3434040cb2fbec9869813b0e273b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RealBufferedSink: 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":"okio/src/jvmMain/kotlin/okio/RealBufferedSink.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78dd1f488e83b665b4743a17d66032811e39ead752d89ee6373151da302d7bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): okio/src/hashFunctions/kotlin/okio/internal/Md5.kt:35-72 | okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt:36-73 | okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:39-76 | okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:39-76 \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":"okio/src/hashFunctions/kotlin/okio/internal/Md5.kt"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd82c2c596a95a7675666c09c7a56772c5ac5779142bfffae9644a81e340600"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): okio/src/hashFunctions/kotlin/okio/internal/Md5.kt:140-184 | okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt:136-189 | okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:153-221 | okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:148-248 \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":"okio/src/hashFunctions/kotlin/okio/internal/Md5.kt"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1095171b97c3a0b6ce6456e93a53cce7479ea32a747b721ddc0c757dff0b34ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 4): okio/src/hashFunctions/kotlin/okio/internal/Md5.kt:36-72 | okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt:37-73 | okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:40-76 | okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:40-76 \u2014 before extracting anything, compare \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 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":"okio/src/hashFunctions/kotlin/okio/internal/Md5.kt"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"620b0ccf590256384ebb7a0a993bf04be125eb222d78f9300b2f39c00a1fcddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201327 lines \u00D7 2): okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:124-150 | okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:122-145 \u2014 before extracting anything, compare \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 183 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 \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:124\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 \u0060words\u0060 to \u0060IntArray\u0060 in one and \u0060LongArray\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":"okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"062c88c7b8462a736c08acf4e157d6698cae8f77ddd8baa3f668b0469edbd06c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): okio/src/commonMain/kotlin/okio/internal/ByteString.kt:74-97 | okio/src/commonMain/kotlin/okio/internal/ByteString.kt:102-125 \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":"okio/src/commonMain/kotlin/okio/internal/ByteString.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4441abbfa95fe081488ec9a8e21181ed5b45be337ea0d7d034975c33a5fc95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt:165-187 | okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:185-206 \u2014 before extracting anything, compare \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 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 \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt:165\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":"okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e81f0fc4a746971616f880c04902ff0e1cdc1b6870f50021709a2c97bd470e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): okio/src/commonMain/kotlin/okio/Utf8.kt:443-463 | okio/src/commonMain/kotlin/okio/Utf8.kt:510-527 \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 \u0060okio/src/commonMain/kotlin/okio/Utf8.kt:443\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 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, \u0060okio/src/commonMain/kotlin/okio/Utf8.kt:507\u0060 calls \u0060isUtf8Continuation\u0060 and \u0060okio/src/commonMain/kotlin/okio/Utf8.kt:443\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":"okio/src/commonMain/kotlin/okio/Utf8.kt"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bb4f996196bd7aaa7b3a5d7fc7a18877eb401c4c8dcf1b742498c48749970b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): okio/src/jvmMain/kotlin/okio/DeflaterSink.kt:119-138 | okio/src/zlibMain/kotlin/okio/GzipSink.kt:99-118 \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 \u0060okio/src/jvmMain/kotlin/okio/DeflaterSink.kt:119\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":"okio/src/jvmMain/kotlin/okio/DeflaterSink.kt"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b31dca7de52de7dd1d2cab474695ca02aa36fee8e1af327af6089eb3d33686"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:172-190 | okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:167-185 \u2014 before extracting anything, compare \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 183 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 \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:172\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:191\u0060 calls \u0060toByte\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:186\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":"okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a107fb16f28887014eb4f04bbf8d38f9d962ffb6218276927156921363542de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt:137-151 | okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:154-168 | okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:149-163 \u2014 before extracting anything, compare \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 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":"okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8f426e4a67b3809d11a9d473d4bd9d8dcd47b7a1332d621d57e2147ea2a31f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): okio/src/appleNonMacosX64Main/kotlin/okio/NonMacosX64PosixVariant.kt:33-46 | okio/src/macosX64Main/kotlin/okio/MacosX64PosixVariant.kt:34-47 \u2014 before extracting anything, compare \u0060okio/src/appleNonMacosX64Main/kotlin/okio/NonMacosX64PosixVariant.kt\u0060 and \u0060okio/src/macosX64Main/kotlin/okio/MacosX64PosixVariant.kt\u0060 as WHOLE FILES: 85% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060okio/src/appleNonMacosX64Main/kotlin/okio/NonMacosX64PosixVariant.kt:33\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":"okio/src/appleNonMacosX64Main/kotlin/okio/NonMacosX64PosixVariant.kt"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1aa9544fb47f34cf78c5828bea826b5fc9d83dcd67746dc6f1941fe7afcd82a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): okio/src/jvmMain/kotlin/okio/HashingSource.kt:73-86 | okio/src/nonJvmMain/kotlin/okio/HashingSource.kt:33-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060okio/src/jvmMain/kotlin/okio/HashingSource.kt:73\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":"okio/src/jvmMain/kotlin/okio/HashingSource.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ff16e335f3ee782ba1ff7b203dd81d12fdf754aba11c96253c766df3f7b3d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): okio/src/commonMain/kotlin/okio/internal/Buffer.kt:356-367 | okio/src/commonMain/kotlin/okio/internal/Buffer.kt:394-405 \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 \u0060okio/src/commonMain/kotlin/okio/internal/Buffer.kt:356\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/commonMain/kotlin/okio/internal/Buffer.kt"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efa926a5b80b7213f3bf390c762c048ef9125e256228782515693ade0cae938"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): okio-wasifilesystem/src/wasmWasiMain/kotlin/okio/FileSource.kt:33-40 | okio/src/nativeMain/kotlin/okio/FileSource.kt:39-50 \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. 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":"okio-wasifilesystem/src/wasmWasiMain/kotlin/okio/FileSource.kt"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15b853d1bc932a423fd2021b480497e463775fdb0b284ec3c2910dd3a0c0dcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt:153-163 | okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:170-180 | okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:165-175 \u2014 before extracting anything, compare \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 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":"okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f0c15c7e4b9944d0bb5b09d44ce8e1a4109cd41b9bdc9beb434713f2895593"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): okio/src/commonMain/kotlin/okio/internal/Buffer.kt:1404-1414 | okio/src/commonMain/kotlin/okio/internal/RealBufferedSource.kt:446-456 \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 \u0060okio/src/commonMain/kotlin/okio/internal/Buffer.kt:1404\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 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":"okio/src/commonMain/kotlin/okio/internal/Buffer.kt"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"f430cf03abc0d3fca63eebd3e97aaa2b97f4181e42355ae409ac8187f73fc2a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): okio/src/jvmMain/kotlin/okio/JvmOkio.kt:95-105 | okio/src/jvmMain/kotlin/okio/internal/DefaultSocket.kt:140-151 \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 \u0060okio/src/jvmMain/kotlin/okio/internal/DefaultSocket.kt: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. 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":"okio/src/jvmMain/kotlin/okio/JvmOkio.kt"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3456ffa46cecc562affabc87fd53ef187f0e216142401e2b4be8828e478189"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): okio/src/hashFunctions/kotlin/okio/internal/Md5.kt:141-150 | okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt:139-148 | okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:156-165 | okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:151-160 \u2014 before extracting anything, compare \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060okio/src/hashFunctions/kotlin/okio/internal/Md5.kt:151\u0060 calls \u0060toByte\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt:149\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":"okio/src/hashFunctions/kotlin/okio/internal/Md5.kt"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67dcffd50d15fa15c3582e693b78c727f9936a6fc6408da9345f5790d56ffd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): okio/src/hashFunctions/kotlin/okio/internal/Md5.kt:100-107 | okio/src/hashFunctions/kotlin/okio/internal/Md5.kt:109-116 \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 \u0060okio/src/hashFunctions/kotlin/okio/internal/Md5.kt:100\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":"okio/src/hashFunctions/kotlin/okio/internal/Md5.kt"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b1eed3b35bae8832f64348d81f984e087606b9b37448b1157efaaf3aa993a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt:168-174 | okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:188-194 | okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:187-193 \u2014 before extracting anything, compare \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt:175\u0060 calls \u0060toByte\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:194\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":"okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4eddc408266a8eb95c1d25da34ba73f0f9089338c8b6ed7eba89175c1f952f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt:172-178 | okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:192-198 | okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:195-201 \u2014 before extracting anything, compare \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 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":"okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21d561d2c5cb71e7c3055444856e1db3c30295be2f110958b44d14d2fac2269"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt:176-182 | okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:196-202 | okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:203-209 \u2014 before extracting anything, compare \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 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":"okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df5ef775c281f7be4f4378cee799bff54f58e331f5570bf287271137b1b1cb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt:180-186 | okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:200-206 | okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:211-217 \u2014 before extracting anything, compare \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt:179\u0060 calls \u0060toByte\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:210\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":"okio/src/hashFunctions/kotlin/okio/internal/Sha1.kt"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"42935cbdee7d741f7f59c83ecd0f4cf7c3ff649d0710c885ff37d7ca173febb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:204-210 | okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:219-225 \u2014 before extracting anything, compare \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 183 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":"okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"455b65ef5d1c0d59cedad6f94714902481ce5abc9299468a82d7e6131df109bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:208-214 | okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:227-233 \u2014 before extracting anything, compare \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 183 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":"okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f390223ada016ca5c7cdf939f87abc7c14dc84b9fef856f7e35f24ef18185c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:212-218 | okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:235-241 \u2014 before extracting anything, compare \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 183 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:211\u0060 calls \u0060toByte\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:234\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":"okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa706569d6368566893879092bd3acfead70c22c3be1d836dd486b9fb9c83e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): okio/src/appleNonMacosX64Main/kotlin/okio/NonMacosX64PosixVariant.kt:33-38 | okio/src/macosX64Main/kotlin/okio/MacosX64PosixVariant.kt:34-39 | okio/src/mingwX64Main/kotlin/okio/WindowsPosixVariant.kt:159-164 \u2014 before extracting anything, compare \u0060okio/src/appleNonMacosX64Main/kotlin/okio/NonMacosX64PosixVariant.kt\u0060 and \u0060okio/src/macosX64Main/kotlin/okio/MacosX64PosixVariant.kt\u0060 as WHOLE FILES: 85% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060okio/src/appleNonMacosX64Main/kotlin/okio/NonMacosX64PosixVariant.kt:33\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 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":"okio/src/appleNonMacosX64Main/kotlin/okio/NonMacosX64PosixVariant.kt"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd80c4b2e225f83f760a3e2485aae8122fd42fcbfee2c1c01d59592732ce3df0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): okio/src/commonMain/kotlin/okio/internal/Buffer.kt:1059-1064 | okio/src/commonMain/kotlin/okio/internal/Buffer.kt:1071-1076 \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 \u0060okio/src/commonMain/kotlin/okio/internal/Buffer.kt:1059\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, \u0060okio/src/commonMain/kotlin/okio/internal/Buffer.kt:1070\u0060 calls \u0060toByte\u0060 and \u0060okio/src/commonMain/kotlin/okio/internal/Buffer.kt:1058\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":"okio/src/commonMain/kotlin/okio/internal/Buffer.kt"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdf297738df6219efd293e43062ed630acc8da1e60688e6df866084fd6303d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): okio/src/commonMain/kotlin/okio/internal/Buffer.kt:1001-1005 | okio/src/commonMain/kotlin/okio/internal/Buffer.kt:1059-1063 | okio/src/commonMain/kotlin/okio/internal/Buffer.kt:1071-1075 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060okio/src/commonMain/kotlin/okio/internal/Buffer.kt:1000\u0060 calls \u0060toByte\u0060 and \u0060okio/src/commonMain/kotlin/okio/internal/Buffer.kt:1058\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":"okio/src/commonMain/kotlin/okio/internal/Buffer.kt"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"152813a169164cc5fc9da04e3285a073d665adfd8eb9200039d318a37b58668a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (68 lines \u00D7 2): okio/src/appleMain/kotlin/okio/SegmentedByteString.kt:35-102 | okio/src/nonAppleMain/kotlin/okio/SegmentedByteString.kt:35-102 \u2014 before extracting anything, compare \u0060okio/src/appleMain/kotlin/okio/SegmentedByteString.kt\u0060 and \u0060okio/src/nonAppleMain/kotlin/okio/SegmentedByteString.kt\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/appleMain/kotlin/okio/SegmentedByteString.kt"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"751fe6dfc4f42114855f6cf1e8471677b14d9206cae1b8c609ae95ed0b7bb648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (68 lines \u00D7 3): okio/src/jsMain/kotlin/okio/FileSystem.kt:31-99 | okio/src/nativeMain/kotlin/okio/FileSystem.kt:32-118 | okio/src/wasmMain/kotlin/okio/FileSystem.kt:33-100 \u2014 before extracting anything, compare \u0060okio/src/jsMain/kotlin/okio/FileSystem.kt\u0060 and \u0060okio/src/wasmMain/kotlin/okio/FileSystem.kt\u0060 as WHOLE FILES: 92% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060okio/src/wasmMain/kotlin/okio/FileSystem.kt:29\u0060 calls \u0060OptIn\u0060 and \u0060okio/src/jsMain/kotlin/okio/FileSystem.kt:26\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":"okio/src/jsMain/kotlin/okio/FileSystem.kt"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64c43af01b193494ed206ff9719cd9cd58804d3281524fbf462cab5bbd1e408"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): okio/src/jvmMain/kotlin/okio/Path.kt:78-129 | okio/src/nonJvmMain/kotlin/okio/Path.kt:70-100 \u2014 before extracting anything, compare \u0060okio/src/jvmMain/kotlin/okio/Path.kt\u0060 and \u0060okio/src/nonJvmMain/kotlin/okio/Path.kt\u0060 as WHOLE FILES: 86% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060okio/src/jvmMain/kotlin/okio/Path.kt:78\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060okio/src/jvmMain/kotlin/okio/Path.kt:77\u0060 calls \u0060JvmName\u0060 and \u0060okio/src/nonJvmMain/kotlin/okio/Path.kt:68\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":"okio/src/jvmMain/kotlin/okio/Path.kt"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"607ce4cd563d2142d8566264ad31a129b9088f41a37f22341648c977c938a453"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt:224-238 | okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt:251-265 \u2014 before extracting anything, compare \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt\u0060 and \u0060okio/src/hashFunctions/kotlin/okio/internal/Sha512.kt\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 183 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":"okio/src/hashFunctions/kotlin/okio/internal/Sha256.kt"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2b64aafa0e2b74569e7875eec7525ea1ff2af9d23ad9f48f20c0ff1f00e337"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: sinkSplitsLargeWrites: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022Flaky\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/jvmTest/kotlin/okio/AsyncTimeoutTest.kt"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0af40229c60878181b5aa8070d644bdfeeef9a61880e70d4b0c20d2b7683e98"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: okio/src/jvmTest/kotlin/okio/ThrottlerTest.kt: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022These tests are flaky and fail on slower hardware, need to be improved\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/jvmTest/kotlin/okio/ThrottlerTest.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92c790cee99c4912a7a03b9cc46b9adf853167b77998ba4101d021d84748122"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: okio/src/commonMain/kotlin/okio/internal/Buffer.kt: okio/src/commonMain/kotlin/okio/internal/Buffer.kt changed 2 times in last 90 days, max cyclomatic complexity 19 in BufferKt.selectPrefix at line 144. 1 of those changes was a fix/bug commit, and the other 1 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-06-19..2026-09-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-19 00:27:48 \u002B00:00\u0027 --until=\u00272026-09-17 00:27:48 \u002B00:00\u0027 --full-history --no-merges -- okio/src/commonMain/kotlin/okio/internal/Buffer.kt\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":"okio/src/commonMain/kotlin/okio/internal/Buffer.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51260ba82ff66b6efc02c4dfa0ddd880e9de0f38169d7c4b0684007dbc8479f"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 4 significant file(s) lose their only recent owner: okio/src/jvmMain/kotlin/okio/Buffer.kt, okio/src/jvmMain/kotlin/okio/RealBufferedSink.kt, okio/src/jvmMain/kotlin/okio/BufferedSink.kt, okio-wasifilesystem/build.gradle.kts. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"02ffc48710406c4fdedbaa63fdabafcddfb2626af82ed395bfe43c1f224344f3"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 5 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (9 single-owned of 117 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 117 of the 223 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(swankjesse): configure a test directory in CI that exists, but that this process doesn\u0027t \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":"okio-testing-support/src/commonMain/kotlin/okio/AbstractFileSystemTest.kt"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acdb16af49ca8501becc90d5d5cadcad0a9b0d2399682cf0f9695e112ce7178"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: stop using exceptions for flow control. \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":"okio-wasifilesystem/src/wasmWasiMain/kotlin/okio/WasiFileSystem.kt"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cc83dbabe53a23b1c8d1f2845d8a9804ca7b2d2a6ec79072624cf9093063a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO combine with Buffer.writeUtf8? \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":"okio/src/commonMain/kotlin/okio/Utf8.kt"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3727fbd4062bfe6f5b94c0059ddc763006488da09447b59a19e93f632b20f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO combine with Buffer.writeUtf8CodePoint? \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":"okio/src/commonMain/kotlin/okio/Utf8.kt"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5582e4c9360fafa48abee0cb71289a3dd9e6f05ed4e2f2a58cb1f9b2b87ce692"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO combine with Buffer.readUtf8CodePoint? \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":"okio/src/commonMain/kotlin/okio/Utf8.kt"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11f75c58062587847d3baa1692faafbadd39b3038a085e31bf2a08099fa600b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO combine with Buffer.readUtf8? \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":"okio/src/commonMain/kotlin/okio/Utf8.kt"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98007bbb5e73297eec9520388d85a89f49f38ecb84fa0299036c9f90dc65cf0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u0027Source by delegate\u0027 once https://youtrack.jetbrains.com/issue/KT-23935 is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/commonMain/kotlin/okio/ForwardingSource.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"722d0f2e92bb72e551c009c8cb4600cd219b58b07866ff56605ee5431f225fc5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u0027Source by delegate\u0027 once https://youtrack.jetbrains.com/issue/KT-23935 is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/jvmMain/kotlin/okio/ForwardingSource.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a78967af4295355a32d4f5466cd8448e677d68fa0ec682e27ca7f6b4ceb2f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u0027Source by delegate\u0027 once https://youtrack.jetbrains.com/issue/KT-23935 is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/nonJvmMain/kotlin/okio/ForwardingSource.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d945b83c52e740953ef52d3f1f6515e8a7578f0abec826b4354dec2a5763d844"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make internal https://youtrack.jetbrains.com/issue/KT-37316"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/commonMain/kotlin/okio/CommonPlatform.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1982b6d1642da4711936e63ee338a37c9686651f41466024ef500aaa916742d"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to work around Kotlin\u0027s limitation for using JvmName on open/override vals/funs \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/commonMain/kotlin/okio/ByteString.kt"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf2e3823a039abdf16e2de7afa3b63a029912916a7e5055ba2a6ed3e97cbd60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO move to SegmentedByteString class: https://youtrack.jetbrains.com/issue/KT-20427"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/commonMain/kotlin/okio/internal/SegmentedByteString.kt"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e1a8e75ba8e6f3cc0289b3a6b977728ef7e44df0670ac48b9ddf3dd6edda07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Kotlin\u0027s expect classes can\u0027t have default implementations, so platform implementations \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":"okio/src/commonMain/kotlin/okio/internal/SegmentedByteString.kt"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4564c82c2caccc638369126bc34fb3b95788a8fe6bd497fbd6cb2a5dcb55b5fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Kotlin\u0027s expect classes can\u0027t have default implementations, so platform implementations \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":"okio/src/commonMain/kotlin/okio/internal/ByteString.kt"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2555f918c9438d4dc12bac449ea4a68cfaf21455d1e127ba2b17795be46e9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Kotlin\u0027s expect classes can\u0027t have default implementations, so platform implementations \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":"okio/src/commonMain/kotlin/okio/internal/Buffer.kt"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"13621c61747962ff6f825126e41592b6c6f5b929048dc3d48f8b2a0480d8c5f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO move to RealBufferedSource class: https://youtrack.jetbrains.com/issue/KT-20427"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/commonMain/kotlin/okio/internal/RealBufferedSource.kt"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd2b6ea97908e5a62ab60f94d96597d379f3a3e9a4091633c74307c01e4e129"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO move to RealBufferedSink class: https://youtrack.jetbrains.com/issue/KT-20427"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/commonMain/kotlin/okio/internal/RealBufferedSink.kt"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34d2d1d1aa29cad3ce0310107257039eea420cbc1010f20a7beaff39facdf9a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO move to Buffer class: https://youtrack.jetbrains.com/issue/KT-20427"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/commonMain/kotlin/okio/internal/Buffer.kt"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5183fcdbdde3abe7d1700fa2cb74dfd6aa32a765bd89d4a32c9db28ed7fc2069"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jwilson): use edit counts or other information to track unexpected changes? \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":"okio/src/commonMain/kotlin/okio/internal/Buffer.kt"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"9306dd9ed897fe4b8ad311c3c742e9c8f31b47b8003befc6729a7717b1edaf22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO For benchmarking, these methods need to be available but preferably invisible \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":"okio/src/commonMain/kotlin/okio/internal/-Utf8.kt"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca83c335222379dafd2450be59fecb5077a29d0fc09520415b1e3cd0ed817bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Confirm we are consistent when writing one code point at a time. \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":"okio/src/commonTest/kotlin/okio/Utf8KotlinTest.kt"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6e528979f1127f7fbda4b3dec037b88ac44b7cff04f79a1dadb9d72c092a1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Is 64 KiB a good maximum size? Do we ever have that many idle segments? \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":"okio/src/jvmMain/kotlin/okio/SegmentPool.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3790fe085ee7db930244619a0258d8af5889b40e9eb93b18b443df393dbc3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u0027Sink by delegate\u0027 once https://youtrack.jetbrains.com/issue/KT-23935 is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/jvmMain/kotlin/okio/ForwardingSink.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57d5747585c8b8242b2c93378939dff06386b70c5ddc5825a4a6d62f40b2001"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove if https://youtrack.jetbrains.com/issue/KT-20641 provides a better solution"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"okio/src/jvmMain/kotlin/okio/-JvmPlatform.kt"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7472d9b26705054aba6a822c57432a18045de84723bc7c77e595f9768cf0c9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jwilson): throw FileNotFoundException if the canonical file doesn\u0027t exist. \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":"okio/src/jvmMain/kotlin/okio/internal/ResourceFileSystem.kt"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"752059120754c43da61c2ca682aec5de516c4dfff00caff68b08273ae0607e7b"}},{"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":"c7155ef539c11431eedbd29fb54f7565cfcc13ba4ba088f0563a46679cb845fd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"6f3ab13f804bb888fe9d440c8c3ff286163e97b8126a016751a4873e9aee958c"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"d585a65a53763446f92bb12195331076306a6fd90dbe06fc17f6d8ca5ae1e884"},"taxa":[{"id":"CWE-330","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"56fd66adafad7f3e4b8487f4f74563109b3d61e1865a850f2d7d7d11668e301f"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"0c8a60a7d43d8174b97aeb71ceb4b354fc33dbbfba0ca551c2fe4065960d6a4a"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","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":"28214516d72c1d4cc7aae1475b3fd3530b8dc40aee3fbce2a29eaa7d41036d1b"}},{"ruleId":"D30","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":"a851709ddc106f5adb8022bce36d6f8451ac06bdf94eaac7a34cdb108eaf7720"}},{"ruleId":"D30","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":"6a2925db8f5e647cbc4e6291c998939513d682a436176c70f5f223836493cdcc"}},{"ruleId":"D30","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":"094a5ad27afb3798ffaf2d91ab48f2acfb0f08efb997dafcbbd9600cb15cdf67"}},{"ruleId":"D30","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":"4dafe2fbe5dc278339e4569b5ed0d841efedee0d782adc74996734c7f3439d7f"}},{"ruleId":"D30","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":"db33f34063c6ba5e5fc4d831f7fb3385e15a3283ab7f8eec3aa65a51a37fe6b9"}},{"ruleId":"D30","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":"bd0e2c2c20a3823c2643d4ce3c8a2fd826ced4aff639c8b4af4d796b0c442026"}},{"ruleId":"D30","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":"0779da1210f0c74231540d05b3685f813faa1d0483a312933bb34173af2dc31f"}},{"ruleId":"D30","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":"43c130f31a15e91cfb73490061504e7af59331d76eae5a0bb0fdfdca3608eec1"}},{"ruleId":"D30","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":"ea4b976d7911c95a24e68bfd117685a0ec8a4e2af6424e71ed8252157849a079"}},{"ruleId":"D30","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":"8e708ca4c98dc77df55e85ffe9101e3de1688c3d105f6f213858485f7566ca3e"}},{"ruleId":"D30","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":"5d5923740a03ae9df779fd48e38d43895e38fbfa9ca95bf1bcc21918754c63f7"}},{"ruleId":"D30","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":"3eae84a3d4c8ffd2864d39cc74509e65598cda2793c18305c17a3b2b795eb9af"}},{"ruleId":"D30","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":"2a9a9eaaf00da8ea142b579f40f04c38d7064a5b6bc93e9ece4367e9dc08cd49"}},{"ruleId":"D30","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":"ac7e41d00b9b2568ec0836e1cef5e6fb6e2e61d7f6bd3b6e0910988d6d6ea3b2"}},{"ruleId":"D30","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":"3de7fdc3e89f12d7337eab2c74dbe4743328a50f69884794e2fd32412c9eee45"}},{"ruleId":"D30","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":"0a3ed700e0787076381641842045f6785701b40d05ebdd09f6e8b43b6a654d36"}},{"ruleId":"D30","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":"db5bf2e8f599bc0e087a4b0e4b9e819c1fc7bb799be99f0eee2a201a36122111"}},{"ruleId":"D30","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":"8e3900411fe572f32940f903050782d20f1dd23fd46cafeb96bcf590b91b9d4c"}},{"ruleId":"D30","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":"10e1e4f82a9508ae69e75968a8fa02c448af5d4192445e9aa3873b32aa01e6f0"}},{"ruleId":"D30","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":"b4bef650a5801f18ac68e6126127c86254fb84a115166c38679cb5718af77924"}},{"ruleId":"D30","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":"3433b75931410049b8e95c0fe84f7856fde82f4af273f75807c6986adc6fe751"}},{"ruleId":"D30","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":"398bb9eb9ec218f81c59530f1186c2b2d0cdba687cc9afa13ddeead29b8cd1ef"}},{"ruleId":"D30","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":"bf40b8aa03d380f21c390651ea3f7fcee6cb95b012e2cdf0d83e55b8a55bf324"}},{"ruleId":"D30","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":"9c8b24b9032d61c6f95823555671ecea49732783a59ed4f22d060ef0aa72eb06"}},{"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"}},{"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"}},{"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":"d068c977b62d9a977df1bb6f53e8b00b586c3abee955f91d715f92b8e019d624"}},{"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":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: README claims Okio started as a component of OkHttp but there is no okhttp project in the tree \u2014 searched for: \u0060OkHttp\u0060. Each was matched case- and separator-insensitively against file and directory NAMES anywhere in the tree, and against the CONTENTS of manifest files (package.json, *.csproj, *.props, *.slnx, *.yml, Dockerfile); the README\u0027s own prose never counts, so a claim is never refuted by merely being made. Nothing outside that search was read \u2014 a footprint living only in a submodule, in a file type not listed here, or under a name none of those terms matches is not seen, and this row is then wrong."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"343bbbd51ceb8de7a9ff88d79f7c797abf9b5921f8727b67b4d0f4f8a22c5e49"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add spotbugs with find-sec-bugs (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 6575 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}}],"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-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-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.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-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"CWE-319","shortDescription":{"text":"CWE-319"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-330","guid":"f811ddf9-2e54-865b-9c76-f97905849790","name":"CWE-330","shortDescription":{"text":"CWE-330"},"helpUri":"https://cwe.mitre.org/data/definitions/330.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":"CWE-502","shortDescription":{"text":"CWE-502"},"helpUri":"https://cwe.mitre.org/data/definitions/502.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"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-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"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":33,"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."]}]}