{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"I.Decode (cyclomatic 57): I.Decode has cyclomatic complexity 57 (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":"DecodeI.fs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2d4471703872c943ca777cfd4ca348f89ce1f9434d0a08bb07650fcfb0afd5"}},{"ruleId":"D1","level":"warning","message":{"text":"C.Decode (cyclomatic 49): C.Decode has cyclomatic complexity 49 (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":"DecodeC.fs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfdb2b007e81bdd0f9d38ce5d9a47fa1ec3a4c6462d0c2f68111db281527670"}},{"ruleId":"D1","level":"warning","message":{"text":"CLI.fetchArgs (cyclomatic 20): CLI.fetchArgs 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":"CLI.fs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4328fa5c4e58c18a1db91694c2f1d708d8065c105a76b94b9c3af9fb6acbc5cf"}},{"ruleId":"D1","level":"warning","message":{"text":"Decoder.Decode (cyclomatic 17): Decoder.Decode 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":"Decoder.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c247251993182eca20775a1f8a7f295ea0c6f833982a1e7f3d61c3c94af53b"}},{"ruleId":"D1","level":"warning","message":{"text":"I64.Decode (cyclomatic 17): I64.Decode has cyclomatic complexity 17 (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":"DecodeI64.fs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"611c9327e4e8cb140767d3d6a0ced4380db40672bb18497e8e9207af62a78baa"}},{"ruleId":"D2","level":"warning","message":{"text":"C.Decode (cognitive 63): C.Decode has cognitive complexity 63 (threshold 15). Drivers by points: if/else 45, match/switch 17, boolean chains 1 (nesting depth added 34). 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":"DecodeC.fs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c386410c4b25cfc96f18b9e528dad7ce0bd8511b423843bea75e2897032e37"}},{"ruleId":"D2","level":"warning","message":{"text":"CLI.fetchArgs (cognitive 56): CLI.fetchArgs has cognitive complexity 56 (threshold 15). Drivers by points: if/else 49, loops 3, boolean chains 2, match/switch 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"CLI.fs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e7d094d223c08b50a447f76c132082208f6dc85bd32db42fc8897abf043d3a"}},{"ruleId":"D2","level":"warning","message":{"text":"Decoder.Decode (cognitive 43): Decoder.Decode has cognitive complexity 43 (threshold 15). Drivers by points: if/else 37, boolean chains 6 (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":"Decoder.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea738e924c1f3101225a2c31f6b12fcc0922e9a6b1057f9c235536875f5a04d"}},{"ruleId":"D2","level":"warning","message":{"text":"I.Decode (cognitive 19): I.Decode has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 11, boolean chains 6, if/else 2 (nesting depth added 5). 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":"DecodeI.fs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff14c46890f459dd2c88102e0fb37f0ecaaaa0f3b30384b2876f66f9310a3d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Run.runSteps (cognitive 18): Run.runSteps has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, match/switch 7 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Run.fs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3889dd578a90c5648be8cfd2daa010525e3bc7b41cc3104e2947c4edbf0bc5d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: I: TooManyMethods \u2014 42 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":"ExecuteI.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2746a87b75a96b206149f2b1d04b5022c460afd365aef0e0db19ecff2cba5877"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): ExecuteI.fs:92-105 | ExecuteI.fs:112-125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ExecuteI.fs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"5854458d2536cfbaea35561ed39fcd666a7cc9b496f7534e797bb16f8a32d5fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): DecodeI.fs:64-74 | DecodeI64.fs:30-40 | DecodeA.fs:28-37 | DecodeA64.fs:28-37 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"DecodeI.fs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6ef2d748486dc11bfed1948b10c5c18587178caee8c80578a73b9fc0396425"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): DecodeM.fs:24-33 | DecodeM64.fs:21-30 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"DecodeM.fs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e71d2f86a5b289db7f4724759cf88991d5f5ceb3b353fc0e64735949b1d133f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): ExecuteA.fs:116-124 | ExecuteA.fs:135-143 | ExecuteA.fs:154-162 | ExecuteA.fs:173-181 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ExecuteA.fs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"778c74c93511f68d9cfa1c87a5ecf55899fc324d65958968165126f36d01badd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): ExecuteA64.fs:116-124 | ExecuteA64.fs:135-143 | ExecuteA64.fs:154-162 | ExecuteA64.fs:174-182 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ExecuteA64.fs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c89cc0383ed55258f1bb6fb17bc220a734451a5e30ea96d974f62d7399f814"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 9): ExecuteA.fs:41-48 | ExecuteA.fs:56-63 | ExecuteA.fs:71-78 | ExecuteA.fs:86-93 | ExecuteA.fs:101-108 | ExecuteA.fs:116-123 | ExecuteA.fs:135-142 | ExecuteA.fs:154-161 | ExecuteA.fs:173-180 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ExecuteA.fs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"661691c173d79b1e9a225ceada095add9cf9dda06f72c6a38550ff64bb3003bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 9): ExecuteA64.fs:41-48 | ExecuteA64.fs:56-63 | ExecuteA64.fs:71-78 | ExecuteA64.fs:86-93 | ExecuteA64.fs:101-108 | ExecuteA64.fs:116-123 | ExecuteA64.fs:135-142 | ExecuteA64.fs:154-161 | ExecuteA64.fs:174-181 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ExecuteA64.fs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c498291a58a13b7a4e15c9ba6d38bed912a7fdb7987f18910cbbf0c4895ba459"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ExecuteM.fs:93-100 | ExecuteM.fs:134-141 \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":"ExecuteM.fs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a29bb83328b5986567175a5a1338d240aaad3edfb2e26704111ac665f83ce0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ExecuteI.fs:126-131 | ExecuteI.fs:159-164 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ExecuteI.fs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d46d397cf98388ef88f26383d11cbaa9d5de27f5f3c0db4cb70c2df49927c81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ExecuteI.fs:137-142 | ExecuteI.fs:171-176 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ExecuteI.fs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db4ebc11a46a3e4914dba59d006b21e24c9b055cd8e4b2b055322c5614f8680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ExecuteI.fs:148-153 | ExecuteI64.fs:11-16 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ExecuteI.fs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6200876b7f42a486a8a52ef7a0ad1ea75b534d246a6a39bacdf9b692f54819"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): DecodeI64.fs:96-100 | DecodeM.fs:57-61 | DecodeM64.fs:55-59 | DecodeA.fs:66-70 | DecodeA64.fs:66-70 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"DecodeI64.fs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"391a61908d8dc4ac2ea3bb26936c1ab5b3f7ac48f95f2640a3be4902676e2635"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Run.fs:41-45 | Run.fs:49-53 \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":"Run.fs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1033926edc5c76bde18511f984344a23c8c90da25939904f8965027d6860387"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: xunit: xunit 2.9.3 \u2014 Legacy \u2014 the publisher\u0027s replacement is \u0060xunit.v3\u0060; migrate the reference to it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d37c8c0e8046c9e8358e976373216abfb78e9fdef63ed53d3edcaa7d2238edcd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ExecuteI.fs: ExecuteI.fs changed 5 times in last 90 days, max complexity 41. 2 of those changes were fix/bug commits, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, cover the area it touches with tests, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ExecuteI.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d393b933d3f3c2ea5bf7dddaf8902a8ca99218e4b65b70e574ce6c7a8b295a0f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: DecodeI.fs: DecodeI.fs changed 3 times in last 90 days, max complexity 57. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"DecodeI.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed845b640154cbd319037b3a905cf749ae64c33fe17b61510ed8148dc7340146"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: CLI.fs: CLI.fs changed 5 times in last 90 days, max complexity 20. 2 of those changes were fix/bug commits, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, cover the area it touches with tests, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"CLI.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02000c3bace94c4586832a2f4e99648b6810bb524d58131c8682225f55359f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ExecuteA.fs: ExecuteA.fs changed 3 times in last 90 days, max complexity 17. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ExecuteA.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a657b0d0de3fbfff7908d2cdc352e079d14c0aeafe1c6d0b6f03784d149394b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ExecuteA64.fs: ExecuteA64.fs changed 3 times in last 90 days, max complexity 17. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ExecuteA64.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b981201a496bb27d85558a078490cfa7ece59d42e7b7354dc3bb838997f2a11d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Arch.fs: Arch.fs changed 3 times in last 90 days, max complexity 17. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, cover the area it touches with tests, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Arch.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65333a9c8ff040267f42b08520f1b080d1184a8110dee1795c8f11e53e7a6f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Decoder.fs: Decoder.fs changed 2 times in last 90 days, max complexity 17. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, behind tests written first."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Decoder.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f305a5593b75bc1436ef946f7f21fec25f8811cb1e56c2803a7614b5de2582c7"}},{"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 204 commit(s) sampled)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b4b49d961df742f0e507f4cc5c8094fb077ba0391a27fd015d18320865187719"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb267f2ab41c95615bf1fb1864a50cb936c7295ced6b7812fed0fd361697105a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"36d920e5c19412bea921dacd31ff3eebbf3c029ce52d47f77f6afdec7e5d69be"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85db8caf1a0a80756358cff401555dff7d80494d953c125d8872831e21fb7f45"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.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":3,"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."]}]}