{"$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":"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":"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":"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":"Parser.ParseKey (cyclomatic 51): Parser.ParseKey has cyclomatic complexity 51 (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":"tea/internal/infrastructure/ansi/parser.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53782572eeda27e6ed346718bd22acf5dac8817533127cf429e1260ed305913"}},{"ruleId":"D1","level":"warning","message":{"text":"renderer.runeDisplayWidth (cyclomatic 41): renderer.runeDisplayWidth has cyclomatic complexity 41 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tea/internal/infrastructure/renderer/inline.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"622c1def4698aa6f617f4416c484515c4d18d5765e7aeecfc08831c30ae25de1"}},{"ruleId":"D1","level":"warning","message":{"text":"EmacsKeybindings.Handle (cyclomatic 37): EmacsKeybindings.Handle has cyclomatic complexity 37 (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":"components/input/internal/textarea/infrastructure/keybindings/emacs.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafe3b36cde352eb751f1f13708dd031d8fead5141ba485fb05c748453d77f76"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.Run (cyclomatic 24): Program.Run has cyclomatic complexity 24 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 5 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":"tea/internal/application/program/program.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"611081c1ae98ca239e2fee4aafd9b778adf3c38b4c7b35b68f9b2bebe92d5697"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.Start (cyclomatic 24): Program.Start has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 3 of the 24 points are its own statements and the rest belongs to one function literal inside it that branches (line 285). 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":"tea/internal/application/program/program.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d909e45acb00517086da03f3d2717df05008ee8f8f04d37bf30fc2aa82b824"}},{"ruleId":"D1","level":"warning","message":{"text":"service.isEmoji (cyclomatic 23): service.isEmoji has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/internal/domain/service/unicode_service.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc792f4e1261e64335f554036a8cb4d4f8de732a7e4c712984d1cb8de31fcaa6"}},{"ruleId":"D1","level":"warning","message":{"text":"model.Update (cyclomatic 21): model.Update has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/context-menu/main.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d1982786d9de82f421e408610b714e9b2f5d45e33e5d622afc8904a9559317"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageCodec.DetectFormat (cyclomatic 20): ImageCodec.DetectFormat has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clipboard/internal/domain/service/image_codec.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f935b6922562381ba3913eb9e48c26e304ad0c1cb5a6625c5d6d84c677fe74d2"}},{"ruleId":"D1","level":"warning","message":{"text":"model.View (cyclomatic 20): model.View has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/context-menu/main.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e742097eb45fc78e22cf70e4768512f75b0dc47aa5afae8114d697f1bb4fc50"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderCommand.Execute (cyclomatic 20): RenderCommand.Execute has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"style/internal/application/command/render.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4123c5031308646ea46268ad0c07383e3a429fe7d53b5b09460954193eafd785"}},{"ruleId":"D1","level":"warning","message":{"text":"model.updateWrite (cyclomatic 19): model.updateWrite has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clipboard/examples/richtext-clipboard/main.go"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbf345512df28509b97fe93e63a82e4226f507af8b97e58c644040a7d5bdb8f"}},{"ruleId":"D1","level":"warning","message":{"text":"model.drawButton (cyclomatic 19): model.drawButton has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/hover-highlight/main.go"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c40fd9174f4f38976d6e6dd093db0b14d6fe0dfc90110cabacacebf748398df"}},{"ruleId":"D1","level":"warning","message":{"text":"FlexboxLayoutService.calculateMainAxisPositions (cyclomatic 19): FlexboxLayoutService.calculateMainAxisPositions has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"layout/internal/domain/service/flexbox_layout_service.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0351e60137d66b8fb795398284c3fd5bbf7ec61ea083680f0c62a2ca915c95e"}},{"ruleId":"D1","level":"warning","message":{"text":"Table.View (cyclomatic 17): Table.View 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":"components/table/table.go"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60b7020211bc1b41e52513b14932df5d701fca61fa38eebc006300e33a09368"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderService.Render (cyclomatic 17): RenderService.Render 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":"layout/internal/domain/service/render_service.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38a1770887daa9e4423080015fe41908fb595b350c47f1822d00c22e56570b6"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader.Read (cyclomatic 17): Reader.Read 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":"tea/internal/infrastructure/input/reader.go"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9207ea7ada1fa9f5018892c617c094a571df24abec2e2495dffeea544e1ee00"}},{"ruleId":"D1","level":"warning","message":{"text":"renderer.truncateLine (cyclomatic 17): renderer.truncateLine 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":"tea/internal/infrastructure/renderer/inline.go"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4162357fb70711d288857515e51ee2a1195067aefa129d8967252bdd2f072c"}},{"ruleId":"D1","level":"warning","message":{"text":"Style.Validate (cyclomatic 16): Style.Validate has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"style/internal/domain/model/style.go"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"377db4560da14d45b630a63f610cbd5209299539a6e268df46d5bd465754aff9"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.Start (cognitive 45): Program.Start has cognitive complexity 45 (threshold 15). Drivers by points: if/else 31, loops 9, boolean chains 3, match/switch 2 (nesting depth added 23). Most of this is not in the body itself: 2 of the 45 points are its own statements and the rest belongs to one function literal inside it that branches (line 285). 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":"tea/internal/application/program/program.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"71187df3e058a97f00aeaf735e2bc8bd80bd7d67f082c4a56814c0fad1e3306a"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.Run (cognitive 44): Program.Run has cognitive complexity 44 (threshold 15). Drivers by points: if/else 30, loops 9, boolean chains 3, match/switch 2 (nesting depth added 23). Of this number, 40 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":"tea/internal/application/program/program.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f540912a179129eb01bdaaaf0ae31e550cf0877ff0d49a76b6cf14b6ca3893"}},{"ruleId":"D2","level":"warning","message":{"text":"renderer.truncateLine (cognitive 44): renderer.truncateLine has cognitive complexity 44 (threshold 15). Drivers by points: if/else 29, loops 9, boolean chains 3, match/switch 3 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tea/internal/infrastructure/renderer/inline.go"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"157958b0df69ab33f4eec9be78dd0d44203906f96fb95103af6119886e43c55f"}},{"ruleId":"D2","level":"warning","message":{"text":"model.drawButton (cognitive 43): model.drawButton has cognitive complexity 43 (threshold 15). Drivers by points: if/else 37, boolean chains 3, loops 3 (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":"examples/hover-highlight/main.go"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c44b4c02e0307dfe957fae48b6c67d5cb287c859c8436581a202a6c3bfb6a8"}},{"ruleId":"D2","level":"warning","message":{"text":"Table.View (cognitive 39): Table.View has cognitive complexity 39 (threshold 15). Drivers by points: if/else 29, loops 8, boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"components/table/table.go"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d321e5e441113700301105c4f4735f01e5580b55c7dfd821dec4bf1d63c53a9"}},{"ruleId":"D2","level":"warning","message":{"text":"model.View (cognitive 39): model.View has cognitive complexity 39 (threshold 15). Drivers by points: if/else 24, loops 12, boolean chains 3 (nesting depth added 18). 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":"examples/context-menu/main.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"699a333a7037aba17e709c192f4ed691254f49acd670985f5c47712a7a63da13"}},{"ruleId":"D2","level":"warning","message":{"text":"FlexboxLayoutService.calculateMainAxisPositions (cognitive 38): FlexboxLayoutService.calculateMainAxisPositions has cognitive complexity 38 (threshold 15). Drivers by points: if/else 27, loops 10, match/switch 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":"layout/internal/domain/service/flexbox_layout_service.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf030b1afae957c5511a177745dcbd00c3bf610f818684b95cea0e7d870677ae"}},{"ruleId":"D2","level":"warning","message":{"text":"model.Update (cognitive 37): model.Update has cognitive complexity 37 (threshold 15). Drivers by points: if/else 28, match/switch 5, boolean chains 4 (nesting depth added 21). 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":"examples/context-menu/main.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe604a25fd8f3adefe573ef0da2788ccc4b3fa2abf62dd128dcd49cc503defaa"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.ParseKey (cognitive 35): Parser.ParseKey has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15, match/switch 14, boolean chains 6 (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":"tea/internal/infrastructure/ansi/parser.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fed0ad438a8d0e41676e7260ce74c38f5684e92f7c41a17b9a6e8fa3e28710"}},{"ruleId":"D2","level":"warning","message":{"text":"renderer.stripANSI (cognitive 32): renderer.stripANSI has cognitive complexity 32 (threshold 15). Drivers by points: if/else 21, loops 7, boolean chains 2, match/switch 2 (nesting depth added 20). 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":"tea/internal/infrastructure/renderer/inline.go"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0376d26fc59d11d2dd16ceb70829550f3d6bb3a98a0c1815ed909758440cff90"}},{"ruleId":"D2","level":"warning","message":{"text":"TodoModel.View (cognitive 29): TodoModel.View has cognitive complexity 29 (threshold 15). Drivers by points: if/else 23, loops 6 (nesting depth added 18). 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":"tea/examples/todo/main.go"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a98afd3f0e49f7b161a97f33759f60221e2b1a334c37f827ea6965ae9dc9408"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderCommand.Execute (cognitive 27): RenderCommand.Execute has cognitive complexity 27 (threshold 15). Drivers by points: if/else 24, boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"style/internal/application/command/render.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"66204edd11d2cd7af33df7e53bf2b9fc6119919015d848364f030c580c433f91"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader.Read (cognitive 27): Reader.Read has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, boolean chains 4, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tea/internal/infrastructure/input/reader.go"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b164c34272f8a8fb86003bb59af47a3ebb3ff5e01b2c48d8b04e346b002d15"}},{"ruleId":"D2","level":"warning","message":{"text":"model.updateWrite (cognitive 26): model.updateWrite has cognitive complexity 26 (threshold 15). Drivers by points: if/else 25, match/switch 1 (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":"clipboard/examples/richtext-clipboard/main.go"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"106b70bba9617754ab1b5b39bd048cd3880d9390406efb9a898904dc524a413f"}},{"ruleId":"D2","level":"warning","message":{"text":"Size.String (cognitive 26): Size.String has cognitive complexity 26 (threshold 15). Drivers by points: if/else 25, 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":"layout/internal/domain/value/size.go"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f61638f3d6c803a1f2149d7fab4d2c4adbf2b9c51444823ba14e0ed194f51b5"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderService.Render (cognitive 24): RenderService.Render has cognitive complexity 24 (threshold 15). Drivers by points: if/else 19, loops 5 (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":"layout/internal/domain/service/render_service.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cb0b8645b94e8b15daa12a1403271566810b7c511b7580d8858324d0aa93a4"}},{"ruleId":"D2","level":"warning","message":{"text":"renderer.runeDisplayWidth (cognitive 23): renderer.runeDisplayWidth has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 20, if/else 2, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tea/internal/infrastructure/renderer/inline.go"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da554629a8bb46d8377145691b07e43aabf5dfbb4aeb71e902fa032102655f1"}},{"ruleId":"D2","level":"warning","message":{"text":"TodoModel.Update (cognitive 22): TodoModel.Update has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18, match/switch 3, boolean chains 1 (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":"tea/examples/todo/main.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"340d6f386e172d6f2fa0474b24021b30b436645ab8f82e394fb3918e0759f5fd"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.execWithTTYControl (cognitive 21): Program.execWithTTYControl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 21 (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":"tea/internal/application/program/tty_control_linux.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4927d62a0bc765165c129aa16ea4b70c43d1aebda7d625694b3f01fa450137"}},{"ruleId":"D2","level":"warning","message":{"text":"TimerModel.Update (cognitive 20): TimerModel.Update has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, match/switch 3 (nesting depth added 12). 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":"tea/examples/timer/main.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e58126d4bd1de38aed5d9dbfb7a7005251ed802ebd1ad31cb7bc9ba3859807f"}},{"ruleId":"D2","level":"warning","message":{"text":"Flex.Render (cognitive 19): Flex.Render has cognitive complexity 19 (threshold 15). Drivers by points: loops 10, if/else 9 (nesting depth added 10). 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":"layout/layout.go"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"120814edf9eaac1dede3a7c08dba937cbaa3916bbab79d31ef9c095839a12926"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageCodec.DetectFormat (cognitive 18): ImageCodec.DetectFormat has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 4 (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":"clipboard/internal/domain/service/image_codec.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"785954cf028e490d059d8c528e9db1ac7ab35c450b2bb194b0f1aa0b35b0ec78"}},{"ruleId":"D2","level":"warning","message":{"text":"NavigationService.MoveUp (cognitive 18): NavigationService.MoveUp has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18 (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":"components/input/internal/textarea/domain/service/navigation.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa104631454d186ecbd397329215a802d95e2e0a1ecd98c760cc80040f8afe1d"}},{"ruleId":"D2","level":"warning","message":{"text":"NavigationService.MoveDown (cognitive 18): NavigationService.MoveDown has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18 (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":"components/input/internal/textarea/domain/service/navigation.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca1874fff9241edc19b3b55ed61db13b6a236ac2e493849ad70899d43b8a3b5"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer.applyOperations (cognitive 18): Renderer.applyOperations has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, match/switch 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"render/internal/application/renderer.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc69a6892dded8f1ce25ffb7e3671998dc7d44a026f3eb98f37a4533d2ad0368"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineRenderer.Render (cognitive 18): InlineRenderer.Render has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tea/internal/infrastructure/renderer/inline.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba853630cb024824760ee91dd486a4b3cf1d74bbfa34995474fc70c8710afa56"}},{"ruleId":"D2","level":"warning","message":{"text":"model.View (cognitive 17): model.View has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clipboard/examples/richtext-clipboard/main.go"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc3da4f277ae408ae1eaefda9420d7d8653cbd256d7a92d454d09b365e7fbbe"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer.renderFullScreen (cognitive 17): Renderer.renderFullScreen has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, loops 3 (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":"render/internal/application/renderer.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"16542e7c495bbdee0e212eb6c00a38baa18e866f005152254be4fe734d23e8fb"}},{"ruleId":"D2","level":"warning","message":{"text":"model.updateMenu (cognitive 16): model.updateMenu has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, match/switch 1 (nesting depth added 7). 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":"clipboard/examples/richtext-clipboard/main.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3d99c66c0ce3ff7896055b6c5ec86f4c85f40b34afde40b605b23d2715e0d6"}},{"ruleId":"D2","level":"warning","message":{"text":"model.updateConvert (cognitive 16): model.updateConvert has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, match/switch 1 (nesting depth added 7). 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":"clipboard/examples/richtext-clipboard/main.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77e78b70e6f45652d57754b823aa479859bdf54ee477933d945b4401d389512"}},{"ruleId":"D2","level":"warning","message":{"text":"Input.renderContent (cognitive 16): Input.renderContent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"components/input/input.go"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f039d9b89f44675dd5757ffd1ac912c6d83e9871b38eae06fb57e2e3ac9ac07"}},{"ruleId":"D2","level":"warning","message":{"text":"EmacsKeybindings.Handle (cognitive 16): EmacsKeybindings.Handle has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 12, if/else 3, boolean chains 1 (nesting depth added 7). 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":"components/input/internal/textarea/infrastructure/keybindings/emacs.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"79547179a960ec646c31a599fd78bb947f6b95c46c90652579c5aa495d9ea3bc"}},{"ruleId":"D2","level":"warning","message":{"text":"service.isEmoji (cognitive 16): service.isEmoji has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 13, if/else 3. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/internal/domain/service/unicode_service.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b393bc149a52fd9356d974178cdf1af216d426c4deaeac2bf1e21bc2366e7e"}},{"ruleId":"D2","level":"warning","message":{"text":"Size.Constrain (cognitive 16): Size.Constrain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 4 (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":"layout/internal/domain/value/size.go"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c32078ca7b5ca6cd113c76f3838806d068480c4c845ada0acbc2f4ad50fa14"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultTextAligner.AlignVertical (cognitive 16): DefaultTextAligner.AlignVertical has cognitive complexity 16 (threshold 15). Drivers by points: loops 11, if/else 4, match/switch 1 (nesting depth added 6). 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":"style/internal/domain/service/text_aligner.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fc31713d5b4ab1f14a7b539595c883cf31474a34d407f853d035555a0f63a7"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runPerformanceDemo (cognitive 16): main.runPerformanceDemo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, loops 3, match/switch 1 (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":"terminal/examples/platform_demo/main.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5183c16144ac17dd34ae17b152ca75cc55fba91c7f60af1303d0dfa0cf85ca6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Style: TooManyMethods \u2014 56 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":"style/internal/domain/model/style.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b5c6045e0888d13ba45964410d804cf3531eec6a950ae64d88056958291646"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TextArea: TooManyMethods \u2014 44 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":"components/input/internal/textarea/domain/model/textarea.go"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"91499d7c10d382bc96335e6bc78169d448da9a1366fa13b898334f0f61c89112"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MockTerminal: TooManyMethods \u2014 33 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":"testing/mock_terminal.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b3d9c2453e3d22a07091532fa20aac676e694fde774d4a8e97179caadbe2e3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TextInput: TooManyMethods \u2014 32 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":"components/input/internal/input/domain/model/input.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4af07adc2e57b98035862fd8326b1685cd626173bee575415b4daf2ab00cc5a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: List: TooManyMethods \u2014 31 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":"components/list/internal/domain/model/list.go"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d83172e3a831286ac10c751f434fa0186d072ebe65d9d01a010028e988c3f3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Console: TooManyMethods \u2014 31 methods. Most of these members implement terminal.internalTerminal (30 of 31 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"terminal/internal/infrastructure/windows/console.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"41186fb42a79b434e5fd4171d7f4575decb4798f5278d132e13a93d216c76fbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): tea/internal/domain/model/cmd.go:48-68 | tea/tea.go:458-478 \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 \u0060tea/internal/domain/model/cmd.go:48\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":"tea/internal/domain/model/cmd.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b620ac215bb2a990926a0611d68a2fbbafa4c0660369ccd39a035dfa497424"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): mouse/internal/infrastructure/parser/sgr_parser.go:134-153 | mouse/internal/infrastructure/parser/urxvt_parser.go:113-132 | mouse/internal/infrastructure/parser/x10_parser.go:97-116 \u2014 before extracting anything, compare \u0060mouse/internal/infrastructure/parser/sgr_parser.go\u0060 and \u0060mouse/internal/infrastructure/parser/urxvt_parser.go\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mouse/internal/infrastructure/parser/sgr_parser.go:134\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":"mouse/internal/infrastructure/parser/sgr_parser.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fefa2719341a5d2cce7c06f7fac313b9e7ff8713930fb68f1b74c415c1795bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): tea/internal/domain/model/cmd.go:109-128 | tea/tea.go:519-538 \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 \u0060tea/internal/domain/model/cmd.go:109\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":"tea/internal/domain/model/cmd.go"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6c6fdb44d47744383dc2a291f6b730feb54145a8f0a0d998374b4c7b7437b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): components/input/internal/textarea/domain/service/navigation.go:31-49 | components/input/internal/textarea/domain/service/navigation.go:76-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060components/input/internal/textarea/domain/service/navigation.go:31\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":"components/input/internal/textarea/domain/service/navigation.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e938cfcce3fe6c97cd20acc367766b6420fe060d1260d39c2b5265a9521784"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): mouse/internal/infrastructure/parser/sgr_parser.go:89-105 | mouse/internal/infrastructure/parser/urxvt_parser.go:80-96 | mouse/internal/infrastructure/parser/x10_parser.go:63-79 \u2014 before extracting anything, compare \u0060mouse/internal/infrastructure/parser/sgr_parser.go\u0060 and \u0060mouse/internal/infrastructure/parser/urxvt_parser.go\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mouse/internal/infrastructure/parser/sgr_parser.go:89\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mouse/internal/infrastructure/parser/sgr_parser.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e508ecc32618a321979a129603d32141ed806c1ef4d2629f22d83e9097c5281"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): tea/internal/infrastructure/input/cancelable_reader.go:177-197 | tea/internal/infrastructure/input/cancelable_reader.go:219-235 \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 \u0060tea/internal/infrastructure/input/cancelable_reader.go:177\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":"tea/internal/infrastructure/input/cancelable_reader.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91165ffa217349510bf2603b01f192a40c82871fd37c40d12939c8c99e44f1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): components/input/internal/textarea/domain/service/navigation.go:128-143 | components/input/internal/textarea/domain/service/navigation.go:180-195 \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 \u0060components/input/internal/textarea/domain/service/navigation.go:128\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":"components/input/internal/textarea/domain/service/navigation.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d0872d1f3dc2cf82da79a97a240cb5cbad22901d36cac29283d0fd234ccda9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): components/multiselect/internal/domain/model/multiselect.go:251-266 | components/select/internal/domain/model/select.go:198-213 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"components/multiselect/internal/domain/model/multiselect.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"18337da957637dddabe524b7b3addadb381246a4ce90de3e6d7372440ed1022a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/internal/domain/service/unicode_service.go:201-216 | core/internal/domain/service/unicode_service.go:238-253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/internal/domain/service/unicode_service.go:201\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":"core/internal/domain/service/unicode_service.go"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"91010fde450f4e8e8960f5a5f8d80216d83ea80f9df4c817c783f5fd38be11fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): mouse/internal/infrastructure/parser/sgr_parser.go:48-63 | mouse/internal/infrastructure/parser/urxvt_parser.go:42-57 \u2014 before extracting anything, compare \u0060mouse/internal/infrastructure/parser/sgr_parser.go\u0060 and \u0060mouse/internal/infrastructure/parser/urxvt_parser.go\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mouse/internal/infrastructure/parser/sgr_parser.go:48\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":"mouse/internal/infrastructure/parser/sgr_parser.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8920cfaa9c2d27d87f7d7fa50ee6e70676d70d5018e0ec73d49c31c00fc75ca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): tea/internal/application/program/program.go:191-209 | tea/internal/application/program/program.go:319-334 \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 \u0060tea/internal/application/program/program.go:191\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":"tea/internal/application/program/program.go"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9335a1f9105ff9179cbd682684687cc607d0b149252cc80d7c018be0f98ced8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): tea/internal/application/program/program.go:215-230 | tea/internal/application/program/program.go:340-355 \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 \u0060tea/internal/application/program/program.go:215\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":"tea/internal/application/program/program.go"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"19352a35b0e885c78faf6f032453838668a8d531462a3f4b6a60d2bc7d80bedb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): components/modal/examples/basic/main.go:41-55 | components/modal/examples/confirmation/main.go:57-71 | components/modal/examples/custom_buttons/main.go:71-85 | components/modal/examples/help_screen/main.go:42-56 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060components/modal/examples/basic/main.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 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":"components/modal/examples/basic/main.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"830858cae220e32d519de90fc24f3f3a479e524261629b08af8998e3f2c34eaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): style/internal/domain/service/spacing_calculator.go:82-96 | style/internal/domain/service/spacing_calculator.go:130-144 \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":"style/internal/domain/service/spacing_calculator.go"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa090afd7ed64f023b6948ec3469c18e2507b1d26d588f0ded9fa3a7d60840d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): style/internal/domain/model/theme_presets.go:32-46 | style/internal/domain/model/theme_presets.go:79-93 \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 \u0060style/internal/domain/model/theme_presets.go:32\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":"style/internal/domain/model/theme_presets.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d52e64fb30e0a91bcd73fef30e2cbc7b14ad463964ffc6de24591d9fc758290"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): components/multiselect/internal/domain/model/multiselect.go:191-204 | components/select/internal/domain/model/select.go:147-160 \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 \u0060components/multiselect/internal/domain/model/multiselect.go:191\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"components/multiselect/internal/domain/model/multiselect.go"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffaaa7227845677b075dfdc3b471e0bd7d05cd185186e7901be97544918397a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): components/multiselect/multiselect.go:267-280 | components/select/select.go:187-200 \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 \u0060components/multiselect/multiselect.go:267\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"components/multiselect/multiselect.go"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e285dbbf69154aa0958e1caf9b87db9034b6ba8f7a5138f99711b4a22d1c28e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): tea/internal/application/program/program.go:164-177 | tea/internal/application/program/program.go:291-304 \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 \u0060tea/internal/application/program/program.go:164\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":"tea/internal/application/program/program.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4824fb05e09d2b8b73053e3bf582663a2aa99bf1d90b14db5d5d2a64bfbc9fcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): mouse/internal/infrastructure/parser/urxvt_parser.go:53-65 | mouse/internal/infrastructure/parser/x10_parser.go:35-48 \u2014 before extracting anything, compare \u0060mouse/internal/infrastructure/parser/urxvt_parser.go\u0060 and \u0060mouse/internal/infrastructure/parser/x10_parser.go\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mouse/internal/infrastructure/parser/urxvt_parser.go:53\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mouse/internal/infrastructure/parser/urxvt_parser.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"99974bae203bb011ad554609d56e771ca50e7c3e2477703fb133801b69f00f4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): components/input/examples/styled/main.go:37-48 | components/input/examples/validated/main.go:48-61 \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 \u0060components/input/examples/styled/main.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":"components/input/examples/styled/main.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9309eab118ce2605ad9bdfa7a0f0f672dcc5cc31c8e4863a87332d567a9823ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): render/internal/application/renderer.go:40-52 | render/internal/application/renderer.go:60-71 \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 \u0060render/internal/application/renderer.go:40\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":"render/internal/application/renderer.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9be8d3d1e8562b9a65a992f6d06a3d2104e94fbf1bf9ed38b7eabaf98812a09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): components/modal/examples/basic/main.go:77-87 | components/modal/examples/confirmation/main.go:105-115 | components/modal/examples/help_screen/main.go:101-111 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060components/modal/examples/basic/main.go:77\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":"components/modal/examples/basic/main.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd06554b6975dbfb2ea0730802ffbd808488f117f6361b4f1a38129c2b6cfa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): clipboard/clipboard.go:519-529 | clipboard/clipboard.go:559-569 \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 \u0060clipboard/clipboard.go:519\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":"clipboard/clipboard.go"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9ae0eb413af165e63f4ccaad838416b8ad76d34e6187f12821b77bc1050dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): clipboard/examples/richtext-clipboard/main.go:204-214 | clipboard/examples/richtext-clipboard/main.go:261-271 \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 \u0060clipboard/examples/richtext-clipboard/main.go:204\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":"clipboard/examples/richtext-clipboard/main.go"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc2c6c4fdf7d86c21131120a918f563939010050878887581b2021da3a811ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): components/form/internal/domain/model/form.go:80-90 | components/form/internal/domain/model/form.go:106-116 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060components/form/internal/domain/model/form.go:80\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"components/form/internal/domain/model/form.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"479817cbf44ad459db2f82316d76379f534bdf62e0f8c5cfa93bc0a033d81a0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): components/progress/examples/multi_progress/main.go:45-54 | components/progress/examples/spinner_simple/main.go:32-42 \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 \u0060components/progress/examples/multi_progress/main.go:45\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":"components/progress/examples/multi_progress/main.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e18a5f889803beeedd9d83cf4a2e9f83cf464b6b0752da87feb4c902640eb3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): components/multiselect/multiselect.go:219-227 | components/select/select.go:154-162 \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 \u0060components/multiselect/multiselect.go:219\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":"components/multiselect/multiselect.go"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a0490e7b2d08edc06fefce4d761d93aa7e81c9e8aab2fb3b5e8beed05f69f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): style/internal/domain/model/theme_presets.go:23-31 | style/internal/domain/model/theme_presets.go:70-78 \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 \u0060style/internal/domain/model/theme_presets.go:23\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":"style/internal/domain/model/theme_presets.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7632824506bfc3d07073734753dae62664155230e8f949b50b5cb7b1a4b465f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): terminal/internal/infrastructure/windows/syscalls_windows.go:129-137 | terminal/internal/infrastructure/windows/syscalls_windows.go:150-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 \u0060terminal/internal/infrastructure/windows/syscalls_windows.go:129\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"terminal/internal/infrastructure/windows/syscalls_windows.go"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eeda1243a163946dae0d983cea1d9fee71e0d4952b4d3551ca8abe566893943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): clipboard/internal/domain/service/clipboard_history.go:87-92 | clipboard/internal/domain/service/clipboard_history.go:110-114 \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 \u0060clipboard/internal/domain/service/clipboard_history.go:87\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":"clipboard/internal/domain/service/clipboard_history.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b153185c9867b876cf2fa732d3ff83f46a3482bf7acc75f0abfbbc718e5f3a2"}},{"ruleId":"D16","level":"warning","message":{"text":"single-maintainer \u2014 knowledge-concentration (bus factor) risk: single-maintainer \u2014 knowledge-concentration (bus factor) risk (1 author(s) across 104 commit(s) sampled)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b4b49d961df742f0e507f4cc5c8094fb077ba0391a27fd015d18320865187719"}},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"51d28b019ea8241f77a2e9997a97fec9b465a7f81ef9ac87d5866c0b0be581cc"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"909469b71b317937c3189a5376950264b016d337ce2136c67b6bda328bbec195"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"16c0af0bd1d43908110da5d99bdc9ef7fcd81d9d0c24f72a645db7b83ac74c3a"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be47f59da12d6818eb7a77871881f0773f3a6acce85144fb92eb72bc95a23220"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3fcbba84abc36bb623e038d5704d2287c4e80a7a677c22992fbf1b73d9f893b9"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf42e2ae9763e19b7aa2aca567ea4427ea61c707e350fb8946bb69399a8065e3"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5720b96df0600b315ca7e3c1b46d24f621352b8522685206bb30600f3e20ce7a"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a295a7a9f414225fa32f418e49932ebb5b70a110782d74a6d32bf556c0cc2052"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63428359a06669a713a4046e793318c1ca6119898c201197fcda373bff76d216"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d6f8535201296b6767e8012e3a9b649f729dab189d284fb04cd4b504b2ca7fff"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2f323ebe89374b3dc6d9da67c68c58fe359f364c885ef8e9dfb72b414d542b80"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b487f8e69210ed1dc79aec0cdbc6a97b11b4e15ca5abceed9081e5720da58786"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e843e4113908fc113c32da5870b0d9553de60ca22e9b8b5b87f3b4f67a9155d3"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d177c73d38fafcf1e28d948f59f739caaff25db61b0749158dced348d1ec9714"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"464cfc7fe93ecbd287b2b6b24546aa9a37f8d4deee9247f793a49e2be27b4dac"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a57b3b9564dadb537845b26dc5bf4591966b0276d242a56c3f3c7dfd9424f1ea"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2db14ec064c102639e10f8f6447371ccbedffd1cea47b1287dbe5d9bcd49ac41"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c470704c50f5d76726db411f366a8d26e05c87b0e9fbf4e80a4f6b88bd0600cf"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c9096b185fcc68bed005272805832609a393bd0b33e062a8305b2eb8d38ee83"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0741f581b2a5e08124b051255ba75c440b607f8d81da0a18c7127ab546cccbe9"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59a2126ee54fe05052e2d0937838fc604788b99f1b522f3d83fedbe1b6dd77c0"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bd66cfbb8797e7f2d57117a16a33cf63c68fdf3b674b250fb11cb2e98f6da161"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"051431ff84f4adc46bc77e1056ebc1a38834b0269d3703f00ebb4954d5c5118f"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9a57c65d8caad8ce6276fd095fddd60368f35f8d625efa3cd3154409257d51f4"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2dbf27f8b7b9117d6277567c1f3071484bc454226f7e33f60670d9383d2a247"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ebc23ebd9f209f2259ac5910c50ee300c92fee84b094256d6b8560ea708915f7"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"01215ed33e4e55022e5384d5b3b009d866dd335e0f0d7b765c393a0ddc32d395"}},{"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":"5eccb0b60ddb2638c922359e133034f94e3772c876773e2091fcbca1db7b5e2b"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-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-242","guid":"5c147e5c-be37-b051-9928-764ef5a8f3d3","name":"CWE-242","shortDescription":{"text":"CWE-242"},"helpUri":"https://cwe.mitre.org/data/definitions/242.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-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":28,"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."]}]}