{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"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":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"]}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D2","level":"warning","message":{"text":"Pluralizer.adjustCase (cognitive 35): Pluralizer.adjustCase has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Extras/Pluralizer.fs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"de55467cfba9a42a9f785f4aba725afca482674f7a04f98d9af6e0ecfc29204a"}},{"ruleId":"D2","level":"warning","message":{"text":"TLog.OrElse (cognitive 26): TLog.OrElse has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), error handling 6 (9 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Extras/Stm.fs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea1138f099dbeea8ddd4d0e6f78f4f4445b27f2c0e8be344370db96242fb658"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Prelude: TooManyFunctions \u2014 70 functions. The bar is 30 functions; this is 40 over it, 2.33\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Extras/Prelude.fs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aad859af1b46bad34f17fdfd1f4a77cc275d079e07c108efcb7ba320707256b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: StringModule: TooManyFunctions \u2014 65 functions. The bar is 30 functions; this is 35 over it, 2.17\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Extras/String.fs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"812a1aff44c61036d50c662b0a0c2c5e83ce7f0780550c59519a9b5f14b19811"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Choice: TooManyFunctions \u2014 54 functions. The bar is 30 functions; this is 24 over it, 1.80\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Extras/ComputationExpressions/Choice.fs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc44afd488046b5b5c716d336979fd5329b53f22571718e449e9f5759d97f9a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FSharpOption: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Extras/CSharpCompat.fs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0842580e07d1ace596156d5581a5e9448d1b0c02917a686dbf57aafe00d0a5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Option: TooManyFunctions \u2014 42 functions. The bar is 30 functions; this is 12 over it, 1.40\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Extras/ComputationExpressions/Option.fs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd7f400bbdde7b0c0aa8c01a73def7562f463dc9c19c28cd2719705c3aca98f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: FSharpx.Extras/Iteratee.fs: FileTooLong \u2014 597 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 97 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Extras/Iteratee.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b87fcb84f896cf64c04c744ef65809baf08ad2edb9d76c03f3e66e05cca7da"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Nullable: TooManyFunctions \u2014 32 functions. The bar is 30 functions; this is 2 over it, 1.07\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Extras/ComputationExpressions/Nullable.fs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a07c84aecc90376c19ecb09d6dec805b8ce04fb5b5e4c456b6ec067b75a0ec8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FSharpChoice: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Extras/CSharpCompat.fs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"355ef12ca1fa637b331a4c160fd823fc17cbb5cbaddd2657835fdc3a2e992bed"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Task: TooManyFunctions \u2014 31 functions. The bar is 30 functions; this is 1 over it, 1.03\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Extras/ComputationExpressions/Task.fs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c57a564ebb94eb90e0344e928f23a0209edec6a1a25ae585a3484b040385dd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Conneg: TooManyFunctions \u2014 31 functions. The bar is 30 functions; this is 1 over it, 1.03\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Extras/Conneg.fs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"30687946e8990b93612bc0ff34afcd173a480a21b5bd8206f7d80871795681ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/FSharpx.Extras/ComputationExpressions/Async.fs:1-48 | src/FSharpx.Extras/ComputationExpressions/Continuation.fs:1-109 | src/FSharpx.Extras/ComputationExpressions/Option.fs:1-254 | src/FSharpx.Extras/ComputationExpressions/Reader.fs:1-80 | src/FSharpx.Extras/ComputationExpressions/State.fs:1-85 | src/FSharpx.Extras/ComputationExpressions/Writer.fs:1-109 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Extras/ComputationExpressions/Async.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f8771eeb1e538262df77747f318d9f754f4ff48fb548c9c037ed5e41c3d7c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): src/FSharpx.Extras/ComputationExpressions/Validation.fs:48-75 | src/FSharpx.Extras/ComputationExpressions/Validation.fs:125-152 \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":"src/FSharpx.Extras/ComputationExpressions/Validation.fs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2259ec0ef7978ac4ce8392e2a41e557cbbf34bdb67bbb38989838a8ecff00ac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): src/FSharpx.Extras/ComputationExpressions/Choice.fs:72-92 | src/FSharpx.Extras/ComputationExpressions/Task.fs:59-77 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"src/FSharpx.Extras/ComputationExpressions/Choice.fs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1ceee7efbfececad21d959e5b9f95c9872c6bc8d8e8942b2cb91887581a406"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): src/FSharpx.Extras/ComputationExpressions/State.fs:66-78 | src/FSharpx.Extras/ComputationExpressions/Writer.fs:85-100 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/FSharpx.Extras/ComputationExpressions/Writer.fs:100\u0060 calls \u0060inline\u0060, \u0060flip\u0060 and \u0060src/FSharpx.Extras/ComputationExpressions/State.fs:78\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Extras/ComputationExpressions/State.fs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab97f79382e1b654a803b68eb0780c20e9961212da783479468a5c22ce3894b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 4): src/FSharpx.Extras/ComputationExpressions/Async.fs:35-46 | src/FSharpx.Extras/ComputationExpressions/Continuation.fs:78-89 | src/FSharpx.Extras/ComputationExpressions/Reader.fs:67-78 | src/FSharpx.Extras/ComputationExpressions/Writer.fs:94-107 \u2014 before extracting anything, compare \u0060src/FSharpx.Extras/ComputationExpressions/Async.fs\u0060 and \u0060src/FSharpx.Extras/ComputationExpressions/Continuation.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Extras/ComputationExpressions/Async.fs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c314542a14161aeea251360ee4b7b329b91e8d8a36d505070598406da10c5f33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 6): src/FSharpx.Extras/ComputationExpressions/Async.fs:12-20 | src/FSharpx.Extras/ComputationExpressions/Continuation.fs:60-68 | src/FSharpx.Extras/ComputationExpressions/Option.fs:63-75 | src/FSharpx.Extras/ComputationExpressions/Reader.fs:49-57 | src/FSharpx.Extras/ComputationExpressions/State.fs:54-62 | src/FSharpx.Extras/ComputationExpressions/Writer.fs:67-79 \u2014 before extracting anything, compare \u0060src/FSharpx.Extras/ComputationExpressions/Async.fs\u0060 and \u0060src/FSharpx.Extras/ComputationExpressions/Continuation.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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. 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":"src/FSharpx.Extras/ComputationExpressions/Async.fs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad68e7a94cb90ed5adb3303d94b509926f8bf3c6c2842ad6575b02064d6b7525"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharpx.Extras/Pluralizer.fs:220-230 | src/FSharpx.Extras/Pluralizer.fs:238-248 \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":"src/FSharpx.Extras/Pluralizer.fs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd35a420492fe124c45a6f7137ab268bebaf06ebce41c6d5990b4300ebab1220"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 5): src/FSharpx.Extras/ComputationExpressions/Continuation.fs:72-78 | src/FSharpx.Extras/ComputationExpressions/Option.fs:78-87 | src/FSharpx.Extras/ComputationExpressions/Reader.fs:61-67 | src/FSharpx.Extras/ComputationExpressions/State.fs:66-72 | src/FSharpx.Extras/ComputationExpressions/Validation.fs:67-73 \u2014 before extracting anything, compare \u0060src/FSharpx.Extras/ComputationExpressions/Continuation.fs\u0060 and \u0060src/FSharpx.Extras/ComputationExpressions/Reader.fs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 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. 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":"src/FSharpx.Extras/ComputationExpressions/Continuation.fs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12d51087c370b0a75a7e7bb6028c61460e0579562245eca54912d3f4733b5ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharpx.Extras/ComputationExpressions/Choice.fs:60-69 | src/FSharpx.Extras/ComputationExpressions/Result.fs:37-46 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"src/FSharpx.Extras/ComputationExpressions/Choice.fs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b055cade61d7e206488aeac13285367517406c90e07d56bb8dc73798cc01805"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/FSharpx.Text.StructuredFormat/StructuredFormat.fs:492-501 | src/FSharpx.Text.StructuredFormat/StructuredFormat.fs:533-542 \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":"src/FSharpx.Text.StructuredFormat/StructuredFormat.fs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e4c3629af9312937ab30206212d3c60f25907efec1979334635d6c22777886"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/FSharpx.Extras/ComputationExpressions/Validation.fs:30-38 | src/FSharpx.Extras/ComputationExpressions/Validation.fs:107-115 \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":"src/FSharpx.Extras/ComputationExpressions/Validation.fs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace1bc62c6f8ffffa0065f79422df6420ade7f2b9a6ea683068927468ab66a43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/FSharpx.Extras/Iteratee.fs:497-504 | src/FSharpx.Extras/Iteratee.fs:730-737 \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":"src/FSharpx.Extras/Iteratee.fs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd551c035b8324ad5acfbc34b8d0203b89cc295920e35655140b73f9b1dcf27e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/FSharpx.Extras/ComputationExpressions/Choice.fs:116-122 | src/FSharpx.Extras/ComputationExpressions/Option.fs:25-31 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Extras/ComputationExpressions/Choice.fs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"22450a400abd17561e9d4801666c73a1279db05617b90625bea562fd90c996cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 5): src/FSharpx.Extras/ComputationExpressions/Async.fs:41-46 | src/FSharpx.Extras/ComputationExpressions/Continuation.fs:84-89 | src/FSharpx.Extras/ComputationExpressions/Option.fs:209-213 | src/FSharpx.Extras/ComputationExpressions/Reader.fs:73-78 | src/FSharpx.Extras/ComputationExpressions/Writer.fs:102-107 \u2014 before extracting anything, compare \u0060src/FSharpx.Extras/ComputationExpressions/Async.fs\u0060 and \u0060src/FSharpx.Extras/ComputationExpressions/Continuation.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Extras/ComputationExpressions/Async.fs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3fd3308ffc13336ee6583d5b81adbd7f89f3a2ad6358b4929b2882f6bc00c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharpx.Extras/ComputationExpressions/Validation.fs:23-27 | src/FSharpx.Extras/ComputationExpressions/Validation.fs:100-104 \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":"src/FSharpx.Extras/ComputationExpressions/Validation.fs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c7c3f78d8eff93be4a1cf5ed3053a9bf62cfa7d972c5f5b35883aef02828a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/FSharpx.Text.StructuredFormat/StructuredFormat.fs:877-881 | src/FSharpx.Text.StructuredFormat/StructuredFormat.fs:889-893 \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":"src/FSharpx.Text.StructuredFormat/StructuredFormat.fs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d68a75ee7dc8a55ddeb477172b827a3d862352a3aec6aa20093ad334b41afd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/FSharpx.Extras/ComputationExpressions/Reader.fs:23-33 | src/FSharpx.Extras/ComputationExpressions/State.fs:36-46 \u2014 before extracting anything, compare \u0060src/FSharpx.Extras/ComputationExpressions/Reader.fs\u0060 and \u0060src/FSharpx.Extras/ComputationExpressions/State.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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 \u0060src/FSharpx.Extras/ComputationExpressions/Reader.fs:23\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":"src/FSharpx.Extras/ComputationExpressions/Reader.fs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9825bb64fd2c25fd3f8b7786c0bb2fb45139c7cc52c96b210fa4e246e5de0e"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 no coverage collector is wired up: Coverage NOT MEASURED: \u0060--collect:\u0022XPlat Code Coverage\u0022\u0060 names a data collector that ships in the \u0060coverlet.collector\u0060 package, and this repository wires up none \u2014 no test project references it and no runsettings declares one. The absence of coverage here is therefore not evidence about the suite or about our analyzer environment: without a collector, \u0060--collect\u0060 produces nothing even from a suite that builds and passes. Add a \u0060coverlet.collector\u0060 PackageReference to the test project(s) (or commit the Cobertura/OpenCover/lcov report your CI produces) and real coverage will be measured. It is excluded from the score rather than counted as a near-zero defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: Does_not_conflict_with_System_Array: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FSharpx.CSharpTests/ArrayTests.cs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c4f86bc75d990ed9cce58d06934db05322ad14bff32fe2c18b7a76b4378318"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ToAsync: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FSharpx.CSharpTests/AsyncTests.cs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d043b4a8790b91edcde5ceffafa031003c593561d2856b07e8bbd7949ed1d2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: Test1_Imperative: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FSharpx.CSharpTests/ValidationTests.cs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da8c07066e86a0627a449e6964fd9bbe717c23498884b6d3f1aeed17984a876"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: Test2_imperative: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FSharpx.CSharpTests/ValidationTests.cs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e7d6c1da25c788acbb07b39b6f9b64fa83ff9e5ea11bbacaaf65ea2822ca21"}},{"ruleId":"D12","level":"warning","message":{"text":"Prerelease dependency: Microsoft.SourceLink.GitHub: Microsoft.SourceLink.GitHub resolves to 1.0.0-beta2-19351-01, a prerelease build. Prerelease packages carry no support policy, may change breaking between previews and can be unlisted \u2014 pin a stable release before shipping, or record the reason this preview is required."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"19f343f2215d1cdb63ac453b56bf6ffb30642a5db5e80f87989d3cfd38090c20"}},{"ruleId":"D17","level":"error","message":{"text":"FileScopedPragmaDisable: #pragma warning disable 219 \u2014 the disable has no matching restore anywhere in this file, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers \u2014 that alone turns a standing exemption into a scoped one \u2014 or fix the cause and drop the directive entirely."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FSharpx.CSharpTests/AsyncTests.cs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8ae6ae48168ea6866b60f29d689954c464f9bfda81ced839a25be5e1494b0b"}},{"ruleId":"D17","level":"warning","message":{"text":"BarePragmaDisable: #pragma warning disable 219 \u2014 the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line \u2014 what makes this site legitimately different \u2014 or fix what the rule is pointing at and delete the pair. A rationale in the member\u0027s documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FSharpx.CSharpTests/FuncTests.cs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5b7691ee90140dc504cf8c589e94bec9f58c2093c0a2f708c22f335b445b8c"}},{"ruleId":"D17","level":"warning","message":{"text":"BarePragmaDisable: #pragma warning disable 219 \u2014 the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line \u2014 what makes this site legitimately different \u2014 or fix what the rule is pointing at and delete the pair. A rationale in the member\u0027s documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FSharpx.CSharpTests/MapTests.cs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda01f305987fb1db20839208527377062eb2ab5b7030ea98eeaecb70d428184"}},{"ruleId":"D17","level":"warning","message":{"text":"CommentedOutCode: 3 consecutive commented-code lines"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FSharpx.CSharpTests/Person.cs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43155f93ec7aebbcd1b3a4daa6d4f937184c6519899adb52391c60e0458b840"}},{"ruleId":"D17","level":"warning","message":{"text":"CommentedOutCode: 4 consecutive commented-code lines"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FSharpx.CSharpTests/ValidationTests.cs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8989e7682c7de9b7694c341c1001cac653776b5f13f6edbbf02d12f542831d61"}},{"ruleId":"D17","level":"warning","message":{"text":"BarePragmaDisable: #pragma warning disable 414 \u2014 the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line \u2014 what makes this site legitimately different \u2014 or fix what the rule is pointing at and delete the pair. A rationale in the member\u0027s documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FSharpx.CSharpTests/ValidationTests.cs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4154ef6ef6cbae5880c8be377c279a027b410f29204ab4c2351a05bba39b86"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private Func\u003CAddress, FSharpChoice\u003CAddress, Errors\u003E\u003E ValidateAddressLines2 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FSharpx.CSharpTests/ValidationTests.cs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb9c039a592b8f9408d1ac8edce0b50ede57161371a02ea0dd06bf40cc966a1"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no installation or build instructions: No setup/build instructions for installing or building FSharpx.Extras. Add a short Install/Build section covering how to get the package (NuGet) and any prerequisites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa6bfcd5c6ae231d1b8ee99bced50b832d1f61cde9da6cbb533467b879a57db"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no usage examples: No runnable example demonstrating how to use one of the libraries in FSharpx.Extras. Add a Usage section with an executable or code snippet showing a minimal working example."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1355eb4e127a4bc9236772ce1c46f09510aa9286e7a06d1e47f308229df19049"}},{"ruleId":"D24","level":"note","message":{"text":"misleading comment: \u0022super verbose return\u0022 \u2014 delete - the line is a DefaultAsyncBuilder.Return(1), not a super-verbose return; this comment restates the code"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FSharpx.CSharpTests/AsyncTests.cs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0be827b8288f4ca89497dc97e73e6b9a8014044df2f882001ae1af37df7a1b"}},{"ruleId":"D24","level":"note","message":{"text":"misleading comment: \u0022PERFORM THE CHECKS USING Monadic SUGAR (LINQ)\u0022 \u2014 delete - the CostToEnter method uses applicative functors, not monadic sugar; the comment is a false claim against the code"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/FSharpx.CSharpTests/ValidationExample.cs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e53e83e66cb70083734070ad556bf024333cb68b57f7b2338551e4509ce80d"}},{"ruleId":"D28","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":"10953dc235cf8ea4c25525cd784e64dc429850c46d65172c22cc53e49c62a4af"},"properties":{"commitSha":"6c250802dc536dcf3c748d020976a9891022dc59"}},{"ruleId":"D28","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":"5452666d1d6ba114aa6094f2cd4696d83a454f346fbd81c60e8bd31f8c974361"},"properties":{"commitSha":"6c250802dc536dcf3c748d020976a9891022dc59"}},{"ruleId":"D28","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":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"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":"85596d040b50e8d06ccf83dadb684cc46fea9d38409df08516cf63f9eb339c7e"},"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":"ce3e9240ab2f04ac758ffe84ab68ebc170702bb48693ce587ea5125a019f3c45"},"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":"9136fbaa92ea14ac7cbc2c95c3cb37cd0aab779eca11caebabf6e972a920f9cd"},"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":"D34","level":"note","message":{"text":"Dormant codebase: 24 of 24 significant files have no living knowledge \u2014 the codebase as a whole is dormant, not 24 separate risks. Counted over 24 of the 32 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. Re-engage owners or document before change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4c69f1e54b7dd6fe9029dd02df6ba8f8145b789f2f18dbdaa086c40ded49dba6"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Text.StructuredFormat/StructuredFormat.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58dd562b754cc74157755ea18a42aaf957180d2ae10eac6effe082d3ab700ef"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/FSharpx.Extras/Iteratee.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e0db1209a41f2ff0ae997bfc0e90c356d9940ad4dab77f2817c703db4ffc99"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9658270ba49f37ed04e99ab1263b6393cd42aed8bdfb7aafd9fa1070f5491895"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"}},{"ruleId":"M1","level":"note","message":{"text":"Thin README: The root README is 89 words, against a bar of 120. Of the three newcomer-critical sections this check looks for by heading, it found no a testing section, no an architecture or project-map section. Sections are matched on HEADING text only, so material written under a heading this check does not recognise \u2014 or with no heading at all \u2014 is not seen and this row may understate what the document covers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5fc8f78bec0b6b3daab9d9139ba49b687f61b54f8310b64c159df9616f47e38e"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add \u0060semgrep --config=auto\u0060 plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) as a CI step. What was searched, so you can tell an absence from a miss: the 831 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}}],"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-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-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":8,"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."]}]}