{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D39","name":"IL Efficiency","shortDescription":{"text":"IL Efficiency"},"helpUri":"https://codehealth.canine.dev/dimensions/D39"},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"]}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"DM10","name":"One transaction, one aggregate","shortDescription":{"text":"One transaction, one aggregate"},"helpUri":"https://codehealth.canine.dev/dimensions/DM10"},{"id":"DM8","name":"Value-object opportunities","shortDescription":{"text":"Value-object opportunities"},"helpUri":"https://codehealth.canine.dev/dimensions/DM8"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"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":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"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":"ProvenanceGrouping.Main (cyclomatic 180): ProvenanceGrouping.Main has cyclomatic complexity 180 (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/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0143479654d7918fe652c017062782a6aabd158aabfac1fa106d5e68cd1a5c12"}},{"ruleId":"D1","level":"warning","message":{"text":"ArcVaultsApi.api (cyclomatic 133): ArcVaultsApi.api has cyclomatic complexity 133 (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/Electron/src/Main/IPC/IArcVaultsApi.fs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced3527afe2b60723b08e0d7aeba5b54c803d5e3d77efad08bc45a1d62f250da"}},{"ruleId":"D1","level":"warning","message":{"text":"GitWorkflow.update (cyclomatic 109): GitWorkflow.update has cyclomatic complexity 109 (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/Electron/src/Renderer/Context/GitWorkflow.fs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb7e5fbca328858fbc16349d8ad2a81c1ff8672b279c6cc359fc908193c6796"}},{"ruleId":"D1","level":"warning","message":{"text":"IGitApi.api (cyclomatic 78): IGitApi.api has cyclomatic complexity 78 (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/Electron/src/Main/IPC/IGitApi.fs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"462167f418a5cc9ac7939832cb25b953029f8a5163ee8ca030078a5a458f1cb5"}},{"ruleId":"D1","level":"warning","message":{"text":"Interface.update (cyclomatic 77): Interface.update has cyclomatic complexity 77 (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/Client/Update/InterfaceUpdate.fs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4720deb0aabe4c99d1119afcba7d4f0655cda9a59c712d11d0e3f21fd13cdd5c"}},{"ruleId":"D1","level":"warning","message":{"text":"TextInputWithMarkdown.TextInputWithMarkdown (cyclomatic 76): TextInputWithMarkdown.TextInputWithMarkdown has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/MarkdownText/TextInputWithMarkdown.fs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ce346bfe2ef080e51f2ab394471bb0faf10a6fa1d93334fb475cac78a53712"}},{"ruleId":"D1","level":"warning","message":{"text":"FileTree.FileTree (cyclomatic 65): FileTree.FileTree has cyclomatic complexity 65 (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/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTree.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cbf3dc433dc66281891789f767b0ea33cdb62c85c2f2adf303b045f83a7d68"}},{"ruleId":"D1","level":"warning","message":{"text":"TutorialOverlay.Main (cyclomatic 63): TutorialOverlay.Main has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/TutorialOverlay/TutorialOverlay.fs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b375814c3f34a28a502ade116382c3597237bcd861f8d27751c186f78dc0f8d"}},{"ruleId":"D1","level":"warning","message":{"text":"Controls.PropertyRailItem (cyclomatic 60): Controls.PropertyRailItem has cyclomatic complexity 60 (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/Components/src/Page/ProvenanceGrouping/Controls.fs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce541213c2fbf9ecc9c296a4782a9eccceb2aaad11581742983e836cc34ba989"}},{"ruleId":"D1","level":"warning","message":{"text":"TermSearch.TermSearch (cyclomatic 55): TermSearch.TermSearch has cyclomatic complexity 55 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/TermSearch/TermSearch.fs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ce08d8c725403cd05a2767a6da9f907a6a03da70e2b044307dd859fe624f82"}},{"ruleId":"D1","level":"warning","message":{"text":"Spreadsheet.update (cyclomatic 52): Spreadsheet.update 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/Client/Update/SpreadsheetUpdate.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"82de0027f8a88585cf7c0f225cf78b3724320c7da5e3e3ecc08b0e327ae1ae0f"}},{"ruleId":"D1","level":"warning","message":{"text":"GroupCard.Main (cyclomatic 50): GroupCard.Main has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/GroupCard.fs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0862261e4f0699747162e99af5f30332ddff6931c085b371fadfd749c247436"}},{"ruleId":"D1","level":"warning","message":{"text":"DropOverlay.DropOverlay (cyclomatic 47): DropOverlay.DropOverlay has cyclomatic complexity 47 (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/Components/src/Composite/Workspace/DropOverlay.fs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c3084d4d87d06009429d5c18afcf2db533f9ce2a88e7be2f1a8bfc0f7e4618"}},{"ruleId":"D1","level":"warning","message":{"text":"ConnectorOverlay.Main (cyclomatic 41): ConnectorOverlay.Main has cyclomatic complexity 41 (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/Components/src/Page/ProvenanceGrouping/ConnectorOverlay.fs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2bd211602b03a0602d4eec5d2e0b34e139d88db604b0ceeea8a4c2048d4ca6"}},{"ruleId":"D1","level":"warning","message":{"text":"GitProvisioningService.cloneRepository (cyclomatic 41): GitProvisioningService.cloneRepository has cyclomatic complexity 41 (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/Electron/src/Main/Git/GitProvisioningService.fs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf9c3e99f34038ef7cd7b06a65970387cd1de7f7eed0603b2e704eef7486e47"}},{"ruleId":"D1","level":"warning","message":{"text":"Build.main (cyclomatic 39): Build.main has cyclomatic complexity 39 (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":"build/Build.fs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b592b40c2395cd3f726a36ec279c68ed3fa194587a3b2aca0979109f8b2670ab"}},{"ruleId":"D1","level":"warning","message":{"text":"GitMergeConflictViewer.Viewer (cyclomatic 38): GitMergeConflictViewer.Viewer has cyclomatic complexity 38 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/GitComparison/GitMergeConflictViewer.fs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a60b251ba96b9850c7d6a7acafe51f92f3f9369c70b43bca0883e0f353abf99"}},{"ruleId":"D1","level":"warning","message":{"text":"Table.Table (cyclomatic 38): Table.Table has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/Table/Table.fs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff7e413c889f3c5fe6624241aae884a177e2460c947d1320051d06864eff693"}},{"ruleId":"D1","level":"warning","message":{"text":"GitSidebar.Main (cyclomatic 37): GitSidebar.Main has cyclomatic complexity 37 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/GitSidebar/GitSidebar.fs"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"f929e1c1b2b5e840a7b40d8b936d8be3982d848ea79f10ec83f03c6f35fb2d80"}},{"ruleId":"D1","level":"warning","message":{"text":"ARCitect.update (cyclomatic 34): ARCitect.update has cyclomatic complexity 34 (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/Client/Update/ARCitectUpdate.fs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e62c6636e7b310bd8e306a3c56abd574683e33cd834f3f9122fea687ecb5830"}},{"ruleId":"D1","level":"warning","message":{"text":"DataHubBrowser.ExplorePanel (cyclomatic 34): DataHubBrowser.ExplorePanel has cyclomatic complexity 34 (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/Components/src/Page/DataHubBrowser/DataHubBrowser.fs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cd91371e5d12bf7d9e476b1f1be4a36bf29f1da6d22f21dd6ea9eacc8457a9"}},{"ruleId":"D1","level":"warning","message":{"text":"DataAnnotator.Table (cyclomatic 29): DataAnnotator.Table has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/Widgets/DataAnnotator/DataAnnotator.fs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6165485f5cc7a2f6d1c2eb3dad85462af6e2110bc657b62d20e0d450a40ebc"}},{"ruleId":"D1","level":"warning","message":{"text":"FolderedDraggableList.FolderedDraggableList (cyclomatic 29): FolderedDraggableList.FolderedDraggableList has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.fs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"4561a21fb2b01bfcb91b0347ddb3014fb90933054f3890cde814416ec41ee996"}},{"ruleId":"D1","level":"warning","message":{"text":"Controls.ValueChip (cyclomatic 27): Controls.ValueChip has cyclomatic complexity 27 (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/Components/src/Page/ProvenanceGrouping/Controls.fs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6e4ab6af7227e7dd53a86f8044de70b99a4abd67e610f1f131a7133eef482d"}},{"ruleId":"D1","level":"warning","message":{"text":"Controls.PropertyRail (cyclomatic 26): Controls.PropertyRail has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/Controls.fs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b687e09309a8f41ab59f94d5fe78043aa8eb92ec613b5175fe4211dd5bf373"}},{"ruleId":"D1","level":"warning","message":{"text":"ArcFileFooterTabs.Main (cyclomatic 25): ArcFileFooterTabs.Main has cyclomatic complexity 25 (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/Components/src/Page/ArcFileEditor/ArcFileFooterTabs.fs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d0ee91c9a38995c8ed97d1b35ea3292511b20e706df4b7b86ee867c4e1aa57"}},{"ruleId":"D1","level":"warning","message":{"text":"DataHubBrowser.Entry (cyclomatic 25): DataHubBrowser.Entry has cyclomatic complexity 25 (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/Components/src/Page/DataHubBrowser/DataHubBrowser.fs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1e9bffd6cf36095f40ffe8241275bc908fec2b41270158829d303e1f11c9f2"}},{"ruleId":"D1","level":"warning","message":{"text":"Layout.Sidebars (cyclomatic 25): Layout.Sidebars has cyclomatic complexity 25 (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/Components/src/Composite/Layout/Layout.fs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e10a9b841e02d60768f812b81f18ad23f39682d0a5a2b702e5db975ad152d65"}},{"ruleId":"D1","level":"warning","message":{"text":"V2.ontologyApi (cyclomatic 25): V2.ontologyApi has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Server/Api/IOntologyAPI.fs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f16a6a96b3eee3113a80b31553252a7949ade380124ca8b825490777deb540"}},{"ruleId":"D1","level":"warning","message":{"text":"DataHubBrowserModel.update (cyclomatic 24): DataHubBrowserModel.update has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/DataHubBrowser/Model.fs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18f2772d8a0c6ca4526a23d94b173c4e02b473967fdb1c04b933c25b05cbd57"}},{"ruleId":"D1","level":"warning","message":{"text":"GitWorkflow.runPrimarySaveAttemptAsync (cyclomatic 24): GitWorkflow.runPrimarySaveAttemptAsync has cyclomatic complexity 24 (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/Electron/src/Renderer/Context/GitWorkflow.fs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b3970c5d47722a30ff96c7924492eb4055d2d0a5decb98a62119721a439ceb"}},{"ruleId":"D1","level":"warning","message":{"text":"Main.tryParseToArcFile (cyclomatic 23): Main.tryParseToArcFile has cyclomatic complexity 23 (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/Client/OfficeInterop/OfficeInterop.fs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92d13413fdc8a76cbf7f4d79202f56b4e596103659b6913ca31677d0bd98812"}},{"ruleId":"D1","level":"warning","message":{"text":"V1.ontologyApi (cyclomatic 23): V1.ontologyApi has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Server/Api/IOntologyAPI.fs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74acd955cb34e9c4e86b6d58027d03f21b79beb2d67a43804862feb6102d5cb"}},{"ruleId":"D1","level":"warning","message":{"text":"GitLfsService.planOutboundPush (cyclomatic 23): GitLfsService.planOutboundPush has cyclomatic complexity 23 (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/Electron/src/Main/Git/GitLfsService.fs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2fc7e42ac11056903eb949c857486bf842aefbfd62c2441d150d903dc5f1e0"}},{"ruleId":"D1","level":"warning","message":{"text":"FormComponents.TextInput (cyclomatic 22): FormComponents.TextInput has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/SharedComponents/Metadata/Forms.fs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6f5b29bd25a8f42c4f5f823009dd04ad7e706f5ec63aba196b97f96c7c0962"}},{"ruleId":"D1","level":"warning","message":{"text":"Helper.applyToTable (cyclomatic 22): Helper.applyToTable has cyclomatic complexity 22 (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/Components/src/Composite/Widgets/DataAnnotator/Helper.fs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c49df88012e6c8c730659810d99571ea42354dfe0ccc8761276d41eb106b3eb"}},{"ruleId":"D1","level":"warning","message":{"text":"ComboBox.ComboBox (cyclomatic 22): ComboBox.ComboBox has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Primitive/ComboBox/ComboBox.fs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fc1f9ce29835dfc648036a22993f8d80a2de435570eb0a24a0b15a00402e52"}},{"ruleId":"D1","level":"warning","message":{"text":"ArcEntityPathRules.classifyDeleteTarget (cyclomatic 22): ArcEntityPathRules.classifyDeleteTarget has cyclomatic complexity 22 (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/Shared/PathHelpers.fs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"a797bf8884c769d2cea60a28d7f06b077c57979213c4eb838640da8b822f0307"}},{"ruleId":"D1","level":"warning","message":{"text":"ArcVaultHelper.updateARCByFileContentDTO (cyclomatic 22): ArcVaultHelper.updateARCByFileContentDTO has cyclomatic complexity 22 (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/Electron/src/Main/ArcVault/ArcVaultHelper.fs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"494b63c0259d57cd1c1325e67465c237753e8bf49c7cf91e3e039fce3ff78993"}},{"ruleId":"D1","level":"warning","message":{"text":"FormComponents.ValueInput (cyclomatic 21): FormComponents.ValueInput has cyclomatic complexity 21 (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/Client/SharedComponents/Metadata/Forms.fs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"114b503608b5d264d9b9438f8f8dfeb0d903b36f9d09af99ab136055a75d1bb3"}},{"ruleId":"D1","level":"warning","message":{"text":"DataHubBrowser.Filter (cyclomatic 21): DataHubBrowser.Filter has cyclomatic complexity 21 (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/Components/src/Page/DataHubBrowser/DataHubBrowser.fs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b977709dcad8ff60820d6f974afb9163504e4cda5417b4ba433fad77856d71"}},{"ruleId":"D1","level":"warning","message":{"text":"FileExplorer.FileExplorer (cyclomatic 21): FileExplorer.FileExplorer has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/FileExplorer/FileExplorer.fs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2040c56ecff8a96ef068720d69657787f2f36b235737a44f0499304b5c6f3116"}},{"ruleId":"D1","level":"warning","message":{"text":"GitSidebar.OperationStatusNotice (cyclomatic 21): GitSidebar.OperationStatusNotice has cyclomatic complexity 21 (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/Components/src/Page/GitSidebar/GitSidebar.fs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"534ffafbee9a9cd92baf350fc4d763aacd65c5439fc8a1b1719c6448e077bef7"}},{"ruleId":"D1","level":"warning","message":{"text":"AnnotationTableContextMenuUtil.getFittedCells (cyclomatic 21): AnnotationTableContextMenuUtil.getFittedCells has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/AnnotationTable/ContextMenu.fs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e73e3f96081b33126ed73c28a1dd9a9e8247625b1ed1e6bc2625012f6ca4628"}},{"ruleId":"D1","level":"warning","message":{"text":"ContextMenu.ContextMenu (cyclomatic 21): ContextMenu.ContextMenu has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Primitive/ContextMenu/ContextMenu.fs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"54824c6cef2889d4e8f2e0f62c62ea0eef23e9741b195a2650242177b2dfa9b1"}},{"ruleId":"D1","level":"warning","message":{"text":"MessageInteropHelper.buildInProxyInner (cyclomatic 20): MessageInteropHelper.buildInProxyInner has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/Util/MessageInterop.fs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e780835de8afb61ec3950b0a73593e7ac22ee378643d8f5567c2b2b30f52b1"}},{"ruleId":"D1","level":"warning","message":{"text":"Notes.Wizard (cyclomatic 20): Notes.Wizard has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/Notes/Editor/Notes.fs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5617ab60fdc777316e89044a98e2934f89f94d0771accc178ff1cb3422693e"}},{"ruleId":"D1","level":"warning","message":{"text":"FileExplorerItem.LFSStatusPill (cyclomatic 19): FileExplorerItem.LFSStatusPill has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/FileExplorer/FileExplorerItem.fs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20a8e6213ae8fcdd4cf133e90dfcb781f6e85f5badb6fcbee9fc141d1b37458"}},{"ruleId":"D1","level":"warning","message":{"text":"TextInput.TextInput (cyclomatic 19): TextInput.TextInput has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/Metadata/FormComponents/TextInput.fs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d3f081022e8bfa78f06601107f4fd55dab3328261eecb015ab272ef8470d73"}},{"ruleId":"D1","level":"warning","message":{"text":"GitWorkflow.runCommitAttemptAsync (cyclomatic 19): GitWorkflow.runCommitAttemptAsync has cyclomatic complexity 19 (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/Electron/src/Renderer/Context/GitWorkflow.fs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ee91fc63343d390f779f4604d172842bfc2629c098cf8a884905b038da9284"}},{"ruleId":"D1","level":"warning","message":{"text":"SpreadsheetView.Main (cyclomatic 18): SpreadsheetView.Main 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/Client/Views/SpreadsheetView.fs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7567b14480ba9ac68101cb9d764fcdd6b866b519f4c9f092baf32aece0e68297"}},{"ruleId":"D1","level":"warning","message":{"text":"ProtocolState.update (cyclomatic 18): ProtocolState.update 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/Client/Pages/ProtocolTemplates/ProtocolState.fs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62fe447a93eec06e5165645f894aa12a4fa5d40b22552c1f878ee335cc619a9"}},{"ruleId":"D1","level":"warning","message":{"text":"LazyLoadTable.Main (cyclomatic 18): LazyLoadTable.Main has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/SharedComponents/LazyLoadTable.fs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b35a59137de5d262761783d1460d4186c0efc0c1090f395c6ad97a161e833b"}},{"ruleId":"D1","level":"warning","message":{"text":"GroupCard.OrganizerTab (cyclomatic 18): GroupCard.OrganizerTab has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/GroupCard.fs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49f22a948cfcd81c4ff45a90f8d390c9f20d342c004e312445dd72dc7f6b320"}},{"ruleId":"D1","level":"warning","message":{"text":"DataMapTable.DataMapTable (cyclomatic 18): DataMapTable.DataMapTable 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/Components/src/Composite/DataMapTable/DataMapTable.fs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7e8b97e7b42b086510fe02e56d175f74420824800e1c769cc3b3e3c17cbdcf"}},{"ruleId":"D1","level":"warning","message":{"text":"AnnotationTableContextMenuUtil.pasteCells (cyclomatic 18): AnnotationTableContextMenuUtil.pasteCells has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/AnnotationTable/ContextMenu.fs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7134ed07740d672add56b18d2ed81985db9e75bc57c44af9f1e4333a7ef1bf0"}},{"ruleId":"D1","level":"warning","message":{"text":"FileStateContext.FileStateCtxProviderWithSnapshots (cyclomatic 18): FileStateContext.FileStateCtxProviderWithSnapshots 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/Electron/src/Renderer/Context/FileStateContext.fs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a76280bb82e3cbae68dc967c0d754c6086c5702d3ac5446860ed6c30c1576b"}},{"ruleId":"D1","level":"warning","message":{"text":"GitService.confirmMergeResolution (cyclomatic 18): GitService.confirmMergeResolution has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95c6a839117588a04a92cf1cf33dd78f26cf718b6d94ebd79404de0e41140d5"}},{"ruleId":"D1","level":"warning","message":{"text":"Main.fillSelectedWithOntologyAnnotation (cyclomatic 17): Main.fillSelectedWithOntologyAnnotation has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/OfficeInterop/OfficeInterop.fs"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"226138c105865a2f5fb7ce83450c039b0926b5a371306b649acc77962bd9c4fe"}},{"ruleId":"D1","level":"warning","message":{"text":"Helper.SemVer.comparePreRelease.Static (cyclomatic 17): Helper.SemVer.comparePreRelease.Static has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ValidationPackageBrowser/Helper.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4ca9b56f7fa336e895484363619c3a8803dc2ac8eea6630dac54acbfb7ffe7"}},{"ruleId":"D1","level":"warning","message":{"text":"MergeConflicts.parseMergeConflictFragments (cyclomatic 17): MergeConflicts.parseMergeConflictFragments has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/GitComparison/GitTextComparison.Core.fs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc31436f89de992086d6c40fedcd5c1a498af3da9f4a9b042269581b813e633"}},{"ruleId":"D1","level":"warning","message":{"text":"Controls.FilterToolbar (cyclomatic 17): Controls.FilterToolbar has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/Controls.fs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8c637d07b275ad3ff8ee56f9ba37145eace8dab6a8d8f2a688ec617d8d0b86"}},{"ruleId":"D1","level":"warning","message":{"text":"BuildingBlockWidget.Main (cyclomatic 17): BuildingBlockWidget.Main has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/Widgets/BuildingBlockWidget/BuildingBlockWidget.fs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9d308b857d4e3a437300c91a687db4e6dfa87ba082747e413c4ead1c6f8c9a"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonImport.JsonImport (cyclomatic 17): JsonImport.JsonImport has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/Widgets/JsonImport/JsonImport.fs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"966617e0990f583d8a1d3555973cf36863453bc5534af70312fbd5936afbeb17"}},{"ruleId":"D1","level":"warning","message":{"text":"TargetSelector.Main (cyclomatic 17): TargetSelector.Main has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/Notes/Editor/TargetSelector.fs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b3f904b94f7d4d725e3d1dc26c44c442ba0d809f55c7fe31d318a9a5974c3a"}},{"ruleId":"D1","level":"warning","message":{"text":"AnnotationTable.ModalController (cyclomatic 17): AnnotationTable.ModalController has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/AnnotationTable/AnnotationTable.fs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22c80a521e5073b30c0e065112e46226d470f59b6c6596334ff01308a941a1e"}},{"ruleId":"D1","level":"warning","message":{"text":"ArcEntityPathRules.classifyRenameTarget (cyclomatic 17): ArcEntityPathRules.classifyRenameTarget has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Shared/PathHelpers.fs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd1887bec314cece5f81174c20e4ba12d361898edc32be6d6b0bdfa4acb50c2"}},{"ruleId":"D1","level":"warning","message":{"text":"GitService.previewPull (cyclomatic 17): GitService.previewPull has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30745ca82a58430dafacee95e57ab0a414544017a4ed94ab0b6d5d4648f5564"}},{"ruleId":"D1","level":"warning","message":{"text":"GitService.freeLocalLfsCopy (cyclomatic 17): GitService.freeLocalLfsCopy has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"e884c383d96136c8385bb7fa18e08e73ec71979791adad1b18f44816c39d48c1"}},{"ruleId":"D1","level":"warning","message":{"text":"GitLfsService.tryReadBatchPointerOids (cyclomatic 17): GitLfsService.tryReadBatchPointerOids has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/Git/GitLfsService.fs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"c166907a2bf405d4396a508816a38800c19440534cd97200cae08f6189076c6d"}},{"ruleId":"D1","level":"warning","message":{"text":"Main.convertBuildingBlock (cyclomatic 16): Main.convertBuildingBlock has cyclomatic complexity 16 (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/Client/OfficeInterop/OfficeInterop.fs"},"region":{"startLine":2052}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f02c1ba2b57b2a88ba7912ded5f52a82ca7345e9c55c7226d03121b942bc1c"}},{"ruleId":"D1","level":"warning","message":{"text":"FileExplorerItem.DirectoryRow (cyclomatic 16): FileExplorerItem.DirectoryRow has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/FileExplorer/FileExplorerItem.fs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb34cb75ef393b263b5c2b1241b71da48796c4b3ff1ad3c9b40e365653342724"}},{"ruleId":"D1","level":"warning","message":{"text":"Controls.ConnectionHandle (cyclomatic 16): Controls.ConnectionHandle has cyclomatic complexity 16 (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/Components/src/Page/ProvenanceGrouping/Controls.fs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b115fb4243d67f44be6878092e24fe2a8856ed5d422b57973ba5f60c44854684"}},{"ruleId":"D1","level":"warning","message":{"text":"FlipColumn.View (cyclomatic 16): FlipColumn.View has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/ViewSupport.fs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c9e2942c5a4c4db948d5838a6c9b2e3a591df4a37a48999b4018bd0b7b07f3"}},{"ruleId":"D1","level":"warning","message":{"text":"GridSelect.GetNextIndex (cyclomatic 16): GridSelect.GetNextIndex has cyclomatic complexity 16 (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/Components/src/Composite/Table/KeyboardNavigation.fs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e21c7975c4cc839271bfa603a1f1f6fcd8dd5551a7ca4d4486047ecf68c292"}},{"ruleId":"D1","level":"warning","message":{"text":"TermSearch.TermItem (cyclomatic 16): TermSearch.TermItem has cyclomatic complexity 16 (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/Components/src/Composite/TermSearch/TermSearch.fs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e28163fecb2a16bb15f63af368e68ff12c6cbcff36de58a7c349a07298fe1c4"}},{"ruleId":"D1","level":"warning","message":{"text":"ErrorModalProvider.ErrorModalHost (cyclomatic 16): ErrorModalProvider.ErrorModalHost has cyclomatic complexity 16 (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/Components/src/Primitive/ErrorModal/Provider.fs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef026fc5b667260d954c639a0a483524068542dac5412ef3f328b46177e9fe7"}},{"ruleId":"D1","level":"warning","message":{"text":"Blankslate.Blankslate (cyclomatic 16): Blankslate.Blankslate has cyclomatic complexity 16 (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/Components/src/Primitive/Blankslate/Blankslate.fs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91204c35bc98158160c2caa8fb434c61b60bb1ef0b86117f32c1d24fc09c0a4"}},{"ruleId":"D1","level":"warning","message":{"text":"EmptyColumnJson.normalize (cyclomatic 16): EmptyColumnJson.normalize has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/ARCtrl/EmptyColumnJson.fs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd03bf1970a850588c1753a7f0c50280aaeca4925f967c24a9cf34aeb7d1a561"}},{"ruleId":"D1","level":"warning","message":{"text":"GitService.getDiffViewData (cyclomatic 16): GitService.getDiffViewData has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a04144059dfb9025bd5cb8bdb1b03927ccc5d392596e29c57de4b1026206ef"}},{"ruleId":"D1","level":"warning","message":{"text":"GitLfsService.getLfsObjectIdsFromObjectIds (cyclomatic 16): GitLfsService.getLfsObjectIdsFromObjectIds has cyclomatic complexity 16 (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/Electron/src/Main/Git/GitLfsService.fs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3dfe3e96eb0ef90e618561fe973e8df395272f52508a484fde58151cbefa9b9"}},{"ruleId":"D1","level":"warning","message":{"text":"GitLfsAdapter.runGitProcess (cyclomatic 16): GitLfsAdapter.runGitProcess has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/Git/GitlfsAdapter.fs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efa17e9580e43b661c5e75ca529ffbe8f6884b8235c3f7d5edb0af5a95ba78a"}},{"ruleId":"D2","level":"warning","message":{"text":"ProvenanceGrouping.Main (cognitive 192): ProvenanceGrouping.Main has cognitive complexity 192 (threshold 15). Drivers by points: if/else 93 (115 pts), match/switch 53 (65 pts), boolean chains 9, loops 1 (3 pts) (nesting depth added 36). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7cbbfb83289c677851e0ccb0c71e69d925d962cc9756d13aab2c2aeda74d8b"}},{"ruleId":"D2","level":"warning","message":{"text":"GitProvisioningService.cloneRepository (cognitive 154): GitProvisioningService.cloneRepository has cognitive complexity 154 (threshold 15). Drivers by points: match/switch 14 (99 pts), error handling 4 (36 pts), if/else 6 (18 pts), boolean chains 1 (nesting depth added 129). 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/Electron/src/Main/Git/GitProvisioningService.fs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3ce8aec91f90d36c463d888c39f402b15a0be4d60f56ceeec33cea69c82a01"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcVaultsApi.api (cognitive 152): ArcVaultsApi.api has cognitive complexity 152 (threshold 15). Drivers by points: match/switch 42 (83 pts), if/else 30 (37 pts), error handling 26 (28 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 51). 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/Electron/src/Main/IPC/IArcVaultsApi.fs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4aeaf378c7e8cf4ace1612bce0eff0473a871f100b247f165c32721424b42cc"}},{"ruleId":"D2","level":"warning","message":{"text":"TextInputWithMarkdown.TextInputWithMarkdown (cognitive 117): TextInputWithMarkdown.TextInputWithMarkdown has cognitive complexity 117 (threshold 15). Drivers by points: if/else 46 (67 pts), match/switch 17 (36 pts), loops 4 (10 pts), boolean chains 4 (nesting depth added 46). 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/Components/src/Composite/MarkdownText/TextInputWithMarkdown.fs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e0b2eadacbf9ba5175b9b78bd407034aea94228a05052ddcbd2851669eadc6"}},{"ruleId":"D2","level":"warning","message":{"text":"TutorialOverlay.Main (cognitive 92): TutorialOverlay.Main has cognitive complexity 92 (threshold 15). Drivers by points: if/else 43 (65 pts), match/switch 13 (21 pts), boolean chains 6 (nesting depth added 30). 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/Components/src/Composite/TutorialOverlay/TutorialOverlay.fs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c961742a5e98dcd1982db838d4db8dd9ed6290d5089e7efad0f81099f81daed2"}},{"ruleId":"D2","level":"warning","message":{"text":"TermSearch.TermSearch (cognitive 84): TermSearch.TermSearch has cognitive complexity 84 (threshold 15). Drivers by points: if/else 48 (56 pts), loops 8 (20 pts), boolean chains 5, match/switch 3 (nesting depth added 20). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/TermSearch/TermSearch.fs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e544805e52c54910546c7553e3abc6e270362c5a0400ffda94c156f54f27987"}},{"ruleId":"D2","level":"warning","message":{"text":"Table.Table (cognitive 82): Table.Table has cognitive complexity 82 (threshold 15). Drivers by points: if/else 42 (74 pts), loops 3 (5 pts), match/switch 2, boolean chains 1 (nesting depth added 34). 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/Components/src/Composite/Table/Table.fs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5076a3cf1d79561bc7219be52b88e3a16a4c35a5d01609d83ef5b5e7268166"}},{"ruleId":"D2","level":"warning","message":{"text":"Interface.update (cognitive 79): Interface.update has cognitive complexity 79 (threshold 15). Drivers by points: match/switch 27 (61 pts), if/else 6 (13 pts), loops 1 (4 pts), error handling 1 (nesting depth added 44). 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/Client/Update/InterfaceUpdate.fs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4726fbd291e8d85728cc055247d7ad9d49087a388d5c0c6b80990ce9af4bbc"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupCard.Main (cognitive 77): GroupCard.Main has cognitive complexity 77 (threshold 15). Drivers by points: if/else 27 (45 pts), match/switch 13 (18 pts), loops 4 (11 pts), boolean chains 3 (nesting depth added 30). 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/Components/src/Page/ProvenanceGrouping/GroupCard.fs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c6f4698496e4ab858ad49bb89bb7d175fcd0e44b2560b017aa183d7542e6a2"}},{"ruleId":"D2","level":"warning","message":{"text":"FileTree.FileTree (cognitive 73): FileTree.FileTree has cognitive complexity 73 (threshold 15). Drivers by points: match/switch 23 (49 pts), if/else 18 (21 pts), boolean chains 3 (nesting depth added 29). 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/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTree.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a874650c83e41fecc513fd9fa7606fcbe2ae6a0b4393702edd5dcabbac288d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Main.fillSelectedWithOntologyAnnotation (cognitive 66): Main.fillSelectedWithOntologyAnnotation has cognitive complexity 66 (threshold 15). Drivers by points: if/else 18 (55 pts), match/switch 2 (6 pts), loops 1 (4 pts), boolean chains 1 (nesting depth added 44). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/OfficeInterop/OfficeInterop.fs"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"969b37bbca1d5e3baf49995904489c338debcdba8c0265c6fd92160cefedfd60"}},{"ruleId":"D2","level":"warning","message":{"text":"Controls.PropertyRailItem (cognitive 60): Controls.PropertyRailItem has cognitive complexity 60 (threshold 15). Drivers by points: if/else 31 (34 pts), match/switch 17 (20 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/Controls.fs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4249a936784c752f28dae3fe8fa81aaeedc1e194c243561326f50989190cb67"}},{"ruleId":"D2","level":"warning","message":{"text":"Main.rectifyTermColumns (cognitive 54): Main.rectifyTermColumns has cognitive complexity 54 (threshold 15). Drivers by points: if/else 12 (37 pts), loops 3 (14 pts), match/switch 2 (3 pts) (nesting depth added 37). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/OfficeInterop/OfficeInterop.fs"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a3cf732e3b9cfe4e4e446760f2837ecd54eda8ebe33e639d2466d942497592"}},{"ruleId":"D2","level":"warning","message":{"text":"IGitApi.api (cognitive 53): IGitApi.api has cognitive complexity 53 (threshold 15). Drivers by points: match/switch 36 (45 pts), if/else 4 (8 pts) (nesting depth added 13). 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/Electron/src/Main/IPC/IGitApi.fs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b1f8627f15be226b4c3e96da63fae4d97fa36691d7981d2b738fdad3be6408"}},{"ruleId":"D2","level":"warning","message":{"text":"V2.ontologyApi (cognitive 49): V2.ontologyApi has cognitive complexity 49 (threshold 15). Drivers by points: if/else 33 (43 pts), match/switch 4, boolean chains 2 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Server/Api/IOntologyAPI.fs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ecc1827314a11abc721cd6b469afb5bfbe461380cb6f14a12e9f3308a90529"}},{"ruleId":"D2","level":"warning","message":{"text":"DropOverlay.DropOverlay (cognitive 48): DropOverlay.DropOverlay has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 19 (39 pts), if/else 7 (9 pts) (nesting depth added 22). 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/Components/src/Composite/Workspace/DropOverlay.fs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3c755032b09ea5ecd14c6ba87f6e8fbbbb8c9505a8a7b2baee1469b11434cc"}},{"ruleId":"D2","level":"warning","message":{"text":"GitMergeConflictViewer.Viewer (cognitive 46): GitMergeConflictViewer.Viewer has cognitive complexity 46 (threshold 15). Drivers by points: if/else 26 (33 pts), match/switch 6 (8 pts), boolean chains 5 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/GitComparison/GitMergeConflictViewer.fs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"68527729605601e53ea5096c79234bb10ce55d1cf505a2b4e4d71d3219b24cf5"}},{"ruleId":"D2","level":"warning","message":{"text":"GitSidebar.Main (cognitive 46): GitSidebar.Main has cognitive complexity 46 (threshold 15). Drivers by points: if/else 35 (39 pts), match/switch 4, boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/GitSidebar/GitSidebar.fs"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8365740a354e0b866dae7077b6a790b7c5c3a6ecb3c5ba68fb5d2717ca8839"}},{"ruleId":"D2","level":"warning","message":{"text":"GitWorkflow.update (cognitive 46): GitWorkflow.update has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 9 (18 pts), boolean chains 3 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Renderer/Context/GitWorkflow.fs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"700e0ec7709f32cf136bc5c715055c91094311e9c4370899ed0406104d7ab9b4"}},{"ruleId":"D2","level":"warning","message":{"text":"GitService.previewPull (cognitive 46): GitService.previewPull has cognitive complexity 46 (threshold 15). Drivers by points: if/else 6 (24 pts), match/switch 6 (21 pts), boolean chains 1 (nesting depth added 33). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afb2d28a4b2c065a617c66519cc6990cee6b8cd75af845284751526d65d8025"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectorOverlay.Main (cognitive 45): ConnectorOverlay.Main has cognitive complexity 45 (threshold 15). Drivers by points: match/switch 15 (27 pts), if/else 7 (12 pts), boolean chains 5, loops 1 (nesting depth added 17). 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/Components/src/Page/ProvenanceGrouping/ConnectorOverlay.fs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8605dea51eeec8d8fb19717c077ca8fb429a5a55f7ad978735322aa5a814b1"}},{"ruleId":"D2","level":"warning","message":{"text":"V1.ontologyApi (cognitive 45): V1.ontologyApi has cognitive complexity 45 (threshold 15). Drivers by points: if/else 31 (40 pts), match/switch 4, boolean chains 1 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Server/Api/IOntologyAPI.fs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c59ade52c21b5ba3074d4b6643f72f41d5a1698020d23a6409b663e47848c3"}},{"ruleId":"D2","level":"warning","message":{"text":"GitLfsService.planOutboundPush (cognitive 44): GitLfsService.planOutboundPush has cognitive complexity 44 (threshold 15). Drivers by points: match/switch 7 (28 pts), if/else 4 (16 pts) (nesting depth added 33). 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/Electron/src/Main/Git/GitLfsService.fs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3581044a0c18255be243dd2606519bd2153b6618881ea31c4f87f35702ed15"}},{"ruleId":"D2","level":"warning","message":{"text":"GitService.getDiffViewData (cognitive 43): GitService.getDiffViewData has cognitive complexity 43 (threshold 15). Drivers by points: match/switch 6 (22 pts), if/else 8 (20 pts), boolean chains 1 (nesting depth added 28). 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/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"4385ea67be20f424e2f82b33d9fc015152b9e92c13f77972e4e6a8bbaa146158"}},{"ruleId":"D2","level":"warning","message":{"text":"GitService.confirmMergeResolution (cognitive 41): GitService.confirmMergeResolution has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 5 (20 pts), if/else 6 (15 pts), error handling 1 (5 pts), boolean chains 1 (nesting depth added 28). 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/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"675f18d9dc1e7f9b9c4c4bf243485cb78ae04bdcfde58e6cac2537b12b671e9f"}},{"ruleId":"D2","level":"warning","message":{"text":"Controls.PropertyRail (cognitive 39): Controls.PropertyRail has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 6, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/Controls.fs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"1175a81823a5f6d3b6311ab6de6dd7c5249967e63a767b29c51b3805233e8043"}},{"ruleId":"D2","level":"warning","message":{"text":"DataAnnotator.Table (cognitive 39): DataAnnotator.Table has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (25 pts), match/switch 5 (8 pts), boolean chains 6 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/Widgets/DataAnnotator/DataAnnotator.fs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"14991311b8bef211ee751cc1f984ab880ca9d51b3f70cfc13cf0f3904415968e"}},{"ruleId":"D2","level":"warning","message":{"text":"Build.main (cognitive 37): Build.main has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 10 (25 pts), if/else 5 (11 pts), boolean chains 1 (nesting depth added 21). 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":"build/Build.fs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b53e3751a54c9e8df7080123f8e3bf555ae1907ce9acc37bdbd63785ed8e2eb"}},{"ruleId":"D2","level":"warning","message":{"text":"FolderedDraggableList.FolderedDraggableList (cognitive 36): FolderedDraggableList.FolderedDraggableList has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 6 (8 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.fs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"89336dee1db770b895e81733ae85a039dc2ce2642d7da4574eb1158cdc759cfd"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextMenu.ContextMenu (cognitive 36): ContextMenu.ContextMenu has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 5 (10 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Primitive/ContextMenu/ContextMenu.fs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8c707b43170f0d00ea532768267a911d470ccfc2cdcff89b626b9496503fd3"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotationTableContextMenuUtil.pasteCells (cognitive 35): AnnotationTableContextMenuUtil.pasteCells has cognitive complexity 35 (threshold 15). Drivers by points: if/else 25 (33 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/AnnotationTable/ContextMenu.fs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bdfa2a2b910bf56f57f0fb07a9cb9770e660b2418ec978dab32aec3fc639e3"}},{"ruleId":"D2","level":"warning","message":{"text":"EmptyColumnJson.normalize (cognitive 35): EmptyColumnJson.normalize has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 1 (4 pts), boolean chains 3 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/ARCtrl/EmptyColumnJson.fs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fd617578c5957947107130ce069fc1457a8a8b693f14ab7fa307064442ebb9"}},{"ruleId":"D2","level":"warning","message":{"text":"GitLfsService.tryReadBatchPointerOids (cognitive 34): GitLfsService.tryReadBatchPointerOids has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 5, match/switch 1 (5 pts), loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/Git/GitLfsService.fs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f6078f9e603d58848e8c22f8a05b02fdfa7b75ca98db702c978eaee4233ac1"}},{"ruleId":"D2","level":"warning","message":{"text":"GridSelect.SelectAt (cognitive 33): GridSelect.SelectAt has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (30 pts), match/switch 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/Table/KeyboardNavigation.fs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8c8e8fba5fd20ffc1341e93cb413a6b9360f3deb31eb6244dad9edc57572ff"}},{"ruleId":"D2","level":"warning","message":{"text":"FormComponents.ValueInput (cognitive 32): FormComponents.ValueInput has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 9 (21 pts), if/else 7 (10 pts), loops 1 (nesting depth added 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. 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/Client/SharedComponents/Metadata/Forms.fs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6127495b996d6635730983489795c89a02ffc99a601c85b52b2c8a793a0a6b8"}},{"ruleId":"D2","level":"warning","message":{"text":"DataHubBrowser.ExplorePanel (cognitive 32): DataHubBrowser.ExplorePanel has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 8 (10 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"0689d1704e7a29b15261261dbd59349605501a6f793c64a09870b2b264cfc4e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Helper.applyToTable (cognitive 32): Helper.applyToTable has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 6 (16 pts), if/else 3 (8 pts), error handling 1 (3 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 19). 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/Components/src/Composite/Widgets/DataAnnotator/Helper.fs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"573e9c608cd9c6e2fe87a386889f5dd6caa5d83de0f5c39de591a8cfc5942407"}},{"ruleId":"D2","level":"warning","message":{"text":"Helper.updateTables (cognitive 32): Helper.updateTables has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 4 (14 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/TemplateBrowser/Helper.fs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d7796a6c7d72c9a8c8903562591cda69c2e289de915ffafabbce5a4d083663"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcEntityPathRules.classifyRenameTarget (cognitive 32): ArcEntityPathRules.classifyRenameTarget has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 4 (16 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Shared/PathHelpers.fs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"413b224b508dc63dd120ca2efc5cf923774f4d9e2f27adee590f1f52872d9518"}},{"ruleId":"D2","level":"warning","message":{"text":"Controls.ValueChip (cognitive 31): Controls.ValueChip has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 8 (13 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/Controls.fs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a7f9b75767e00e16c4829c536905e63b06002dfc5cefff43c8c84ad1c9a922"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcEntityPathRules.classifyDeleteTarget (cognitive 31): ArcEntityPathRules.classifyDeleteTarget has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 6 (19 pts), if/else 7 (12 pts) (nesting depth added 18). 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/Shared/PathHelpers.fs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fcf37ceffb72767cde3fab7759b55fee2aee240715b0096785fb2b8bb963d3"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthService.revalidate (cognitive 31): AuthService.revalidate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 3 (12 pts), loops 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/Auth/AuthService.fs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"3593e21109654ccbd0dcf5dfe4b386fba5805c252deccda54f1c8d7220e5c657"}},{"ruleId":"D2","level":"warning","message":{"text":"GitLfsService.getLfsObjectIdsFromObjectIds (cognitive 30): GitLfsService.getLfsObjectIdsFromObjectIds has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 5 (21 pts), if/else 2 (7 pts), boolean chains 1, loops 1 (nesting depth added 21). 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/Electron/src/Main/Git/GitLfsService.fs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90909c7da02f7aa5e24cce7177b516967fc3d0cc037cd72a73c924df892fde8"}},{"ruleId":"D2","level":"warning","message":{"text":"DataHubBrowserModel.update (cognitive 29): DataHubBrowserModel.update has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/DataHubBrowser/Model.fs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c773284951cd1aaac9862db77e99e5f2fe06264413aac920daa46d4b73f1b85"}},{"ruleId":"D2","level":"warning","message":{"text":"FileExplorer.FileExplorer (cognitive 29): FileExplorer.FileExplorer has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (20 pts), match/switch 4 (7 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/FileExplorer/FileExplorer.fs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"89118e34ae3d7c6bfac3a3cf91fd1503185bf7ea45c1925cd2d134a05f8b374c"}},{"ruleId":"D2","level":"warning","message":{"text":"Notes.Wizard (cognitive 29): Notes.Wizard has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 8 (24 pts), if/else 5 (nesting depth added 16). 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/Components/src/Composite/Notes/Editor/Notes.fs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c832fc065cba430e0201ef00da24053f9cd4bd40bf59f5dd8c1344583972dd7"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotationTableContextMenuUtil.getFittedCells (cognitive 29): AnnotationTableContextMenuUtil.getFittedCells has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (21 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/AnnotationTable/ContextMenu.fs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fff42bb49d33b1d386bdd66f39e4bb37833a884da409f35f69c3d72112918a2"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcVaultExtensions.ArcVault.RenameOpenArcRoot (cognitive 29): ArcVaultExtensions.ArcVault.RenameOpenArcRoot has cognitive complexity 29 (threshold 15). Drivers by points: error handling 4 (14 pts), if/else 5 (12 pts), match/switch 2 (3 pts) (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/ArcVault/ArcVault.fs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"526668c1dedf4a08d4beb16a586c23d76f1f530d5cdd2304379f400601b66946"}},{"ruleId":"D2","level":"warning","message":{"text":"GitService.push (cognitive 29): GitService.push has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 4 (14 pts) (nesting depth added 20). 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/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":2043}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bd8c709ea47b9a896326831d68fcf118fef2480b47d7b127e7b43125f0173a"}},{"ruleId":"D2","level":"warning","message":{"text":"Main.convertBuildingBlock (cognitive 28): Main.convertBuildingBlock has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 4 (8 pts), loops 2 (8 pts) (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/OfficeInterop/OfficeInterop.fs"},"region":{"startLine":2052}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7aa5aed744db17334bcd10d06946d7ca872f3e84c51e7d13d782dad1b4a6813"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcVaults.OnCloseWindow (cognitive 28): ArcVaults.OnCloseWindow has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (20 pts), error handling 1 (4 pts), match/switch 1 (4 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/ArcVault/ArcVault.fs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a97c9795d403266ca58f207475d12e49730bbad5127cf4b12e157d04670139"}},{"ruleId":"D2","level":"warning","message":{"text":"ARCitect.update (cognitive 26): ARCitect.update has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 5 (12 pts) (nesting depth added 14). 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/Client/Update/ARCitectUpdate.fs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c444703044d0ed8ffde3a627d159f1e63c03d6a46f05a65ce42820e45f23635"}},{"ruleId":"D2","level":"warning","message":{"text":"MessageInteropHelper.buildInProxyInner (cognitive 26): MessageInteropHelper.buildInProxyInner has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 9 (17 pts), if/else 4 (5 pts), error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 11). 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/Client/Util/MessageInterop.fs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8184d1058f82fdbf29e04b08433e58c4f0d378bf9336f6b83eac55a8c5b90035"}},{"ruleId":"D2","level":"warning","message":{"text":"TextInput.TextInput (cognitive 26): TextInput.TextInput has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (20 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/Metadata/FormComponents/TextInput.fs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc77c448d0f519ba3302df3ee4563704d788dac99675c1f2ec33f2da8e987f2f"}},{"ruleId":"D2","level":"warning","message":{"text":"FormComponents.TextInput (cognitive 25): FormComponents.TextInput has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 5 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/SharedComponents/Metadata/Forms.fs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d27109d47f1ce520373ef4e01498632fbcf93b7aba6705a3aff83b94d70925c"}},{"ruleId":"D2","level":"warning","message":{"text":"LazyLoadTable.Main (cognitive 25): LazyLoadTable.Main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 3 (5 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/SharedComponents/LazyLoadTable.fs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf3124e29e2aa732fca7c627b119e1d9d98e637c13bf591b0d27ab47aa34d15"}},{"ruleId":"D2","level":"warning","message":{"text":"FlipColumn.View (cognitive 25): FlipColumn.View has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 4 (7 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/ViewSupport.fs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e228dda07bbd1cb46d603d62b1b6020c9130027808173f0bf737328f9951cfb5"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildingBlockWidget.Main (cognitive 25): BuildingBlockWidget.Main has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 7 (12 pts) (nesting depth added 12). 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/Components/src/Composite/Widgets/BuildingBlockWidget/BuildingBlockWidget.fs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ce1edcf21556ceb8dbcf33b68cfd7be915df3357fea8182101f2c1da6efc59"}},{"ruleId":"D2","level":"warning","message":{"text":"GitService.freeLocalLfsCopy (cognitive 25): GitService.freeLocalLfsCopy has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (21 pts), error handling 1 (4 pts) (nesting depth added 18). 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/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"6984afec2d2c15438320f791b85385236f0a78486dc328a6a5fcec3cf82b5469"}},{"ruleId":"D2","level":"warning","message":{"text":"MergeConflicts.parseMergeConflictFragments (cognitive 24): MergeConflicts.parseMergeConflictFragments has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 9 (10 pts), loops 1 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/GitComparison/GitTextComparison.Core.fs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"723c8f424de115ffbf8afa07561aa212b9927852549fb2323c0acdf1f4e90ea4"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorPanels.assignmentBatchWarning (cognitive 24): EditorPanels.assignmentBatchWarning has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (20 pts), match/switch 2 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/EditorPanels.fs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5d9462b8696a2459a80aa56400c383ec4ee6b8facb89c2ecf7fe7870427b76"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupCard.OrganizerTab (cognitive 24): GroupCard.OrganizerTab has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (20 pts), match/switch 3, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/GroupCard.fs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5ba748ec0525a853dacb4dc632e1247e2f0e08073e4337849e419a7e25cef2"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcFileSystemHelper.moveGenericFileSystemItemOnDisk (cognitive 24): ArcFileSystemHelper.moveGenericFileSystemItemOnDisk has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 4 (14 pts), if/else 4 (9 pts), boolean chains 1 (nesting depth added 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. 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/Electron/src/Main/IPC/FileSystemIO.fs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4024839bb0f558f1e6f0d861295d2e858172e435e262f4951d629c2de10b0b"}},{"ruleId":"D2","level":"warning","message":{"text":"GitService.pull (cognitive 24): GitService.pull has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 3 (9 pts) (nesting depth added 16). 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/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"731b81f3885df6146f018036c4addfdcc3db82981a21d0a32907b56da528d1c2"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonImportHelper.updateTables (cognitive 23): JsonImportHelper.updateTables has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 4 (14 pts), if/else 2 (5 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 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. 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/Client/Update/UpdateUtil.fs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"547d3f59b01ac842a22e88d42d3c55380d1d4770d4e5f680dae03b56386ca415"}},{"ruleId":"D2","level":"warning","message":{"text":"GitLfsService.filterResolvableRemoteTipIds (cognitive 23): GitLfsService.filterResolvableRemoteTipIds has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/Git/GitLfsService.fs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"722dbc769a13ef6784593665b9abd0c85a0a1744e0893d4674a9c22ee7e0889b"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorPanels.connectionDetails (cognitive 22): EditorPanels.connectionDetails has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 3 (9 pts), loops 1 (3 pts) (nesting depth added 14). 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/Components/src/Page/ProvenanceGrouping/EditorPanels.fs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2de56f4a4cd588bd12f0a344cecdb2da9bc97ce5a384069abf61a1088cdabe9"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetSelector.Main (cognitive 22): TargetSelector.Main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 3 (7 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/Notes/Editor/TargetSelector.fs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2069746318e7803dc15732fb14ad232d87f5daa68d8a6ebf93bd62f32f775809"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextMenuModals.MoveColumnModal (cognitive 22): ContextMenuModals.MoveColumnModal has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/AnnotationTable/Modals.fs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a54447e67ce20fc236e8de6ca104b3e077710d399d58d9867dbee99b04c5bb"}},{"ruleId":"D2","level":"warning","message":{"text":"FileTreeRenameWorkflow.confirmRenameItem (cognitive 22): FileTreeRenameWorkflow.confirmRenameItem has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (18 pts), if/else 2 (4 pts) (nesting depth added 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. 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/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTreeRename.fs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c68d404458c9668eb41d29960d9c513f700405346495d67ab65031ebcf45384"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcVaultHelper.updateARCByFileContentDTO (cognitive 22): ArcVaultHelper.updateARCByFileContentDTO has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 8 (22 pts) (nesting depth added 14). 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/Electron/src/Main/ArcVault/ArcVaultHelper.fs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"601612df6fb7bb2306ed30f54154041055dcc2b464b28f3970e9f642e786526a"}},{"ruleId":"D2","level":"warning","message":{"text":"FileExplorerItem.LFSStatusPill (cognitive 21): FileExplorerItem.LFSStatusPill has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/FileExplorer/FileExplorerItem.fs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"0309b2e097450b04cb1b2ef94115773f60310317169421ac58c1fef329fccca4"}},{"ruleId":"D2","level":"warning","message":{"text":"GitSidebar.OperationStatusNotice (cognitive 21): GitSidebar.OperationStatusNotice has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 8 (13 pts), if/else 4 (8 pts) (nesting depth added 9). 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/Components/src/Page/GitSidebar/GitSidebar.fs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f2f38548619fdeab02c4372910a3cacd809133134f8eb451f5a36a4044738e"}},{"ruleId":"D2","level":"warning","message":{"text":"Controls.SourceInfoPopover (cognitive 21): Controls.SourceInfoPopover has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (6 pts), match/switch 3 (6 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/Controls.fs"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc5ecee9b4b9fb5363db9384e5bbc14c16cf7885122a454a49f114d399baf19"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotationTable.ModalController (cognitive 21): AnnotationTable.ModalController has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), error handling 1 (3 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/AnnotationTable/AnnotationTable.fs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d666a639c8f65cbb58d42f504f7ce8ab276558e99581554474c2230344320ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"ComboBox.ComboBox (cognitive 21): ComboBox.ComboBox has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (15 pts), match/switch 3, boolean chains 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Primitive/ComboBox/ComboBox.fs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f148e17025f391043a4a555418a9ba91609673023044467c98d63dec6566a41"}},{"ruleId":"D2","level":"warning","message":{"text":"GitService.discardPaths (cognitive 21): GitService.discardPaths has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 3 (7 pts) (nesting depth added 13). 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/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":2541}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65f91fd2c0ab8bd51946960c0130e131c7934f9d49c677ee1fbad1add9ca787"}},{"ruleId":"D2","level":"warning","message":{"text":"GitLfsService.tryGetOptimizedLfsObjectIds (cognitive 21): GitLfsService.tryGetOptimizedLfsObjectIds has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/Git/GitLfsService.fs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"044ed08798e1d849a583a1f7ce5ac3f69669e874b278a72003e18466447e3654"}},{"ruleId":"D2","level":"warning","message":{"text":"DataHubBrowser.GitLabEntry (cognitive 20): DataHubBrowser.GitLabEntry has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (16 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"c918234cf7b3b1df0a1a01fcd100012acdc3348c16ae23b7e33f205136cae088"}},{"ruleId":"D2","level":"warning","message":{"text":"DragHandlers.applyPropertyValueToGroups (cognitive 20): DragHandlers.applyPropertyValueToGroups has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 3 (6 pts), boolean chains 1 (nesting depth added 11). 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/Components/src/Page/ProvenanceGrouping/EditorActions.fs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffb6c0c6b1573089cde4f812118be74473a26ad20c06b2398db9a196a18e646"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateImportModalPreview.TemplateImportModalPreview (cognitive 20): TemplateImportModalPreview.TemplateImportModalPreview has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (10 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/TemplateBrowser/TemplateImportModalPreview.fs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06f05da28fff725fde9e79ea44bccdabc258ba1380ee0270467278c25ac6b6f"}},{"ruleId":"D2","level":"warning","message":{"text":"GitService.enforceStageTimeLfsTrackingForPaths (cognitive 20): GitService.enforceStageTimeLfsTrackingForPaths has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 2 (4 pts), loops 1 (2 pts) (nesting depth added 12). 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/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad72a1fe6c1fcbfafbb59b15f6b77d808b9670cb5fc7f72db9133c36fa70e22"}},{"ruleId":"D2","level":"warning","message":{"text":"Main.joinTables (cognitive 19): Main.joinTables has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/OfficeInterop/OfficeInterop.fs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5a64fdea99379c39776875674fdb16f3299415a134e9558798b013e7b519cd"}},{"ruleId":"D2","level":"warning","message":{"text":"Main.tryGetValidConversionCellTypes (cognitive 19): Main.tryGetValidConversionCellTypes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/OfficeInterop/OfficeInterop.fs"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"3183c860acca0d14684a9f349d768be5c2a6d475e99fbde39b57e5968f5e9186"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcFileFooterTabs.Main (cognitive 19): ArcFileFooterTabs.Main has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 5, boolean chains 2, loops 2 (nesting depth added 4). 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/Components/src/Page/ArcFileEditor/ArcFileFooterTabs.fs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"4697088b8d403a866f69c0a6514bd5eaebb4139ba9b8cc5a769d71522abe942b"}},{"ruleId":"D2","level":"warning","message":{"text":"EmptyTableModals.PreviousTableSelect (cognitive 18): EmptyTableModals.PreviousTableSelect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), loops 2 (6 pts) (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/MainComponents/EmptyTableModals.fs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e358e806fda8ed117b69d4dd60bd3f1f8d885c512cc5e4b265d645700ad5342"}},{"ruleId":"D2","level":"warning","message":{"text":"Main.tryParseToArcFile (cognitive 18): Main.tryParseToArcFile has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 8 (18 pts) (nesting depth added 10). 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/Client/OfficeInterop/OfficeInterop.fs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa471c2f9df0d3a100a5fc79f14d582aa9b03bdd18d617b09e451ec167850672"}},{"ruleId":"D2","level":"warning","message":{"text":"Helper.SemVer.comparePreRelease.Static (cognitive 18): Helper.SemVer.comparePreRelease.Static has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (6 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ValidationPackageBrowser/Helper.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6412d1c9748d2253372b8614289a2ec0e0619b0806cb0ab1ec9f28e57b1561a1"}},{"ruleId":"D2","level":"warning","message":{"text":"Layout.Sidebars (cognitive 18): Layout.Sidebars has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 4 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/Layout/Layout.fs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a331efc50860ee907d98f995d81e244d61366422470e8a4cc5b0853256efa6"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownPluginPromptModal.View (cognitive 18): MarkdownPluginPromptModal.View has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/MarkdownText/Plugins/MarkdownPluginPromptModal.fs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1e76066499dda9f05eb8732a9468bea7806a70795602578388cd989bbc48dc"}},{"ruleId":"D2","level":"warning","message":{"text":"GitService.getOriginRepositoryWebUrl (cognitive 18): GitService.getOriginRepositoryWebUrl has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 4 (8 pts) (nesting depth added 8). 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/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":2797}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a69dcc898580948b454b3a70b8f4aa28e488e9c66681eebd48ba585ef0b0027"}},{"ruleId":"D2","level":"warning","message":{"text":"GitLfsService.readLsFilesByRelativePath (cognitive 18): GitLfsService.readLsFilesByRelativePath has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/Git/GitLfsService.fs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86fd8c2063fdc661762a3dbbf4c60465e77fd0716129f0e1011d0f1b75829bd"}},{"ruleId":"D2","level":"warning","message":{"text":"GitLfsAdapter.runGitProcess (cognitive 18): GitLfsAdapter.runGitProcess has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 3, boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/Git/GitlfsAdapter.fs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc2b42d428eaaa147cb65f11f0a74ca476ec8216a6f346368eb912b8841b1df"}},{"ruleId":"D2","level":"warning","message":{"text":"NoFileElement.Main (cognitive 17): NoFileElement.Main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 4 (6 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/MainComponents/NoFileElement.fs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d64d21db53b10a52b457ae4431968e42cbac7f726372f1935b35ba145c52d0e"}},{"ruleId":"D2","level":"warning","message":{"text":"DataHubBrowser.Entry (cognitive 17): DataHubBrowser.Entry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, match/switch 6, boolean chains 1, loops 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f9224f794c806ea12d9556707ccaf65519fdd80928a3d2100d1f571bb71bda"}},{"ruleId":"D2","level":"warning","message":{"text":"DataHubBrowser.Filter (cognitive 17): DataHubBrowser.Filter has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 4 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). 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/Components/src/Page/DataHubBrowser/DataHubBrowser.fs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"0716b54bd5a46cc17c76a19d55f87423f7619aec10ea5f6a13026b844ae0702a"}},{"ruleId":"D2","level":"warning","message":{"text":"DataHubBrowser.Tabs (cognitive 17): DataHubBrowser.Tabs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c75b1dfb066d59fd177aaade4c35b73670457d6e9757d86b4b91ce7b4b2717c"}},{"ruleId":"D2","level":"warning","message":{"text":"FileExplorerItem.DirectoryRow (cognitive 17): FileExplorerItem.DirectoryRow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, match/switch 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/Components/src/Page/FileExplorer/FileExplorerItem.fs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c40a1ef553bbd690f7e7c9eed1add143d5d4bb80cec3b8535c47ed75189b1d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Workspace.Workspace (cognitive 17): Workspace.Workspace has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 4, boolean chains 1 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/Workspace/Workspace.fs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d1e284fc0d81e354bae889261f111cff935d7e2be73b149146bb3d403dcce2"}},{"ruleId":"D2","level":"warning","message":{"text":"DropTarget.resolveDropTarget (cognitive 17): DropTarget.resolveDropTarget has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/Workspace/Helper/DropTarget.fs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fab46d58362d8154f0af10fd93b5248976a5ae1e0a42ec23696e2ec9e518e1"}},{"ruleId":"D2","level":"warning","message":{"text":"CompositeCellModal.CompositeCellModal (cognitive 17): CompositeCellModal.CompositeCellModal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, match/switch 1 (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/AnnotationTable/Modals.fs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97fb247ac936711a6a437c20ebfc16298adfabc8a3265ca7dfe88e35884dd1f"}},{"ruleId":"D2","level":"warning","message":{"text":"ErrorModalProvider.ErrorModalHost (cognitive 17): ErrorModalProvider.ErrorModalHost has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 4 (5 pts), loops 2 (4 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Primitive/ErrorModal/Provider.fs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa1ee8a4b6c94e3532b61b3e6617646f3269b0a91421c9319203e632cf36ebc"}},{"ruleId":"D2","level":"warning","message":{"text":"Popover.Content (cognitive 17): Popover.Content has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (4 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Primitive/Popover/Popover.fs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d548b59dfb3ec08c8b1ba36d8866267f89a1f734baa02b0c6e6962cafe2d7dfe"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcRenameHelper.renameResolvedArcEntityAsync (cognitive 17): ArcRenameHelper.renameResolvedArcEntityAsync has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 2 (3 pts), error handling 1 (nesting depth added 10). 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/Electron/src/Main/IPC/Rename.fs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e8899e20c585f10cf412a48de3adf30baba470cf61895ae2b9db3518b18d07"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthService.signIn (cognitive 17): AuthService.signIn has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 4 (8 pts) (nesting depth added 10). 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/Electron/src/Main/Auth/AuthService.fs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49855355941295d9fa999741c4f4b04f9a85f7229ecc4fff184559b1ceb8d58"}},{"ruleId":"D2","level":"warning","message":{"text":"Changelog.tryFindLastVersion (cognitive 16): Changelog.tryFindLastVersion has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (16 pts) (nesting depth added 10). 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":"build/IO/Changelog.fs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9354689a43dc0a3c729b311ac8a89f989cd29f3201f554ae137322a540969b6"}},{"ruleId":"D2","level":"warning","message":{"text":"History.updateHistoryStorageMsg (cognitive 16): History.updateHistoryStorageMsg has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/Update.fs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afde3fe35818c772d17e8458f9cb3056ed53a66911fbbb1b4032416a7ec56bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Main.getCompositeColumnDetails (cognitive 16): Main.getCompositeColumnDetails has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 4 (5 pts) (nesting depth added 8). 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/Client/OfficeInterop/OfficeInterop.fs"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"184fce6b78cdea5cf84c6c84fd9ea456e3097d0c75da6c508e82fc7194a5f514"}},{"ruleId":"D2","level":"warning","message":{"text":"Helper.computeNewPackages (cognitive 16): Helper.computeNewPackages has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 2 (6 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ValidationPackageBrowser/Helper.fs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d3119002c3d66c316344c17f4846716b9bbc8aac2f10fdf9d0d62c9c010ce0"}},{"ruleId":"D2","level":"warning","message":{"text":"FileExplorerGitLfsHelper.contextMenuItems (cognitive 16): FileExplorerGitLfsHelper.contextMenuItems has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/FileExplorer/FileExplorerGitLfsHelper.fs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc13d83245cf01a629a02d0aa4cc85691931331a7cacfae91a8df97b6e9728e"}},{"ruleId":"D2","level":"warning","message":{"text":"ValueAssignment.planPropertyValueDrop (cognitive 16): ValueAssignment.planPropertyValueDrop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/EndpointAndAssignment.fs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"abef72e222348ae0c02d9ade42ea5fb3f58d93f6def4a88f9d99c12c40d54144"}},{"ruleId":"D2","level":"warning","message":{"text":"FileIOHelper.tryGetRepoRelativePathCore (cognitive 16): FileIOHelper.tryGetRepoRelativePathCore has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Swate.Electron.Shared/FileIOHelper.fs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa411a58645bdd0f0b7a19b71fdf80ff16eabc9659572c8afcdc18070707b6aa"}},{"ruleId":"D2","level":"warning","message":{"text":"GitLfsService.uploadObjects (cognitive 16): GitLfsService.uploadObjects has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/Git/GitLfsService.fs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b41fbdb62da1f82ae1672ffd9e7a47cd6d0a1c3257cdeefb27dc054013cdd56"}},{"ruleId":"D2","level":"warning","message":{"text":"InMemoryChangesExtensions.ARC.hasInMemoryChanges (cognitive 16): InMemoryChangesExtensions.ARC.hasInMemoryChanges has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), boolean chains 4, if/else 4 (nesting depth added 4). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/ARCtrlExtensions/InMemoryChanges.fs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b70a8937be1a3f16ef5b6e3d691558468b2e60b8dc643ef3c835b4d4b371c17"}},{"ruleId":"D2","level":"warning","message":{"text":"FileTreeCreator.getFileEntries (cognitive 16): FileTreeCreator.getFileEntries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/FileTreeCreator.fs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbda9bfd7d791537a67ffc370c90a0b9339a62dc7cd5aa8d3c193c0729a403e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Git/GitService.fs: FileTooLong \u2014 2226 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 136 functions. The bar is 500 significant lines; this is 1726 over it, 4.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f7fe811da37c6ec34fd38edfdf7ad08316240e2b9bdfcf8dfa9fe08184c2fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: GitSidebar/GitSidebar.fs: FileTooLong \u2014 1638 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1138 over it, 3.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/GitSidebar/GitSidebar.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f1587be6e38baaac7c43de43b8e03cf6aed9374909f8442254de06239fc51a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ProvenanceGrouping/Controls.fs: FileTooLong \u2014 1563 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1063 over it, 3.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/Controls.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0bce8458f8b3b115182732c6285ed8143bc6893f4af596f2e0e6d25933d68d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: OfficeInterop/OfficeInterop.fs: FileTooLong \u2014 1526 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1026 over it, 3.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/OfficeInterop/OfficeInterop.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a607ac76666e4e16ce81367b80dc0a98f90fa4b15efa5c5716ee6feeac5f7ff8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Context/GitWorkflow.fs: FileTooLong \u2014 1514 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 58 functions. The bar is 500 significant lines; this is 1014 over it, 3.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Renderer/Context/GitWorkflow.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6571cf7d34555f0a561a704ce357b2801fad9a1f52dc57adda3dd1ce1c0a389"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ProvenanceGrouping/ProvenanceGrouping.fs: FileTooLong \u2014 1407 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 907 over it, 2.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdbb316ef5a6e3b38b45819eab0f9652e5d704077501964172ecac867c43a28"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Icons: TooManyMethods \u2014 76 methods. The bar is 30 methods; this is 46 over it, 2.53\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/Components/src/Primitive/Icons.fs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d512114daf4c9679fbde4f7f6e8bc2e7ac53a1fd81c062e39db5fd891d69ca5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: AnnotationTable/Modals.fs: FileTooLong \u2014 1161 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 661 over it, 2.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/AnnotationTable/Modals.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f423d6cfe89043a9223eba485fced4e0476ba6ce9b5e6dd073315eb78a01a522"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Metadata/Forms.fs: FileTooLong \u2014 1137 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 637 over it, 2.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/SharedComponents/Metadata/Forms.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d15209fdb24f9eae0d5fa2a95b9633977396c4509847e67ca6250e05826baa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: TermSearch/TermSearch.fs: FileTooLong \u2014 960 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 460 over it, 1.92\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/TermSearch/TermSearch.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d43afdd897a14831d725ccfe6c75b94885699cc40e03d883b80a7686b1d5eea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: DataHubBrowser/DataHubBrowser.fs: FileTooLong \u2014 939 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 439 over it, 1.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f74c43a9cbe8693a80b5304453b1e45b5bf20cf661db3ab2b113464f26ebffc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Git/GitLfsService.fs: FileTooLong \u2014 903 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 51 functions. The bar is 500 significant lines; this is 403 over it, 1.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/Git/GitLfsService.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eab9b7757f3fb70a77d939bdefefe624eafe06338e6407f3717e1514975b650"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: Session: TooManyFunctions \u2014 48 functions. The bar is 30 functions; this is 18 over it, 1.60\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Shared/ProvenanceGrouping/Session.fs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05c6d5b7a4ac4ef0da5b06a938090aa89fe2000ac454114c9276e714fd1a03c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: GitComparison/GitMergeConflictViewer.fs: FileTooLong \u2014 770 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 270 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/GitComparison/GitMergeConflictViewer.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3fd5f5cc01c08eab5222eb63bd0ee7225746188a96608046d3ad73b812b48b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: IPC/IArcVaultsApi.fs: FileTooLong \u2014 770 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 270 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/IPC/IArcVaultsApi.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7e6e022d1a53608b1de230c66f616b02c36530a2e7e9d57f3857078c008c77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: AnnotationTable/ContextMenu.fs: FileTooLong \u2014 765 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 265 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/AnnotationTable/ContextMenu.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a513b91feea5c31863436e8b181608a00cab838fa82bfc2a5a5ded71d39974d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ProvenanceGrouping/ARCtrlConverter.fs: FileTooLong \u2014 712 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 212 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Shared/ProvenanceGrouping/ARCtrlConverter.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"558efb043bcf7b21a7d95d7b44ccc8b0b4a30a877f17cfbfb0dd41a917621084"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Api/GitLabApi.fs: FileTooLong \u2014 663 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 163 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Api/GitLabApi.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9317e82e13aeb6a110fd39b4c372f6d35bf53607acb4faf3a0c8dcfbea727e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ArcVault/ArcVault.fs: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 131 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/ArcVault/ArcVault.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a16eecaf27114e5059a62ff2ca4118cfc6fa3694d7438b38117890e9a24f3c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ProvenanceGrouping/State.fs: FileTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 112 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/State.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"893979f1351db5a7e766fbe5fc4cd4abe7a3be801c752775a8bb3db241644589"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Api/IOntologyAPI.fs: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 101 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Server/Api/IOntologyAPI.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52803c6f7299aa9242d3e4a8308640eb9a380d1a6788c9354af382c8c4847b07"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ProvenanceGrouping/PropertyModel.fs: FileTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 75 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/PropertyModel.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"432f5227939c50989241ab0f6f23b9f849483d04aae9598775809cdc2cd4aec1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ProvenanceGrouping/GroupCard.fs: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 44 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/GroupCard.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd0b678e244f2abb0024565c9d6fee71d2200b9b9ed10ab978e8a7dbb3a4bf6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: IPC/FileSystemIO.fs: FileTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 34 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/IPC/FileSystemIO.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c37e2d00ea337772e815d89225c9aa7510abac9374f5bd70700b940cddc756"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: TutorialOverlay/TutorialOverlay.fs: FileTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 32 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/TutorialOverlay/TutorialOverlay.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec09417161155f42fef8f0fce5bbc6f107396a72bd13df4d886e4a76aea3f4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: DataAnnotator/DataAnnotator.fs: FileTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 20 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/Widgets/DataAnnotator/DataAnnotator.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e141af343bd3192b3de7fd46ed3d703e96e5b875507c6d7f10e07d8590bbaefc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: AuthService: TooManyFunctions \u2014 31 functions. The bar is 30 functions; this is 1 over it, 1.03\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/Auth/AuthService.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f18cf68829b29777a262d94b1605e0a88d5e2fdd44c6890b2900ff9f240b022"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: GitApiClient: TooManyFunctions \u2014 31 functions. The bar is 30 functions; this is 1 over it, 1.03\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Renderer/GitApiClient.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ac45feffa9951bd3302289c5f81aa3c3d2ade8f78e9a174fa968a4dd24a1e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: AnnotationTable/AnnotationTable.fs: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 15 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/AnnotationTable/AnnotationTable.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f11f066a751cd5dfd28220e0ebc555fdb0e30e5453ff2d8b04ee0359df117a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (223 shared lines): src/Client/MainComponents/Widgets.fs:1-308 | src/Components/src/Composite/Widgets/Widgets.fs:1-599 \u2014 These two members are variants of one another: 223 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/MainComponents/Widgets.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd0d30829c21b4a6896c2522dcf01b740d6f2bd7ea3d4e7d7d01fb0370b4b51"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (73 shared lines): src/Client/SharedComponents/JsBindings/DndKit.fs:1-96 | src/Components/src/JsBindings/DndKit.fs:1-143 \u2014 These two members are variants of one another: 73 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/SharedComponents/JsBindings/DndKit.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ecc2fb25610b953ab876c6665e74094bc986a86fcf3ae8bdea356595d2e317"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (61 shared lines): src/Client/SharedComponents/Metadata/Generic.fs:1-97 | src/Components/src/Primitive/LayoutComponents/LayoutComponents.fs:1-104 \u2014 These two members are variants of one another: 61 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/SharedComponents/Metadata/Generic.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e0e5d65364370bac4e87531f9acd7a912e42cd1a8ec063a54295e70964f3a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): src/Client/Spreadsheet/IO.fs:1-97 | src/Components/src/ARCtrl/Json.fs:1-298 \u2014 These two members are one piece of code written twice and then edited apart: 46 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/Client/Spreadsheet/IO.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd2fd43093e7e301011d5166f048ff405a7c12d8ce9d9e337e529f78246913b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/Client/Model.fs:1-309 | src/Components/src/Composite/Widgets/BuildingBlockWidget/BuildingBlockWidget.fs:1-380 \u2014 These two members are one piece of code written twice and then edited apart: 31 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/Client/Model.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5698634aeeb87796f50a77a555c7f99ed54d8dd17d09f3e8477e309722d74b77"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/Components/src/Page/ProvenanceGrouping/EditorActions.fs:1-608 | src/Components/src/Page/ProvenanceGrouping/EditorLayout.fs:1-123 | src/Components/src/Page/ProvenanceGrouping/EditorPanels.fs:1-342 | src/Components/src/Page/ProvenanceGrouping/EditorPropertyShelf.fs:1-261 | src/Components/src/Page/ProvenanceGrouping/EditorSurface.fs:1-206 | src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs:1-1912 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/EditorActions.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6107f1ce4f235bab3edc4a8f62e33c20fb23d7d90a721a212081580a438f1ebe"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/Components/src/Page/ProvenanceGrouping/ConnectorMeasurement.fs:1-351 | src/Components/src/Page/ProvenanceGrouping/ConnectorOverlay.fs:1-417 | src/Components/src/Page/ProvenanceGrouping/ConnectorPaths.fs:1-543 | src/Components/src/Page/ProvenanceGrouping/ConnectorRendering.fs:1-223 | src/Components/src/Page/ProvenanceGrouping/ConnectorTypes.fs:1-100 \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":"src/Components/src/Page/ProvenanceGrouping/ConnectorMeasurement.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7aee096fda8d2d7ee2dbdd5a9e499fe2ed11093c0fe4418f98f12e3ee2840ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/Components/src/Page/Metadata/AssayMetadata.fs:1-83 | src/Components/src/Page/Metadata/InvestigationMetadata.fs:1-94 | src/Components/src/Page/Metadata/RunMetadata.fs:1-90 | src/Components/src/Page/Metadata/StudyMetadata.fs:1-90 | src/Components/src/Page/Metadata/WorkflowMetadata.fs:1-82 \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":"src/Components/src/Page/Metadata/AssayMetadata.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1024b063d60b838c8fdf90a2a4e34b2fab71a42d1ca211c5f2cdee5a1e7a1310"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (85 lines \u00D7 2): src/Client/MainComponents/Widgets.fs:49-133 | src/Components/src/Composite/Widgets/Widgets.fs:41-125 \u2014 before extracting anything, compare \u0060src/Client/MainComponents/Widgets.fs\u0060 and \u0060src/Components/src/Composite/Widgets/Widgets.fs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 225 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/MainComponents/Widgets.fs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce1bf05303e3777e9dd95355162223dabf187f464a9b42c52d8f13066392629"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (70 lines \u00D7 2): src/Client/Pages/ProtocolTemplates/ProtocolView.fs:30-99 | src/Components/src/Composite/TemplateBrowser/TemplatesDisplay.fs:42-111 \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/Client/Pages/ProtocolTemplates/ProtocolView.fs:30\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/Client/Pages/ProtocolTemplates/ProtocolView.fs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fb99431788015b877f4956c48459c2cf0b760de175fb1d3f0b229611c22902"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2): src/Client/MainComponents/Widgets.fs:142-196 | src/Components/src/Composite/Widgets/Widgets.fs:143-197 \u2014 before extracting anything, compare \u0060src/Client/MainComponents/Widgets.fs\u0060 and \u0060src/Components/src/Composite/Widgets/Widgets.fs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 225 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Client/MainComponents/Widgets.fs:142\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Components/src/Composite/Widgets/Widgets.fs:198\u0060 calls \u0060onFocus\u0060 and \u0060src/Client/MainComponents/Widgets.fs:197\u0060 does not \u2014 after which the two agree again for 4 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/Client/MainComponents/Widgets.fs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d668f8f699c339028cf38280637dc99c73946f61c4a8f0e147b06a12621331de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53\u201354 lines \u00D7 2): src/Server/Api/IOntologyAPI.fs:497-549 | src/Server/Api/IOntologyAPI.fs:778-831 \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/Server/Api/IOntologyAPI.fs:497\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":"src/Server/Api/IOntologyAPI.fs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5ad65852e290b0f09a277560558f6377c14031fe51187908a07acdc4a5123f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44\u201348 lines \u00D7 2): src/Components/src/Page/Metadata/InvestigationMetadata.fs:27-74 | src/Components/src/Page/Metadata/StudyMetadata.fs:27-70 \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 \u0060src/Components/src/Page/Metadata/InvestigationMetadata.fs:27\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":"src/Components/src/Page/Metadata/InvestigationMetadata.fs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce18c93c1d6bdb38ed7bd143299b8abed80bb6f322a4a509c6225089df5a840"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): src/Components/src/Page/Metadata/AssayMetadata.fs:28-63 | src/Components/src/Page/Metadata/RunMetadata.fs:27-62 \u2014 before extracting anything, compare \u0060src/Components/src/Page/Metadata/AssayMetadata.fs\u0060 and \u0060src/Components/src/Page/Metadata/RunMetadata.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Components/src/Page/Metadata/AssayMetadata.fs:28\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":"src/Components/src/Page/Metadata/AssayMetadata.fs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d26c197582197e37f54802090f0b037cbb262bdc81d5ee8c4d7616c640e78a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201334 lines \u00D7 2): src/Client/SharedComponents/JsBindings/DndKit.fs:47-80 | src/Components/src/JsBindings/DndKit.fs:76-108 \u2014 before extracting anything, compare \u0060src/Client/SharedComponents/JsBindings/DndKit.fs\u0060 and \u0060src/Components/src/JsBindings/DndKit.fs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/SharedComponents/JsBindings/DndKit.fs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"167f011b6f2bef3481659bbfee2c7416f1128117e552925ef5f771d7b4323665"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201332 lines \u00D7 2): src/Client/SharedComponents/Widgets.fs:10-41 | src/Components/src/Composite/Widgets/LocalStorage.fs:19-49 \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/Client/SharedComponents/Widgets.fs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3867ec93a8dd14d63b3807d500beef2a13810e6f2085b6895c6b97ded408c153"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201332 lines \u00D7 2): src/Client/SharedComponents/Metadata/Forms.fs:425-456 | src/Components/src/Page/Metadata/FormComponents/InputSequence.fs:24-43 \u2014 before extracting anything, compare \u0060src/Client/SharedComponents/Metadata/Forms.fs\u0060 and \u0060src/Components/src/Page/Metadata/FormComponents/InputSequence.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Client/SharedComponents/Metadata/Forms.fs:425\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/Client/SharedComponents/Metadata/Forms.fs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec2ca347e5f5fc1dd8f9046759d2aef6c7085aa8c549f8f04de0ef71e8485c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): src/Client/SharedComponents/Metadata/Forms.fs:740-771 | src/Components/src/Page/Metadata/FormComponents/OntologyAnnotationInput.fs:26-57 \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/Client/SharedComponents/Metadata/Forms.fs:740\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/Client/SharedComponents/Metadata/Forms.fs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87a303ae40daeeb38a897b9b66649b660020cb095c1d5f38aecd7b0b43b7496"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/Client/Model.fs:191-221 | src/Components/src/Composite/Widgets/BuildingBlockWidget/BuildingBlockWidget.fs:16-46 \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/Client/Model.fs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0416d2bfae2063c8448dd6842744e43d2e4281af52a97cb103a9030b349255"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/Client/Spreadsheet/IO.fs:67-97 | src/Components/src/ARCtrl/Json.fs:26-56 \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/Client/Spreadsheet/IO.fs:67\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":"src/Client/Spreadsheet/IO.fs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da811a4d8a6136ebc9eea28f4bf34f0bce0f6220b9ee279bacac7e09587553f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): src/Client/SharedComponents/Metadata/Generic.fs:23-51 | src/Components/src/Primitive/LayoutComponents/LayoutComponents.fs:22-50 \u2014 before extracting anything, compare \u0060src/Client/SharedComponents/Metadata/Generic.fs\u0060 and \u0060src/Components/src/Primitive/LayoutComponents/LayoutComponents.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Client/SharedComponents/Metadata/Generic.fs:23\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/SharedComponents/Metadata/Generic.fs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"092d2b20a299277c9c52e444cf4f6ff4264a9040a18271b45e4b59d02114f27b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.fs:71-98 | src/Components/src/Page/ProvenanceGrouping/ControlsSupport.fs:44-71 \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/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.fs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3f0b43b1e42d6d119a1f8473d86f61f2575340ca5cfffb1eb06823d738c7ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/Client/SharedComponents/JsBindings/DndKit.fs:8-34 | src/Components/src/JsBindings/DndKit.fs:9-35 \u2014 before extracting anything, compare \u0060src/Client/SharedComponents/JsBindings/DndKit.fs\u0060 and \u0060src/Components/src/JsBindings/DndKit.fs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/SharedComponents/JsBindings/DndKit.fs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d147364e5dc3e459d9daa1b7a7d5b807723969dbebb2194740b832f1ee1d8b76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/Components/src/Primitive/Buttons/Buttons.fs:16-42 | src/Components/src/Primitive/Buttons/Buttons.fs:47-73 \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/Components/src/Primitive/Buttons/Buttons.fs:16\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":"src/Components/src/Primitive/Buttons/Buttons.fs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bc3f208e663ce35ae36d6905db41cccf2ad4b859ea13bcc02fb96a0e0e9790"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/Client/Pages/ProtocolTemplates/ProtocolView.fs:117-141 | src/Components/src/Composite/TemplateBrowser/TemplatesDisplay.fs:134-158 \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/Client/Pages/ProtocolTemplates/ProtocolView.fs:117\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":"src/Client/Pages/ProtocolTemplates/ProtocolView.fs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede319b10508de5edf5a5f4fdcd588bffd55ff575e90a33f55c1ff650da10c31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/Components/src/Composite/DataMapTable/DataMapTable.fs:94-118 | src/Components/src/Composite/DataMapTable/DataMapTable.fs:143-167 \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/Components/src/Composite/DataMapTable/DataMapTable.fs:94\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":"src/Components/src/Composite/DataMapTable/DataMapTable.fs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a85c5614df8cca97ad775c82f5d15f536ecbe5032abe473a9cde028a9d348c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/Server/Api/IOntologyAPI.fs:413-437 | src/Server/Api/IOntologyAPI.fs:690-714 \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/Server/Api/IOntologyAPI.fs:413\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":"src/Server/Api/IOntologyAPI.fs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c37a7317d25006f7497c9154a860166cfef6dbf0f37b7174c745a68af482c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/Client/OfficeInterop/OfficeInterop.fs:111-133 | src/Client/OfficeInterop/OfficeInterop.fs:231-253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/OfficeInterop/OfficeInterop.fs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2786ecd5dfc2ee9b3ab43b0f9ed01e90e3ce8dc268a3d3856ecb984e6ff5e6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): src/Client/MainComponents/Widgets.fs:217-238 | src/Components/src/Composite/Widgets/Widgets.fs:219-241 \u2014 before extracting anything, compare \u0060src/Client/MainComponents/Widgets.fs\u0060 and \u0060src/Components/src/Composite/Widgets/Widgets.fs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 225 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Client/MainComponents/Widgets.fs:217\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/MainComponents/Widgets.fs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c39f1e7974fef2cc0c00a20dc14076673fd7ec05932b1615be6c7c19a872ac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/Components/src/Composite/AnnotationTable/Modals.fs:1188-1210 | src/Components/src/Composite/AnnotationTable/Modals.fs:1638-1660 \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/Components/src/Composite/AnnotationTable/Modals.fs:1188\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":"src/Components/src/Composite/AnnotationTable/Modals.fs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"619c1e6a0b5a632a18057c6d6f98c24735756554a3f6dd7f04a4e2032aa4d950"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 4): src/Client/OfficeInterop/ARCtrlHelper.fs:71-90 | src/Client/OfficeInterop/OfficeInterop.fs:54-74 | src/Client/OfficeInterop/OfficeInterop.fs:91-108 | src/Client/OfficeInterop/OfficeInterop.fs:170-190 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Client/OfficeInterop/ARCtrlHelper.fs:71\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/Client/OfficeInterop/ARCtrlHelper.fs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7a76086eccafec53d001ee81f83990bd689586d9383d0bda976e2990cb4236"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/Client/States/IndexedDB.fs:115-134 | src/Client/States/IndexedDB.fs:155-174 \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/Client/States/IndexedDB.fs:115\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/Client/States/IndexedDB.fs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd71c3ec820ed251adbd1669a261b6c30342f50481c8f9958acce157d9c7f46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/Components/src/Composite/AnnotationTable/ContextMenu.fs:828-846 | src/Components/src/Composite/AnnotationTable/ContextMenu.fs:910-929 \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/Components/src/Composite/AnnotationTable/ContextMenu.fs:828\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":"src/Components/src/Composite/AnnotationTable/ContextMenu.fs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfaf3d9cb022dad77d278f67cd8063770e7692aa1b630ebd8a4df3a9717e6ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/Components/src/Composite/MarkdownText/TextInputWithMarkdown.fs:115-134 | src/Components/src/Page/Metadata/FormComponents/TextInput.fs:35-53 \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/Components/src/Page/Metadata/FormComponents/TextInput.fs:35\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":"src/Components/src/Composite/MarkdownText/TextInputWithMarkdown.fs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab03d81c2851e8a731a158f02731c70bf5466b45a560d75e2b3e4e2e3dafcab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/Client/Modals/SelectiveImportModal.fs:329-347 | src/Client/Modals/SelectiveImportModal.fs:394-412 \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/Client/Modals/SelectiveImportModal.fs:329\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":"src/Client/Modals/SelectiveImportModal.fs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a47c1f391743d5af4089f5c3a282634d0fe2e94772612995fe68fde1fe8339"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/Client/MainComponents/Widgets.fs:197-215 | src/Components/src/Composite/Widgets/Widgets.fs:199-217 \u2014 before extracting anything, compare \u0060src/Client/MainComponents/Widgets.fs\u0060 and \u0060src/Components/src/Composite/Widgets/Widgets.fs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 225 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Client/MainComponents/Widgets.fs:197\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Components/src/Composite/Widgets/Widgets.fs:198\u0060 calls \u0060onFocus\u0060 and \u0060src/Client/MainComponents/Widgets.fs:196\u0060 does not \u2014 after which the two agree again for 4 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/Client/MainComponents/Widgets.fs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bfb7fe24ff3392ac9bdc0d428812e2a92a85f3a48f142a8f42fc77c5b3c01b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/Components/src/Composite/AnnotationTable/Modals.fs:1165-1183 | src/Components/src/Composite/AnnotationTable/Modals.fs:1615-1633 \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/Components/src/Composite/AnnotationTable/Modals.fs:1165\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/Components/src/Composite/AnnotationTable/Modals.fs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dd3dba5d1a5cb95f1e88bf8b0e44a0260848766e925b0db7cf1da44a124f0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/Components/src/Composite/DataMapTable/ClipboardTarget.fs:36-53 | src/Components/src/Composite/DataMapTable/ClipboardTarget.fs:60-78 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Components/src/Composite/DataMapTable/ClipboardTarget.fs:60\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":"src/Components/src/Composite/DataMapTable/ClipboardTarget.fs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bef992152a857fda6693e1983384357f41c763687c428824d4252df61c75714"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/Server/Api/IOntologyAPI.fs:298-316 | src/Server/Api/IOntologyAPI.fs:556-574 \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/Server/Api/IOntologyAPI.fs:298\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/Server/Api/IOntologyAPI.fs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d08ad3d02e8cf5d698ad672f63c7fff795404a4345fca2d62c6d724355c043"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 5): src/Components/src/Page/Metadata/AssayMetadata.fs:22-39 | src/Components/src/Page/Metadata/InvestigationMetadata.fs:21-38 | src/Components/src/Page/Metadata/RunMetadata.fs:21-38 | src/Components/src/Page/Metadata/StudyMetadata.fs:21-38 | src/Components/src/Page/Metadata/WorkflowMetadata.fs:21-38 \u2014 before extracting anything, compare \u0060src/Components/src/Page/Metadata/AssayMetadata.fs\u0060 and \u0060src/Components/src/Page/Metadata/RunMetadata.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Components/src/Page/Metadata/AssayMetadata.fs:22\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/Components/src/Page/Metadata/AssayMetadata.fs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b0d47589a295005ca931f08120d243ff6fc77501475ed04d4b78ec1c5fb158"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/Client/OfficeInterop/OfficeInterop.fs:1801-1818 | src/Client/OfficeInterop/OfficeInterop.fs:1900-1916 \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/Client/OfficeInterop/OfficeInterop.fs:1801\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/Client/OfficeInterop/OfficeInterop.fs"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f1e92ab56c1d6085b8fd30439e2fd3b688a8609a68672c04140c63f17b1658"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): src/Client/SharedComponents/Metadata/Forms.fs:1077-1094 | src/Components/src/Page/Metadata/FormComponents/PersonsInput.fs:23-37 \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/Client/SharedComponents/Metadata/Forms.fs:1077\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":"src/Client/SharedComponents/Metadata/Forms.fs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"036d55ecd8f637609e67f1a99238d49584de57a7300e1dd87131109d79656319"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/Client/SharedComponents/Metadata/Assay.fs:23-40 | src/Client/SharedComponents/Metadata/Workflow.fs:32-48 \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 \u0060src/Client/SharedComponents/Metadata/Assay.fs:23\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/SharedComponents/Metadata/Assay.fs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"afabeabf37819fbd5f21a0f2f43bacf3dcd63ce1693e9e436d97d1b8a9db2003"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/Client/MainComponents/Widgets.fs:18-35 | src/Components/src/Composite/Widgets/Widgets.fs:13-30 \u2014 before extracting anything, compare \u0060src/Client/MainComponents/Widgets.fs\u0060 and \u0060src/Components/src/Composite/Widgets/Widgets.fs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 225 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/MainComponents/Widgets.fs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c0d6f01d364761265cf6b6bdf9938affacb7efdc1bbcc73ff7ff9535f08429"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/Components/src/Page/ProvenanceGrouping/Controls.fs:1-18 | src/Components/src/Page/ProvenanceGrouping/ControlsSupport.fs:1-18 \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/Components/src/Page/ProvenanceGrouping/Controls.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e285c5813ba6a7669b7ba9fe32bc56c6aba60255fbfc7335b71cfcd67d7ed10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): src/Server/Api/IOntologyAPI.fs:479-494 | src/Server/Api/IOntologyAPI.fs:759-776 \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/Server/Api/IOntologyAPI.fs:479\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Server/Api/IOntologyAPI.fs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"01518a9088a915628d7237d395209b77f53e6ac1c5e91a8e1ecba7cff6d3727a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/Electron/src/Main/Git/GitLfsService.fs:867-884 | src/Electron/src/Main/Git/GitLfsService.fs:930-947 \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/Electron/src/Main/Git/GitLfsService.fs:867\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":"src/Electron/src/Main/Git/GitLfsService.fs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0e1b2e2318908099a2a137c6e325bb1991638b1ab7992e01467ed5fb2cae6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/Client/Modals/SelectiveImportModal.fs:307-322 | src/Client/Modals/SelectiveImportModal.fs:376-392 \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/Client/Modals/SelectiveImportModal.fs:307\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/Client/Modals/SelectiveImportModal.fs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"23536c25a50e50abf59d3872b2ce2ec5e3ba0f3d0c5d4541973dc8f52d7a2c26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/Client/SharedComponents/Metadata/Generic.fs:60-75 | src/Components/src/Primitive/LayoutComponents/LayoutComponents.fs:65-81 \u2014 before extracting anything, compare \u0060src/Client/SharedComponents/Metadata/Generic.fs\u0060 and \u0060src/Components/src/Primitive/LayoutComponents/LayoutComponents.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/SharedComponents/Metadata/Generic.fs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d0ebbb021318d1ef306ae3fd5fab6b7c4b61433efdfa7e1c7e8d92c63ab675"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/Client/SharedComponents/Metadata/Generic.fs:78-93 | src/Components/src/Primitive/LayoutComponents/LayoutComponents.fs:84-100 \u2014 before extracting anything, compare \u0060src/Client/SharedComponents/Metadata/Generic.fs\u0060 and \u0060src/Components/src/Primitive/LayoutComponents/LayoutComponents.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Client/SharedComponents/Metadata/Generic.fs:78\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/Client/SharedComponents/Metadata/Generic.fs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9b5e1ece89d2e9da41d79cf9f70bf80eb1e57e4a023a44dda598c42017ff17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/Client/SharedComponents/Metadata/Forms.fs:524-540 | src/Components/src/Page/Metadata/FormComponents/InputSequence.fs:108-124 \u2014 before extracting anything, compare \u0060src/Client/SharedComponents/Metadata/Forms.fs\u0060 and \u0060src/Components/src/Page/Metadata/FormComponents/InputSequence.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Client/SharedComponents/Metadata/Forms.fs:524\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/Client/SharedComponents/Metadata/Forms.fs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c5b7240709956cc02c7c7712549c032f23d2396c84829842d3a7efd1e5f825"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): src/Client/Pages/Settings/SettingsView.fs:18-32 | src/Components/src/Page/SettingsPage/SettingsPage.fs:21-37 \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/Client/Pages/Settings/SettingsView.fs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8916ecbf888e91c8953aee72682f21201eb7728f917849e275299a5571c414a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/Components/src/Composite/TermSearch/TermSearch.fs:899-915 | src/Components/src/Composite/TermSearch/TermSearch.fs:929-945 \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/Components/src/Composite/TermSearch/TermSearch.fs:899\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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/Components/src/Composite/TermSearch/TermSearch.fs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c425d58f159a4734b328b10b38b39f9dbc21bb57a0d2e433efce8e3ea3cea01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Components/src/Composite/TermSearch/Types.fs:24-39 | src/Components/src/Composite/TermSearch/Types.fs:42-57 \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/Components/src/Composite/TermSearch/Types.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/TermSearch/Types.fs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3ebd74884e4eb5218a5fa6181fdfc30efda6ba7311c04fba60123ee84d5769"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/Components/src/Page/ProvenanceGrouping/Interaction.fs:174-189 | src/Components/src/Page/ProvenanceGrouping/Interaction.fs:227-242 \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/Components/src/Page/ProvenanceGrouping/Interaction.fs:174\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":"src/Components/src/Page/ProvenanceGrouping/Interaction.fs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fc78adc6526b7102a09dc997458b3d2c5b5a6d143b80a42ed37b5f3854dd9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 6): src/Components/src/Page/ProvenanceGrouping/EditorActions.fs:1-15 | src/Components/src/Page/ProvenanceGrouping/EditorLayout.fs:1-14 | src/Components/src/Page/ProvenanceGrouping/EditorPanels.fs:1-14 | src/Components/src/Page/ProvenanceGrouping/EditorPropertyShelf.fs:1-15 | src/Components/src/Page/ProvenanceGrouping/EditorSurface.fs:1-14 | src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs:1-15 \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 all 6 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/EditorActions.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e04c7d664d4b71e36279a22de2b6b8863ac538272f604f8c39e468ab14a1b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 5): src/Client/OfficeInterop/ARCtrlHelper.fs:67-81 | src/Client/OfficeInterop/OfficeInterop.fs:50-64 | src/Client/OfficeInterop/OfficeInterop.fs:87-101 | src/Client/OfficeInterop/OfficeInterop.fs:166-180 | src/Client/OfficeInterop/OfficeInterop.fs:207-219 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. 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/Client/OfficeInterop/ARCtrlHelper.fs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb6516f361487d9aa3441672e642257d35f5e25c8f9562d95a16e6d90c5d851"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Client/Types.fs:25-39 | src/Components/src/Composite/TemplateBrowser/Types.fs:40-54 \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/Client/Types.fs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0206977deec694ada3b32a5d6ef86123b4112b59c5e19fb3d699cba53394b6e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Client/OfficeInterop/ExcelHelper.fs:240-254 | src/Client/OfficeInterop/OfficeInterop.fs:1999-2013 \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 \u0060src/Client/OfficeInterop/ExcelHelper.fs:240\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Client/OfficeInterop/OfficeInterop.fs:2013\u0060 calls \u0060then\u0060 and \u0060src/Client/OfficeInterop/ExcelHelper.fs:254\u0060 does not \u2014 after which the two agree again for 3 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/Client/OfficeInterop/ExcelHelper.fs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec4280a6cd57b35edbdbfc1de51c81f2488e857269fdcf4780d8b958f41b38e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Client/OfficeInterop/ExcelHelper.fs:422-436 | src/Client/OfficeInterop/ExcelHelper.fs:497-511 \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/Client/OfficeInterop/ExcelHelper.fs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50faf0ade9a06e1c7b866db4dc68078a0553644b081937965300c40e770fb80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Client/States/DataAnnotator.fs:35-49 | src/Components/src/Composite/Widgets/DataAnnotator/Types.fs:65-79 \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/Client/States/DataAnnotator.fs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2eda743eeaf8946e6838f16617b8efd3a3855bf233cc308727f868da41c636"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Client/Pages/FilePicker/FilePickerView.fs:96-110 | src/Client/Pages/TermSearch/TermSearchView.fs:24-38 \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/Client/Pages/FilePicker/FilePickerView.fs:96\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/Client/Pages/FilePicker/FilePickerView.fs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"db895ee4dfb18d0de5c4991a8e81d33e345e007e0e7140e1f04285e38af99542"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Components/src/ARCtrl/Extensions/CompositeCell.fs:12-26 | src/Components/src/Composite/TemplateBrowser/Helper.fs:21-35 \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/Components/src/ARCtrl/Extensions/CompositeCell.fs:12\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/Components/src/ARCtrl/Extensions/CompositeCell.fs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef68d9b77ab88d601cc1a2342c275e5b1b2a0e947a34e286690b95d94fbcf14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/Server/Api/IOntologyAPI.fs:461-475 | src/Server/Api/IOntologyAPI.fs:741-755 \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/Server/Api/IOntologyAPI.fs:461\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/Server/Api/IOntologyAPI.fs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a34b94e8688c182a2d405befa811c7687b74523541e19d0af839c28ce497f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/Electron/src/Main/Git/GitService.fs:1184-1198 | src/Electron/src/Main/Git/GitService.fs:1246-1259 \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/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae0d8e99e151cf16838dd52fb651a4778ffb0fcf99e14fa9a724ad62d99bba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): src/Components/src/Composite/AnnotationTable/Modals.fs:1185-1198 | src/Components/src/Composite/AnnotationTable/Modals.fs:1496-1507 | src/Components/src/Composite/AnnotationTable/Modals.fs:1635-1648 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Components/src/Composite/AnnotationTable/Modals.fs:1185\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":"src/Components/src/Composite/AnnotationTable/Modals.fs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2f2a2481fb9c27b6c44129df9acbbfe7df427ad917751837fc839a5c7632d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/Client/OfficeInterop/OfficeInterop.fs:34-47 | src/Client/OfficeInterop/OfficeInterop.fs:151-163 \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/Client/OfficeInterop/OfficeInterop.fs:34\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":"src/Client/OfficeInterop/OfficeInterop.fs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58863fa3d29c6f0e4d4a2551c660c082f95e60e7c51a68370524ade9a0e51a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/Client/Spreadsheet/IO.fs:52-65 | src/Components/src/ARCtrl/Json.fs:12-24 \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/Client/Spreadsheet/IO.fs:52\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/Client/Spreadsheet/IO.fs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c226e28cd9284a83343fcb4789279dbbed341e36cc0fd6c9ef606108afefc5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): src/Client/MainComponents/EmptyTableModals.fs:137-147 | src/Components/src/Page/ArcFileEditor/EmptyTableView/Modals.fs:112-125 \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/Client/MainComponents/EmptyTableModals.fs:137\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":"src/Client/MainComponents/EmptyTableModals.fs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bf2c9abdc8324e9e08cd6b4073420da0b126493ca61cf96b9382c7e20195ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/Client/MainComponents/Navbar.fs:88-101 | src/Client/MainComponents/Navbar.fs:115-127 \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/Client/MainComponents/Navbar.fs:88\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/Client/MainComponents/Navbar.fs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"224c1661dc719f98d759361eb0a56ab33084833d7f0b060e984e7617a5b3f16f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Client/Update/UpdateUtil.fs:54-67 | src/Components/src/Composite/TemplateBrowser/Helper.fs:77-90 \u2014 before extracting anything, compare \u0060src/Client/Update/UpdateUtil.fs\u0060 and \u0060src/Components/src/Composite/TemplateBrowser/Helper.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Client/Update/UpdateUtil.fs:54\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/Client/Update/UpdateUtil.fs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc81c7ed2b18b9033d7f26b303b2e6d54f56e6b29391d28ba69c0a671a214df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Client/Update/UpdateUtil.fs:149-162 | src/Components/src/Composite/TemplateBrowser/Helper.fs:126-139 \u2014 before extracting anything, compare \u0060src/Client/Update/UpdateUtil.fs\u0060 and \u0060src/Components/src/Composite/TemplateBrowser/Helper.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Client/Update/UpdateUtil.fs:149\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":"src/Client/Update/UpdateUtil.fs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ed64b1f270dce59a47a7e1e576e5a3abfe9a5d9f20f321648d8ad7e50e7c5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/Components/src/Composite/Widgets/Widgets.fs:306-319 | src/Components/src/Composite/Widgets/Widgets.fs:321-333 \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/Components/src/Composite/Widgets/Widgets.fs:306\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":"src/Components/src/Composite/Widgets/Widgets.fs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3a42c2cfa4778f4a88b4a32f3a35cfd071b46f736a384c0f78c48c4b8827fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/Components/src/Page/ProvenanceGrouping/EditorPropertyShelf.fs:23-34 | src/Components/src/Page/ProvenanceGrouping/PropertyModel.fs:9-22 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/EditorPropertyShelf.fs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4491dbcbf53f0c4292ce7e3e46488dfc39b315ebe16d8e0eba68f9bd267e2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Electron/src/Main/Git/GitService.fs:1724-1737 | src/Electron/src/Main/Git/GitService.fs:2643-2656 \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/Electron/src/Main/Git/GitService.fs:1724\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/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cda261f4fbb25990bc3a3f51ed1d4aabec9d81f32063718eeaa9dca6affd49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Electron/src/Main/Git/GitService.fs:2773-2786 | src/Electron/src/Main/Git/GitService.fs:2826-2839 \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/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":2773}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ab497f7071ceb6e7c51c1fdd528fac810d30b3a59d753dfe909fd6d6b6c4fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Client/SharedComponents/Widgets.fs:36-48 | src/Client/SharedComponents/Widgets.fs:58-70 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/SharedComponents/Widgets.fs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"684707e0dd2b457aa32037a1a0a3ee39e29102323f6786504b0a30198dcfd138"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/Client/SharedComponents/Widgets.fs:52-63 | src/Components/src/Composite/Widgets/LocalStorage.fs:53-65 \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/Client/SharedComponents/Widgets.fs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b8e3bb971019819fb5599746f12b034b89515e7046122a661c544f8b4362ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Client/States/DataAnnotator.fs:90-102 | src/Components/src/Composite/Widgets/DataAnnotator/Types.fs:130-142 \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/Client/States/DataAnnotator.fs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3118793aa82f77ef8c18fe1be298dba67bbaf941f3f41f3d77f972b1705359"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Client/MainComponents/Widgets.fs:249-261 | src/Components/src/Composite/Widgets/Widgets.fs:255-267 \u2014 before extracting anything, compare \u0060src/Client/MainComponents/Widgets.fs\u0060 and \u0060src/Components/src/Composite/Widgets/Widgets.fs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 225 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Client/MainComponents/Widgets.fs:249\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Components/src/Composite/Widgets/Widgets.fs:268\u0060 calls \u0060onMouseDown\u0060, \u0060stopPropagation\u0060 and \u0060src/Client/MainComponents/Widgets.fs:262\u0060 does not \u2014 after which the two agree again for 4 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/Client/MainComponents/Widgets.fs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f557e18194c59a2f03bfc3654f00f21d59b71a58a83034a8b2d3fc9b9fa2a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Components/src/Api/GitLabApi.fs:635-647 | src/Components/src/Api/GitLabApi.fs:706-718 \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/Components/src/Api/GitLabApi.fs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"b540118db07e89fee9ef1fecb76166e23656d7443c8605c7918ed1da135640cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Components/src/Composite/AnnotationTable/ContextMenu.fs:764-776 | src/Components/src/Composite/AnnotationTable/ContextMenu.fs:889-901 \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/Components/src/Composite/AnnotationTable/ContextMenu.fs:764\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Components/src/Composite/AnnotationTable/ContextMenu.fs:902\u0060 calls \u0060ContextMenuItem\u0060 and \u0060src/Components/src/Composite/AnnotationTable/ContextMenu.fs:776\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/Components/src/Composite/AnnotationTable/ContextMenu.fs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f9fdc1c8b1db94483e63c1d9068e36cc752cc4aca37694ca169341a91535c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): src/Components/src/Composite/Layout/Layout.fs:165-173 | src/Components/src/Composite/Workspace/PaneNode.fs:97-109 \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/Components/src/Composite/Layout/Layout.fs:165\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Components/src/Composite/Layout/Layout.fs:161\u0060 calls \u0060removeEventListener\u0060, \u0060addEventListener\u0060 and \u0060src/Components/src/Composite/Workspace/PaneNode.fs:95\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/Components/src/Composite/Layout/Layout.fs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f0de65999876b4bfad7f0fccb6561ae041e5904215827d05dcd96d45b72a24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Electron/src/Main/Git/GitService.fs:1622-1635 | src/Electron/src/Main/Git/GitService.fs:1720-1732 \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/Electron/src/Main/Git/GitService.fs:1622\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":"src/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"182cc7cd87c1fd2a87b96eb9f3142c5f31f07ac4763448d91475b8f3fc405b93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/Electron/src/Main/Git/GitService.fs:2746-2758 | src/Electron/src/Main/Git/GitService.fs:2875-2888 \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/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":2746}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d163824193b9295653742b3736273c276defb507a45bd0499aa42a16bab7634"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 5): src/Components/src/Page/ProvenanceGrouping/ConnectorMeasurement.fs:1-12 | src/Components/src/Page/ProvenanceGrouping/ConnectorOverlay.fs:1-12 | src/Components/src/Page/ProvenanceGrouping/ConnectorPaths.fs:1-11 | src/Components/src/Page/ProvenanceGrouping/ConnectorRendering.fs:1-12 | src/Components/src/Page/ProvenanceGrouping/ConnectorTypes.fs:1-12 \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 all 5 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ProvenanceGrouping/ConnectorMeasurement.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8b1962d5659219396d0221e722dc327a0af75126fc8babbea6d7932d66f5a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): src/Client/OfficeInterop/ARCtrlHelper.fs:158-166 | src/Client/OfficeInterop/ArcTableHelper.fs:73-84 \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/Client/OfficeInterop/ARCtrlHelper.fs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a7f09050831f8fe3bc96905707c6f4760c20615f4ecab7e200e99b072a1835"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Client/OfficeInterop/ExcelHelper.fs:465-476 | src/Client/OfficeInterop/ExcelHelper.fs:540-551 \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/Client/OfficeInterop/ExcelHelper.fs:465\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":"src/Client/OfficeInterop/ExcelHelper.fs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e5661f4ce112584d738c7717af661b8af4454cef62c07149a7a3566f95937f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Client/OfficeInterop/OfficeInterop.fs:429-440 | src/Client/OfficeInterop/OfficeInterop.fs:443-454 \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/Client/OfficeInterop/OfficeInterop.fs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8a3d10ce6eddae52df216fd8d18158ccd8f7d020c772d825a42020309c03af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Client/SharedComponents/Metadata/Forms.fs:178-189 | src/Components/src/Page/Metadata/FormComponents/Helpers.fs:6-18 \u2014 before extracting anything, compare \u0060src/Client/SharedComponents/Metadata/Forms.fs\u0060 and \u0060src/Components/src/Page/Metadata/FormComponents/Helpers.fs\u0060 as WHOLE FILES: 82% 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/SharedComponents/Metadata/Forms.fs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00d2d12a714b032c17c45fbe37e09486c7579b6eb367eea455ffb68e684a573"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Client/Pages/BuildingBlock/Dropdown.fs:17-28 | src/Components/src/Composite/Widgets/BuildingBlockWidget/Dropdown.fs:55-66 \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/Client/Pages/BuildingBlock/Dropdown.fs:17\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/Components/src/Composite/Widgets/BuildingBlockWidget/Dropdown.fs:67\u0060 calls \u0060preventDefault\u0060 and \u0060src/Client/Pages/BuildingBlock/Dropdown.fs:29\u0060 does not \u2014 after which the two agree again for 4 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/Client/Pages/BuildingBlock/Dropdown.fs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b0c38c16bc9df034a20ea09043c3685c1ecba76a440cc97b295783475dff79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Components/src/Page/ProvenanceGrouping/Controls.fs:1359-1370 | src/Components/src/Page/ProvenanceGrouping/Controls.fs:1494-1505 \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/Components/src/Page/ProvenanceGrouping/Controls.fs"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fc4b5fc8e7a20e264bcf70626493a372d0b64bec0c377e72855bdfa712aa3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Components/src/Page/ProvenanceGrouping/Controls.fs:1794-1805 | src/Components/src/Page/ProvenanceGrouping/Controls.fs:1810-1821 \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/Components/src/Page/ProvenanceGrouping/Controls.fs"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"697d0bd791c386549524ea83af5552e7dce3529b92e35d800838132f60594896"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Electron/src/Main/Git/GitService.fs:1753-1764 | src/Electron/src/Main/Git/GitService.fs:2044-2055 \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/Electron/src/Main/Git/GitService.fs:1753\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/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f047fc60c06908bae2e3be10845969ea446fb7f0453af1697a12cdbc40eb95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/Electron/src/Main/IPC/IArcVaultsApi.fs:237-248 | src/Electron/src/Main/IPC/IArcVaultsApi.fs:274-284 \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/Electron/src/Main/IPC/IArcVaultsApi.fs:237\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":"src/Electron/src/Main/IPC/IArcVaultsApi.fs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb3d7060c40082e0c97ff0b88ff85ae237ac527d27ca583e0e83aaa4b3bd367"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Client/SharedComponents/Metadata/Forms.fs:477-487 | src/Components/src/Page/Metadata/FormComponents/InputSequence.fs:60-72 \u2014 before extracting anything, compare \u0060src/Client/SharedComponents/Metadata/Forms.fs\u0060 and \u0060src/Components/src/Page/Metadata/FormComponents/InputSequence.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/SharedComponents/Metadata/Forms.fs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"61385949ad7484f5d4cf99c7b1e1d10cb69ae5e6b70aab202108ef7081be8438"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Server/Server.fs:50-60 | src/Server/Server.fs:66-76 \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/Server/Server.fs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a484a1674ae5be196fca6b064ebfe4b5fb87e96b0a283d98b07379d4b57f27c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Electron/src/Main/Git/GitlfsAdapter.fs:54-64 | src/Electron/src/Main/Git/GitlfsAdapter.fs:294-304 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/Git/GitlfsAdapter.fs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75ca3410774662ec59c0112df55f5dc4a0e8e51f256a0193bc270f1dbd56ef6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Electron/src/Main/IPC/IArcVaultsApi.fs:238-248 | src/Electron/src/Main/IPC/IArcVaultsApi.fs:570-580 \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/Electron/src/Main/IPC/IArcVaultsApi.fs:238\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":"src/Electron/src/Main/IPC/IArcVaultsApi.fs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c6be0fb090fbc78c3e47f5bd292646f6c08b0f840b77250bc729b48adbdc10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Client/OfficeInterop/ARCtrlHelper.fs:55-64 | src/Client/OfficeInterop/OfficeInterop.fs:75-84 \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 \u0060src/Client/OfficeInterop/ARCtrlHelper.fs:55\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/Client/OfficeInterop/ARCtrlHelper.fs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8d038df5dd5ac8403c41a6ea85f1349e561966c3215374aa264d88929e2cac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/Client/Update/UpdateUtil.fs:164-173 | src/Components/src/Composite/TemplateBrowser/Helper.fs:141-149 \u2014 before extracting anything, compare \u0060src/Client/Update/UpdateUtil.fs\u0060 and \u0060src/Components/src/Composite/TemplateBrowser/Helper.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Client/Update/UpdateUtil.fs:164\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/Update/UpdateUtil.fs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c24263fff350515da707324bf6b5105854b541f3f9515beceee43ec079b13b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Components/src/Composite/Widgets/JsonExport/JsonExport.fs:49-58 | src/Components/src/Composite/Widgets/JsonImport/JsonImport.fs:51-60 \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/Components/src/Composite/Widgets/JsonExport/JsonExport.fs:49\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/Widgets/JsonExport/JsonExport.fs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f00bd35a9234decc1a9f7551436efa3566dca2b0b6a6064154df6bdd2692b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Shared/ProvenanceGrouping/Session.fs:546-555 | src/Shared/ProvenanceGrouping/Session.fs:557-566 \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/Shared/ProvenanceGrouping/Session.fs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cb5c122b3f4d40d83c1474a101e3ceb9dc8c36e5a081b2a8b3d54559a28e8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Electron/src/Main/ArcVault/ArcVault.fs:788-797 | src/Electron/src/Main/ArcVault/ArcVault.fs:819-828 \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/Electron/src/Main/ArcVault/ArcVault.fs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"0540e954d20e145f4c470b810f37ddaa4d70433b9283cf1bb9227dd0e4afe09d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): src/Client/SharedComponents/JsBindings/DndKit.fs:82-88 | src/Components/src/JsBindings/DndKit.fs:116-124 \u2014 before extracting anything, compare \u0060src/Client/SharedComponents/JsBindings/DndKit.fs\u0060 and \u0060src/Components/src/JsBindings/DndKit.fs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Components/src/JsBindings/DndKit.fs:116\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":"src/Client/SharedComponents/JsBindings/DndKit.fs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25e4d30a569ac886c279ec72842cd94d341925783bc78db8c0004d9cb5e38e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Client/Pages/FilePicker/FilePickerView.fs:186-194 | src/Client/Pages/FilePicker/FilePickerView.fs:210-218 \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/Client/Pages/FilePicker/FilePickerView.fs:186\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/Client/Pages/FilePicker/FilePickerView.fs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb4f19c0d5d57a91b7fe2cd06d5ef5f2988735f3e76c0be2f152b8c4a3ac766"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Components/src/ARCtrl/Extensions/CompositeCell.fs:201-209 | src/Components/src/ARCtrl/Extensions/CompositeCell.fs:216-224 \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/Components/src/ARCtrl/Extensions/CompositeCell.fs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4856b9e6a070d31c4542c23f47f2146cc4589ba8eec7375b744e67e1804bd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Components/src/Primitive/Blankslate/Blankslate.fs:43-51 | src/Components/src/Primitive/Blankslate/Blankslate.fs:58-66 \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/Components/src/Primitive/Blankslate/Blankslate.fs:43\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":"src/Components/src/Primitive/Blankslate/Blankslate.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb4f6cfaafdc7d7c48cd4615100cc98735ccb743e7d24763e59e43d43fa0418"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Components/src/Composite/AnnotationTable/ContextMenu.fs:866-874 | src/Components/src/Composite/AnnotationTable/ContextMenu.fs:938-946 \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/Components/src/Composite/AnnotationTable/ContextMenu.fs:866\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":"src/Components/src/Composite/AnnotationTable/ContextMenu.fs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"981e5ecc55458ae69baabbcbbcf61ba83d26e3ec12a126821cdb586a638ebe5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/Components/src/Page/ValidationPackageBrowser/PackageTable.fs:64-72 | src/Components/src/Page/ValidationPackageBrowser/PackageTable.fs:75-82 \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/Components/src/Page/ValidationPackageBrowser/PackageTable.fs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"87714ff3b82ad1adea9679b12498c5128628ba4bf699c523b0e1042335b13e05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Electron/src/Main/ArcVault/ArcVaultHelper.fs:230-238 | src/Electron/src/Main/IPC/FileSystemIO.fs:196-204 \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/Electron/src/Main/ArcVault/ArcVaultHelper.fs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4564d57c1096835cd564972863e94dbeb7391e33fbd217e0993402dacde491"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/Components/src/Composite/AnnotationTable/AnnotationTable.fs:403-410 | src/Components/src/Composite/AnnotationTable/AnnotationTable.fs:417-424 | src/Components/src/Composite/AnnotationTable/AnnotationTable.fs:428-435 \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/Components/src/Composite/AnnotationTable/AnnotationTable.fs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3acb24791c110d8acb8fe81810b6c09d89ce3fbf79bf4c4950eaf60c079066"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Components/src/Primitive/Popover/Popover.fs:236-243 | src/Components/src/Primitive/Popover/Popover.fs:280-287 \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/Components/src/Primitive/Popover/Popover.fs:236\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/Components/src/Primitive/Popover/Popover.fs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e67121fa5c18aad4127fb83c0e5123141f8939abf5dd9f09ce9cab99fbbfd8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Components/src/Page/ProvenanceGrouping/EditorLayout.fs:116-123 | src/Components/src/Page/ProvenanceGrouping/GroupCard.fs:112-119 \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/Components/src/Page/ProvenanceGrouping/EditorLayout.fs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"0117652092bb1cee83972a817ec8830bfaca81173da10ded44b32b430ca6ddc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/Server/Database/Helper.fs:106-112 | src/Server/Database/Helper.fs:156-163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Server/Database/Helper.fs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e4fbb3d73906d143a0a10afb9b0fec2bbce09e97b286d797b870d1075e4879"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Electron/src/Main/Git/GitService.fs:745-752 | src/Electron/src/Main/Git/GitService.fs:815-822 \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/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad264effd373a619dc3170659060455682321494c69c5b277d86caddf4f6ed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Client/Pages/BuildingBlock/Helper.fs:37-43 | src/Components/src/Composite/Widgets/BuildingBlockWidget/BuildingBlockWidget.fs:67-73 \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/Client/Pages/BuildingBlock/Helper.fs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0be6dd1f066db2f22f5be7225ce061e04c566539d39130e8063347adb8c670a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 2): src/Client/MainComponents/EmptyTableElement.fs:23-27 | src/Client/MainComponents/EmptyTableModals.fs:34-40 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/MainComponents/EmptyTableElement.fs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a561978de05c59ed1de8b4fc944da930486e32da97d40e76902eba98aac75415"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Components/src/Primitive/BaseModal/BaseModal.fs:148-154 | src/Components/src/Primitive/ErrorModal/ErrorModal.fs:84-90 \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. 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/Components/src/Primitive/BaseModal/BaseModal.fs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c63b45c9703cad20ec0cb666c3029c276e7b142079e069df2a28b2ac85ccb5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Components/src/Composite/MarkdownText/Plugins/AddImage.fs:31-37 | src/Components/src/Composite/MarkdownText/Plugins/AddStep.fs:37-43 \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/Components/src/Composite/MarkdownText/Plugins/AddImage.fs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b7fa3588033fe64a833589f04b5ed1ccca2b1d38b0c9ab099c0125cedc19cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Components/src/Composite/Notes/Editor/Validation.fs:32-38 | src/Components/src/Composite/Notes/Editor/Validation.fs:40-46 \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/Components/src/Composite/Notes/Editor/Validation.fs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4ca178db748afc46ef311f2c5a872cad10af58bcf97ceffc5c7d6697784d55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Electron/src/Main/Git/GitService.fs:1584-1590 | src/Electron/src/Main/Git/GitService.fs:1599-1607 \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/Electron/src/Main/Git/GitService.fs:1584\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":"src/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dbf41a27613fe601cab3cf37c48b0a548dba3549fe168090efccb1b2805823"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Client/OfficeInterop/OfficeInterop.fs:151-156 | src/Client/OfficeInterop/OfficeInterop.fs:312-317 \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/Client/OfficeInterop/OfficeInterop.fs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbf659202028b3809f830aeb1c3cf2c4eac095e11ad9e49647093c6eb28e0f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Components/src/Util/ReactHooks.fs:145-153 | src/Components/src/Util/ReactHooks.fs:265-270 \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/Components/src/Util/ReactHooks.fs:145\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":"src/Components/src/Util/ReactHooks.fs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b308d229c0b9b484d37d2812b243b069dc74bd0e56b51050caa6370fb0584a6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): src/Electron/src/Renderer/Context/GitWorkflow.fs:841-845 | src/Electron/src/Renderer/Context/GitWorkflow.fs:981-986 \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/Electron/src/Renderer/Context/GitWorkflow.fs:981\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"src/Electron/src/Renderer/Context/GitWorkflow.fs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3fe3a17d67b53cf4ca0e17192a94bb2521a8ec6b3464c40480aeebdb784987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Electron/src/Main/IPC/FileSystemIO.fs:566-573 | src/Electron/src/Main/IPC/FileSystemIO.fs:615-620 \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/Electron/src/Main/IPC/FileSystemIO.fs:566\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":"src/Electron/src/Main/IPC/FileSystemIO.fs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bea29d71b52f2053a6495c7db8d5d64498cd171d6eca7464f0a30ee9fe68c49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/Electron/src/Renderer/Context/GitWorkflow.fs:823-827 | src/Electron/src/Renderer/Context/GitWorkflow.fs:831-835 | src/Electron/src/Renderer/Context/GitWorkflow.fs:839-843 \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/Electron/src/Renderer/Context/GitWorkflow.fs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"6199230e40e000f1188bba8e94d3fea3e8d3af64be58920b2fc704ff4066aba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/Electron/src/Renderer/Context/GitWorkflow.fs:840-844 | src/Electron/src/Renderer/Context/GitWorkflow.fs:857-861 | src/Electron/src/Renderer/Context/GitWorkflow.fs:980-984 \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/Electron/src/Renderer/Context/GitWorkflow.fs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccb9c006d8c545d32c8e7c85db4cede84037e30e39354d5392e9f382a108ae3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Client/SharedComponents/Metadata/Forms.fs:1058-1062 | src/Components/src/Page/Metadata/FormComponents/PersonsInput.fs:46-50 \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/Client/SharedComponents/Metadata/Forms.fs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcb91c1fa56ecb088b5d6c0b396ee4bd4f25a352ed5af5cd7a2fe9520347d5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Client/MainComponents/Widgets.fs:40-46 | src/Components/src/Composite/Widgets/Widgets.fs:34-38 \u2014 before extracting anything, compare \u0060src/Client/MainComponents/Widgets.fs\u0060 and \u0060src/Components/src/Composite/Widgets/Widgets.fs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 225 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/MainComponents/Widgets.fs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b1f356a62dde10e072fb9f7c4c5ea0cd8f9c59f1e5a232dfead76970eb1bba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Client/MainComponents/Widgets.fs:244-248 | src/Components/src/Composite/Widgets/Widgets.fs:250-254 \u2014 before extracting anything, compare \u0060src/Client/MainComponents/Widgets.fs\u0060 and \u0060src/Components/src/Composite/Widgets/Widgets.fs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 225 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Components/src/Composite/Widgets/Widgets.fs:249\u0060 calls \u0060onFocus\u0060 and \u0060src/Client/MainComponents/Widgets.fs:243\u0060 does not \u2014 after which the two agree again for 4 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/Client/MainComponents/Widgets.fs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f3e0fb44a364852301a8d5ff3fc13d08a054bc200213bb2f306190c8d0c509"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Components/src/Composite/AnnotationTable/AnnotationTable.fs:344-348 | src/Components/src/Composite/DataMapTable/DataMapContextMenu.fs:155-159 \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/Components/src/Composite/AnnotationTable/AnnotationTable.fs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"7844fa9ab0ffcac15bfbbbbcbdd9e00c8296d6c9b947daf7d80aaaa063d5bbb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Server/Database/Term.fs:509-513 | src/Server/Database/Term.fs:574-578 \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/Server/Database/Term.fs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f43e065ef8a93adf24713a43572c81ff07c9c060147647b915a1448d7c4c42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/Client/SharedComponents/Metadata/Assay.fs:78-99 | src/Client/SharedComponents/Metadata/Run.fs:83-104 \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 \u0060src/Client/SharedComponents/Metadata/Assay.fs:78\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":"src/Client/SharedComponents/Metadata/Assay.fs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6164c61396a77358296aeafa292d416abc27c44626837ebc48fe814f9689e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/Components/src/Page/Metadata/AssayMetadata.fs:62-83 | src/Components/src/Page/Metadata/RunMetadata.fs:69-90 \u2014 before extracting anything, compare \u0060src/Components/src/Page/Metadata/AssayMetadata.fs\u0060 and \u0060src/Components/src/Page/Metadata/RunMetadata.fs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Components/src/Page/Metadata/AssayMetadata.fs:62\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/Metadata/AssayMetadata.fs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa87a4733cbe823e4706222ef7a5a5873c4cc8f15749a376fd6ead06a77ee90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/Components/src/Composite/TermSearch/TermSearch.fs:861-874 | src/Components/src/Composite/TermSearch/TermSearch.fs:921-934 \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/Components/src/Composite/TermSearch/TermSearch.fs:861\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/Components/src/Composite/TermSearch/TermSearch.fs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f2a5ce552b7d1260b70d170676d4031dea0829e9c6391d7d2804949d322531"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Electron/src/Main/Git/GitService.fs:2437-2447 | src/Electron/src/Main/Git/GitService.fs:2519-2529 \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/Electron/src/Main/Git/GitService.fs:2437\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/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e20e990c0ed64fde611c7805be02a112186ff329baff910669b01cce5807269"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Components/src/Composite/AnnotationTable/Modals.fs:896-905 | src/Components/src/Composite/AnnotationTable/Modals.fs:932-941 \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/Components/src/Composite/AnnotationTable/Modals.fs:896\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/Components/src/Composite/AnnotationTable/Modals.fs:895\u0060 calls \u0060td\u0060 and \u0060src/Components/src/Composite/AnnotationTable/Modals.fs:931\u0060 does not \u2014 after which the two agree again for 4 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/Components/src/Composite/AnnotationTable/Modals.fs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f625c779691d1323144445b7ed16ad3c28835e8757d65f0fd4a789f23d4b6ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/Components/src/Composite/DataMapTable/DataMapTable.fs:82-91 | src/Components/src/Composite/DataMapTable/DataMapTable.fs:132-141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/DataMapTable/DataMapTable.fs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb9a55859f2217587020f0a3553de9e3446b9a0b017c270e9ca3d3151a21fc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Components/src/Composite/Workspace/DropOverlay.fs:277-285 | src/Components/src/Composite/Workspace/DropOverlay.fs:291-299 \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/Components/src/Composite/Workspace/DropOverlay.fs:277\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/Components/src/Composite/Workspace/DropOverlay.fs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ac5f20511e33fb913f07cd55ca5481fd2b441af58a6e59d3a4e35161f3eb91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Components/src/Composite/AnnotationTable/Modals.fs:301-308 | src/Components/src/Composite/AnnotationTable/Modals.fs:334-341 \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/Components/src/Composite/AnnotationTable/Modals.fs:301\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/Components/src/Composite/AnnotationTable/Modals.fs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"90224d93c23c58dbb4d728ce7ca00c926e3b0b97b4bef45da48024ef2378c0a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Components/src/Composite/TermSearch/TermSearch.fs:140-147 | src/Components/src/Composite/TermSearch/TermSearch.fs:152-159 \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/Components/src/Composite/TermSearch/TermSearch.fs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b033ae88a19970598ff3e81d265c9063729f7f294f0004ddf7447d68d2368ad5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Server/Database/Term.fs:351-355 | src/Server/Database/Term.fs:364-368 \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/Server/Database/Term.fs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a0b2ad2cd3d0f02263b5ee2178547d4d01a89e769d7304f00f3688e2f09d16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Client/SharedComponents/JsBindings/DndKit.fs:92-96 | src/Components/src/JsBindings/DndKit.fs:139-143 \u2014 before extracting anything, compare \u0060src/Client/SharedComponents/JsBindings/DndKit.fs\u0060 and \u0060src/Components/src/JsBindings/DndKit.fs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/SharedComponents/JsBindings/DndKit.fs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"446535ce1c5857f1005c9953fedfd6e8dfd7bda43e6cf0e6f89354da6c926457"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 .NET and JavaScript/TypeScript suite: Coverage NOT MEASURED: the .NET half could not be measured \u2014 the repository wires up no coverage collector for \u0060--collect:\u0022XPlat Code Coverage\u0022\u0060 to use; the JavaScript/TypeScript half could not be measured \u2014 the repository root runs vitest but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060@vitest/coverage-v8\u0060 (or \u0060@vitest/coverage-istanbul\u0060) as a devDependency. This repository\u0027s production source spans both ecosystems, and no partial figure is published as if it were the whole: coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D11","level":"error","message":{"text":"Test suite cannot be installed from its own lockfile: the repository root: The vitest suite in the repository root was never exercised because its dependency install refused the committed lockfile \u2014 the dependency install for the repository root refused the committed lockfile (npm error code EUSAGE), so the suite never ran. The suite is declared and committed but cannot be installed from what the repository ships, so neither this scan nor a new contributor can run it. The ask is the one the owner performs: run the install locally and commit the lockfile it writes."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"10b238b2ab6f091882f6ba22d70f4f159018916a05a0c57f435d1ae77a741b88"}},{"ruleId":"D11","level":"error","message":{"text":"Test suite cannot be installed from its own lockfile: src/Components/: The vitest suite in src/Components/ was never exercised because its dependency install refused the committed lockfile \u2014 the dependency install for src/Components/ refused the committed lockfile (npm error code EUSAGE), so the suite never ran. The suite is declared and committed but cannot be installed from what the repository ships, so neither this scan nor a new contributor can run it. The ask is the one the owner performs: run the install locally and commit the lockfile it writes."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"393b7e834b4ab51c12283193de2d70eaebe72e7ff9e55357cf0ac35063349183"}},{"ruleId":"D11","level":"warning","message":{"text":"Test reliability not measured \u2014 JavaScript/TypeScript suite install refused the lockfile: Test reliability NOT MEASURED: this repository\u0027s test suite spans .NET and JavaScript/TypeScript, and the JavaScript/TypeScript half could not be re-run \u2014 unit: measured (0 flaky); JavaScript/TypeScript (vitest via \u0060npm ci --ignore-scripts\u0060 in the repository root; vitest via \u0060npm ci --ignore-scripts\u0060 in src/Components/): not included \u2014 the dependency install for the repository root refused the committed lockfile (npm error code EUSAGE), so the suite never ran. No partial figure is published as if it were the whole: reliability is excluded from the score rather than counted as a near-zero."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"166e5a7f1e7f7840934bd0f1c14ddd658b4d7aa7c7571340b9874ca6caf351a2"}},{"ruleId":"D13","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":"5092a9209bba1d0bc07e2476db39e701685557330ab5a4219cd6d2991f55dc88"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D13","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":"6ee9df87852bf95434f271428877dbbd12a3106cc75a1d69557b812948d0bd57"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs: src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs changed 52 times in last 90 days, max cyclomatic complexity 180 in ProvenanceGrouping.Main at line 21. 4 of those changes were fix/bug commits, and the other 48 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-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.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/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4cc4430b4ba6eab53fb662feeac45294239618ebcb0a856a1c48894872c867"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Electron/src/Main/IPC/IArcVaultsApi.fs: src/Electron/src/Main/IPC/IArcVaultsApi.fs changed 33 times in last 90 days, max cyclomatic complexity 133 in ArcVaultsApi.api at line 127. 11 of those changes were fix/bug commits, and the other 22 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-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Electron/src/Main/IPC/IArcVaultsApi.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/Electron/src/Main/IPC/IArcVaultsApi.fs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cad7eb6bcad71a6e9a757353ddbac8dd440278a7655397d5f9d0eebad503b68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Page/ProvenanceGrouping/Controls.fs: src/Components/src/Page/ProvenanceGrouping/Controls.fs changed 37 times in last 90 days, max cyclomatic complexity 60 in Controls.PropertyRailItem at line 613. 2 of those changes were fix/bug commits, and the other 35 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-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Page/ProvenanceGrouping/Controls.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/Components/src/Page/ProvenanceGrouping/Controls.fs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"948ba4102de5e8aa59566e591d9d979a37bd992d77b4edfffce6fb01d4fe17a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTree.fs: src/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTree.fs changed 24 times in last 90 days, max cyclomatic complexity 65 in FileTree.FileTree at line 43. 3 of those changes were fix/bug commits, and the other 21 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-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTree.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/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTree.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76c63c0cc778f61266c9caf7827e0fe57fb63ec9d3addc0c1bd0d5d7b8c75bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Page/ProvenanceGrouping/GroupCard.fs: src/Components/src/Page/ProvenanceGrouping/GroupCard.fs changed 16 times in last 90 days, max cyclomatic complexity 50 in GroupCard.Main at line 300. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Page/ProvenanceGrouping/GroupCard.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/Components/src/Page/ProvenanceGrouping/GroupCard.fs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3847f8d1637d036052fbe57b7e3dcd4bda621669d3196db8159ea0d2b54f484"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Page/ProvenanceGrouping/ConnectorOverlay.fs: src/Components/src/Page/ProvenanceGrouping/ConnectorOverlay.fs changed 15 times in last 90 days, max cyclomatic complexity 41 in ConnectorOverlay.Main at line 49. 2 of those changes were fix/bug commits, and the other 13 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-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Page/ProvenanceGrouping/ConnectorOverlay.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/Components/src/Page/ProvenanceGrouping/ConnectorOverlay.fs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1433e5e1acd01cbd0fb26127ea233226d387b558502b04d6702b29695d82774"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Electron/src/Main/IPC/IGitApi.fs: src/Electron/src/Main/IPC/IGitApi.fs changed 7 times in last 90 days, max cyclomatic complexity 78 in IGitApi.api at line 104. 2 of those changes were fix/bug commits, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, 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-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Electron/src/Main/IPC/IGitApi.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/Electron/src/Main/IPC/IGitApi.fs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ed6b1da2d25c9302c333a8ab12cfa4a721d763c19d4819e621309ce5781393"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Electron/src/Renderer/Context/GitWorkflow.fs: src/Electron/src/Renderer/Context/GitWorkflow.fs changed 4 times in last 90 days, max cyclomatic complexity 109 in GitWorkflow.update at line 1045. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Electron/src/Renderer/Context/GitWorkflow.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/Electron/src/Renderer/Context/GitWorkflow.fs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d30738ca3c58edbbde1522193bb9a0bac3160120e939487f5fab98bb80d9df1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.fs: src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.fs changed 15 times in last 90 days, max cyclomatic complexity 29 in FolderedDraggableList.FolderedDraggableList at line 326. 1 of those changes was a fix/bug commit, and the other 14 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-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.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/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.fs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"4280a20e706bbfe27c6252088ad86cc5615266fb4225e289f4924836444aec8e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Composite/Workspace/DropOverlay.fs: src/Components/src/Composite/Workspace/DropOverlay.fs changed 9 times in last 90 days, max cyclomatic complexity 47 in DropOverlay.DropOverlay at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Composite/Workspace/DropOverlay.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/Components/src/Composite/Workspace/DropOverlay.fs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"517cee97e640c72d1e3dbefeeda747c20092215df4db6c4e2215a50bd9e28a1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Composite/TutorialOverlay/TutorialOverlay.fs: src/Components/src/Composite/TutorialOverlay/TutorialOverlay.fs changed 6 times in last 90 days, max cyclomatic complexity 63 in TutorialOverlay.Main at line 143. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Composite/TutorialOverlay/TutorialOverlay.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/Components/src/Composite/TutorialOverlay/TutorialOverlay.fs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c335ec3efb8132589b2bbb15437d8f0ed3bbb2772ee8a5e23058449a2d4c0a84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: build/Build.fs: build/Build.fs changed 8 times in last 90 days, max cyclomatic complexity 39 in Build.main at line 6. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- build/Build.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":"build/Build.fs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc5cdff1156aeb48e7434d62cf7184f9b5f8862fea3338d1a7992a5ffed2cb8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Electron/src/Main/ArcVault/ArcVaultHelper.fs: src/Electron/src/Main/ArcVault/ArcVaultHelper.fs changed 14 times in last 90 days, max cyclomatic complexity 22 in ArcVaultHelper.updateARCByFileContentDTO at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Electron/src/Main/ArcVault/ArcVaultHelper.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/Electron/src/Main/ArcVault/ArcVaultHelper.fs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28905ae0a25484c585eb4244a6a5309c1a6ea9b84465e975fd70199eb1c4f38"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Page/ArcFileEditor/ArcFileFooterTabs.fs: src/Components/src/Page/ArcFileEditor/ArcFileFooterTabs.fs changed 12 times in last 90 days, max cyclomatic complexity 25 in ArcFileFooterTabs.Main at line 298. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Page/ArcFileEditor/ArcFileFooterTabs.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/Components/src/Page/ArcFileEditor/ArcFileFooterTabs.fs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1ae120649d46e2def5210a3715fc90ed62505811ddf7b2394aaf0e8c5f485c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Shared/ARCtrl.Helper.fs: src/Shared/ARCtrl.Helper.fs changed 18 times in last 90 days, max cyclomatic complexity 15 in ArcFilesDiscriminate.tryFromString at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Shared/ARCtrl.Helper.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/Shared/ARCtrl.Helper.fs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16da3ce23776de2bbac33565739e7329b9053feaec5bc6bd43e3d9fa3dd379e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Composite/AnnotationTable/ContextMenu.fs: src/Components/src/Composite/AnnotationTable/ContextMenu.fs changed 12 times in last 90 days, max cyclomatic complexity 21 in AnnotationTableContextMenuUtil.getFittedCells at line 202. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Composite/AnnotationTable/ContextMenu.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/Components/src/Composite/AnnotationTable/ContextMenu.fs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99976e6c77fdf2d7328d5e983ae79528a157f61c5d490261dc601a52112b7e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Page/ValidationPackageBrowser/ValidationPackageBrowser.fs: src/Components/src/Page/ValidationPackageBrowser/ValidationPackageBrowser.fs changed 13 times in last 90 days, max cyclomatic complexity 15 in ValidationPackageBrowser.ValidationPackageBrowser at line 121. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Page/ValidationPackageBrowser/ValidationPackageBrowser.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/Components/src/Page/ValidationPackageBrowser/ValidationPackageBrowser.fs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29d17bb84d0e72d76f4e1fd715bfbd4bb1b7af296d2900da6b94c7b71f1b962"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Page/ValidationPackageBrowser/PackageTable.fs: src/Components/src/Page/ValidationPackageBrowser/PackageTable.fs changed 12 times in last 90 days, max cyclomatic complexity 16 in PackageTable.PackageTableHeader at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Page/ValidationPackageBrowser/PackageTable.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/Components/src/Page/ValidationPackageBrowser/PackageTable.fs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f095cd19fcfa00e68378633cf8728dcf52a595d833a0f15fb94d1c8adb6ab3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Electron/src/Main/Git/GitService.fs: src/Electron/src/Main/Git/GitService.fs changed 10 times in last 90 days, max cyclomatic complexity 18 in GitService.confirmMergeResolution at line 2632. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Electron/src/Main/Git/GitService.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/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"a321b12812331040fd4918951803b05d00755ec769abb7e1186ab69f8bc2d545"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Page/ProvenanceGrouping/EditorActions.fs: src/Components/src/Page/ProvenanceGrouping/EditorActions.fs changed 12 times in last 90 days, max cyclomatic complexity 15 in DragHandlers.applyPropertyValueToGroups at line 375. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Page/ProvenanceGrouping/EditorActions.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/Components/src/Page/ProvenanceGrouping/EditorActions.fs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d03f048b4685645b8451fe7148c14e367c7f3964da3473a8f6122e2d52cc9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Page/ValidationPackageBrowser/Helper.fs: src/Components/src/Page/ValidationPackageBrowser/Helper.fs changed 9 times in last 90 days, max cyclomatic complexity 17 in Helper.SemVer.comparePreRelease.Static at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Page/ValidationPackageBrowser/Helper.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/Components/src/Page/ValidationPackageBrowser/Helper.fs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7caf362c053bbfe66bf4906acadc62b5335612974b066111ba14717f2aed558"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs: src/Components/src/Page/DataHubBrowser/DataHubBrowser.fs changed 4 times in last 90 days, max cyclomatic complexity 34 in DataHubBrowser.ExplorePanel at line 446. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Page/DataHubBrowser/DataHubBrowser.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/Components/src/Page/DataHubBrowser/DataHubBrowser.fs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa8fd51b61d59b05223bbe2476aa9243faa882fd6e7023965c589e47ff838f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Primitive/ContextMenu/ContextMenu.fs: src/Components/src/Primitive/ContextMenu/ContextMenu.fs changed 6 times in last 90 days, max cyclomatic complexity 21 in ContextMenu.ContextMenu at line 82. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Primitive/ContextMenu/ContextMenu.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/Components/src/Primitive/ContextMenu/ContextMenu.fs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bc4ed011a72b6e305e0d08d306906cea46bd146cbb12c2bf8d4cf7ce3a567d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Electron/src/Main/Git/GitProvisioningService.fs: src/Electron/src/Main/Git/GitProvisioningService.fs changed 3 times in last 90 days, max cyclomatic complexity 41 in GitProvisioningService.cloneRepository at line 314. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Electron/src/Main/Git/GitProvisioningService.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/Electron/src/Main/Git/GitProvisioningService.fs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6381c18e7b3770a960553fa27e8691bcd22cf483ddf299c0d5bafd2019d737"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Electron/src/Main/Git/GitLfsService.fs: src/Electron/src/Main/Git/GitLfsService.fs changed 5 times in last 90 days, max cyclomatic complexity 23 in GitLfsService.planOutboundPush at line 967. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Electron/src/Main/Git/GitLfsService.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/Electron/src/Main/Git/GitLfsService.fs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"309f77ac4b433b12ed451fe944028c7c26318aab8db97961ba1da6c97a7b0dd7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Page/GitSidebar/GitSidebar.fs: src/Components/src/Page/GitSidebar/GitSidebar.fs changed 3 times in last 90 days, max cyclomatic complexity 37 in GitSidebar.Main at line 1616. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Page/GitSidebar/GitSidebar.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/Components/src/Page/GitSidebar/GitSidebar.fs"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"277c542fcef3d81cc9671c599a9b350a414751f881b37e10482588cefefd00c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Shared/PathHelpers.fs: src/Shared/PathHelpers.fs changed 5 times in last 90 days, max cyclomatic complexity 22 in ArcEntityPathRules.classifyDeleteTarget at line 290. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Shared/PathHelpers.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/Shared/PathHelpers.fs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d8d86ec97d1bd065015757e849e1ce7a7f9b62341c1e574bcc6beecdeb27e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Composite/TermSearch/TermSearch.fs: src/Components/src/Composite/TermSearch/TermSearch.fs changed 2 times in last 90 days, max cyclomatic complexity 55 in TermSearch.TermSearch at line 772. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Composite/TermSearch/TermSearch.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/Components/src/Composite/TermSearch/TermSearch.fs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8cd761ee7fa33bc97bde38e6b50960d8951db470b78725f437fc53107b7b78"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Electron/src/Renderer/Components/MainContent/Main.fs: src/Electron/src/Renderer/Components/MainContent/Main.fs changed 6 times in last 90 days, max cyclomatic complexity 17 in Main.Main at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Electron/src/Renderer/Components/MainContent/Main.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/Electron/src/Renderer/Components/MainContent/Main.fs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6f146e27fde941af72c8ec4210e00df3ea2a359daacf3ddb47e21e343d9b89"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Composite/Actionbar/Actionbar.fs: src/Components/src/Composite/Actionbar/Actionbar.fs changed 6 times in last 90 days, max cyclomatic complexity 16 in Actionbar.Button at line 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Composite/Actionbar/Actionbar.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/Components/src/Composite/Actionbar/Actionbar.fs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf863b646890d4245e124bac38deaf6d151e0e718394c6466fddfacf6a8f08fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Page/ProvenanceGrouping/ViewSupport.fs: src/Components/src/Page/ProvenanceGrouping/ViewSupport.fs changed 6 times in last 90 days, max cyclomatic complexity 16 in FlipColumn.View at line 230. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Page/ProvenanceGrouping/ViewSupport.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/Components/src/Page/ProvenanceGrouping/ViewSupport.fs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"a299709c1a34103b9107a0baca33dafe44609081f5db760f53f3040a8f9344c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/ARCtrl/Json.fs: src/Components/src/ARCtrl/Json.fs changed 3 times in last 90 days, max cyclomatic complexity 26 in Export.parseToJsonString at line 228. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/ARCtrl/Json.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/Components/src/ARCtrl/Json.fs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5ebb609df41b56164b4262a40b5a7ff610ad562ce51aa107de22d63506d9cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Composite/Table/Table.fs: src/Components/src/Composite/Table/Table.fs changed 2 times in last 90 days, max cyclomatic complexity 38 in Table.Table at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Composite/Table/Table.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/Components/src/Composite/Table/Table.fs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6a1bb920f7d0015752b9449b3502e7c30755fe4a6c1826c4623d74ece00e7e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Electron/src/Renderer/Context/FileStateContext.fs: src/Electron/src/Renderer/Context/FileStateContext.fs changed 4 times in last 90 days, max cyclomatic complexity 18 in FileStateContext.FileStateCtxProviderWithSnapshots at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Electron/src/Renderer/Context/FileStateContext.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/Electron/src/Renderer/Context/FileStateContext.fs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7e46d3be9ce296ca30a54e6fa4c06654d73a7f4b093d83bab98d8de58d9793"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Composite/AnnotationTable/AnnotationTable.fs: src/Components/src/Composite/AnnotationTable/AnnotationTable.fs changed 4 times in last 90 days, max cyclomatic complexity 17 in AnnotationTable.ModalController at line 357. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Composite/AnnotationTable/AnnotationTable.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/Components/src/Composite/AnnotationTable/AnnotationTable.fs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9a0fd9b011c09d0eaafe06a4ee413eb4390bb38f9883b5d15b7043f88512ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Primitive/ComboBox/ComboBox.fs: src/Components/src/Primitive/ComboBox/ComboBox.fs changed 3 times in last 90 days, max cyclomatic complexity 22 in ComboBox.ComboBox at line 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Primitive/ComboBox/ComboBox.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/Components/src/Primitive/ComboBox/ComboBox.fs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6679af712e61be59329dfe769056c3300d4f62113d04054541848fdbb2e5f717"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Page/FileExplorer/FileExplorer.fs: src/Components/src/Page/FileExplorer/FileExplorer.fs changed 3 times in last 90 days, max cyclomatic complexity 21 in FileExplorer.FileExplorer at line 108. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Page/FileExplorer/FileExplorer.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/Components/src/Page/FileExplorer/FileExplorer.fs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"861522d84c1b274de518c49dca1830ee5cad28ee8653793ef0be4b790a325256"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Electron/src/Main/ArcMerge/ArcMergeLibraryExtensions.fs: src/Electron/src/Main/ArcMerge/ArcMergeLibraryExtensions.fs changed 3 times in last 90 days, max cyclomatic complexity 20 in ArcMergeHelper.applyEntityEvent at line 145. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Electron/src/Main/ArcMerge/ArcMergeLibraryExtensions.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/Electron/src/Main/ArcMerge/ArcMergeLibraryExtensions.fs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"703c6a5310d695bee92faff1898fc4b3ff2c6a59ed1184399b53543d7e73c5bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/Composite/DataMapTable/DataMapTable.fs: src/Components/src/Composite/DataMapTable/DataMapTable.fs changed 3 times in last 90 days, max cyclomatic complexity 18 in DataMapTable.DataMapTable at line 252. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Composite/DataMapTable/DataMapTable.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/Components/src/Composite/DataMapTable/DataMapTable.fs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"6591398c67cd2ad4312a7d0c7eeef832c4618906d3343919107962bfa018fb29"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/Components/src/ARCtrl/Extensions/CompositeCell.fs: src/Components/src/ARCtrl/Extensions/CompositeCell.fs changed 3 times in last 90 days, max cyclomatic complexity 16 in CompositeCellExtensions.CompositeCell.fromContentValid.Static at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/ARCtrl/Extensions/CompositeCell.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/Components/src/ARCtrl/Extensions/CompositeCell.fs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"404751aee5ca1efd68a17c2957fad3d0e4071ac19777e391367f8c074ce8afb2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Electron/src/Main/ArcVault/WatcherHelpers.fs: src/Electron/src/Main/ArcVault/WatcherHelpers.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 6 (its worst body is WatcherHelpers.buildWatcherEvent at line 18), 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: \u201CFixed IPC security fix.\u201D; \u201CFix lastArcMerge Refactoring\u201D; \u201CImplemented path/event-specific watcher suppression. Fixed logic associated with closeDecisionRecoveryMs. Fixed the phase boundary.\u201D; \u201CFixed filewatch event calling\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-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Electron/src/Main/ArcVault/WatcherHelpers.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/Electron/src/Main/ArcVault/WatcherHelpers.fs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"28583b1a23f304e8ee79a5f61ea347991613c07370e806ac9a0d1ac0aa513447"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/Components/src/Util/Extensions.fs: src/Components/src/Util/Extensions.fs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is style.resolveStyle at line 13), 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: \u201CFixed DataMap term and unit paste alignment. Refactored clipboard handling with typed payloads. Centralized browser clipboard bindings. Added cross-table clipboard regression tests.\u201D; \u201Cfix \u0060dotnet run --project ./build/Build.fsproj --\u0060 calls with \u0060--\u0060 args seperator\u201D; \u201Cmore pipeline fixes\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-18..2026-09-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-18 17:01:49 \u002B02:00\u0027 --until=\u00272026-09-16 17:01:49 \u002B02:00\u0027 --full-history --no-merges -- src/Components/src/Util/Extensions.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/Components/src/Util/Extensions.fs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"59cbc644dc7368571c65534a5459d35ff3a05fc72cc3be0963ce8db7e5d333af"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 42 significant file(s) lose their only recent owner: src/Server/Api/IOntologyAPI.fs, src/Components/src/Composite/Widgets/DataAnnotator/DataAnnotator.fs, src/Components/src/Composite/Workspace/WorkspaceModel.fs, src/Components/src/Composite/Workspace/Workspace.stories.tsx, src/Components/src/Composite/Workspace/DropOverlay.fs, src/Components/src/Composite/Widgets/BuildingBlockWidget/Dropdown.fs, src/Components/src/Composite/TemplateBrowser/TemplatesDisplay.fs, src/Client/Util/MessageInterop.fs (\u002B34 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d0fa4155ae8af89f1552cdbdd2bfdea3f3a7fd5ca319e55467d4394136a3f14"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 41 significant file(s) lose their only recent owner: src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.stories.tsx, src/Components/src/Page/GitSidebar/GitSidebar.fs, src/Components/src/Page/ProvenanceGrouping/Controls.fs, src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.fs, src/Components/src/Page/ProvenanceGrouping/GroupCard.fs, src/Shared/ProvenanceGrouping/ARCtrlConverter.fs, src/Components/src/Composite/TutorialOverlay/TutorialOverlay.fs, src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.stories.tsx (\u002B33 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1eb1856eccc34b956c8bb5a9e6ef90f7ebc4448610b8f8fd64cb5e049e962d9b"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 20 significant file(s) lose their only recent owner: src/Electron/src/Main/IPC/FileSystemIO.fs, src/Shared/PathHelpers.fs, src/Components/src/Page/FileExplorer/FileExplorerItem.fs, src/Shared/ARCtrl.Helper.fs, src/Electron/src/Main/ArcMerge/ArcMergeLibraryExtensions.fs, src/Electron/src/Main/IPC/Rename.fs, src/Electron/src/Renderer/Components/LeftSidebar/FileExplorer/FileTreeContextMenu.fs, src/Components/src/ARCtrl/Extensions/CompositeCell.fs (\u002B12 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"84534fa1dc77cb29ba91e0878a46da68a8facd64c608e59f854499db15e7ad34"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (104 single-owned of 345 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 345 of the 568 production source files in this repository met that bar). They are anonymized user #4 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D27","level":"note","message":{"text":"Scattered collaborators: 96 % of calls cross a namespace and only 54 % of collaborators are co-located \u2014 group each feature\u0027s code into a vertical slice so a call\u0027s collaborators sit together."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5aad4a4530bac3928d3a065a664be89d023ecfc865f9bf79ac05754b3bffe322"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f908bf0ae27b0b5096b066ac05af720b7a0e40946407d4f30ed129f9292d7a7"},"properties":{"commitSha":"5cadaa7d15569d846d459348862de26009c354df"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2642c96e5f8cdd96a5ea4589ad452bdeb992d21942d93a8337cb3928f3962862"},"properties":{"commitSha":"e43b404a6150073e642794f19fc8127b6206dbde"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71bc6756c07a79093448a4bf95de6ff2752b5838d15e83b7f5ff06af97ac654c"},"properties":{"commitSha":"e0cd13b65b2fcf6aaac7e5673f60216ea198492b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e975aab93577109f379769a9b69e0cade70b8a09973dff051707325847eecd6d"},"properties":{"commitSha":"fb4b96935bce8e48cc8ce0df866eb58c55983d65"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"089fe949d1795f5432e4808c4d0d27c931266534aa656bb68b2355c21e514a17"},"properties":{"commitSha":"061f310e9262be7e0762f2a198b8d5c21c1113de"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"60d2a1a9e37f27ec3434965c3b15338c85ce6a56492537a25580308526a79de1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3471824c8a6cddeffdb97cd3a7e42f1a03d6d8507660f6df13d806159bb3c4c4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a91a8c7ab3db9c9bc12cacd4ec0e6fe5d1cfd04431668736deddcb62fe8c1535"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ec853a0173ba6b04a88a9c3e92c8cb73955b013fb152987cefa7e30c546fa28e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ec693bf9f8e40ac079f2e2c40732086ead308c312455b7e3581352627164e0c2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9bbe4a3692b815dc9f3dd8fb4f04d1adddeeebbe356f908d8be86859d23d2d79"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8553924ac24a7085411098281f82dbf9f1cd5d8d4b6728b39d6a70fb2ae783ac"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a60504daaac9a88b06e67d81ca23ce3de494abf4450799e940d65c6ffcd43008"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6be6c68dbb5dc333ed4f189de01e394ce32de49183a09bfd62f57ced68920b36"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b8eed3e2e8267733841f06c539c532d16fc05c8a38fc3c67fef63c38759dafe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7278a68b372244e3b08a3b5cf5a5b66205647d5600c34e2fdab7b72948a975d5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"594f270b56984cb0baf00a6f28306014b1271eaadc82bafab92ffba74d7e2369"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c05805f43c87458670f6ef9ed9a39d7e5d2a87846d8998956ae5d6e99a38eab8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3c418292fde872b05806e73a041b4277672a14597f0f03ec5e7fd50ae9b2ee6e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ba31ee60a2bab472fa73cf4ebd81f528f9ea72c8f199eeb04670f4ed5f367423"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4b6c677885e65f74c7199391d0c1b130510023572f7c8404006e1c1729ce44c4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1a463bbb70c1c0470bf3a8e378511a38ea5bd940f550fa1c595c6b0e9381c51"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3280676292023657f90aad778f5cdfbdb5535ad8f1f0354f89542439083275c9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5df404ee1b81dad355104ccaee627c1a89b98d3e4473b1573e1b4cbd2ed6f6fb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65600671460df657f8419db3d337dcde4aea69946b891129db6e154af10b1526"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"87719babdc2e8ce9955032e55da763c87d8bfce9bf5d29ec18fd358a96592fbf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f098f4f0a7efd6ea4c28241c5ffc7cfcdb991b2e0aa699010038db71f6a44c3f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32e00f70930bf95ebe74a42818a4c7c0d536ca35d871a2ed0aaadee068f519bd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f2cc893a124b6eef744cb4d586ef4913fc1acf96ad338408a993568ebdc4224"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"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":"1273e6e70590408b9dfcca1a4e6df7f70cdcd4279a1fe68e45ffdbee298a5891"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","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":"1b422d7d2acf4ec86c8855b185b5bb8a76f746739db2b625b71467e001072cde"}},{"ruleId":"D30","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":"4fb8816de73d244d42ffcc183b8a13402914115804d2f55f9528edc447fc263b"}},{"ruleId":"D30","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":"769e9d2248cb98851adbaf62aa7f78db3f94886ca662e318699216e6f9e92bbe"}},{"ruleId":"D30","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":"5a31a0b5364830f542d37385755d27dd90f97746286a80cb6c17836bc6e14179"}},{"ruleId":"D30","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":"a2e781aeeb54d3ae845ae518d9f9b4fabc9ce4afb31ec2d5eceab2c30473e850"}},{"ruleId":"D30","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":"5c489fe9320972ae460db943c3a6203601882fba7b5f7d3b2b701224581f94c4"}},{"ruleId":"D30","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":"9bfcd0ade21bb8ac2fc591a1f00c5d30c6cf227f727c74efcf2f17e409862575"}},{"ruleId":"D30","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":"b4c4a8982713127057af2ddee6b9697f8e59c3eef9b88472d693aa85d57df25e"}},{"ruleId":"D30","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":"749509e195a34dec2f08c50f3b399f879f87f398f788d6f2e2108519b5944140"}},{"ruleId":"D30","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":"2567ea2f56ae79977dadd3bf380bcb8e0d5204997d0db598b3e49e1891ff5525"}},{"ruleId":"D30","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":"aea179ab0c68cc9e97b24a42df4953f60a168b52ce1ce992dfa9d65c712f31e1"}},{"ruleId":"D30","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":"7d20b4ad5b396d5bdab0959a3f43334da25bf5f1ffffe4ef41876ffd687a0569"}},{"ruleId":"D30","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":"384a0892f51a77ce6e1097a5154e203805ee2ad75d30693634ca5b796c0008c6"}},{"ruleId":"D30","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":"dd5b5bb5ff8737ef29043af986439961876b394145dd0284a62660211f33da4a"}},{"ruleId":"D30","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":"8ce1f4fe5bf25d6c80fb6f50383850e417a6996c3982e3bace35be151039474a"}},{"ruleId":"D30","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":"8645c87b8e8cde81724180b15f178db8239ce7561d62a3e6e45f51db28c7a5d0"}},{"ruleId":"D30","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":"59e28f0fc3ceb219b9638eae73d38b2bcb54c3283507449da6396114e6cfcf26"}},{"ruleId":"D30","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":"02f809db19946ff68dac97234c12abfc27eedc356a81cfd3ee9e444a4053df19"}},{"ruleId":"D30","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":"a123c7a8538ef5659aefc6b6b9bf5ef92557f2acc40c94c7874d873c9193a516"}},{"ruleId":"D30","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":"3f76bf97b93214463fb039951f053c0c8570ee31c64ab8520f839469eb690dd9"}},{"ruleId":"D30","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":"87839f7289af0999d94a99db6eefa4a0c9cb8f6ea36e8599abd5bd35ced532c8"}},{"ruleId":"D30","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":"db8ddf53eec178b51f98dc27066328ef04284ba5b4972d567a556b0cb219ca83"}},{"ruleId":"D30","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":"3b254cab2d477d260a22ad3ad1842871561c5a076bdc39b68ee6f2560720484a"}},{"ruleId":"D30","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":"68000737525979ea24f79422ab17664a7194c74ee7c522cce0c5ff2439d92d10"}},{"ruleId":"D30","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":"98645b36f3d8a19e1462b10ae8d23a6853b810993981c4fc4065e762fff2771b"}},{"ruleId":"D30","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":"51ac1dd342003e80a05050cba506be83df108568e1c17b29699d0e5f6259d871"}},{"ruleId":"D30","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":"fbe6d1932947c2a9c83f253f60b7afd9bd5f47b0579736221d40a7082b82a4cd"}},{"ruleId":"D30","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":"861e228d9dfb31a892f27026c0d4d852dc090835a3e2cf7e0e8507f417f3addb"}},{"ruleId":"D30","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":"c93c9e9a7508d1bb1d419bfe67a538fbd81572ddc053c684d546cff31ca78570"}},{"ruleId":"D30","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":"43427bab5dea8e4a9974d0d31081f6cee7984ed96dc960bd2c33af06bc12237b"}},{"ruleId":"D30","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":"eb5055b3709072c66d00624be2b6e901d3e4f1bc2f0978ff3fe5e49d1c0155eb"}},{"ruleId":"D30","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":"3681e0b0dced2dca00be692922bda4012adb5a0234c1d22c53a13969ab5dd823"}},{"ruleId":"D31","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":"7851b648d0d60b26fd2af6eb1211a37e2cf0bef4b1aad82f807a0e0bd565b15c"}},{"ruleId":"D31","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":"2b0aec475f5ccd3e4b3f5f29e07e62f06b592898e1ed26819a200519d6b990f3"}},{"ruleId":"D31","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":"0a369e05f49a69690bac0d86a8b7f119e75075d03561e0cedc26331c2abd60d7"}},{"ruleId":"D31","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":"ca74dae5e7c0b5a23a71e6a9a9071c031c738f6ad59e84bc1abe5d701fa8cbba"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","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":"1c224ebefa6cf10c8cbe1c051e56ca0ffe5ea5a8021db6f0d0125aaec963616e"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f640b1e3721d419bfce1448b2c602a5369ca2c391328840d839191ca96988ab"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"26bdf254201e65f611e04083619555eec689a6e6d8577027da0161b1aaca0ceb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ba53256908b700f472287d7b747c89077e54e7c447f8d76238ab55fd96844972"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fc2c0a38f6389892e89c74e904a9ddb4bdbe283769ec68555162364525e9da0d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af3861ec72c432678f45bf4d8e35bcc6896b794781feeb1c78288e447d693212"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","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":"6b609d8f851c3d3039def0f9d402b47e1515f7e2b4072dd9c90e3c3c4423ffc9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: IGitApi.fs \u2194 GitApiClient.fs: \u0060src/Electron/src/Main/IPC/IGitApi.fs\u0060 and \u0060src/Electron/src/Renderer/GitApiClient.fs\u0060 change together 79% of the time (11 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder \u2014 so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u00601fb6f0fa\u0060 Allow canceling in-flight git network operations (clone, fetch, pull,\u2026; \u0060133d3e6f\u0060 add cancel button and idle timeouts instead of flat timeouts; \u0060e31ca4f8\u0060 Implement review comments \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/IPC/IGitApi.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2037c6c945cefdf33972d5079212a7b9b3c073e98671e0bf0fe888c920cb729b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: GitSidebar.stories.tsx \u2194 Types.fs: \u0060src/Components/src/Page/GitSidebar/GitSidebar.stories.tsx\u0060 and \u0060src/Components/src/Page/GitSidebar/Types.fs\u0060 change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060133d3e6f\u0060 add cancel button and idle timeouts instead of flat timeouts; \u006032a0fff7\u0060 add git command console output to busy indicator; \u00601b3fbb14\u0060 add lfs storage actions to git sidebar (at that commit the files were still \u0060src/Components/src/GitSidebar/GitSidebar.stories.tsx\u0060 and \u0060src/Components/src/GitSidebar/Types.fs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/GitSidebar/GitSidebar.stories.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4cb9d0a0974ff7d0b033fe34d6a4152e9e21847ad14aefdc7917b458d45c5e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: main.fs \u2194 preload.fs: \u0060src/Electron/src/Main/main.fs\u0060 and \u0060src/Electron/src/Preload/preload.fs\u0060 change together 64% of the time (9 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder \u2014 so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00608b51d1f8\u0060 Ducktape fix: Fix template loading in Electron startup by moving temp\u2026; \u00600c05679c\u0060 Start implementing datahubbrowser; \u0060fae4eae0\u0060 Add Auth workflow to electron app \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/main.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87233de6a713d412daecd0b1b7d5d81d89af14d30a5e3dd42e7d2840f482267b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: Api.fs \u2194 Server.fs: \u0060src/Client/Api.fs\u0060 and \u0060src/Server/Server.fs\u0060 change together 62% of the time (8 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder \u2014 so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00602e10492a\u0060 final solution for routing issue; \u0060f534afb0\u0060 Remove switch of routebuilder.config :fire:; \u00608d13a860\u0060 Rework search field :sparkles::construction: #332#338#339 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/Api.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad7f340f5b746a336f87a6f59d53dd76c20e68615ed2de9c4f70fa9d912a6f7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: IArcVaultsApi.fs \u2194 InitState.fs: \u0060src/Electron/src/Main/IPC/IArcVaultsApi.fs\u0060 and \u0060src/Electron/src/Renderer/Components/InitState.fs\u0060 change together 60% of the time (9 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder \u2014 so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006083162f41\u0060 add init git by default to arc creation; \u0060680aacec\u0060 Remove ArcScope Hook; \u0060ec14032e\u0060 Improve auth types and implement datahub view \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/IPC/IArcVaultsApi.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e30f56e93f2b56551c6d362514fb628673eb4f641d3995ec5ccc9aa72706ed"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: IArcVaultsApi.fs \u2194 preload.fs: \u0060src/Electron/src/Main/IPC/IArcVaultsApi.fs\u0060 and \u0060src/Electron/src/Preload/preload.fs\u0060 change together 57% of the time (8 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder \u2014 so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00604b5d3be3\u0060 Implement fileimport into current established lifecycle; \u0060f7d362b6\u0060 remove git repo creation from acrvault; \u00600cfb17a1\u0060 App layout: Sync save button state with \u0022unsavedChanges\u0022 flag in ArcV\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/IPC/IArcVaultsApi.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2cd4a1e40d7b4460f030cf0e55a9a1dba75d6e74e3e6b0c1018dc35301aaef"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ArcFileEditor.fs \u2194 ArcFileEditor.stories.tsx: \u0060src/Components/src/Page/ArcFileEditor/ArcFileEditor.fs\u0060 and \u0060src/Components/src/Page/ArcFileEditor/ArcFileEditor.stories.tsx\u0060 change together 57% of the time (8 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060eaacc7da\u0060 Cover With Units template import in the ArcFileEditor stories; \u0060885ff7a4\u0060 Removed datamap part; \u006041459807\u0060 Add navbar button tooltips \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Page/ArcFileEditor/ArcFileEditor.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce31f3f9f4335985f2fc6a6bf0cb52d7fbb9bd196cf3356e1c5d006d5b7b50d2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: GitService.fs \u2192 GitStateContext.fs, GitWorkflow.fs, GitApiClient.fs: \u0060src/Electron/src/Main/Git/GitService.fs\u0060 changes together with 3 other files \u2014 \u0060src/Electron/src/Renderer/Context/GitStateContext.fs\u0060, \u0060src/Electron/src/Renderer/Context/GitWorkflow.fs\u0060, \u0060src/Electron/src/Renderer/GitApiClient.fs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/src/Main/Git/GitService.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f92da2b7f87035802a8e880f721d8f03b2f5c3786241952cc9e237bd81277a2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: Actionbar.fs \u2194 ArcSelector.stories.tsx: \u0060src/Components/src/Composite/Actionbar/Actionbar.fs\u0060 and \u0060src/Components/src/Composite/ArcSelector/ArcSelector.stories.tsx\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u00605b939049\u0060 Implement review corrections Refactor some existing code Moved action\u2026; \u0060cb884c88\u0060 Remove wrong changelog entries Remove unnecessary tests Update contex\u2026 (at that commit the file was still \u0060src/Components/src/Primitive/Actionbar/Actionbar.fs\u0060); \u00608aab7775\u0060 * Move react state control outside ArcSelector * Keep Arc selector at\u2026 (at that commit the file was still \u0060src/Components/src/Primitive/Actionbar/Actionbar.fs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/Actionbar/Actionbar.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1346da0ed484a2a84547a63465041c692bbdf7e6eb69fd307add01acc3b626ee"}},{"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"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"ruleId":"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":"0752d0df7434000fcabf1048e2de30a7a1a8b982b3db9a19898c4dec199856b4"}},{"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":"d068c977b62d9a977df1bb6f53e8b00b586c3abee955f91d715f92b8e019d624"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/playground/App.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6408fcc7ff6bb4e8b9f0cd390230619cc2690638b0085c1e8128fc6a8d6e23"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/playground/App.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa21b246ce173f299f262b317cbaf2c3812c5275a655a9c626931b1cace85a4d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/playground/App.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e4ef3fb8c62605ec5eaf18981462e832e5aac52a4980f0a572f72855b05a2c"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CComboBox\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id / name \u2014 and neither does anything it renders \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/playground/App.tsx"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"495aad81df3392b20e2ad6dbd7a3d15b545a49b713843daac45aae250345126b"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0753b0b0cf0f2fe07bdca96f61fdda1184ad08863ff7cf99487fd8a30e999b05"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. This document\u0027s body is only the mount point \u003Cdiv id=\u0022elmish-app\u0022\u003E, so there is no content here to wrap \u2014 render the \u003Cmain\u003E from the component mounted into it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Client/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e391ed1f5ad7255c7a80b2ab4e665493f57867ad4c70ed8a31bdf8c24c5bddc"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. This document\u0027s body is only the mount point \u003Cdiv id=\u0022app\u0022\u003E, so there is no content here to wrap \u2014 render the \u003Cmain\u003E from the component mounted into it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ed5fb775ee3802c2a4809a3df146d78d48c59f1bd12077ae74d6d44729eda2"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"04249ab1a22a8940d1bc18ab634eba74d83787bc1a4fb7f3e77b47a70d2d9863"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. This document\u0027s body is only the mount point \u003Cdiv id=\u0022root\u0022\u003E, so there is no content here to wrap \u2014 render the \u003Cmain\u003E from the component mounted into it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Electron/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b076fa9a7a8371ba038e325dbc1a3cbb1e3320a60f592ddab374b26f3bd98c60"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Server/public/test.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc772b8012e61860964a4ceb1a416816d68bc20dd4f40d83abc78fca99fc2943"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Server/public/test.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ac8c8adbaa5c2f2412c2f00a7bbd704dc7417f9e44bd233d955155be69b0f5"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. This document\u0027s body is only the mount point \u003Cdiv id=\u0022eddf67bb498\u0022\u003E, so there is no content here to wrap \u2014 render the \u003Cmain\u003E from the component mounted into it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Server/public/test.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cd96405de6247245fcc2e682510281626cca80f7db4ee48529f3a5ae4a0069"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no a11y linter (eslint-plugin-jsx-a11y) and no axe/pa11y/Lighthouse in tests or CI. Start with the linter to catch issues at author time. What was searched, so you can tell an absence from a miss: the 6 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"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 11061 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P4","level":"note","message":{"text":"No rollback/health safety: Deployment is orchestrated by compose, but no service declares a \u0060healthcheck:\u0060 and nothing pins a previous image to fall back to \u2014 the runtime can tell that the container is up, not that it is serving, so a bad release is harder to detect and reverse."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"db6bab8a28a2145f47e5a4e6683cda39d2ba0296c723238e8057da979ae1c706"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6 locations): src/Components/playground/App.tsx:86 \u00B7 src/Components/playground/App.tsx:102 \u00B7 src/Components/playground/App.tsx:116 \u00B7 src/Components/playground/App.tsx:137 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/playground/App.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fd8245d5e3c99419f8861236a1f5f2cf0866cd8133843a54c01134b5dcac1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5 locations): src/Components/playground/App.tsx:108 \u00B7 src/Components/playground/App.tsx:122 \u00B7 src/Components/playground/App.tsx:143 \u00B7 src/Components/playground/App.tsx:180 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/playground/App.tsx"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bd757adc06d7b10636a9d1bb59db1e3627cff402e9a1be105f907b733cab28"}},{"ruleId":"R3","level":"warning","message":{"text":"Large Files: 6 file(s) over 400 lines (counted as significant lines \u2014 blank lines excluded \u2014 over production source only, tests excluded), largest first: src/Components/src/Page/ProvenanceGrouping/ProvenanceGrouping.stories.tsx (2448), src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.stories.tsx (798), src/Components/src/Page/GitSidebar/GitSidebar.stories.tsx (782), src/Components/src/Page/FileExplorer/FileExplorer.stories.tsx (683), src/Components/src/Composite/AnnotationTable/AnnotationTable.stories.tsx (637), src/Components/src/Page/GitComparison/GitMergeConflictViewer.stories.tsx (575)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cecee31b569df4f07e06db732f1ca037af27b5afef9023da51f9673d931a142f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/playground/App.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68477dea246e41103fdeda25d6be63172b696a7a667f4ee6a1351f61ca5983a2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7fc90e34c452988aadef44fb85854520d1b18999642e9ddb258cf212fdbbd3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/playground/main.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4073eca1e05c635895c5a2f5255585218c3d4a574de7ddbd9d280703edb08344"}},{"ruleId":"R6","level":"warning","message":{"text":"No lint script: test \u2713 \u00B7 lint \u2717 \u00B7 typecheck \u2713 \u2014 read from this repository\u0027s package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: \u0060test\u0060 for the suite, \u0060lint\u0060 or \u0060prettier\u0060 for linting, \u0060typecheck\u0060/\u0060type-check\u0060/\u0060tsc\u0060 for type checking. \u2717 therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline \u2014 a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A \u2713 means the wiring is DECLARED \u2014 a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bc8e67e81453cf5399dd04786d18b232180426b135169175fee670bdd83ccb03"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@fable-org/fable-library-js\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7d04fbecd9dcebf6e112e16d5c37611f42468e13ff23dc555ca38a0c094ff7b2"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@iconify-json/fluent\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c540249e0401ac33aa7f31bfbfc0380fe2e1afda13d94640d3b8de90b5605c8"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@iconify/tailwind4\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"38dbc5b2cc84229e652612cf3a5484ab771bf21785971fd5343477adec6f1711"}},{"ruleId":"R8","level":"note","message":{"text":"Test-only dependency \u0027@dnd-kit/core\u0027 in production deps: Only test files import it \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Components/src/Composite/FolderedDraggableList/FolderedDraggableList.stories.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee026a28ce418de8c56de7cdcb2e5174931760d423bc6d56233fafb23275794"}},{"ruleId":"S1","level":"warning","message":{"text":"Third-party script without Subresource Integrity: \u0060https://cdnjs.cloudflare.com/ajax/libs/cytoscape/3.18.0/cytoscape.min.js\u0060 is executed by this page with no Subresource Integrity. Whoever can answer that request \u2014 the CDN, anyone who compromises it, anyone on the network path \u2014 runs arbitrary script in this page\u0027s origin, with its session."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Server/public/test.html"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad048ef2de61837821a441d6d9605f4b57d9ee3dbb2e62d7d388034a7330b859"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-345","guid":"d80d4b65-bbbe-b65d-958e-7ac466af18f9","name":"CWE-345","shortDescription":{"text":"CWE-345"},"helpUri":"https://cwe.mitre.org/data/definitions/345.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"CWE-552","shortDescription":{"text":"CWE-552"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":81,"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."]}]}