{"$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":"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":"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":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"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":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"]}},{"id":"D38","name":"OSV Dependency Vulnerabilities","shortDescription":{"text":"OSV Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D38","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"]}}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"composeService.doBuildBake (cyclomatic 59): composeService.doBuildBake has cyclomatic complexity 59 (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":"pkg/compose/build_bake.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c200ac5762faecc95c7371f7c3bdc0ce678216708cdcca165b520bd03326d5c"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.Up (cyclomatic 48): composeService.Up has cyclomatic complexity 48 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 24 belong to 6 function literals inside it that branch. 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":"pkg/compose/up.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1f3e7b4ae78dc8d525f431fe1e876a5292b4bbe4487cdc348218cf107c286f"}},{"ruleId":"D1","level":"warning","message":{"text":"monitor.Start (cyclomatic 34): monitor.Start has cyclomatic complexity 34 (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":"pkg/compose/monitor.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"46442bb220221337bccfb8b241258ff66e410924d9ea56c6d26323653e5b336e"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.doBuildImage (cyclomatic 32): composeService.doBuildImage has cyclomatic complexity 32 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"pkg/compose/build_classic.go"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e0497e8ac138b63d7a79e88202b1a256a6e1fb7eb8f34ec29ddee15eca3e41"}},{"ruleId":"D1","level":"warning","message":{"text":"compose.RootCommand (cyclomatic 29): compose.RootCommand has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 466, 453). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/compose.go"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba2a408fd9436799befa221d022edc7af7fa10fbdb04d4eba2ebe50e49f8755"}},{"ruleId":"D1","level":"warning","message":{"text":"compose.validateFlags (cyclomatic 27): compose.validateFlags has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/up.go"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed0d73e69734ced4009ce10fe82381b073ee68123198dc6b1301fc98bd7a7a4"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.pull (cyclomatic 26): composeService.pull has cyclomatic complexity 26 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. 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":"pkg/compose/pull.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7278f1c38ee1ce251f7e343d1ce743a60e6872b1ab8ade642ce97ee14d4a8b8b"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.watch (cyclomatic 26): composeService.watch has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"pkg/compose/watch.go"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fc7a17d654d830a8dbc4e3f4944b6b8292cf3d75f8171161752a933b3617fe"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.waitDependencies (cyclomatic 24): composeService.waitDependencies has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 8 of the 24 points are its own statements and the rest belongs to one function literal inside it that branches (line 181). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/convergence.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41a1b891f3e5af0247b1dc7836c6d0c3712b0ee3893ac904db0f3904e14f068"}},{"ruleId":"D1","level":"warning","message":{"text":"compose.runUp (cyclomatic 20): compose.runUp has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"cmd/compose/up.go"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7c7f30828b85624ffa59d6cdbc8605032bfa14ad19673073c12201526e7a13"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.getCreateConfigs (cyclomatic 20): composeService.getCreateConfigs has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/create.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2f2a8bcd5c72bbe6b9c0afd1b934fc3e85364a64b0d81979dd92292cd2e6c8"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.down (cyclomatic 20): composeService.down has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/down.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d960b1778f374b9cd008abf103fb5f6a1e47092900d1155d75316a04643c27ed"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.executePlugin (cyclomatic 20): composeService.executePlugin has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/plugins.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a73a7092e5ed27ecc5e6c4f897fd9708fdda7a776942eec094fe6ae25f34415"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.publish (cyclomatic 18): composeService.publish 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":"pkg/compose/publish.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2101d26687e1cf6bc698ede18ff87b92aa07e62b0b242ea096b55e1be7a66978"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.restart (cyclomatic 18): composeService.restart has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 9 belong to 2 function literals inside it that branch. 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":"pkg/compose/restart.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2290e1e7f2d481075761eb67f4381140f3d4379007082a025d4b7246f7514ac7"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.handleWatchBatch (cyclomatic 18): composeService.handleWatchBatch 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":"pkg/compose/watch.go"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8115b783b615f4cd9a0a39b4484f970be76bfaf67ddc537254a73cecc728eb"}},{"ruleId":"D1","level":"warning","message":{"text":"ociRemoteLoader.Load (cyclomatic 18): ociRemoteLoader.Load 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":"pkg/remote/oci.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ad55aaad2f50cb5baeb5162cdfcb0951543c22fa9198966f12d1e35115cd27"}},{"ruleId":"D1","level":"warning","message":{"text":"compose.runPs (cyclomatic 17): compose.runPs has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/ps.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"447709fc23418246f4d7b772a93dc70d4278d9b19cdf3794b0ca8ee96fde2a42"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.Ps (cyclomatic 17): composeService.Ps has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 49). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/ps.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfd7e3a0e000f0c9fb603b79a11692ff6d7dddacccd023913752b1412c734c6"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.Remove (cyclomatic 17): composeService.Remove has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/remove.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bd33be59a556a75c50c350fcba7cb24aa6deaf47174c5e8fe9db8cb342fdc8"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.initialSyncFiles (cyclomatic 17): composeService.initialSyncFiles has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 787). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/watch.go"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d155a559ae98bfe5ef0913aacf8791e16529df06e8c5cd13f605336491ce5a"}},{"ruleId":"D1","level":"warning","message":{"text":"naiveNotify.loop (cyclomatic 17): naiveNotify.loop has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. 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":"pkg/watch/watcher_naive.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc66ba37caf5ebe43bef58a3c0d49aa1ed0734697a733c7500311a82a4fb4858"}},{"ruleId":"D1","level":"warning","message":{"text":"compose.runImages (cyclomatic 16): compose.runImages has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. 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":"cmd/compose/images.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9387b1931450999d89b1cae54e56d58d9f55002f00afbc8ea1a45e7faffa5ce0"}},{"ruleId":"D1","level":"warning","message":{"text":"compose.runCommand (cyclomatic 16): compose.runCommand has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 165, 201). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/run.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7ffeb0bfce89af44a66b767ddd53bd4cd1bb1175b046ae3cff549332c6ad73"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.copyToContainer (cyclomatic 16): composeService.copyToContainer has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/cp.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bcde3990019e40bc68b68644afeefeac4ec578a65d5c44b64d908d9aece375"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.Images (cyclomatic 16): composeService.Images has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 72). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/images.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5d35f1b8d3fd26181ff91664b9670c79e4429053cbd8749dbd17db1123a358"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.collectObservedState (cyclomatic 16): composeService.collectObservedState has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/observed_state.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce0d6d6de87797f3ddca3a823e6a0e4017052bbba1554d0bb5741d0ad0690f4"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.checkForSensitiveData (cyclomatic 16): composeService.checkForSensitiveData has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/publish.go"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"a954de56d3659994fa5c36d557019008c7f952f75e3d95a0b4b40e47b6d2a5f0"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.pullServiceImage (cyclomatic 16): composeService.pullServiceImage has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/pull.go"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"46087eb4fa8b71e8c77b36d98cb58f160417872e09e258888c5fa31ad24409e9"}},{"ruleId":"D1","level":"warning","message":{"text":"composeService.prepareRun (cyclomatic 16): composeService.prepareRun has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/run.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd9fb7e054dc07f843f3ab8562ed053eb8c84e3cb37d6cb8c3a8ccb90bd702f"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.doBuildBake (cognitive 92): composeService.doBuildBake has cognitive complexity 92 (threshold 15). Drivers by points: if/else 69, loops 15, boolean chains 6, match/switch 2 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/build_bake.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf5a41f214a188b11b962fe689fdc7f14c67b6bb467030fabb79bcaf1076bab"}},{"ruleId":"D2","level":"warning","message":{"text":"monitor.Start (cognitive 79): monitor.Start has cognitive complexity 79 (threshold 15). Drivers by points: if/else 38, loops 30, boolean chains 6, match/switch 5 (nesting depth added 49). 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":"pkg/compose/monitor.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe37193932aecfec41b80c6e59108267fc3104d90ab3aa7c00b3c7eb1357b799"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.waitDependencies (cognitive 63): composeService.waitDependencies has cognitive complexity 63 (threshold 15). Drivers by points: if/else 54, match/switch 6, loops 3 (nesting depth added 43). Most of this is not in the body itself: 11 of the 63 points are its own statements and the rest belongs to one function literal inside it that branches (line 181). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/convergence.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56856ceabf5c5f905f31cdf2555cd8ba4d59297cadb98923467023913ff824b"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.Up (cognitive 62): composeService.Up has cognitive complexity 62 (threshold 15). Drivers by points: if/else 50, boolean chains 8, loops 2, match/switch 2 (nesting depth added 18). Of this number, 30 points are the body\u0027s own statements and 32 belong to 6 function literals inside it that branch. 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":"pkg/compose/up.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"107766708bc3e9bdf2c546a80122d09ad1ff9dca1f8f93e876dd6cf7496ffb9c"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.watch (cognitive 55): composeService.watch has cognitive complexity 55 (threshold 15). Drivers by points: if/else 47, loops 5, boolean chains 3 (nesting depth added 30). Of this number, 54 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"pkg/compose/watch.go"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8dc757d2c119199505c2c8f6bc82a8a5eab89bad8564225e14b55fe29c16c9"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.pull (cognitive 49): composeService.pull has cognitive complexity 49 (threshold 15). Drivers by points: if/else 37, match/switch 5, loops 4, boolean chains 3 (nesting depth added 25). Of this number, 32 points are the body\u0027s own statements and 17 belong to 2 function literals inside it that branch. 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":"pkg/compose/pull.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"069c5858e914053e46171a30c91cbc6b1575d8b56d3b1344576f2804743f5975"}},{"ruleId":"D2","level":"warning","message":{"text":"ociRemoteLoader.Load (cognitive 48): ociRemoteLoader.Load has cognitive complexity 48 (threshold 15). Drivers by points: if/else 44, loops 4 (nesting depth added 31). 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":"pkg/remote/oci.go"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d5f649e67538001e654bf5b74b536de340134d1807f4fea1ada07924ba3b68"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.doBuildImage (cognitive 42): composeService.doBuildImage has cognitive complexity 42 (threshold 15). Drivers by points: if/else 39, boolean chains 1, loops 1, match/switch 1 (nesting depth added 13). Of this number, 40 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"pkg/compose/build_classic.go"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"8562aaf21e30e6691ef2c7943d627915d402ff892cd3a689b8dfe3358941a270"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.RootCommand (cognitive 38): compose.RootCommand has cognitive complexity 38 (threshold 15). Drivers by points: if/else 32, boolean chains 3, loops 2, match/switch 1 (nesting depth added 10). Most of this is not in the body itself: 0 of the 38 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 466, 453). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/compose.go"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df409111b165f1e69792dd338c623b55b0b1de86f00b7330d953d424db3dd93"}},{"ruleId":"D2","level":"warning","message":{"text":"naiveNotify.loop (cognitive 35): naiveNotify.loop has cognitive complexity 35 (threshold 15). Drivers by points: if/else 32, boolean chains 2, loops 1 (nesting depth added 18). Of this number, 16 points are the body\u0027s own statements and 19 belong to one function literal inside it that branches. 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":"pkg/watch/watcher_naive.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"af01c57a6bd4640e37848b273e72726a83cfdc01c0b12324e050e3fa438d0662"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.buildContainerVolumes (cognitive 34): composeService.buildContainerVolumes has cognitive complexity 34 (threshold 15). Drivers by points: if/else 30, match/switch 2, boolean chains 1, loops 1 (nesting depth added 22). 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":"pkg/compose/create.go"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f2c8b92fbf8c6960ba755e8281ed4e9bc0c2279bec6cb3f6279a28605fd947"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.publish (cognitive 34): composeService.publish has cognitive complexity 34 (threshold 15). Drivers by points: if/else 29, loops 5 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/publish.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c969a84476dd36c49503302e9ed7df1db7464e9d3d6e97df942bc0115badb6c0"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.checkForSensitiveData (cognitive 34): composeService.checkForSensitiveData has cognitive complexity 34 (threshold 15). Drivers by points: if/else 28, loops 6 (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":"pkg/compose/publish.go"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f0bbab8b87f6120579f586744e4cd3d69bcf30c5eb8f978309a29210238aa2"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.Ps (cognitive 33): composeService.Ps has cognitive complexity 33 (threshold 15). Drivers by points: if/else 22, loops 8, match/switch 3 (nesting depth added 18). Most of this is not in the body itself: 4 of the 33 points are its own statements and the rest belongs to one function literal inside it that branches (line 49). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/ps.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc0f2978e5df1ca6d2db7ad1400767e3a437b3a1c40e5a31dda194d08c549f1"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.createEndpointSettings (cognitive 31): compose.createEndpointSettings has cognitive complexity 31 (threshold 15). Drivers by points: if/else 28, loops 2, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/create.go"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"155c41f57024da9659b069ff7b4778a6b2ddf255514c50c1a119a27161838a77"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.runUp (cognitive 30): compose.runUp has cognitive complexity 30 (threshold 15). Drivers by points: if/else 28, boolean chains 2 (nesting depth added 11). Of this number, 26 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. 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":"cmd/compose/up.go"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4e46c8fb9e542cb01cc3da57d0a124b8f1d9b976dad63edff23bc2a9b9f73a"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.projectFromName (cognitive 29): composeService.projectFromName has cognitive complexity 29 (threshold 15). Drivers by points: if/else 20, loops 8, jumps 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/compose.go"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"c613f24049c7b7c21a72ec954020dddf0de513d9a63e7b2416ea82e14c1e99fe"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.buildContainerMountOptions (cognitive 29): composeService.buildContainerMountOptions has cognitive complexity 29 (threshold 15). Drivers by points: if/else 22, loops 6, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/create.go"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"391b2800be0227dcc1c786ef289819f6911283d7e1c3d814865a74fe3276d117"}},{"ruleId":"D2","level":"warning","message":{"text":"compatibility.Convert (cognitive 28): compatibility.Convert has cognitive complexity 28 (threshold 15). Drivers by points: if/else 20, loops 3, jumps 2, match/switch 2, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compatibility/convert.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d04b1cfec6b23129514f40a0f42b3dbb0b40749539413d004efadc6c3ec2843"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.Images (cognitive 28): composeService.Images has cognitive complexity 28 (threshold 15). Drivers by points: if/else 24, loops 3, boolean chains 1 (nesting depth added 13). Most of this is not in the body itself: 10 of the 28 points are its own statements and the rest belongs to one function literal inside it that branches (line 72). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/images.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ad2b190ec578f2f49e0bbcd48626c257243b054d4eaf3613854e530f37a528"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.restart (cognitive 28): composeService.restart has cognitive complexity 28 (threshold 15). Drivers by points: if/else 22, loops 6 (nesting depth added 11). Most of this is not in the body itself: 11 of the 28 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 78, 59). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/restart.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"237fa5cd32f88c629e91f5605d3f6f414f7aadef2f7df92cfe19800e948fbaa4"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.runImages (cognitive 26): compose.runImages has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, loops 7 (nesting depth added 11). Of this number, 19 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. 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":"cmd/compose/images.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa7d95990e4820705226b26c8b3edf63b67c408ace8f0c8bbf0a386ed8d94ed"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.applyPlatforms (cognitive 26): compose.applyPlatforms has cognitive complexity 26 (threshold 15). Drivers by points: if/else 21, boolean chains 4, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/options.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"771ea8bacffec95a054920a61d107ea7128290f2d77e9ed48490fa6205d47a37"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.runPs (cognitive 26): compose.runPs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18, loops 7, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/ps.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc37ebeebea5a7abaa7b701c546c5ea5a4ff84d6ed3b00959f1ce5bbaad29a1"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.Events (cognitive 26): composeService.Events has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, loops 4, match/switch 2, boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/events.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec284950429e98a6af1fea3ba653127089df717620cf79051bba586f7dd03c81"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.initialSyncFiles (cognitive 26): composeService.initialSyncFiles has cognitive complexity 26 (threshold 15). Drivers by points: if/else 23, boolean chains 2, match/switch 1 (nesting depth added 12). Most of this is not in the body itself: 6 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 787). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/watch.go"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3117ac7f4b427d536c7e013a4fbe45a36e59ffe846901e00699ffe8dcd1fee"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.validateFlags (cognitive 25): compose.validateFlags has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15, boolean chains 10 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/up.go"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03dd3e949cc824e9c41c0c90b8d6f84c38823f5dfee2a5acb3d02ee86d57d25"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.copyToContainer (cognitive 25): composeService.copyToContainer has cognitive complexity 25 (threshold 15). Drivers by points: if/else 24, 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":"pkg/compose/cp.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f88db786397b49d7742102754616ef6246e5b58f70961eabae21c8d2e054d7"}},{"ruleId":"D2","level":"warning","message":{"text":"reconciler.servicesUsingVolume (cognitive 25): reconciler.servicesUsingVolume has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16, loops 9 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/reconcile.go"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7acea45cbea25871f647c28646e3e5288b12d22fc966495c77d55698c864e1"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.lockModel (cognitive 24): compose.lockModel has cognitive complexity 24 (threshold 15). Drivers by points: loops 12, if/else 8, match/switch 4 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/config.go"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"097619eb9cbbfaf9ce7e4859422be28d78280cb7bc7f188076c01c48a82632b1"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.Remove (cognitive 24): composeService.Remove has cognitive complexity 24 (threshold 15). Drivers by points: if/else 20, boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/remove.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e86289b8b32f062e4ac7aced045ba63c00e9af731d937aafe6bd756e2b31f9"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.handleWatchBatch (cognitive 24): composeService.handleWatchBatch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14, loops 7, match/switch 3 (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":"pkg/compose/watch.go"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"11889b6c38d65cf40cc24c102dc1d92ba1ae519c189150d6540f130dae382c90"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.processFile (cognitive 23): compose.processFile has cognitive complexity 23 (threshold 15). Drivers by points: if/else 19, loops 3, 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":"pkg/compose/publish.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"479ce6a233d381c5a5c0c3be3047176efb4e979f8f8a816bc0c31392d194f556"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.getLocalImagesDigests (cognitive 23): composeService.getLocalImagesDigests has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, loops 6 (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":"pkg/compose/build.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac6ff5b265dea173e7c8c2f8f74843a03de645cce32b7bb15e9e5b4eed9eb02"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.Logs (cognitive 23): composeService.Logs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 21, boolean chains 1, loops 1 (nesting depth added 9). Of this number, 13 points are the body\u0027s own statements and 10 belong to 2 function literals inside it that branch. 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":"pkg/compose/logs.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c930007a91e603626baf0ae501f87e6c83d44a485896ed32fae38d9e37a48a"}},{"ruleId":"D2","level":"warning","message":{"text":"gitRemoteLoader.Load (cognitive 23): gitRemoteLoader.Load has cognitive complexity 23 (threshold 15). Drivers by points: if/else 23 (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":"pkg/remote/git.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ff1ec49e72bf5c2d966178afd6902cdc902a0b7ad60abb15bd596150bae17c"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.resolveImageDigests (cognitive 22): compose.resolveImageDigests has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, loops 10 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/config.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a7c6160a4edf847d9c8f75edeb5072b031ce78e670d95970f84b3f27c3d8d1"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.down (cognitive 22): composeService.down has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18, boolean chains 3, loops 1 (nesting depth added 3). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/down.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c849909257181b0b178d7d7f9ee3a4962a79561f9cb991b8c16b89fa0d6e1b6"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.pullRequiredImages (cognitive 22): composeService.pullRequiredImages has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, loops 5, boolean chains 1 (nesting depth added 10). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"pkg/compose/pull.go"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"063cecacc82812b2c5bd8b8b19bea67c2cd6dba6bd7152abb85f337cc55cd824"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.watchEvents (cognitive 22): composeService.watchEvents has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19, match/switch 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/watch.go"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d76540865cdb5eee202cc430bc65b4d0b12c41525b7ab568205efefeaa60cc3"}},{"ruleId":"D2","level":"warning","message":{"text":"reconciler.visitInDependencyOrder (cognitive 22): reconciler.visitInDependencyOrder has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, loops 6 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/reconcile.go"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5906c33ecd9fe642d222fe00b18fc60def00ae465c1ea87db8ff1ffa3c6e6e0"}},{"ruleId":"D2","level":"warning","message":{"text":"formatter.Print (cognitive 21): formatter.Print has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, match/switch 5, loops 3 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/formatter/formatter.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c154c4fb9dc6488d0a98862e733c838bc33ae63d198b6b712de672f3ca7f83b"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.NewGraph (cognitive 21): compose.NewGraph has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, loops 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/dependencies.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff81f524b3dd79dfe8527c99f7c7b7cff0074bd471a3800b08620b4cebe4fc9"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.doBuildClassic (cognitive 21): composeService.doBuildClassic has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, loops 4 (nesting depth added 8). Most of this is not in the body itself: 5 of the 21 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 52, 74, 83). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/build_classic.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfff8f8a2d9bebfe08b691d59e1e486f9e3f0609fc5653220612968b28cb75d"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.createMobyContainer (cognitive 21): composeService.createMobyContainer has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, loops 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/convergence.go"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f0abc9432d23d60128a3194b44734c71d404ef2f615e4a818f188cf09b748c"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.pullServiceImage (cognitive 21): composeService.pullServiceImage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 19, boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/pull.go"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"829e239c43eb258a5da02b01ef0d909e101d50c6a6e8d5d97358a92eb7ea3222"}},{"ruleId":"D2","level":"warning","message":{"text":"paths.EncompassingPaths (cognitive 20): paths.EncompassingPaths has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, loops 6 (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":"internal/paths/paths.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f964cb5b939a1ed2b019900d197277201bfe07e37962182f160fd4d0bd0a7d1f"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildOptions.Apply (cognitive 20): BuildOptions.Apply has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, boolean chains 5, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/api/api.go"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b988311fe69452aa912c0aafca85a4ff8bddc0be3714594d26e3785d54a080b9"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge.convert (cognitive 20): bridge.convert has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, loops 1 (nesting depth added 7). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"pkg/bridge/convert.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf086ebc39159015ae49d42ce434170f76fee3f116517eafd31a3482936d3533"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.parseSecurityOpts (cognitive 20): compose.parseSecurityOpts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, 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":"pkg/compose/create.go"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ff20432c09349412dd1c5f55b6a4bd579743c14c77096ade5ce1d3a65b6306"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.defaultNetworkSettings (cognitive 20): compose.defaultNetworkSettings has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, loops 4, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/create.go"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f06549de5f0e3f213a32b3e5e323ab58054b639c0e1d7c9726113920779d7d"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.buildContainerSecretMounts (cognitive 20): compose.buildContainerSecretMounts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, loops 2, boolean chains 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":"pkg/compose/create.go"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1efd2fe0cfea3f35e86e3b6e3a8f974df3ac4127bf8aff62233c87809fa438"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.getCreateConfigs (cognitive 20): composeService.getCreateConfigs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, loops 2, boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/create.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ecef5339d531829987af9bde680d54253cd73f5227288ad338937e899a0674"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.runPlugin (cognitive 20): composeService.runPlugin has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, loops 7, boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/plugins.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e42b49a8f7de87ed3d6c21ae61b75b756ac0a5fb3660764351007c2dc02d886"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.push (cognitive 20): composeService.push has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, loops 3, boolean chains 2 (nesting depth added 10). Of this number, 12 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. 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":"pkg/compose/push.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f455210b1d88eacfd7547f7a5b3c0f71236d7c799b2979dd61ce38d6fc58a0"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.collectTop (cognitive 19): compose.collectTop has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, loops 8 (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":"cmd/compose/top.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"75661f6bc622b0bb6a9c2f77098c8de5b86ba4c1163abb42ba3abf6853373198"}},{"ruleId":"D2","level":"warning","message":{"text":"paths.IsChild (cognitive 19): paths.IsChild has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/paths/paths.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1e190fc100f1c9b5f14e0d8ba5bb44ee2ddc3a0e9bb3c0d3b12fb26320c73b"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.buildContainerConfigMounts (cognitive 19): compose.buildContainerConfigMounts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/create.go"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abc70cc3bfa0b44ba58443ab139c47b4d1f7bea54b2ae2046b8ea139b6566fa"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.addNodes (cognitive 19): compose.addNodes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, loops 7, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/viz.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3342cca8d9400ed9c7df635fa1959e8429e5d054998ded9aa8987a171ec09fa1"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.preChecks (cognitive 19): composeService.preChecks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, loops 7, boolean chains 3 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/publish.go"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1dbbe926eaee5458e629e8d798ac87dd497b1c72d1ef58e03376bd1cac6079"}},{"ruleId":"D2","level":"warning","message":{"text":"ImagePruner.ImagesToPrune (cognitive 19): ImagePruner.ImagesToPrune has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/image_pruner.go"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e2bd866aa30d4f23dc420c1842182b32e893dfb7e540e957968e9616cfe1bb"}},{"ruleId":"D2","level":"warning","message":{"text":"naiveNotify.Start (cognitive 19): naiveNotify.Start has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/watch/watcher_naive.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebad9d14e111ddb0467fdaa91e9b7081c68c75b112178a16874076b4e388c18"}},{"ruleId":"D2","level":"warning","message":{"text":"runOptions.apply (cognitive 18): runOptions.apply has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, loops 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/run.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d28dfe856b725927e7bb4701350111a099f1ac9b30ba463eebc5d3b220bcfa8"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.collectObservedState (cognitive 18): composeService.collectObservedState has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, loops 5, boolean chains 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":"pkg/compose/observed_state.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe6ba7fa9da47031ea921d9c148b1b00fb8bad6747bdca4bd9b64c070b8b48a"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.executePlugin (cognitive 18): composeService.executePlugin has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, match/switch 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/plugins.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5bf927155f5649bc42f78b7b3dc17d22e270e79e819ebdffa7943f51fe0323"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.start (cognitive 18): composeService.start has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, loops 2 (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"pkg/compose/start.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58e4cd500f0fc08defd61b58a8c3b127b44b26aaf3c90a1f8068d98974f1dd4"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.displayTransformer (cognitive 17): compose.displayTransformer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, loops 3 (nesting depth added 9). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 121). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/bridge.go"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"905c6e5c0122dd1124f14b2bd8ee248e3cd8b985c4b72571b0c0e49d7929e4f3"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.runCommand (cognitive 17): compose.runCommand has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, boolean chains 2 (nesting depth added 2). Most of this is not in the body itself: 0 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 165, 201). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/run.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb51e0cbf54a193c2cc116dcc76e446b999a1283f28697b46074bfb3a741034"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchiveBuilder.entriesForPath (cognitive 17): ArchiveBuilder.entriesForPath has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17 (nesting depth added 4). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 270). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/sync/tar.go"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"43902801143ca1a7bf6c718ae27c63a64fbeaa8ee78ee9e95e02f99f4d741070"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.collectEnvCheckFindings (cognitive 17): compose.collectEnvCheckFindings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, loops 5, boolean chains 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":"pkg/compose/publish.go"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"00acba41145ebe97b36d45b6b4d316d9452c70df8e9f4211bff4f083baf23cb9"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.removeNetwork (cognitive 17): composeService.removeNetwork has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/down.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e174c0e311fa485680b6aa10dcdc5d92ac1b69128e624e54a6cd835c316dc14e"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.runRun (cognitive 16): compose.runRun has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/run.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"1111764d4217d8a8833b8b5ec9f28a5b5f8021efbc24ca6d00d9ac8107ac0ea8"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.runWatch (cognitive 16): compose.runWatch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, loops 2, boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/watch.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3775ddccd45b5c97a3ba141cb438e00d24683ee1af6a2f222b85c2031d02d7"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchiveBuilder.writeEntry (cognitive 16): ArchiveBuilder.writeEntry has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 2 (nesting depth added 3). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/sync/tar.go"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1585fee5a76c4b524ed56aca3f560018af8b81feed8f9c9427e5ee5b73342b9a"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge.LoadAdditionalResources (cognitive 16): bridge.LoadAdditionalResources has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, loops 7 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/bridge/convert.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc74e7db62285ae4388fb2b1bbff235652abd2f03d52fa028e2526cd50a74c1"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.loadDevelopmentConfig (cognitive 16): compose.loadDevelopmentConfig has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 2, 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":"pkg/compose/watch.go"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0954352ada142307bc4d01b33cf6398d68ae377139a20d01c61d275d18ac2a"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.ensureImagesExists (cognitive 16): composeService.ensureImagesExists has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, loops 4, boolean chains 1 (nesting depth added 5). Of this number, 12 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. 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":"pkg/compose/build.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9bfd8bcc52e8d160654be0abfc30a9b76dcde142e6a8d4474ade9e2230caed"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.isServiceHealthy (cognitive 16): composeService.isServiceHealthy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 5, match/switch 2, 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":"pkg/compose/convergence.go"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"312450d3e4622a9c3d771483b89bd5651d3cfde20a52f2b945581425f9173943"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.copyFromContainer (cognitive 16): composeService.copyFromContainer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/cp.go"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb3048dba9fb7d5a5c27652d6e33d85b907ca2234de50c3a902ffca4d538669"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.createNetwork (cognitive 16): composeService.createNetwork has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, loops 3, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/create.go"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"916c710c1fa763268b3fb3284f1886b5ac79af28e826890a62595ce847328f8f"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.prepareRun (cognitive 16): composeService.prepareRun has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/run.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2a344f7ee22d39a6bb56a3676ec907369e542d5e5964f2ecc476ca006edd8e"}},{"ruleId":"D2","level":"warning","message":{"text":"composeService.Volumes (cognitive 16): composeService.Volumes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, loops 6 (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":"pkg/compose/volumes.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03a99ed9701c47707935b87cf994850c23cff15f3e58247b4400b74142e724d"}},{"ruleId":"D2","level":"warning","message":{"text":"modelAPI.SetModelVariables (cognitive 16): modelAPI.SetModelVariables has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, loops 3, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/model.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1803b84902b1aa1e2acd8cfa2dcafc149a1cf8b48cca86f5663992f1b4ef22"}},{"ruleId":"D2","level":"warning","message":{"text":"reconciler.reconcileVolumes (cognitive 16): reconciler.reconcileVolumes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/reconcile.go"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a092697689b240f2a55b1517e30525bbec708d5f6f65a2f10f5d6a748af91df"}},{"ruleId":"D2","level":"warning","message":{"text":"reconciler.reconcileService (cognitive 16): reconciler.reconcileService has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 2, loops 2, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/reconcile.go"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00eaad3be95ddcb5778618238f13d80a35d35e3fe2d9631ca4edf98161a5147"}},{"ruleId":"D2","level":"warning","message":{"text":"reconciler.hasVolumeMismatch (cognitive 16): reconciler.hasVolumeMismatch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, loops 3, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/reconcile.go"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcb000efb2f467aed4962831e94f0b2a137b20c1d51c79ea549e746583b7921"}},{"ruleId":"D2","level":"warning","message":{"text":"ociRemoteLoader.pullComposeFiles (cognitive 16): ociRemoteLoader.pullComposeFiles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 3, match/switch 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/remote/oci.go"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"60faea488185a9781d673db0029963276e24662d4c3b34f34c796aa66969ec06"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: composeService: TooManyMethods \u2014 183 methods, declared across 50 files: compose/compose.go (14), compose/down.go (14), compose/create.go (12), compose/watch.go (11), \u002B46 more file(s). That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"pkg/compose/compose.go"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"427962ca47836dbb4e0bddb34f42152c048f7c6a26e11120430ba17e9b6eb391"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DryRunClient: TooManyMethods \u2014 114 methods. 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":"pkg/dryrun/dryrunclient.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0902da68da5051b0a6a9d5d9476c9732a5d5507a37cd24dff13c2c7a5e427fa1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compose/create.go: FileTooLong \u2014 1018 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"pkg/compose/create.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ab06ebedc3ebbc17bad67da6e5bc18e5c9762de7d6168691ef68de2cc789e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compose/reconcile.go: FileTooLong \u2014 587 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"pkg/compose/reconcile.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"792a9eac0d157a73c3bc82486ca73626c7c30b07ffc9d94f99874062cb2edb5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compose/watch.go: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"pkg/compose/watch.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8d6fa8bf05256a0b59c7278d322b45c75330e40e86e37ca2b3a96f663d2ed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): cmd/compose/compose.go:402-417 | pkg/compose/loader.go:101-116 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cmd/compose/compose.go:402\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. 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":"cmd/compose/compose.go"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49dd880da563f11c088b4b593165e50192ea39623dc57c5754618138e298c1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/desktop/client.go:114-127 | internal/desktop/client.go:145-158 \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 \u0060internal/desktop/client.go:114\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/desktop/client.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab18bcf8194ebcb4673b99d01649d6baee0c3fb869a8d734627000fa435f1d0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pkg/compose/cp.go:161-174 | pkg/compose/cp.go:277-290 \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 \u0060pkg/compose/cp.go:161\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/cp.go"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3bb071531547a583905f85ede5f7fa3affd2d94421b54cf5ecfb10c6f63379"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): pkg/compose/transform/replace.go:37-50 | pkg/compose/transform/replace.go:76-89 \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 \u0060pkg/compose/transform/replace.go:37\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":"pkg/compose/transform/replace.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae60bd12548c894d4e5583c6616c99576de01f59376499a196fda9b9dabd298f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pkg/compose/compose.go:369-381 | pkg/compose/generate.go:81-93 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/compose.go"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"de39373856e81cc778635260002a2f3ba0d7476acbd425af79d0065a4036e096"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/compose/images.go:49-62 | pkg/compose/volumes.go:39-50 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/compose/volumes.go:39\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/images.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"224c6206e06951b4968e599ebc951bb9c760830491ab9ab0edc5b74d5c4f3486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cmd/compose/completion.go:42-52 | cmd/compose/completion.go:90-100 \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 \u0060cmd/compose/completion.go:42\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/completion.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dba079592421c0c914ad26a54e0d2a445d8660f2c65b8d0d97685e5976938f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cmd/compose/pull.go:102-112 | cmd/compose/watch.go:70-82 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. 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":"cmd/compose/pull.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d486d100e13b1ea9ee30777997eb05e42c1aff02ba63e64a808190464b744a05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/tracing/wrap.go:41-51 | internal/tracing/wrap.go:64-74 \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 \u0060internal/tracing/wrap.go:41\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/tracing/wrap.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d24407ac7235fbba2abc1e2a0fadc9b9e382bb5ce4f822a4a00fec067e35ace"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cmd/compose/create.go:88-97 | cmd/compose/up.go:178-187 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cmd/compose/create.go:88\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":"cmd/compose/create.go"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"5778442dd5f5845a69fe57d94a6d8cd0c7357c698e76b021cf65f822b8c24570"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): pkg/compose/pause.go:36-45 | pkg/compose/pause.go:61-70 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/compose/pause.go:36\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":"pkg/compose/pause.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f635c4dd7726809f3ad38b8c7c1abccf5f11446d097568bf2655ce23946ddb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/compose/observed_state.go:62-70 | pkg/compose/observed_state.go:86-94 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/observed_state.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c35124e5771790814ec29252983b21f54ebd2663f2b3c84a37ebb17ad1807aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cmd/compose/attach.go:49-55 | cmd/compose/export.go:44-50 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cmd/compose/attach.go:49\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":"cmd/compose/attach.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de686106fe646d0dddfc9cf58d749db0d46844e915576e9a241194a30182007"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cmd/compose/down.go:62-68 | cmd/compose/kill.go:47-54 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cmd/compose/down.go:62\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/down.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bf1a346eaa71eb355aef9ca65cd19db8f68c62ca256f8dd626aee4429d399a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cmd/compose/options.go:49-56 | pkg/api/api.go:243-249 \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 \u0060cmd/compose/options.go:49\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/options.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f511fb755cb2950e8dbf6be0c3f09f0ec63ecd0f1adf72327c229ba40b18f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): pkg/compose/reconcile.go:259-265 | pkg/compose/reconcile.go:446-452 \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 \u0060pkg/compose/reconcile.go:259\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":"pkg/compose/reconcile.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec25fb739561ef02d2c2c495b0adbea9edb6704ec542514e3e5d1e014c85d5e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/compose/create.go: pkg/compose/create.go changed 9 times in last 90 days, max complexity 20. 4 of those changes were fix/bug commits, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/create.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef15a672b811405602aac3146c49f7d9c8311e3248306229685e2b61d3d988b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/compose/build_bake.go: pkg/compose/build_bake.go changed 3 times in last 90 days, max complexity 59. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/build_bake.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a50b39c776cd519d307ac20914ebe2dce0da1e413033307dc841d2e7be9ce49"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/compose/pull.go: pkg/compose/pull.go changed 6 times in last 90 days, max complexity 26. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/pull.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84cb1769a5c3fd18cbb4f37bba2e92d943a489a093285880a66d40c933d1ffd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/compose/observed_state.go: pkg/compose/observed_state.go changed 9 times in last 90 days, max complexity 16. 3 of those changes were fix/bug commits, and the other 6 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/observed_state.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac905f591493c41541188fa41f124436cf9f8e9d6a82caeb2e1a6cdf2701cee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/compose/plugins.go: pkg/compose/plugins.go changed 7 times in last 90 days, max complexity 20. 2 of those changes were fix/bug commits, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/plugins.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3668316ff3350c00f0daeab05f53e73789c2027a83bddd57f8457d1c600e7270"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/compose/convergence.go: pkg/compose/convergence.go changed 5 times in last 90 days, max complexity 24. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, behind tests written first."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/convergence.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68744de179ae82d5c5eb5b5bddf54e2657e134ff929bc6889114e93d818ee5c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cmd/compose/compose.go: cmd/compose/compose.go changed 4 times in last 90 days, max complexity 29. 2 of those changes were fix/bug commits, and the other 2 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/compose.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6493cf88da181ed5b279af3977daa18810523d8ff9d027f82865100723ae6ef3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cmd/compose/config.go: cmd/compose/config.go changed 6 times in last 90 days, max complexity 15. 3 of those changes were fix/bug commits, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/config.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7901f3c214707407aa67074aec5862aa8a0a768374845d2254ab165e31e0b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/compose/down.go: pkg/compose/down.go changed 3 times in last 90 days, max complexity 20. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/compose/down.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1f44387f187994e5f849d5e65841f6f1606fcc503fe0dc78245598ad24a734"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/remote/oci.go: pkg/remote/oci.go changed 3 times in last 90 days, max complexity 18. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/remote/oci.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b643de0a63aad8200185723d5f327e8e965966ef3796c704f9e288280ba82cba"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 2 significant file(s) lose their only recent owner: cmd/compose/hooks.go, pkg/compose/executor_events.go. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4431f0cbcc992fb9c0081d3a4f7da3d7d1e4286a89befc92dabe18430d7ab4a4"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 3 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 (6 single-owned of 114 analysed files in total, counted over production source files of roughly 100 lines or more, excluding tests, vendored, generated and example/demo trees, largest first). They are anonymized user #2 (2 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (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":"D19","level":"note","message":{"text":"The Options table lists \u0060--no-recreate\u0060 but the description does not explain when Compose should recreate containers despite no changes.: Add a sentence noting that --no-recreate prevents recomposing even if configuration or image changed after container creation."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference/compose_up.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7771d70450a9f5b839265b550fb52fb0ddaa9ace9752b86dd4e4ffc5947333"}},{"ruleId":"D19","level":"note","message":{"text":"The pull command\u0027s Options section lists \u0060--ignore-buildable\u0060 (ignore images that can be built) and \u0060--policy\u0060, but the description for \u0060--ignore-buildable\u0060 is cut off mid-sentence, so its behavior is not fully clear.: Add a short one-line summary of what \u0060--ignore-buildable\u0060 does based on the sentence before it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference/compose_pull.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac001d6d4758cff52b61b1ed9609c74215a4ce1ca31259e37eac4c44a835001"}},{"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":"0cfbaa1ad95d16b9dea5aa39bd9b9edbefa22e7564d2bfac73cd50da431974fd"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","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":"becbc5502f94878197b05d70c7ef15f1353fd99a90efcb824b9c43f11ae5ce7a"}},{"ruleId":"D31","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":"ae2dfb06bfe0dcadfc949c881aa237cb2a4aac5b1cc69adf101d9e003549ef46"}},{"ruleId":"D31","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":"b67787f58bbdcde79a43cc08af597219f8bc8ccd5a82b8588a8f7af6b62ec402"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 4 of 114 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 100 lines or more, excluding tests, vendored, generated and example/demo trees, largest first). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 largest first: pkg/compose/viz.go, internal/tracing/wrap.go, pkg/watch/ephemeral.go (and 1 more). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: restart.go \u2194 stop.go: \u0060cmd/compose/restart.go\u0060 and \u0060cmd/compose/stop.go\u0060 change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/compose/restart.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecb3a3ae04b81a5a03de0aed0e790858a8dc92ef4076b3bdf17c77599f17c11"}},{"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":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"ruleId":"D38","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":"180098ad28b8ec88ea6d9d65ee5bc15f4d0baa3b9973c6b6be6d625ae224abce"}},{"ruleId":"D38","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":"50c379534161bb30611d421e82af3666b891a67b9a6a35df5a4fc4b4977e653b"}}],"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-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-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-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.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-328","guid":"f0ffc869-97c3-dc5c-8825-be1159f1fc5f","name":"CWE-328","shortDescription":{"text":"CWE-328"},"helpUri":"https://cwe.mitre.org/data/definitions/328.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-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"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-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":7,"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."]}]}