{"$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":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"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":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"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":"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"]}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"]}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"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":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"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":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"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":"Node.onKeyDown (cyclomatic 111): Node.onKeyDown has cyclomatic complexity 111 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/js/Node.js holds 10 of the 30 methods over the threshold \u2014 including the worst \u2014 and 213 of the 488 points over it (44%), 2.3\u00D7 the next-largest file (src/js/assets/selectr/selectr.js at 91). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":2756}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ddb8c88d7cd68aeba20c8498656ecba9b5d92d734437b1767d170988dd3db0"}},{"ruleId":"D1","level":"warning","message":{"text":"selectr.Selectr.bindEvents (cyclomatic 65): selectr.Selectr.bindEvents has cyclomatic complexity 65 (threshold 15). Most of this is not in the body itself: 12 of the 65 points are its own statements and the rest belongs to 16 function literals inside it that branch (lines 1243, 1329, 1404, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/assets/selectr/selectr.js"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c755bff2b4132d0cae81682153e5dba50ec5494f282977049cb8a68e238bb6"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.onEvent (cyclomatic 61): Node.onEvent has cyclomatic complexity 61 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/js/Node.js holds 10 of the 30 methods over the threshold \u2014 including the worst \u2014 and 213 of the 488 points over it (44%), 2.3\u00D7 the next-largest file (src/js/assets/selectr/selectr.js at 91). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":2518}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7eecda822c523105d77fa9b05cf845aeeb16b6a608ed25802a22452de4fb6d"}},{"ruleId":"D1","level":"warning","message":{"text":"autocomplete.autocomplete (cyclomatic 57): autocomplete.autocomplete has cyclomatic complexity 57 (threshold 15). Most of this is not in the body itself: 9 of the 57 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 402, 139, 348, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/autocomplete.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3747483305871b46f4db159e70faf2270a77f061ac360f9cdcdcd3188de330f1"}},{"ruleId":"D1","level":"warning","message":{"text":"onDrag (cyclomatic 52): onDrag has cyclomatic complexity 52 (threshold 15). Of this number, 51 points are the body\u0027s own statements and 1 belongs to 3 function literals inside it that branch. 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/js/Node.js"},"region":{"startLine":4222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f532e39c8a3eb478cf8beb75f2c33c4a39ac96f341b828ddc05aea30b6b1afc4"}},{"ruleId":"D1","level":"warning","message":{"text":"Node._updateDomValue (cyclomatic 39): Node._updateDomValue has cyclomatic complexity 39 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/js/Node.js holds 10 of the 30 methods over the threshold \u2014 including the worst \u2014 and 213 of the 488 points over it (44%), 2.3\u00D7 the next-largest file (src/js/assets/selectr/selectr.js at 91). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"214ab91bcbb50542e58747e7aa679e14b831b959da44ec28d151323a3ff765d7"}},{"ruleId":"D1","level":"warning","message":{"text":"textmode.textmode.create (cyclomatic 38): textmode.textmode.create has cyclomatic complexity 38 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 7 belong to 7 function literals inside it that branch. 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/js/textmode.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3f38b718608f480607e1f274a90c204783dd63955e0c25216d9ea86cec65d6"}},{"ruleId":"D1","level":"warning","message":{"text":"treemode.treemode._onEvent (cyclomatic 32): treemode.treemode._onEvent has cyclomatic complexity 32 (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/js/treemode.js"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"572d8125d4325dd3770efd6c7b4f47000776a3a2b7cbaeed882a0ed963198726"}},{"ruleId":"D1","level":"warning","message":{"text":"selectr.build (cyclomatic 31): selectr.build has cyclomatic complexity 31 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. 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/js/assets/selectr/selectr.js"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56604af1cc41eb99656d669b8a44a6a055b7d0479a0f239a0fb4c3b32514ba7"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.updateDom (cyclomatic 30): Node.updateDom has cyclomatic complexity 30 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/js/Node.js holds 10 of the 30 methods over the threshold \u2014 including the worst \u2014 and 213 of the 488 points over it (44%), 2.3\u00D7 the next-largest file (src/js/assets/selectr/selectr.js at 91). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":2226}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef5d3a621b764e3d993d66a7b1f3f6ee3f713d5641824f13cc801fb4aa6e827"}},{"ruleId":"D1","level":"warning","message":{"text":"selectr.navigate (cyclomatic 29): selectr.navigate 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/js/assets/selectr/selectr.js"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a76041424eebe1b670aee0e784bfa70242e167bb8aaa0c7124f7652a70c0a26"}},{"ruleId":"D1","level":"warning","message":{"text":"treemode.treemode._onKeyDown (cyclomatic 27): treemode.treemode._onKeyDown has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/treemode.js"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e8c3d51848bd6927619933c7cfa837da3ee2e8b3de127d4b111919985e51e9"}},{"ruleId":"D1","level":"warning","message":{"text":"selectr.Selectr.setSelected (cyclomatic 26): selectr.Selectr.setSelected has cyclomatic complexity 26 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 7 belong to 3 function literals inside it that branch. 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/js/assets/selectr/selectr.js"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41e46c6334b9e69cafd20b67094c32047475146694ad6f8a722864f86639186"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaTextCompleter.getCompletions (cyclomatic 26): SchemaTextCompleter.getCompletions has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 3 of the 26 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 173, 172, 174, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/SchemaTextCompleter.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bc3279951be2151ca3571175e62d6fc380c2444ec9175bb20e3b7b06f76b1a"}},{"ruleId":"D1","level":"warning","message":{"text":"ContextMenu._onKeyDown (cyclomatic 25): ContextMenu._onKeyDown has cyclomatic complexity 25 (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/js/ContextMenu.js"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"362497b23d48c360345640db68c0709f3f426f08c1fc0650e20cfcbe0ec52ddc"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.focus (cyclomatic 25): Node.focus has cyclomatic complexity 25 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/js/Node.js holds 10 of the 30 methods over the threshold \u2014 including the worst \u2014 and 213 of the 488 points over it (44%), 2.3\u00D7 the next-largest file (src/js/assets/selectr/selectr.js at 91). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc4709a855e01e0fb02cf7d01eae55697fa89499165c6e529d1390c67f68f9f"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.Node._findOneSchema (cyclomatic 24): Node.Node._findOneSchema 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/js/Node.js holds 10 of the 30 methods over the threshold \u2014 including the worst \u2014 and 213 of the 488 points over it (44%), 2.3\u00D7 the next-largest file (src/js/assets/selectr/selectr.js at 91). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":4497}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e753f7c2db65ca749e05dbabf1edf7ce50c990d20be1cd85e9184b30c4f062"}},{"ruleId":"D1","level":"warning","message":{"text":"previewmode.previewmode.create (cyclomatic 24): previewmode.previewmode.create has cyclomatic complexity 24 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 8 belong to 8 function literals inside it that branch. 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/js/previewmode.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d5b44ed4c5808826dd18723241b0fbe1f021c1d40efe61f601e9eb6292a5a4"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.setValue (cyclomatic 23): Node.setValue has cyclomatic complexity 23 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/js/Node.js holds 10 of the 30 methods over the threshold \u2014 including the worst \u2014 and 213 of the 488 points over it (44%), 2.3\u00D7 the next-largest file (src/js/assets/selectr/selectr.js at 91). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d2e9a133b9012022fa1e9c3286d65a5c7f3e629a4b7dca86dca6b6be9b0d2a"}},{"ruleId":"D1","level":"warning","message":{"text":"appendNodeFactory (cyclomatic 20): appendNodeFactory has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 14 function items inside it that branch (getPath::getIndex::updateDom, getPath::getIndex::onEvent, getDom, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/appendNodeFactory.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8df5cd2e435c5c146ced4841b1fd026bb648f9640225e87a94b707ef5db3da0"}},{"ruleId":"D1","level":"warning","message":{"text":"ErrorTable.setErrors (cyclomatic 19): ErrorTable.setErrors has cyclomatic complexity 19 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 9 belong to 2 function literals inside it that branch. 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/js/ErrorTable.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5985efaede565c667f588a962df7adddd92c47f8858cb2132a65f7a67c4b813"}},{"ruleId":"D1","level":"warning","message":{"text":"autocomplete::keyDownHandler (cyclomatic 19): autocomplete::keyDownHandler 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/js/autocomplete.js"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e3c9cc27e3ff252279ed6f442931fde86aa9de1d9476e02dcc1e3e5e87596b"}},{"ruleId":"D1","level":"warning","message":{"text":"showTransformModal.showTransformModal (cyclomatic 18): showTransformModal.showTransformModal has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 123, 186). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/showTransformModal.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"155aeb83f0fea8911fbd3b08999b6d6cb0fc297a3d630162e9a63ca4ab8855cc"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.changeType (cyclomatic 18): Node.changeType has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/js/Node.js holds 10 of the 30 methods over the threshold \u2014 including the worst \u2014 and 213 of the 488 points over it (44%), 2.3\u00D7 the next-largest file (src/js/assets/selectr/selectr.js at 91). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3dcf4fdc629dbb5e4830add65f001a8d6fd21b885a70cd882a1af3a8c2fad75"}},{"ruleId":"D1","level":"warning","message":{"text":"treemode.treemode._onChange (cyclomatic 17): treemode.treemode._onChange 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/js/treemode.js"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83f41724ff0fa83c667eee63aa09da70be251c0f41f5ec20b6b28253ae2a30b"}},{"ruleId":"D1","level":"warning","message":{"text":"treemode.treemode._createFrame (cyclomatic 17): treemode.treemode._createFrame has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. 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/js/treemode.js"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc3123fa02dedad1881cf641dbd6162331e6d405390935a634d338fa5a2a2fa"}},{"ruleId":"D1","level":"warning","message":{"text":"JSONEditor.JSONEditor (cyclomatic 17): JSONEditor.JSONEditor has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/JSONEditor.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"47136257a63fc6600d3dfac871ab6d9cdc97b87fc4906fbd587fcf8010f1ba70"}},{"ruleId":"D1","level":"warning","message":{"text":"util.parsePath (cyclomatic 16): util.parsePath 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/js/util.js"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"32772d6eb717bfe7dbe9c98168584764409942a2a89d46924e7f471ebd4d4d9c"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.setInternalValue (cyclomatic 16): Node.setInternalValue 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/js/Node.js holds 10 of the 30 methods over the threshold \u2014 including the worst \u2014 and 213 of the 488 points over it (44%), 2.3\u00D7 the next-largest file (src/js/assets/selectr/selectr.js at 91). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d263689aac0a2654bb6c87aa9d94feb1fd847bc89940edb3744fb1b8afad8ea"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.showContextMenu (cyclomatic 16): Node.showContextMenu 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/js/Node.js holds 10 of the 30 methods over the threshold \u2014 including the worst \u2014 and 213 of the 488 points over it (44%), 2.3\u00D7 the next-largest file (src/js/assets/selectr/selectr.js at 91). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":3731}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf292d3fadbf12a64e18e4fe2b6503b2bfea3dc780a22307fef444d759a9fb5"}},{"ruleId":"D2","level":"warning","message":{"text":"onKeyDown (cognitive 164): onKeyDown has cognitive complexity 164 (threshold 15). Drivers by points: if/else 56 (113 pts), boolean chains 42, ternaries 3 (9 pts) (nesting depth added 63). 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/js/Node.js"},"region":{"startLine":2756}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f9dd53f77c751446966e4d79e6714796768180570e412121d6313d6d06cefc"}},{"ruleId":"D2","level":"warning","message":{"text":"onDrag (cognitive 116): onDrag has cognitive complexity 116 (threshold 15). Drivers by points: if/else 22 (61 pts), ternaries 7 (23 pts), boolean chains 17, loops 5 (15 pts) (nesting depth added 65). Of this number, 115 points are the body\u0027s own statements and 1 belongs to 3 function literals inside it that branch. 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/js/Node.js"},"region":{"startLine":4222}}}],"partialFingerprints":{"codehealthFindingId/v1":"96618ecb4a0aea81042556a5f41e81fa4c0a0a43a1d06203197a8d95d55469d7"}},{"ruleId":"D2","level":"warning","message":{"text":"selectr.Selectr.bindEvents (cognitive 112): selectr.Selectr.bindEvents has cognitive complexity 112 (threshold 15). Drivers by points: if/else 45 (91 pts), boolean chains 17, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 48). Most of this is not in the body itself: 12 of the 112 points are its own statements and the rest belongs to 16 function literals inside it that branch (lines 1243, 1329, 1404, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/assets/selectr/selectr.js"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0752ce02b72cfcab78caa02cbb8adef89a061a40b3d3a762b6ed6f11135b4dcc"}},{"ruleId":"D2","level":"warning","message":{"text":"_updateDomValue (cognitive 85): _updateDomValue has cognitive complexity 85 (threshold 15). Drivers by points: if/else 30 (61 pts), boolean chains 12, ternaries 3 (8 pts), loops 1 (4 pts) (nesting depth added 39). 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/js/Node.js"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ca8257946b8ad591dd5a89dbdb8eb30f57ec7e216a1889670439ec0565a42c"}},{"ruleId":"D2","level":"warning","message":{"text":"autocomplete.autocomplete (cognitive 72): autocomplete.autocomplete has cognitive complexity 72 (threshold 15). Drivers by points: if/else 39 (56 pts), boolean chains 12, ternaries 3, loops 1 (nesting depth added 17). Most of this is not in the body itself: 8 of the 72 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 402, 348, 139, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/autocomplete.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe94ff549de520de582ee0cc9aa027421e170719bcaf8f3343feebc692090dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.onEvent (cognitive 65): Node.onEvent has cognitive complexity 65 (threshold 15). Drivers by points: if/else 25 (44 pts), boolean chains 15, match/switch 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 22). 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/js/Node.js"},"region":{"startLine":2518}}}],"partialFingerprints":{"codehealthFindingId/v1":"a449ff6d3e2b0d5c8ea05c4aaada1ebe4cd56b8542b0e76615be9f83b1113e23"}},{"ruleId":"D2","level":"warning","message":{"text":"create (cognitive 52): create has cognitive complexity 52 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 10, error handling 4 (9 pts), ternaries 6 (7 pts) (nesting depth added 13). Of this number, 38 points are the body\u0027s own statements and 14 belong to 15 function items inside it that branch. 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/js/textmode.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"969f4c25914c27d5d0f0627adf40e5a58b9285a2bcad336f3fe4f769410cc83c"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.setValue (cognitive 50): Node.setValue has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (38 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 24). 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/js/Node.js"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0390d96219e9534df90a91f04239e4c84069d86acab667dd9c47609ab16436e"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaTextCompleter.getCompletions (cognitive 50): SchemaTextCompleter.getCompletions has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (40 pts), boolean chains 6, loops 1 (3 pts), error handling 1 (nesting depth added 25). Most of this is not in the body itself: 2 of the 50 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 173, 172, 174, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/SchemaTextCompleter.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a21e81658f6754b361c8c3cfe3083882ede8f48b29c29a85a20136f1f913e07"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.updateDom (cognitive 49): Node.updateDom has cognitive complexity 49 (threshold 15). Drivers by points: if/else 26 (38 pts), boolean chains 8, ternaries 1 (3 pts) (nesting depth added 14). 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/js/Node.js"},"region":{"startLine":2226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ad08fddd0d279ac1d05e527b64e8c2fdcc4bd30b7805ec009320c19ba5ec1c"}},{"ruleId":"D2","level":"warning","message":{"text":"_findOneSchema (cognitive 45): _findOneSchema has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 7, loops 2 (6 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/js/Node.js"},"region":{"startLine":4497}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a308b95e6721ca1080b8bad09df10db3b3adbdf49a288015b06dcf4c203e80c"}},{"ruleId":"D2","level":"warning","message":{"text":"selectr.build (cognitive 44): selectr.build has cognitive complexity 44 (threshold 15). Drivers by points: if/else 28 (35 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 9). Of this number, 36 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. 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/js/assets/selectr/selectr.js"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad5638f279dc56f5255c0ec0100c216261d3c06a29a0b492d221d5ef1ea5c41"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextMenu._onKeyDown (cognitive 42): ContextMenu._onKeyDown has cognitive complexity 42 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 3 (nesting depth added 17). 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/js/ContextMenu.js"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde236da58b9706688c2defa87d4a71a7c8abb7dd583d523c0c9bf69682ef14e"}},{"ruleId":"D2","level":"warning","message":{"text":"selectr.navigate (cognitive 41): selectr.navigate has cognitive complexity 41 (threshold 15). Drivers by points: if/else 20 (32 pts), boolean chains 7, loops 1, match/switch 1 (nesting depth added 12). 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/js/assets/selectr/selectr.js"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"757a410fbc3f36c443951a9e5a4cd33dc4173dcda7084ac7f7247c3e35cb5e91"}},{"ruleId":"D2","level":"warning","message":{"text":"_onEvent (cognitive 39): _onEvent has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 12 (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/js/treemode.js"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"9209e37f7278cba1e4fc6dbc180fb8d8e8a9fa6d1dbc5aa99c71dde58f54c208"}},{"ruleId":"D2","level":"warning","message":{"text":"create (cognitive 38): create has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (21 pts), error handling 4 (10 pts), boolean chains 5, ternaries 2 (nesting depth added 15). Of this number, 19 points are the body\u0027s own statements and 19 belong to 16 function items inside it that branch. 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/js/previewmode.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d9be56af4898a17737cc147a0f33b2645ef5fe85f816fbf6284abb5faf361c"}},{"ruleId":"D2","level":"warning","message":{"text":"setErrors (cognitive 36): setErrors has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (22 pts), ternaries 5 (11 pts), boolean chains 3 (nesting depth added 12). Most of this is not in the body itself: 15 of the 36 points are its own statements and the rest belongs to 6 function items inside it that branch ((anonymous), onscroll, (anonymous)::(anonymous), \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/ErrorTable.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c3a5f829acd32e70d469ce8f84781cab4ea188ff1f0b007e77a19db7698809"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.setInternalValue (cognitive 34): Node.setInternalValue has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2b8e5dba94840fd576cb3cdfefe632a25a45dd8563d75285e8b27946393baf"}},{"ruleId":"D2","level":"warning","message":{"text":"selectr.Selectr.setSelected (cognitive 33): selectr.Selectr.setSelected has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 8 (nesting depth added 11). Of this number, 20 points are the body\u0027s own statements and 13 belong to 3 function literals inside it that branch. 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/js/assets/selectr/selectr.js"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87e7a3571bc49722bdbf293fd912664cbe1f865e3986a35dee6bc763d76fe03"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.focus (cognitive 33): Node.focus has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 7, match/switch 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/js/Node.js"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae66dfc6f32b032ebc2dee4f1fdb8c4dcf82dd2505a0d3e3d00b64947e6ca1cb"}},{"ruleId":"D2","level":"warning","message":{"text":"autocomplete::keyDownHandler (cognitive 33): autocomplete::keyDownHandler has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (32 pts), boolean chains 1 (nesting depth added 14). 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/js/autocomplete.js"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"223e15684b41dd4993efb748ae368800612d2ffcc0cdd9644f2475fdd19145ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.changeType (cognitive 32): Node.changeType has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 6 (nesting depth added 12). Of this number, 29 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1c1f875230af497bba155076ca7ca8766d6ec1697e49433acd1f117db1bfe7"}},{"ruleId":"D2","level":"warning","message":{"text":"parsePath (cognitive 31): parsePath has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 1 (4 pts), boolean chains 3, loops 3 (nesting depth added 14). Of this number, 25 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. 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/js/util.js"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7485f0eef471185add8f3789c8f7d171af8728f3ca255787c8bfedf0d138a5"}},{"ruleId":"D2","level":"warning","message":{"text":"getCompletions::(anonymous)::(anonymous)::matchPointersToPath (cognitive 31): getCompletions::(anonymous)::(anonymous)::matchPointersToPath has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (28 pts), loops 1 (3 pts) (nesting depth added 22). 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/js/SchemaTextCompleter.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af034fad6a1ea32dac3bbb45ba0ce6bceac65e5e981422a04a75c3f41569cae"}},{"ruleId":"D2","level":"warning","message":{"text":"util.getInnerText (cognitive 28): util.getInnerText has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 1 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 14). 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/js/util.js"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e609f6a835edf88ec0e6e1919878ff47c742d0de2d1bf1fc2fb01a86266fa82"}},{"ruleId":"D2","level":"warning","message":{"text":"treemode.treemode._onKeyDown (cognitive 28): treemode.treemode._onKeyDown has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 9 (nesting depth added 6). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/treemode.js"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f90fbe5b5d4d05a3455c11bb9e2508ea08e6962e3f9182907aa66bb97c91dea"}},{"ruleId":"D2","level":"warning","message":{"text":"_getNodeInstancesByRange (cognitive 28): _getNodeInstancesByRange has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (8 pts), boolean chains 4 (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/js/treemode.js"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"42131cd328ec98404093f1083d8d7f6823a171b56fd77afc4bc2a741925c50ec"}},{"ruleId":"D2","level":"warning","message":{"text":"selectr.Selectr.search (cognitive 27): selectr.Selectr.search has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (24 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 13). Of this number, 16 points are the body\u0027s own statements and 11 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/assets/selectr/selectr.js"},"region":{"startLine":1983}}}],"partialFingerprints":{"codehealthFindingId/v1":"97de4d4ef24f0a05350def32469345651586155a9d68883c5abc46c85bc17e02"}},{"ruleId":"D2","level":"warning","message":{"text":"selectr.Selectr.add (cognitive 26): selectr.Selectr.add has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 3 (nesting depth added 14). Of this number, 22 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. 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/js/assets/selectr/selectr.js"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ccced88d4a92aeed40559b145e87b96fc578b07c3eefb3b27206a27e517f76"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.deepEqual (cognitive 25): Node.deepEqual has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (4 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/js/Node.js"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fc8231091e593e912737114f3f1552c9c2325c7320f9bf7de1bfa005d9fe79"}},{"ruleId":"D2","level":"warning","message":{"text":"treemode.treemode._onChange (cognitive 25): treemode.treemode._onChange has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (10 pts), error handling 4 (8 pts), ternaries 2 (5 pts), boolean chains 2 (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/js/treemode.js"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ca6b78ef20f3973afb8e8741ac8724b796e301c7a12744f9b3a12e4a1ae672"}},{"ruleId":"D2","level":"warning","message":{"text":"_createFrame (cognitive 25): _createFrame has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, error handling 1 (3 pts) (nesting depth added 9). Of this number, 16 points are the body\u0027s own statements and 9 belong to 10 function items inside it that branch. 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/js/treemode.js"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b0220818ca601b6b610d47cdae36d84615965e7a76980bbe6d760b7979c7a6"}},{"ruleId":"D2","level":"warning","message":{"text":"showContextMenu (cognitive 25): showContextMenu has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 4 (8 pts), boolean chains 1 (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/js/Node.js"},"region":{"startLine":3731}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f142174a85afa678128168a2358553642bf28186ceb2170796007c9e928e75"}},{"ruleId":"D2","level":"warning","message":{"text":"JSONEditor.JSONEditor (cognitive 24): JSONEditor.JSONEditor has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 4 (nesting depth added 9). Of this number, 21 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/JSONEditor.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6aba1898ba16e2e2866a0dd7d22210ba586f4bbcae3e66d4128b81d1f47919"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchBox._onSearch (cognitive 23): SearchBox._onSearch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (3 pts), ternaries 2 (3 pts), boolean chains 1 (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/js/SearchBox.js"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1175af49a3632002e1e85ad0045108140918810a33d99836bc67c32d0525df"}},{"ruleId":"D2","level":"warning","message":{"text":"_showAutoComplete (cognitive 23): _showAutoComplete has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (18 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 7). Most of this is not in the body itself: 3 of the 23 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1562, 1570, 1579). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/treemode.js"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b379881d93044d7baff0fc8a5ab2cb6e8f35a0dd0d7a038e03c44c058873ad"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 23): constructor has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 4 (6 pts) (nesting depth added 10). Most of this is not in the body itself: 2 of the 23 points are its own statements and the rest belongs to 5 function items inside it that branch (createMenuItems::(anonymous), (anonymous), createMenuItems, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/ContextMenu.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dceefec8c5ce6a257ec746ea5d83c673af3937e3b678e7a1a93bd996fc2c15"}},{"ruleId":"D2","level":"warning","message":{"text":"Node._getDomField (cognitive 22): Node._getDomField has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2, error handling 1 (2 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/js/Node.js"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ebfadc79cfce29c25ca908548517f866f76c08f7ed070b0f06d8999c9cc20f"}},{"ruleId":"D2","level":"warning","message":{"text":"JSONEditor.JSONEditor.setSchema (cognitive 22): JSONEditor.JSONEditor.setSchema has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (4 pts), error handling 1 (2 pts) (nesting depth added 12). 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/js/JSONEditor.js"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7adf3329aa7bd6251a80936135fa24388856b9cacf01c5e2d72227f984d3243"}},{"ruleId":"D2","level":"warning","message":{"text":"updateError (cognitive 22): updateError has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 8). Of this number, 16 points are the body\u0027s own statements and 6 belong to 9 function items inside it that branch. 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/js/Node.js"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ad86f382af86bbfc755a394ea159842aa3301bc18e3acded180b2fa347ca6e"}},{"ruleId":"D2","level":"warning","message":{"text":"showTransformModal.showTransformModal (cognitive 21): showTransformModal.showTransformModal has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, ternaries 2 (3 pts), error handling 2, loops 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 0 of the 21 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 123, 186). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/showTransformModal.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"df45e8a3514480124d351e3f6b47a785ab1b5a0a246ba6651aa1772618a00650"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.insertBefore (cognitive 21): Node.insertBefore has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 1 (3 pts), boolean chains 2 (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/js/Node.js"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b51398209353eba5b3f53103e47e683a467107b3fd02596c4d969fbc7f00a7"}},{"ruleId":"D2","level":"warning","message":{"text":"_validateCustom (cognitive 21): _validateCustom has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (5 pts), error handling 2 (4 pts), boolean chains 2 (nesting depth added 10). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 717, 703, 706, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/treemode.js"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac46f22a52b31e05b22ec49a292a5d7da723e8e5eeff5f37ed7474250bb799b"}},{"ruleId":"D2","level":"warning","message":{"text":"stringifyObject (cognitive 21): stringifyObject has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 5 (10 pts), loops 1 (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/js/jsonUtils.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82207ff0a7e26421a6d09ddc918065f77c10f0274399b2b9f47a554f7851480"}},{"ruleId":"D2","level":"warning","message":{"text":"FocusTracker._onEvent (cognitive 20): FocusTracker._onEvent has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2 (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/js/FocusTracker.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd3b8cbc3c7cd5b9394ae7fa9f925b8a2475dbc3cb9e1bf76067bb33856406a"}},{"ruleId":"D2","level":"warning","message":{"text":"selectr.Selectr.select (cognitive 20): selectr.Selectr.select has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/assets/selectr/selectr.js"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"847a19609cc4c7c5eae11ac4f52301ae7118ed37ee72891bbdd82a7845ebe2ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.sort (cognitive 20): Node.sort has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 3 (8 pts), boolean chains 1 (nesting depth added 8). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 3315). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":3294}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea7276e99bb6d6643071cf4aa9e7bcd14b9a6664dd0aa631f71d2216cd3acee"}},{"ruleId":"D2","level":"warning","message":{"text":"appendNodeFactory::getPath::getIndex::updateDom (cognitive 20): appendNodeFactory::getPath::getIndex::updateDom has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (20 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/js/appendNodeFactory.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a599053b9bd96db5f8a6931be3f788cdf1e564d2947532fc5fdd1a4d157a021a"}},{"ruleId":"D2","level":"warning","message":{"text":"setPath (cognitive 20): setPath has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 8). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to 7 function items inside it that branch ((anonymous), (anonymous)::onclick::(anonymous), _onShowAllClick::onblur, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/TreePath.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee61040f0d97c841a1b6e6f3a099d5150e96a915b8e1d46cd4d702a0a0565d1"}},{"ruleId":"D2","level":"warning","message":{"text":"selectr.addTag (cognitive 19): selectr.addTag has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (nesting depth added 4). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 767). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/assets/selectr/selectr.js"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa543dfbb5cbb6b1ca91c78d37c08c5a8970066c360a64cc8b45c557f55542a"}},{"ruleId":"D2","level":"warning","message":{"text":"Node._updateEditability (cognitive 19): Node._updateEditability has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3 (nesting depth added 9). 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/js/Node.js"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0c79814de2001822f614bc17e03541934b5b706db5ec12b8815a05ac84b42c"}},{"ruleId":"D2","level":"warning","message":{"text":"JSONEditor.JSONEditor.registerMode (cognitive 19): JSONEditor.JSONEditor.registerMode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 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/js/JSONEditor.js"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e9c987ffd2ba6982324b64856ea81d047afe1d6af6a94636813fa756be98e3"}},{"ruleId":"D2","level":"warning","message":{"text":"createQuery (cognitive 19): createQuery has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 3 (6 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/js/jmespathQuery.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fee1b5f966b733af90c3e82091d2d9c0b8ea3b1b08fc447c9a63c4e44e2cfe"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.appendChild (cognitive 18): Node.appendChild has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, ternaries 1 (3 pts) (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/js/Node.js"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bc50fa397c6f1532b4e15011504ef3e2ad1979aa376b0bb40604042a37c8eb"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.moveBefore (cognitive 18): Node.moveBefore has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, ternaries 1 (2 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/js/Node.js"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dff9ef9dce5d267ed8cd578e831452412860652f207eec4d18c27f7f2fc4af2"}},{"ruleId":"D2","level":"warning","message":{"text":"_updateCursorInfo (cognitive 18): _updateCursorInfo has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 6). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch ((anonymous), updateDisplay). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/textmode.js"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace84f4b549662eac31c75187a3f9f11d5062c250892a0b78f4ebbef04f709e0"}},{"ruleId":"D2","level":"warning","message":{"text":"createAbsoluteAnchor (cognitive 18): createAbsoluteAnchor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 5 function items inside it that branch (destroy, isOutside, destroyIfOutside, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/createAbsoluteAnchor.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a74a9700e85d16bc4dc714368f03d8c198b03ec9f894e2c4b3a53f5604cf125"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.showChilds (cognitive 17): Node.showChilds has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (2 pts), ternaries 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/js/Node.js"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"162488005216dbaa997fe2fcd85569c4f7e5f315d2f411c4f4836e54ecb79079"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeHistory.undo (cognitive 17): NodeHistory.undo has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 1 (5 pts), boolean chains 1 (nesting depth added 10). 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. This shape REPEATS in the file: one other method here (NodeHistory.redo) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/NodeHistory.js"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f1df27875eda813d85eeabcaacf1eb33aa7c2b676d11fd529ef3aae2adab42"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeHistory.redo (cognitive 17): NodeHistory.redo has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 1 (5 pts), boolean chains 1 (nesting depth added 10). 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. This shape REPEATS in the file: one other method here (NodeHistory.undo) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/NodeHistory.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fd37fef395b8262691fc598d2bbd22ec542049ca7fa5b3fe13d26d0b10cba1"}},{"ruleId":"D2","level":"warning","message":{"text":"textmode.textmode.validate (cognitive 17): textmode.textmode.validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, error handling 1 (nesting depth added 6). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/textmode.js"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e74c2088aee3ddc7978d2e021b01b76c9f43af2c9baf887b99370a4dc18033"}},{"ruleId":"D2","level":"warning","message":{"text":"stringifyArray (cognitive 17): stringifyArray has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 4 (6 pts), boolean chains 1, 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/js/jsonUtils.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"729abf47963b3de99c045df3441427a82abb98ac323672930f3332d9df8d2a31"}},{"ruleId":"D2","level":"warning","message":{"text":"util.getInputSelection (cognitive 16): util.getInputSelection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3 (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/js/util.js"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b69d9820e45f64e62230c581f878eb1ece7d7c1016c01396b5cb4ccef0e7ff7"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.search (cognitive 16): Node.search has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, ternaries 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/js/Node.js"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c943ca74ba1bb82b32d67d819feee73b73332690044f9a171f7bfa82d1d97c87"}},{"ruleId":"D2","level":"warning","message":{"text":"treemode.treemode.expand (cognitive 16): treemode.treemode.expand has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/treemode.js"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"6974f221252555ba7997d816464ee27ff604e3365eb8fd0888dfa97d973e123b"}},{"ruleId":"D2","level":"warning","message":{"text":"showMoreNodeFactory (cognitive 16): showMoreNodeFactory has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2 (nesting depth added 5). Most of this is not in the body itself: 0 of the 16 points are its own statements and the rest belongs to 8 function items inside it that branch (updateDom, getDom, isVisible, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/showMoreNodeFactory.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1420cad65af5047880425ad7f8a5ba7efbff68a146cd91e667a529bc37ae89b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/Node.js: FileTooLong \u2014 2605 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 85% of them inside a single declaration: Node (49-4140). The bar is 1500 significant lines; this is 1105 over it, 1.74\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0294ced9bb30bfeca36661e1a6c59d770f81ec4aa256f80b7a477fd72e32c7f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Node: TooManyMethods \u2014 115 methods. The bar is 30 methods; this is 85 over it, 3.83\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/js/Node.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a96e211107f165edff78df83a6fe690dacfc9564d7dae139b069ffca16cf93"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: autocomplete.autocomplete: FunctionTooLong \u2014 autocomplete runs 289 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 189 over it, 2.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/autocomplete.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3313fe4918076751414c27c86085f685e4cdf5ce9382c85ade34045c11d1fc3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Node.onKeyDown: MethodTooLong \u2014 onKeyDown runs 249 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 149 over it, 2.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":2756}}}],"partialFingerprints":{"codehealthFindingId/v1":"90db86777ddf579e285e3fd3647a777bcce70f982b96e0fba633df1f043b52d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/treemode.js: FileTooLong \u2014 998 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 498 over it, 2.00\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/js/treemode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8d8ef852a99ce17efe4ea9b06a4cb15533086a77a02f17652307688a0ae24f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Node.showContextMenu: MethodTooLong \u2014 showContextMenu runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":3731}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a96c29069d20ea6f8ca30cac8d4f100a8df93dcc11017f2664eefb38aad7347"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/textmode.js: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 140 over it, 1.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/js/textmode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc6dc235bad32075f611c45ebaebf4a72c8f9689f6cf616364edfc293ee7588"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Node.onEvent: MethodTooLong \u2014 onEvent runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":2518}}}],"partialFingerprints":{"codehealthFindingId/v1":"6597d939ef09b12e3f1f041d424505b74b66a601e59b73fa3be36b901e59a44c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: appendNodeFactory.appendNodeFactory: FunctionTooLong \u2014 appendNodeFactory runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/appendNodeFactory.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7e1612bfbc2c3602e362dba1971b49620bacddb92f623e9dba52d7c5b41184"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NodeHistory.constructor: MethodTooLong \u2014 constructor runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/NodeHistory.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6144af7977a42d4b61acfad04ef418a46511160bbe94cac646cf37ecd1fe27c5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Node._updateDomValue: MethodTooLong \u2014 _updateDomValue runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4de9bbe2caf32d11ca094b4403146a95aca1d78502eda9501ae2902337a551"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/util.js: FileTooLong \u2014 557 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 57 over it, 1.11\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/js/util.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccedb15e3921cd5cfed189c60d4456522600a01527146667a608cb9691ba5440"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ContextMenu.constructor: MethodTooLong \u2014 constructor runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/ContextMenu.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b3d0482941bd56763adaa80474b749d8480c60a769a2cd5d79a899b8d40071"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 the repository root runs mocha but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060c8\u0060 (or \u0060nyc\u0060) as a devDependency so the suite can be wrapped for coverage. 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":"D10","level":"warning","message":{"text":"No assertions: renders without crashing: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/react_advanced_demo/src/App.test.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0f4a4008ee61f7a66bcc8f2e90956d3f7868b03e823a79f9790b216877e2d4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: renders without crashing: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/react_demo/src/App.test.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8076120642068588abb1e781321b07896bd756e06fc368eaa47efd0b26143e6d"}},{"ruleId":"D10","level":"warning","message":{"text":"Test project verifies nothing: examples/react_advanced_demo: No conventional assertion call was detected in 1 of 1 tests in \u0060examples/react_advanced_demo\u0060 \u2014 the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/react_advanced_demo/src/App.test.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad92da70273fb194d4f1004ffbe6b888dd6f4c4bb365f79ade693845646e554"}},{"ruleId":"D10","level":"warning","message":{"text":"Test project verifies nothing: examples/react_demo: No conventional assertion call was detected in 1 of 1 tests in \u0060examples/react_demo\u0060 \u2014 the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/react_demo/src/App.test.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d0984622caf88feadecdb157cd5ef22058cd3bd08999005ab69b447480e6da"}},{"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":"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":"1a109badce344d491e273e65f4c873503581c227cf6e351e5d7d408324b94960"},"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":"e263ba84e613043a886058aec3a3eec473b92188a17dd3a49fbc50c16e74f42f"},"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":"43423dc467f10f14ab06a817aed6cdb00935b9e1675b130c1e45c802099616a0"},"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":"6a9763f7db0b84c89909d60db8dd09a523f77ad04bbf078bed1bdfb36d21e9e8"},"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":"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":"6a0f3ab676a3f5b0fd9a6def306016819350fe41b7238dab42e284a49c63bb40"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e1cadfd308099d350ff4c577f0ff750e70d335bb25641d19b698133d5a21f137"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c70c74fe2a31d682e89c11084e30519508481d60fd0cd3a70e5e1eb77eb43aca"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"832f22f9f253d3c1204974fe466dce193ed3fe4bc012ef4e7f960f73ceb61934"},"taxa":[{"id":"CWE-319","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":"5a31a0b5364830f542d37385755d27dd90f97746286a80cb6c17836bc6e14179"},"properties":{"dependency":{"package":"js-yaml","version":"4.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"9d861d97c9e6c69cb47d2f5bc645ecdddee4776c7500c34080ca158cbba2b714"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"4ccc24cc7788534b8daac7152d314175696562d9181b8f446e1be92d676aa171"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.17","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"5a8d36579f0c70b52b07a4b34388eeb0f22f9675f0479b902a21fe516144ec92"},"properties":{"dependency":{"package":"brace-expansion","version":"2.1.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"38fe29282fccc1288ac0f3c79d11d281de3ff6a86ab5682f471368b7a6c5f20e"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"ede4e5ea9cbdd1232993f6e7899b878535b603638d5f17ca56a6ea16d84db9f9"},"properties":{"dependency":{"package":"undici","version":"8.9.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"376a4456da6995d3c491d652f6211ebfc88b15f5bb2746420d2d04f20ef1923a"},"properties":{"dependency":{"package":"url-regex","version":"3.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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"},"properties":{"dependency":{"package":"serialize-javascript","version":"6.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"844ee9e41fa9ce4fe620c46bcd8caf24250b0825270972aba151cf6ffecb8920"},"properties":{"dependency":{"package":"decode-uri-component","version":"0.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"b2c2f7815bc2e3dc5c624dff5f3eb708691c4121a9eb5e23a9fac3c97c7d6a20"},"properties":{"dependency":{"package":"diff","version":"7.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 24 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (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; 24 of the 37 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: src/js/FocusTracker.js. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9658270ba49f37ed04e99ab1263b6393cd42aed8bdfb7aafd9fa1070f5491895"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: README advertises Docker containerisation, but no Dockerfile/compose file exists \u2014 searched for: \u0060dockerfile\u0060, \u0060docker-compose\u0060, \u0060compose.yaml\u0060, \u0060compose.yml\u0060. Each was matched case- and separator-insensitively against file and directory NAMES anywhere in the tree, and against the CONTENTS of manifest files (package.json, *.csproj, *.props, *.slnx, *.yml, Dockerfile); the README\u0027s own prose never counts, so a claim is never refuted by merely being made. Nothing outside that search was read \u2014 a footprint living only in a submodule, in a file type not listed here, or under a name none of those terms matches is not seen, and this row is then wrong."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"343bbbd51ceb8de7a9ff88d79f7c797abf9b5921f8727b67b4d0f4f8a22c5e49"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add CodeQL\u0027s javascript-typescript pack, \u0060semgrep --config=p/javascript\u0060, or eslint-plugin-security as a CI step. What was searched, so you can tell an absence from a miss: the 680 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":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 41 plain JS \u2014 the untyped files are index.js, src/js/ContextMenu.js, src/js/ErrorTable.js, src/js/FocusTracker.js, src/js/Highlighter.js, src/js/History.js (\u002B35 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (249 matched lines \u00D7 2 locations): src/js/previewmode.js:43 \u00B7 src/js/textmode.js:42 \u2014 the two spans are one implementation copied and then locally edited \u2014 1445 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/previewmode.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec271556a6a0d215eb82c4795b0779bcad84d906762133b6e369593980b4773d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 3 locations): src/js/Node.js:3827 \u00B7 src/js/Node.js:3875 \u00B7 src/js/appendNodeFactory.js:150 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":3827}}}],"partialFingerprints":{"codehealthFindingId/v1":"f675f5c5e7ee8211962963b4a7be956e5f65808e514a1dffb8c14bba40b8066a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): src/js/Node.js:2885 \u00B7 src/js/Node.js:2991 \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/js/Node.js"},"region":{"startLine":2885}}}],"partialFingerprints":{"codehealthFindingId/v1":"78afc68d1fea47c84268a187a07f7badaceda9b777d78ef9d57340a6e9c755a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/js/previewmode.js:339 \u00B7 src/js/treemode.js:546 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/previewmode.js"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"74753b91b18b33a570e6a317c64a1d43889e2703d4a5a49203336640ecb8602f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/js/NodeHistory.js:272 \u00B7 src/js/NodeHistory.js:302 \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/js/NodeHistory.js"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02d7d47b646f60c7764d5859fd8a906316f59612b6a544894cdd6f79643fbba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/js/treemode.js:697 \u00B7 src/js/validationUtils.js:14 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/treemode.js"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bd5c8aad11afa1e3fa6d086a8b0a2f851fb0c49b346af796dfdbfd2427c84b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/js/Node.js:2620 \u00B7 src/js/Node.js:2665 \u2014 all 2 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/js/Node.js"},"region":{"startLine":2620}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c33360adaf180244ae2d6bcbc612c5252aebce52ce533b6a97e7c5a22341a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/js/Node.js:3923 \u00B7 src/js/treemode.js:1729 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":3923}}}],"partialFingerprints":{"codehealthFindingId/v1":"4046b011dc163d5e5219791f57021b1faee0fa7bb1da269b1aae162e0c3f3616"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/js/Node.js:3194 \u00B7 src/js/Node.js:3225 \u2014 all 2 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/js/Node.js"},"region":{"startLine":3194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04ed71021a0280592929525a7841ab1712d70dc118e1e9099fb2fb66266ab69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/js/textmode.js:151 \u00B7 src/js/textmode.js:190 \u2014 all 2 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/js/textmode.js"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d517bd82187faed546dbabf78ba535ba5b25440de11820be2602f4ca60c19d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/js/textmode.js:905 \u00B7 src/js/treemode.js:629 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/textmode.js"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"4100af0d2336c08cc6c950c30d1191c38743cd34f29a3cbf60857f8c970d970c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/js/Node.js:1168 \u00B7 src/js/Node.js:1195 \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/js/Node.js"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"092a922b962f65af6c0474430c06bdfb932f3939746d9b032d7b3001e6e70f73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): src/js/NodeHistory.js:50 \u00B7 src/js/NodeHistory.js:65 \u00B7 src/js/NodeHistory.js:80 \u00B7 src/js/NodeHistory.js:111 \u2014 all 4 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/js/NodeHistory.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cf40bd4009d0ce679d34372a20969224a06f1a0dd67c322458a26af45badb7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/js/previewmode.js:214 \u00B7 src/js/previewmode.js:228 \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/js/previewmode.js"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c28fd1fc14d6e7412f446cb19bab17f0067805cf37d1246d864a66d9069d42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/js/Node.js:453 \u00B7 src/js/Node.js:565 \u2014 all 2 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/js/Node.js"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"18afa3c14f7a9139badabb89843aefd8638a4b22b87062c8e2356922e747f7f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/js/Node.js:577 \u00B7 src/js/Node.js:610 \u2014 all 2 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/js/Node.js"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44903b112a54b4c2d4f54003c95ce53a4d0dc29c8d0e02c759a89d374ec88a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/js/Node.js:2588 \u00B7 src/js/Node.js:2643 \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/js/Node.js"},"region":{"startLine":2588}}}],"partialFingerprints":{"codehealthFindingId/v1":"0394206700edf440af61bf8e763f9b2ef40f1ea8b6d9beb23e1ad67dfb1294de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/js/Node.js:3945 \u00B7 src/js/appendNodeFactory.js:200 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":3945}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8a213c35bc3898d40f8727d0e005e5fe7d2d5d40aec3aa74ab6ed1842291b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/js/Node.js:2538 \u00B7 src/js/appendNodeFactory.js:235 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f5cd6e438409209869e4a1fbf2022b295fe4968843fbd4c1075f5fc4572854"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/js/Node.js:4161 \u00B7 src/js/Node.js:4214 \u00B7 src/js/Node.js:4382 \u2014 all 3 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/js/Node.js"},"region":{"startLine":4161}}}],"partialFingerprints":{"codehealthFindingId/v1":"546ff932d8189920a4ab007a876c16f5fb9bb04e8f8dc2aea364c704b09a3b3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/js/autocomplete.js:226 \u00B7 src/js/util.js:266 \u2014 the 2 copies are spread across 2 files, 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/js/autocomplete.js"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0c4f65a81a478b63ad7dfb3b212da168e0b93b31a89a4d2b7414f25a025a23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/js/textmode.js:234 \u00B7 src/js/treemode.js:1111 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/textmode.js"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1de6b7a086a4c6501ea022968aa2c033d26f332ae04631e97b83f50cdf056a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/js/Node.js:558 \u00B7 src/js/Node.js:590 \u2014 all 2 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/js/Node.js"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"033f9cb93c2234aca46a968671ba1dab1e58afd7cf1825d120728701f46d9e47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/js/Node.js:1527 \u00B7 src/js/Node.js:1928 \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/js/Node.js"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70b0a14e7a00350fff0b28c2fd3f76cd76472b05e00a0a50f233bd64f82d4d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/js/Node.js:3165 \u00B7 src/js/Node.js:3199 \u00B7 src/js/Node.js:3230 \u2014 all 3 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/js/Node.js"},"region":{"startLine":3165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d7cb9b7c01d08d9e62a06e5d9b054f1e1860fd5da0ab8275d87fcd588954f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/js/previewmode.js:247 \u00B7 src/js/textmode.js:234 \u00B7 src/js/treemode.js:1111 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/previewmode.js"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d170e52307c572ff3c279695f2a3625862af57d4514dd2c8891ccd03c78b8b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/js/textmode.js:210 \u00B7 src/js/textmode.js:221 \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/js/textmode.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c52586c92d4d93719e504cb78cf6cd31ad069783458e5aee4e0f804b4c286f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/js/treemode.js:1079 \u00B7 src/js/treemode.js:1090 \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/js/treemode.js"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09f4f0e28db5adacf0251ad53a04df7d5e4e29bf887b11e2545a120ae4eaba4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/js/Node.js:1708 \u00B7 src/js/Node.js:1787 \u2014 all 2 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/js/Node.js"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a35489de01a4d8f01f6f3149812220837f4e5cc924faac7c1bef6165ea8f854"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/js/util.js:509 \u00B7 src/js/util.js:536 \u2014 all 2 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/js/util.js"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"e040a3263af6f8e410b564d91e9664a4e78fcce42860501aa3cd2abc91fe1c51"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/js/Node.js:1276 \u00B7 src/js/Node.js:1288 \u2014 all 2 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/js/Node.js"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0efe7439036427b0bb35938e362ddb03453c35760d8b88f1e4486128392b2de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/js/Node.js:2925 \u00B7 src/js/Node.js:3046 \u2014 all 2 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/js/Node.js"},"region":{"startLine":2925}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8384fcfae43f1a967189b43cbec7f2d8bebcd35aac4e0287b3fc7cdf7bebff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/js/autocomplete.js:469 \u00B7 src/js/autocomplete.js:480 \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/js/autocomplete.js"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"0130a2e6dfd5d6cbbf5f5436f0b7b888369d4660bdaf454bc8a900fb042df52f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onKeyDown (cyclomatic 111, cognitive 164): onKeyDown has cyclomatic complexity 111 and cognitive complexity 164; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":2756}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c50163299da4a5d84e6cf0783fdc10f1380ab90ba2238427b7075e9eb4ab4db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onEvent (cyclomatic 61, cognitive 65): onEvent has cyclomatic complexity 61 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":2518}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a71ea45d3307e97e61f6f71866b0c64ba40771e6776a865676e6bdc40a32980"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onDrag (cyclomatic 51, cognitive 115): onDrag has cyclomatic complexity 51 and cognitive complexity 115; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":4222}}}],"partialFingerprints":{"codehealthFindingId/v1":"51953e43676a2855c8429e118c8c759d238fd4e2f593f5a4bef2a3b10687ad87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _updateDomValue (cyclomatic 39, cognitive 85): _updateDomValue has cyclomatic complexity 39 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"20090bac61bfa326f626a5ef2813d8e7628038215927d7a040d64ec0c83c3937"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _onEvent (cyclomatic 32, cognitive 39): _onEvent has cyclomatic complexity 32 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/treemode.js"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc20c124864392eae728e2b18c09c334036274a1e64de09c75bdedc0393be51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateDom (cyclomatic 30, cognitive 49): updateDom has cyclomatic complexity 30 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":2226}}}],"partialFingerprints":{"codehealthFindingId/v1":"c296f6c08007560843216723a5af2545fa64cd691d67bba950022b236f5b5750"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 30, cognitive 38): create has cyclomatic complexity 30 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/textmode.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"37643da69e4a33991266e9afecef9df8510b01097e0dc87aece637021af7a93c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _onKeyDown (cyclomatic 26, cognitive 26): _onKeyDown has cyclomatic complexity 26 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/treemode.js"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e87cad4ec6f247f78c8b0edfffdb1d24331436d863875fd45608fce12d4134"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _onKeyDown (cyclomatic 25, cognitive 42): _onKeyDown has cyclomatic complexity 25 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/ContextMenu.js"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80a9b72fc0f4df42a1969dcffb0aa4f23fd9b3917d40cb6b38227b43fe748f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function focus (cyclomatic 25, cognitive 33): focus has cyclomatic complexity 25 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d53c37e15f1724002c1c541dd8897e83f8878b746cca130841bdc691ef5b05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _findOneSchema (cyclomatic 24, cognitive 45): _findOneSchema has cyclomatic complexity 24 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":4497}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f64e44b7eaab7f7671c4ff0fbc5fc6cc02cdd1bac20582a84f71f20d24546ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setValue (cyclomatic 23, cognitive 50): setValue has cyclomatic complexity 23 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90f88b84a96628a7184a5960f3b1c545e7530317b7ea06d0a4e0c5b74762d6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keyDownHandler (cyclomatic 19, cognitive 33): keyDownHandler has cyclomatic complexity 19 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/autocomplete.js"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2719ee5bdd4907ab09e9cb92d2c5d9af5ef1d61f6397087391264ec962a2012"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function changeType (cyclomatic 17, cognitive 29): changeType has cyclomatic complexity 17 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"232e5c44db3178ed297aa09094cf56326ce957b06648f4eb55781782ec96da68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _onChange (cyclomatic 17, cognitive 24): _onChange has cyclomatic complexity 17 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/treemode.js"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"6089132d702767b32d422a5231b19774cec59b7af26c5474c8bc1891107d28fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setInternalValue (cyclomatic 16, cognitive 34): setInternalValue has cyclomatic complexity 16 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"29eab5a0c887e125f7cda10c59687feb2f812acb2b5f75738795dca00d9d59dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function showContextMenu (cyclomatic 16, cognitive 25): showContextMenu has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/Node.js"},"region":{"startLine":3731}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc8e712f215b448a91369be5e309ed6daf5e3ffd0e0c9fb0a9d63302406c2ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function JSONEditor (cyclomatic 16, cognitive 21): JSONEditor has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/JSONEditor.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5c957b17bd9dd1dd280cbc1abb15203d3c6a40e0edba06e80207a1a384c31e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 16, cognitive 19): create has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/previewmode.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed55dc8bf6eddeea4f111202429e85f33efe1306d9a3842710e141b1344d19c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getInnerText (cyclomatic 15, cognitive 28): getInnerText has cyclomatic complexity 15 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/util.js"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"24184c373c88d66aa598acd56cbc6b2820b414fe55599df3171552d848cd684c"}},{"ruleId":"R3","level":"warning","message":{"text":"Large Files: 9 file(s) over 400 lines (counted as significant lines \u2014 blank lines excluded \u2014 over production source only, tests excluded), largest first: src/js/Node.js (4246), src/js/treemode.js (1681), src/js/util.js (1130), src/js/textmode.js (980), src/js/i18n.js (978), src/js/previewmode.js (598) (\u002B3 more)."},"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/js/treemode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"614104327b78bbfb1f63d36928c2ea0f8cb13bc41dbb7813302b20ce5e1768e4"}},{"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/js/textmode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57e179810da578fb2969689511660b297d3883bfc06de7c17d6fd05e1691210"}},{"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/js/previewmode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad80a005e4912a68dac3017db91fdfa6518cb248b7b091602b6e97bc995797f2"}},{"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/js/autocomplete.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1901fbf84f50603bf1900c2abb2abf01ea675fb06cce57ce74b6b7647a16a774"}},{"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/js/JSONEditor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"549cf300df2e267161ca158b17f4b3570b4fc055c6061b159e12e6ea581a7166"}},{"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/js/NodeHistory.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d39806814c267aa60011c0fb6f1d41e6609512cd2e7c0f27b9fa4b6058a3128"}},{"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/js/SearchBox.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e3ddb50eafbdd0361fbef80d62b14b55088e3455fc8402ddb1e7b219f0be05"}},{"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/js/ErrorTable.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef2032c0d2d9c91b100927503bfac48c82e39fb7f34e47dec50932293277a14"}},{"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/js/ace/theme-jsoneditor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e588b38963b3c925b6bccdfbf2a7bece63fdd9087d470a468a04a6b060cdcb"}},{"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/js/TreePath.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e4fc17723577af47f7b77d6a806c19bfcdb45441f5f7d987cba7ed426266d0"}},{"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/js/ModeSwitcher.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ce6ddb0563fb5e4f4d6016c611ab9740dc118795d0d0e60ea0dd4426685224"}},{"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/js/FocusTracker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ce58e528a762bb80b1eecd47314685e64cb170ee7a7786f5486b4b58de76a3"}},{"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/js/Highlighter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c55baa0dcacac9dc930008546f272f31a959c972416a2b282648f0d215722d"}},{"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/js/History.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0581d1aafd17285bfd7d65a1fb858ad3c322bfdc393d2fb488d9d531582c6f"}},{"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/js/jmespathQuery.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bca58512d30616813df7adee089a50ee5275a218187cc847e8a622dd68a1b0"}},{"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/js/validationUtils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde5d4627a9b627a1d3a123c003b12e325386a0564c7d96d75fdf5f2fe04f52a"}},{"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/js/ace/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2143eda159e992f1b0d231501f8d4c9409540701d7cc1eff703071953b330ed6"}},{"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/js/vanilla-picker/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c60029cf75623964ed34a44518cff5507c28dfc047c8c3da226e7a151ac1167"}},{"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/js/tryRequireAjv.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef645e407856357bd7e79d808220019a1853aa9126ed9dffdaedd9131baedac3"}},{"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/js/tryRequireThemeJsonEditor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4675c5976677028ec737b027cad4da2c36e7b9a394d117902fb5adb8ba0bdc20"}},{"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":"index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce9c6863b3d8b2e3133cab1d9ec730fe7b712fa5c1c8fecc21bd4b1873d5052"}},{"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/js/header.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c4b57f57a07969eeaa2fd2613e38c9669787abda7e477dc34bfa1245641321"}},{"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/js/types.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"600cedc1bada68edde161e45b6d1cc3647ee5863423e507050eb015127a4684b"}},{"ruleId":"R6","level":"warning","message":{"text":"No typecheck script: test \u2713 \u00B7 lint \u2713 \u00B7 typecheck \u2717 \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":"912edc7f1fd20bf80ef68c3293e3048565115e48707dc5f9d492201598794658"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (3 application, 2 tooling, 7 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/types.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24263bd1bd608defc84ff9d5e7cdb742b698ad6b15fd41333fd5e1235e98397"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027previewModeMixins\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/previewmode.js"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"220b3e95f2c1c1b56c2e6fc856f9f3d58f150afe5d14eba422d77f83eb94eb34"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027treeModeMixins\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/treemode.js"},"region":{"startLine":1883}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f87f087e91f39a6284e899aacc3e62942bc331cb605733d631e574606ffe710"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027extend\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/util.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59bb54578bc366d4ead34f078e9f81d6bb4e851a34596e6e858c35445a67477"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027clear\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/util.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48ef31b917bfcf49b30fd6d5ebbe075d4a5bf2d353db5b9bac5065261ae243f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getInternetExplorerVersion\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/util.js"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cdc9bff5fe7f87158b5cbafab1ea9b14583e9c3b5c11772e466a0a470c0065"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027insideRect\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/js/util.js"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde78351f7aacf4077f4e45c81aee412c9f97924e4110036bbbd3b0bc9cc692d"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"CWE-319","shortDescription":{"text":"CWE-319"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":20,"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."]}]}