{"$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":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"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"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"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"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"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"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"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"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"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":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"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":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"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":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"DuplicateHandlerAnalyzer.analyzeFile (cyclomatic 52): DuplicateHandlerAnalyzer.analyzeFile has cyclomatic complexity 52 (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":"src/Frank.Analyzers/DuplicateHandlerAnalyzer.fs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"293291daa0fdade49e4866045d21bff9481d987e9456b6a45766e4f8d665b213"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerSentEventGenerator.PatchElementsAsync (cyclomatic 18): ServerSentEventGenerator.PatchElementsAsync has cyclomatic complexity 18 (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":"src/Frank.Datastar/ServerSentEventGenerator.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"03983c2ad470e3c71cc633e61e53cef4517887d16fdc3e65cdd8c1b9af8f557b"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerSentEventGenerator.PatchElementsAsync (cyclomatic 17): ServerSentEventGenerator.PatchElementsAsync 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. This shape REPEATS in the file: one other method here (ServerSentEventGenerator.PatchElementsAsync) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Datastar/ServerSentEventGenerator.fs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44c89fd35dfb81830a57148ba0923123d2579ee20e37f3d29354305e9acabb6"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerSentEventGenerator.PatchElementsAsync (cyclomatic 17): ServerSentEventGenerator.PatchElementsAsync 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. This shape REPEATS in the file: one other method here (ServerSentEventGenerator.PatchElementsAsync) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Datastar/ServerSentEventGenerator.fs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9e0784132f7c302da0f487b6d68319dcffd2cf6a3010d8ba8a09dc50d081ef"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicateHandlerAnalyzer.analyzeFile (cognitive 69): DuplicateHandlerAnalyzer.analyzeFile has cognitive complexity 69 (threshold 15). Drivers by points: match/switch 11 (37 pts), if/else 11 (18 pts), loops 7 (14 pts) (nesting depth added 40). 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":"src/Frank.Analyzers/DuplicateHandlerAnalyzer.fs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae1ea666ebb72ca8ea98ab20819b26bd7d74bd5f202762bdbcae93fd3d57777"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerSentEventGenerator.PatchElementsAsync (cognitive 17): ServerSentEventGenerator.PatchElementsAsync has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (5 pts), boolean chains 2, loops 1 (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":"src/Frank.Datastar/ServerSentEventGenerator.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"be847474b691954176f6c1967953f3bc1a143333043d78494e41d466a10f77cc"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerSentEventGenerator.PatchElementsAsync (cognitive 16): ServerSentEventGenerator.PatchElementsAsync has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (5 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ServerSentEventGenerator.PatchElementsAsync) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Datastar/ServerSentEventGenerator.fs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"400020944b6b11c3fdc729878285f9247dd40e14035c61cdec79ff4b4405273f"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerSentEventGenerator.PatchElementsAsync (cognitive 16): ServerSentEventGenerator.PatchElementsAsync has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (5 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ServerSentEventGenerator.PatchElementsAsync) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Datastar/ServerSentEventGenerator.fs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f9bbc181f653cf5a83b4510d37bef5d528c4b4a5afb42bfd064e112b2f0ace"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ResourceBuilder: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\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/Frank/ResourceBuilder.fs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf28e0d9434142c5314bd9a9d83c5f31057f6c62ecc797c3156271a0f9eaa42f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (109 corresponding lines): src/Frank.Validation/ShapeTypes.fs:1-109 | src/Frank.Validation/ShapeTypes.fsi:1-142 \u2014 These two members are one piece of code written twice and then edited apart: 109 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Validation/ShapeTypes.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fd0cc1291c11664c8d8ed693896094cb2985d1c1cfe6d5826b0a999e488ac5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): src/Frank.Alps/DescriptorTypes.fs:1-69 | src/Frank.Alps/DescriptorTypes.fsi:1-87 \u2014 These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Alps/DescriptorTypes.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18505d841348217d3185eadca2cefe7227e4e40d7d152eec056e13757c160a4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/Frank.Auth/HandlerBuilderExtensions.fs:1-30 | src/Frank.Auth/ResourceBuilderExtensions.fs:1-25 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Auth/HandlerBuilderExtensions.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e82b330eb2a08988f7fc9b8bf71633853df3ce4a815691ef1dd47ea41fcf9f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): src/Frank.Analyzers/DuplicateHandlerAnalyzer.fsi:1-51 | src/Frank.Analyzers/HrefVarAnalyzer.fsi:1-44 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Analyzers/DuplicateHandlerAnalyzer.fsi"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d288d2050e115b6df078b9784ee27f4bc0a71383e1eedfac0cd3d83591d79ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47\u201350 lines \u00D7 2): src/Frank.Validation/ShapeTypes.fs:63-109 | src/Frank.Validation/ShapeTypes.fsi:93-142 \u2014 before extracting anything, compare \u0060src/Frank.Validation/ShapeTypes.fs\u0060 and \u0060src/Frank.Validation/ShapeTypes.fsi\u0060 as WHOLE FILES: 92% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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/Frank.Validation/ShapeTypes.fs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5762d5c7096a2a9d02f4b6dc55ad34764db9924f9085b5442dfff67fb7725369"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): src/Frank.Datastar/ServerSentEventGenerator.fs:97-138 | src/Frank.Datastar/ServerSentEventGenerator.fs:320-361 \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 \u0060src/Frank.Datastar/ServerSentEventGenerator.fs:97\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/Frank.Datastar/ServerSentEventGenerator.fs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"56577ca9517b2fe08e31c8513c8f35b11b3a99745cfa69bd68ff9bcbdeb41f71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201339 lines \u00D7 2): src/Frank.Alps/DescriptorTypes.fs:38-69 | src/Frank.Alps/DescriptorTypes.fsi:49-87 \u2014 before extracting anything, compare \u0060src/Frank.Alps/DescriptorTypes.fs\u0060 and \u0060src/Frank.Alps/DescriptorTypes.fsi\u0060 as WHOLE FILES: 96% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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/Frank.Alps/DescriptorTypes.fs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bfccba259d25457d2c03b4bf221de5bb2b4f1a8c975ad13e73e120d738f1a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201325 lines \u00D7 2): src/Frank.Datastar/Frank.Datastar.fs:98-122 | src/Frank.Datastar/Frank.Datastar.fs:171-187 \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 \u0060src/Frank.Datastar/Frank.Datastar.fs:98\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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/Frank.Datastar/Frank.Datastar.fs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"801fd34211261d00eb8e436d79830e59bc9b8b0be5d0e6f5bd4221f47104f173"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/Frank.Datastar/Types.fs:1-24 | src/Frank.Datastar/Types.fsi:1-24 \u2014 before extracting anything, compare \u0060src/Frank.Datastar/Types.fs\u0060 and \u0060src/Frank.Datastar/Types.fsi\u0060 as WHOLE FILES: 90% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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/Frank.Datastar/Types.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3db42e1874dc8f2c1c73364d6df6a138ce67e5f19644f033cd75d7bc884c2c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/Frank.Alps/AuthorizationFilter.fs:34-54 | src/Frank.JsonHome/AuthorizationFilter.fs:48-68 \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":"src/Frank.Alps/AuthorizationFilter.fs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8615a3ab5933fd12920ec3ba2b6c89ef94973d37dafbfa2509ecc9ecbf9cf4d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): src/Frank.Datastar/ServerSentEventGenerator.fs:67-84 | src/Frank.Datastar/ServerSentEventGenerator.fs:118-135 | src/Frank.Datastar/ServerSentEventGenerator.fs:341-358 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Datastar/ServerSentEventGenerator.fs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ec6924d7477b8b6eb57fac8950e6a0d325658f3729642c75671ca4aaa81374"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Frank.Datastar/SseDataLineStream.fs:74-89 | src/Frank.Datastar/SseDataLineWriter.fs:60-75 \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/Frank.Datastar/SseDataLineStream.fs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f652dd0cbd35228721b9172ce37c5f094e2eb9bbda7c049e59f2d382ed297f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Frank.Datastar/ServerSentEventGenerator.fs:220-233 | src/Frank.Datastar/ServerSentEventGenerator.fs:395-408 \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 \u0060src/Frank.Datastar/ServerSentEventGenerator.fs:220\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/Frank.Datastar/ServerSentEventGenerator.fs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"13eca2174bbdea56b81d5c6ef1e9d8ed6ba0cdfd635362e5cd482e0a38b510d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201313 lines \u00D7 2): src/Frank.Alps/AuthorizationFilter.fs:24-30 | src/Frank.JsonHome/AuthorizationFilter.fs:32-44 \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 \u0060src/Frank.Alps/AuthorizationFilter.fs:24\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Alps/AuthorizationFilter.fs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf545ade2994565a86caafca1d2ac4305626d2e7a33e6b7bdd2d73d9b6d4d939"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Frank.Datastar/ServerSentEventGenerator.fs:44-54 | src/Frank.Datastar/ServerSentEventGenerator.fs:147-157 \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/Frank.Datastar/ServerSentEventGenerator.fs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d315af1a394a3607f1208b0f90cb18ddc3fe8980bb743430396e18eead156ac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Frank.Datastar/ServerSentEventGenerator.fs:174-184 | src/Frank.Datastar/ServerSentEventGenerator.fs:370-380 \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 \u0060src/Frank.Datastar/ServerSentEventGenerator.fs:174\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/Frank.Datastar/ServerSentEventGenerator.fs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e0cca9a1985f2a6bbc41aceec59b008187180500bb8865c6de49c7d617ef8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): src/Frank.Datastar/ServerSentEventGenerator.fs:258-266 | src/Frank.Datastar/ServerSentEventGenerator.fs:293-301 | src/Frank.Datastar/ServerSentEventGenerator.fs:428-437 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Frank.Datastar/ServerSentEventGenerator.fs:258\u0060 calls \u0060match\u0060 and \u0060src/Frank.Datastar/ServerSentEventGenerator.fs:428\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Datastar/ServerSentEventGenerator.fs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d717275e2c8920129d0344037f75c243610241d06a1d84216cc7a062e0d3b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Frank.OpenApi/WebHostBuilderExtensions.fs:53-62 | src/Frank.OpenApi/WebHostBuilderExtensions.fs:66-75 \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/Frank.OpenApi/WebHostBuilderExtensions.fs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c8b8976b0c293340cb23c7bca300dbee8962407f7b64578b0ec29682eab177"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/Frank.Datastar/ServerSentEventGenerator.fs:56-64 | src/Frank.Datastar/ServerSentEventGenerator.fs:107-115 | src/Frank.Datastar/ServerSentEventGenerator.fs:330-338 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Datastar/ServerSentEventGenerator.fs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a457504e1d91a1079f72494da472219d9b9d920513174abea30cfaf233357c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Frank.Datastar/SseDataLineStream.fs:21-29 | src/Frank.Datastar/SseDataLineWriter.fs:19-27 \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/Frank.Datastar/SseDataLineStream.fs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc87cdbab6f83eec35490bc93cb22c73a5942aafe06e974f5b62bbd01bd87ce0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Frank.Validation/Shacl.fs:206-214 | src/Frank.Validation/Shacl.fs:305-313 \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/Frank.Validation/Shacl.fs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4eda6ef34e87a34206b2ce87895500bf7aee136329e9e5e010c5cfefb67541"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/Frank.Datastar/ServerSentEventGenerator.fs:95-102 | src/Frank.Datastar/ServerSentEventGenerator.fs:280-287 | src/Frank.Datastar/ServerSentEventGenerator.fs:318-325 | src/Frank.Datastar/ServerSentEventGenerator.fs:417-424 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Datastar/ServerSentEventGenerator.fs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"85844f0e04beaaba16241d8e1123880c963f042b7a44f487a3276191f958e3dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Frank.Alps/Excerpt.fs:24-30 | src/Frank.Alps/ProtocolGraph.fs:10-16 \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/Frank.Alps/Excerpt.fs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"759699ad9ec66f9395defb207b2efe79436d567b089fe7c3e28e6bf84483ec7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Frank.Datastar/ServerSentEventGenerator.fs:189-195 | src/Frank.Datastar/ServerSentEventGenerator.fs:385-391 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Datastar/ServerSentEventGenerator.fs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f255b52b0ea60bacc32c28f414d040ed5a90df397d6ecffb1244c15f499894ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Frank.Auth/AuthRequirement.fs:1-8 | src/Frank.Auth/AuthRequirement.fsi:1-8 \u2014 before extracting anything, compare \u0060src/Frank.Auth/AuthRequirement.fs\u0060 and \u0060src/Frank.Auth/AuthRequirement.fsi\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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/Frank.Auth/AuthRequirement.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3188972379fe114546b605803d92c7d76d890029129a7feab1754e5394254d5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 337 shared lines): sample/Frank.Datastar.Basic/Program.fs:1-629 | sample/Frank.Datastar.Hox/Program.fs:18-779 | sample/Frank.Datastar.Oxpecker/Program.fs:1-760 \u2014 These 3 members are variants of one another: a block of 337 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sample/Frank.Datastar.Basic/Program.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06f67cb514c2c6484ba91a2e380d9e879a4fd38614297e9b0d706e4bf990b9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): sample/Frank.Falco/Extensions.fs:1-29 | sample/Frank.Giraffe/Extensions.fs:1-29 | sample/Frank.OpenApi.Sample/Extensions.fs:1-24 | sample/Frank.Oxpecker/Extensions.fs:1-33 | sample/Sample/Extensions.fs:1-36 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sample/Frank.Falco/Extensions.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab440469a6251a53d23b6bbf3b707b06840b88032985cc53874b690639ee286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (73 lines \u00D7 3): sample/Frank.Datastar.Basic/Program.fs:557-629 | sample/Frank.Datastar.Hox/Program.fs:707-779 | sample/Frank.Datastar.Oxpecker/Program.fs:688-760 \u2014 \u0060sample/Frank.Datastar.Basic/Program.fs\u0060 and \u0060sample/Frank.Datastar.Hox/Program.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 339 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sample/Frank.Datastar.Basic/Program.fs:557\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":"sample/Frank.Datastar.Basic/Program.fs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c31bfa966751693a6d393ae748b899b858a479f3d94e44865ffa8e5dcfd833"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (56 lines \u00D7 3): sample/Frank.Datastar.Basic/Program.fs:132-187 | sample/Frank.Datastar.Hox/Program.fs:95-150 | sample/Frank.Datastar.Oxpecker/Program.fs:135-190 \u2014 \u0060sample/Frank.Datastar.Basic/Program.fs\u0060 and \u0060sample/Frank.Datastar.Hox/Program.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 339 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sample/Frank.Datastar.Basic/Program.fs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e803780b9480c4ed3cf05316a2c43ab5edbb2f0ae387e65f41d18e9f01faa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53 lines \u00D7 3): sample/Frank.Datastar.Basic/Program.fs:30-82 | sample/Frank.Datastar.Hox/Program.fs:40-92 | sample/Frank.Datastar.Oxpecker/Program.fs:31-83 \u2014 \u0060sample/Frank.Datastar.Basic/Program.fs\u0060 and \u0060sample/Frank.Datastar.Hox/Program.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 339 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sample/Frank.Datastar.Basic/Program.fs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a758bd105039e5c939a5386e568b298c936003c87f6015f70e0dc914d7625d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): sample/Frank.Datastar.Basic/Program.fs:484-523 | sample/Frank.Datastar.Oxpecker/Program.fs:616-655 \u2014 \u0060sample/Frank.Datastar.Basic/Program.fs\u0060 and \u0060sample/Frank.Datastar.Oxpecker/Program.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 15 separate duplicated blocks between them, totalling at least 503 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sample/Frank.Datastar.Basic/Program.fs:484\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":"sample/Frank.Datastar.Basic/Program.fs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f9e36f0180d119842dd3f40a77b1dcc7e9ba5aa73a7af746604b3e1d64276c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (62 lines \u00D7 2): sample/Frank.Datastar.Basic/Program.fs:210-271 | sample/Frank.Datastar.Oxpecker/Program.fs:259-320 \u2014 \u0060sample/Frank.Datastar.Basic/Program.fs\u0060 and \u0060sample/Frank.Datastar.Oxpecker/Program.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 15 separate duplicated blocks between them, totalling at least 503 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"sample/Frank.Datastar.Basic/Program.fs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72caf45fb64ebc203811cff400f948ca869dcb5e873649623c4b845b7eba420"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): sample/Frank.Datastar.Basic/Program.fs:313-346 | sample/Frank.Datastar.Oxpecker/Program.fs:376-409 \u2014 \u0060sample/Frank.Datastar.Basic/Program.fs\u0060 and \u0060sample/Frank.Datastar.Oxpecker/Program.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 15 separate duplicated blocks between them, totalling at least 503 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sample/Frank.Datastar.Basic/Program.fs:313\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":"sample/Frank.Datastar.Basic/Program.fs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"38193acb55f4618fb046ddbc28590e18083d32b2fd58df240639b4da71831228"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 3): sample/Frank.Datastar.Basic/Program.fs:92-122 | sample/Frank.Datastar.Hox/Program.fs:161-191 | sample/Frank.Datastar.Oxpecker/Program.fs:94-124 \u2014 \u0060sample/Frank.Datastar.Basic/Program.fs\u0060 and \u0060sample/Frank.Datastar.Hox/Program.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 339 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sample/Frank.Datastar.Basic/Program.fs:92\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":"sample/Frank.Datastar.Basic/Program.fs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7161a6960b41a88de765187edf9abfdc071326a897db1e4bc130565188ee43a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 3): sample/Frank.Datastar.Basic/Program.fs:405-435 | sample/Frank.Datastar.Hox/Program.fs:505-535 | sample/Frank.Datastar.Oxpecker/Program.fs:498-528 \u2014 \u0060sample/Frank.Datastar.Basic/Program.fs\u0060 and \u0060sample/Frank.Datastar.Hox/Program.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 339 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sample/Frank.Datastar.Basic/Program.fs:405\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sample/Frank.Datastar.Basic/Program.fs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"6427045569ddb797cc6ddcb2c0aea6813930d40cd0a4939bda0127120979bfc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 3): sample/Frank.Datastar.Basic/Program.fs:335-359 | sample/Frank.Datastar.Hox/Program.fs:402-428 | sample/Frank.Datastar.Oxpecker/Program.fs:398-422 \u2014 \u0060sample/Frank.Datastar.Basic/Program.fs\u0060 and \u0060sample/Frank.Datastar.Hox/Program.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 339 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sample/Frank.Datastar.Basic/Program.fs:335\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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":"sample/Frank.Datastar.Basic/Program.fs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5da1139d13f0b6fedcdffe1789160e404ec98c994fdc9be46d510eb9b646d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 3): sample/Frank.Falco/Extensions.fs:6-27 | sample/Frank.Giraffe/Extensions.fs:6-27 | sample/Frank.Oxpecker/Extensions.fs:8-26 \u2014 \u0060sample/Frank.Falco/Extensions.fs\u0060 and \u0060sample/Frank.Giraffe/Extensions.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 35 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sample/Frank.Falco/Extensions.fs:6\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":"sample/Frank.Falco/Extensions.fs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccca143372696d71ec862404c41b3cdf6816300efd7d0daf3d41fca454656d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): sample/Frank.Datastar.Basic/Program.fs:514-533 | sample/Frank.Datastar.Hox/Program.fs:663-682 | sample/Frank.Datastar.Oxpecker/Program.fs:646-665 \u2014 \u0060sample/Frank.Datastar.Basic/Program.fs\u0060 and \u0060sample/Frank.Datastar.Hox/Program.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 339 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sample/Frank.Datastar.Basic/Program.fs:514\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":"sample/Frank.Datastar.Basic/Program.fs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d84f86d0c150d2c1e80b79dfdf678a8267ace3f203800aa7565e7402e612df6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): sample/Frank.OpenApi.Sample/Extensions.fs:3-21 | sample/Sample/Extensions.fs:3-21 \u2014 \u0060sample/Frank.OpenApi.Sample/Extensions.fs\u0060 and \u0060sample/Sample/Extensions.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 32 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sample/Frank.OpenApi.Sample/Extensions.fs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f710074da737f3002dc7c033bc87907d2a96d4ef968063b714ebcd9fe8027e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): sample/Frank.Datastar.Basic/Program.fs:283-300 | sample/Frank.Datastar.Oxpecker/Program.fs:334-351 \u2014 \u0060sample/Frank.Datastar.Basic/Program.fs\u0060 and \u0060sample/Frank.Datastar.Oxpecker/Program.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 15 separate duplicated blocks between them, totalling at least 503 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sample/Frank.Datastar.Basic/Program.fs:283\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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":"sample/Frank.Datastar.Basic/Program.fs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b8d1c721bed50c6bfd8e7cf8f828d259877f9286d2c3a194060a122521f187"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): sample/Frank.Datastar.Basic/Program.fs:228-244 | sample/Frank.Datastar.Hox/Program.fs:268-284 | sample/Frank.Datastar.Oxpecker/Program.fs:277-293 \u2014 \u0060sample/Frank.Datastar.Basic/Program.fs\u0060 and \u0060sample/Frank.Datastar.Hox/Program.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 339 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sample/Frank.Datastar.Basic/Program.fs:228\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":"sample/Frank.Datastar.Basic/Program.fs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"981e7b7b81bd679ff2a1b363b04efe167b723741c677010ed5c548d12379d210"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): sample/Frank.Datastar.Basic/Program.fs:275-291 | sample/Frank.Datastar.Hox/Program.fs:325-341 | sample/Frank.Datastar.Oxpecker/Program.fs:326-342 \u2014 \u0060sample/Frank.Datastar.Basic/Program.fs\u0060 and \u0060sample/Frank.Datastar.Hox/Program.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 339 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sample/Frank.Datastar.Basic/Program.fs:275\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":"sample/Frank.Datastar.Basic/Program.fs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1a3779e3ac0ebf69cf6630800162e0c92215f08f2f62b0ac8bd6231bc6b225"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): sample/Frank.OpenApi.Sample/Handlers.fs:30-44 | sample/Frank.OpenApi.Sample/Handlers.fs:152-165 \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":"sample/Frank.OpenApi.Sample/Handlers.fs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bdc1ed49ec4aef7de9817f19f3a30aa22f5229f133440d8975a8114a7acb08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): sample/Frank.Datastar.Basic/Program.fs:445-458 | sample/Frank.Datastar.Hox/Program.fs:547-560 | sample/Frank.Datastar.Oxpecker/Program.fs:538-551 \u2014 \u0060sample/Frank.Datastar.Basic/Program.fs\u0060 and \u0060sample/Frank.Datastar.Hox/Program.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 339 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sample/Frank.Datastar.Basic/Program.fs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4796f01755e54bf7d3c70d4d465d69548b9b41a5f8782ab40a719d026f093c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): sample/Frank.Alps.Sample/Catalog.fs:47-60 | sample/Frank.Alps.Sample/PingPong.fs:111-124 \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":"sample/Frank.Alps.Sample/Catalog.fs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e1337e3e6671b5cce317422a64c9cd5c86ee7ca83b85003bfe3386e8481b9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 5): sample/Frank.Falco/Extensions.fs:10-22 | sample/Frank.Giraffe/Extensions.fs:10-22 | sample/Frank.OpenApi.Sample/Extensions.fs:12-23 | sample/Frank.Oxpecker/Extensions.fs:12-21 | sample/Sample/Extensions.fs:12-23 \u2014 \u0060sample/Frank.Falco/Extensions.fs\u0060 and \u0060sample/Frank.Giraffe/Extensions.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 35 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sample/Frank.Falco/Extensions.fs:10\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sample/Frank.Falco/Extensions.fs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa69a5e50c4d131bb7d2e0d7575184307e129181c3168ad5edd29d8a4058d5b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): sample/Frank.Datastar.Basic/Program.fs:217-226 | sample/Frank.Datastar.Basic/Program.fs:257-266 | sample/Frank.Datastar.Oxpecker/Program.fs:266-275 | sample/Frank.Datastar.Oxpecker/Program.fs:306-315 \u2014 \u0060sample/Frank.Datastar.Basic/Program.fs\u0060 and \u0060sample/Frank.Datastar.Oxpecker/Program.fs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 15 separate duplicated blocks between them, totalling at least 503 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sample/Frank.Datastar.Basic/Program.fs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfae5bf414d22357aaabb24e9ad7c026a8945c3e0bd2249cdb81b5ba26b8021e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): sample/Frank.Alps.Sample/Catalog.fs:69-77 | sample/Frank.Alps.Sample/PingPong.fs:135-144 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sample/Frank.Alps.Sample/Catalog.fs:69\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":"sample/Frank.Alps.Sample/Catalog.fs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b01943aa07dd2ee36f46ea0b644a5049d55832223cd3d54287cc01b2238694"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sample/Frank.OpenApi.Sample/Handlers.fs:167-176 | sample/Frank.OpenApi.Sample/Handlers.fs:249-258 \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":"sample/Frank.OpenApi.Sample/Handlers.fs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"7127a177958b8ba50cb47f3219167206d538d8bd114b8925fc2a14f04d2db50d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): sample/Frank.Falco/Program.fs:87-95 | sample/Frank.Giraffe/Program.fs:85-92 \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 \u0060sample/Frank.Falco/Program.fs: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":"sample/Frank.Falco/Program.fs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6a93a6f7c1ad7f9cf07585558d7f856fe6e14d888c439132ecf0883630ddb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sample/Frank.Alps.Sample/PingPong.fs:60-72 | sample/Frank.JsonHome.Sample/ApiKeyAuth.fs:19-31 \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":"sample/Frank.Alps.Sample/PingPong.fs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6616e468680610efa40ad22343c0109f60c8eaa10d7f48aba8d2d600d95bce69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sample/Frank.OpenApi.Sample/Handlers.fs:158-167 | sample/Frank.OpenApi.Sample/Handlers.fs:231-239 \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 \u0060sample/Frank.OpenApi.Sample/Handlers.fs:158\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sample/Frank.OpenApi.Sample/Handlers.fs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a84239f0d1aeea3e405d69a1f08167dbfd293c9a5b8b24f0098a143798d6e40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sample/Frank.OpenApi.Sample/Handlers.fs:227-232 | sample/Frank.OpenApi.Sample/Handlers.fs:240-245 \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":"sample/Frank.OpenApi.Sample/Handlers.fs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cd84f9bb1f44be5e19c7f170f0cf467df15887379af06efc6ed5eac7661ca7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WebHostBuilder (LCOM4 7): WebHostBuilder\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank/WebHostBuilder.fs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fd8acf62c2c4b58e36efeda539c9339bbb88a6153f8f9c44ac59317c33056c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ShapeBuilder (LCOM4 4): ShapeBuilder\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Validation/ShapeBuilder.fs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"288b5362bc8d34346513a6085989c0be921882ec97d9997880b0197b86823afd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Frank.Analyzers/DuplicateHandlerAnalyzer.fs: src/Frank.Analyzers/DuplicateHandlerAnalyzer.fs changed 3 times in last 90 days, max cyclomatic complexity 52 in DuplicateHandlerAnalyzer.analyzeFile at line 98. 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, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-21..2026-09-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-21 18:24:35 -05:00\u0027 --until=\u00272026-09-19 18:24:35 -05:00\u0027 --full-history --no-merges -- src/Frank.Analyzers/DuplicateHandlerAnalyzer.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Analyzers/DuplicateHandlerAnalyzer.fs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48c89463316f0d87f71c5d0f52b915184419d98dc10bf01b863f299e1af1644"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Frank.Datastar/ServerSentEventGenerator.fs: src/Frank.Datastar/ServerSentEventGenerator.fs changed 3 times in last 90 days, max cyclomatic complexity 18 in ServerSentEventGenerator.PatchElementsAsync at line 43. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-21..2026-09-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-21 18:24:35 -05:00\u0027 --until=\u00272026-09-19 18:24:35 -05:00\u0027 --full-history --no-merges -- src/Frank.Datastar/ServerSentEventGenerator.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Datastar/ServerSentEventGenerator.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"282a4c9a62fb991eaedff57c251afbaa2b284959301519fd8784648b9133a196"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Frank/NegotiateBuilder.fs: src/Frank/NegotiateBuilder.fs changed 13 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is NegotiateBuilder.Run at line 97), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(frank): broadcast only produces metadata across negotiate {} representations\u201D; \u201Cfix(negotiate): add HttpContext -\u003E Task\u003Cunit\u003E overload so self-writing handlers dispatch directly\u201D; \u201Cfix(negotiate): respect explicit client quality, send Vary: Accept, reject wildcard auto-format\u201D; \u201Cfix(frank): preserve non-colliding negotiate metadata by reference\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-21..2026-09-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-21 18:24:35 -05:00\u0027 --until=\u00272026-09-19 18:24:35 -05:00\u0027 --full-history --no-merges -- src/Frank/NegotiateBuilder.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank/NegotiateBuilder.fs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3e16a41593469915b523ff28d84ede049c73a45188aec216ba0adff35bbe3e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Frank.Provenance/MailboxProcessorProvenanceStore.fs: src/Frank.Provenance/MailboxProcessorProvenanceStore.fs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is MailboxProcessorProvenanceStore..ctor at line 15), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(frank-provenance): isolate journal write failures, atomic manifest writes, doc fixes\u201D; \u201Cfix(frank-provenance): sequence journal tests, bound failure-isolation wait, cover SnapshotEvery cadence\u201D; \u201Cfix(provenance): CI registration, stronger eviction test, config safety clamp, docs\u201D; \u201Cfix(provenance): guard mailbox loop against exceptions, always reply to Query\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-21..2026-09-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-21 18:24:35 -05:00\u0027 --until=\u00272026-09-19 18:24:35 -05:00\u0027 --full-history --no-merges -- src/Frank.Provenance/MailboxProcessorProvenanceStore.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Provenance/MailboxProcessorProvenanceStore.fs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3674c0dcf121073b1f2079aa8c562a5cab70bd312ca25e6f7cd0b4c09520a82b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Frank.Provenance/ProvenanceJournal.fs: src/Frank.Provenance/ProvenanceJournal.fs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is FileProvenanceJournal..ctor at line 72), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(frank-provenance): isolate journal write failures, atomic manifest writes, doc fixes\u201D; \u201Cfix(frank-provenance): correct stale Manifest JSON-handling comment\u201D; \u201Cfix(frank-provenance): restore manual JSON handling due to JsonSerializer limitations in compiled context\u201D; \u201Cfix(frank-provenance): adjust Manifest JSON handling comment and remove unnecessary whitespace check\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-21..2026-09-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-21 18:24:35 -05:00\u0027 --until=\u00272026-09-19 18:24:35 -05:00\u0027 --full-history --no-merges -- src/Frank.Provenance/ProvenanceJournal.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Provenance/ProvenanceJournal.fs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5972a0b67eddc477a06e6d156a0657a1b7dce39d317d404420165bf820e48c89"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Frank.Alps/AlpsDocument.fs: src/Frank.Alps/AlpsDocument.fs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is AlpsDocument.validate at line 33), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(alps): thread real rootUri through both HTTP exposures (Task 2)\u201D; \u201Cfix(alps): implement cross-document reference resolution in Serialization\u201D; \u201Cfix(alps): filter authorization through the whole descriptor tree; excerpt cache headers\u201D; \u201Cfix(alps): use IStartupFilter instead of IHostedService for startup validation -- endpoints don\u0027t exist yet when IHostedService.StartAsync runs\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-21..2026-09-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-21 18:24:35 -05:00\u0027 --until=\u00272026-09-19 18:24:35 -05:00\u0027 --full-history --no-merges -- src/Frank.Alps/AlpsDocument.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Frank.Alps/AlpsDocument.fs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa5bd6208149adc7da811e95cfafb08a353db57c5b27ccd637db8786c354aeb"}},{"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":"2b50d6185f231a28fa9959e31861b0be76667502f1a2f794cc5c60d4fa797cb7"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"07007cb80d9b369e83bdf5bc81544d88996c86af318c20d4b8bf34eb30b65aca"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"bc17439367157c6f6ff8590f4dfe29bc3a0ce4e328d99df310f8a49a2877af10"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"90ef8645d5d250a2cdd6c4ddecf434c2439a3eaf0b71b0b76b3e93b4d1bb9e49"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"},"taxa":[{"id":"CICD-SEC-1","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"ADRs not easily discoverable: 2 ADR-shaped document(s) detected by content \u2014 \u0060specs/006-fix-datastar-basic-tests/research.md\u0060, \u0060specs/011-middleware-before-endpoints/research.md\u0060. They are not under a conventional ADR folder (docs/adr/) and are not named NNNN-title.md, and this check found them by their decision signature rather than by where they live \u2014 so a reader who does not already know these paths has no route to them. Detected by content signature only: records kept outside the repository, or written without a Status/Decision/Consequences shape, are not visible to this check and are not counted here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea921cf64dae701abd877090b3279ff10d03c2e3250e26c8c299d7c5665e0d3f"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 4/5 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060src/Frank\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"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 1 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":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060benchmarks/Frank.Benchmarks/Frank.Benchmarks.fsproj\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/Frank.Benchmarks/Frank.Benchmarks.fsproj"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"448566742d32abd6884fdfeef76074adc5126a9d7bd717da0e7f4f0c50a0f6a9"}},{"ruleId":"SC1","level":"warning","message":{"text":"NuGet dependencies are not locked: No packages.lock.json and no central package management \u2014 restores aren\u0027t reproducible or pinned (SSDF PW.4.4). Enable \u003CRestorePackagesWithLockFile\u003Etrue\u003C/RestorePackagesWithLockFile\u003E (commit the lockfile) or adopt Directory.Packages.props. Advisory \u2014 never scored."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a97b4f69ccac509400ece7eedefb06d3ede0522cd4d8bcb5c068bea719545a6"}}],"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-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":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"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":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"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":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"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":11,"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."]}]}