{"$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":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"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"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"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"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"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":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"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":"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":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"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":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"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":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"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":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"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":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"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.showdown.subParser(\u0022makeMarkdown.node\u0022) (cyclomatic 69): node.showdown.subParser(\u0022makeMarkdown.node\u0022) has cyclomatic complexity 69 (threshold 15). Most of this is not in the body itself: 11 of the 69 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 37, 62). 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/subParsers/makemarkdown/node.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8725397937fe12abb3a8b24bfe16c7547e35d5dd28726acc165e6c87d5ab3f23"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 69): (anonymous) has cyclomatic complexity 69 (threshold 15). Most of this is not in the body itself: 6 of the 69 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 37, (anonymous)::renderRawElement). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makemarkdown/node.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9d53de0942018f1e4d6fa794432f9cd45e2dbfab4d7a53020619a47d11490b"}},{"ruleId":"D1","level":"warning","message":{"text":"converter.showdown.Converter (cyclomatic 60): converter.showdown.Converter has cyclomatic complexity 60 (threshold 15). Most of this is not in the body itself: 7 of the 60 points are its own statements and the rest belongs to 12 function items inside it that branch (_parseExtension, _constructor, unlisten, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/converter.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a393f0f6428356e0a376c1f59310d068db42225685a588eb54e823861a15fac"}},{"ruleId":"D1","level":"warning","message":{"text":"spanGamut.showdown.subParser(\u0022makehtml.spanGamut\u0022)::parseCmInline (cyclomatic 59): spanGamut.showdown.subParser(\u0022makehtml.spanGamut\u0022)::parseCmInline has cyclomatic complexity 59 (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/subParsers/makehtml/spanGamut.js"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46db9ca8e0758737fe6c9077b6d1e020b9e7c19a257da74e7317cd3f67d7de3"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::parseCmInline (cyclomatic 59): (anonymous)::parseCmInline has cyclomatic complexity 59 (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/subParsers/makehtml/spanGamut.js"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c21ec95b5771c1d3e92e949f79e283c9b7e51aed2f2cd1cb0ce70296bd61447"}},{"ruleId":"D1","level":"warning","message":{"text":"stripLinkDefinitions.showdown.subParser(\u0022makehtml.stripLinkDefinitions\u0022)::tryParseCmDefinition (cyclomatic 56): stripLinkDefinitions.showdown.subParser(\u0022makehtml.stripLinkDefinitions\u0022)::tryParseCmDefinition has cyclomatic complexity 56 (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/subParsers/makehtml/stripLinkDefinitions.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a073575f1d9b6dd5e9e053078fb226d6ae2eac5e3b0690995e0289342821f870"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::tryParseCmDefinition (cyclomatic 56): (anonymous)::tryParseCmDefinition has cyclomatic complexity 56 (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/subParsers/makehtml/stripLinkDefinitions.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3e943342db4d698b40ef812c8a189e19bb92fd7d442db6d6475fe77b49823f"}},{"ruleId":"D1","level":"warning","message":{"text":"link.showdown.subParser(\u0022makehtml.inline.link\u0022) (cyclomatic 53): link.showdown.subParser(\u0022makehtml.inline.link\u0022) has cyclomatic complexity 53 (threshold 15). Of this number, 47 points are the body\u0027s own statements and 6 belong to 2 function items 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/subParsers/makehtml/link.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1755ca0626de1ccbbd2cf94ba8d87c447ae2a2c651f21da49b87fbd20bb51479"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 53): (anonymous) has cyclomatic complexity 53 (threshold 15). Of this number, 47 points are the body\u0027s own statements and 6 belong to 2 function items 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/subParsers/makehtml/link.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ed17750cd4aa9b4539d3a0107c5e09b2d97f54c411fbe245263e793de64191"}},{"ruleId":"D1","level":"warning","message":{"text":"htmlBlock.showdown.subParser(\u0022makehtml.htmlBlock\u0022) (cyclomatic 44): htmlBlock.showdown.subParser(\u0022makehtml.htmlBlock\u0022) has cyclomatic complexity 44 (threshold 15). Most of this is not in the body itself: 3 of the 44 points are its own statements and the rest belongs to 6 function items inside it that branch (parseCmHTMLBlocks, hashLegacyHTMLBlocks, hashLegacyHTMLBlocks::protectFences, \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/subParsers/makehtml/htmlBlock.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b6c26196ea1e6be45f5722397cd57131040edf9e45eb36d89362588703cb0c"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 44): (anonymous) has cyclomatic complexity 44 (threshold 15). Most of this is not in the body itself: 3 of the 44 points are its own statements and the rest belongs to 14 function items inside it that branch (parseCmHTMLBlocks, hashLegacyHTMLBlocks, hashLegacyHTMLBlocks::protectFences, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/htmlBlock.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c207efb3bf4c64e0b9512bbaed6dea81ba18a0d3b75567e60556b4c486cc74a0"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.conversionCommand (cyclomatic 43): cli.conversionCommand has cyclomatic complexity 43 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/cli.js"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d22e8c3cafe69a46c97f83135a0f397dfcbfd21d4b380910ac2c7116fef6f3"}},{"ruleId":"D1","level":"warning","message":{"text":"table.showdown.subParser(\u0022makeMarkdown.table\u0022) (cyclomatic 38): table.showdown.subParser(\u0022makeMarkdown.table\u0022) has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 3 of the 38 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 26, 38). 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/subParsers/makemarkdown/table.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c42039b78fca1d22a11776e6ecd0641a1f14608fb06f3b4e4ce190fa76c77fd"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 38): (anonymous) has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 3 of the 38 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 26, (anonymous)::iterateRow). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makemarkdown/table.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"34348d510a835a901e9338472ca72bfd6a12f666fc6b14b21fe09a2f9b118098"}},{"ruleId":"D1","level":"warning","message":{"text":"strikethrough.showdown.subParser(\u0022makehtml.inline.strikethrough.pair\u0022) (cyclomatic 35): strikethrough.showdown.subParser(\u0022makehtml.inline.strikethrough.pair\u0022) has cyclomatic complexity 35 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 13 belong to 3 function items 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/subParsers/makehtml/strikethrough.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e489a15587c9282ba004983f960494b11b11d8206c5ac8fff1c0910bf7a557ce"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 35): (anonymous) has cyclomatic complexity 35 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 13 belong to 3 function items 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/subParsers/makehtml/strikethrough.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb268a37f8459d3fd1a05bc541b0e653eea4dd7410f59c098f9c8326808acc2d"}},{"ruleId":"D1","level":"warning","message":{"text":"list.showdown.subParser(\u0022makehtml.list\u0022)::parseList (cyclomatic 34): list.showdown.subParser(\u0022makehtml.list\u0022)::parseList has cyclomatic complexity 34 (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 shape REPEATS in the file: 2 other methods here (list.showdown.subParser(\u0022makehtml.list\u0022)::gatherItem, list.showdown.subParser(\u0022makehtml.list\u0022)::renderItem) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/subParsers/makehtml/list.js"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"d983400bdddfffee4e3772905a44bdc499f5a946991cd7a3d4da22af15f8123b"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::parseList (cyclomatic 34): (anonymous)::parseList has cyclomatic complexity 34 (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/subParsers/makehtml/list.js"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"033fecbc8f4578981b132e9c933fefb5cda876086f773aa0374729f1b336e6b2"}},{"ruleId":"D1","level":"warning","message":{"text":"table.showdown.subParser(\u0022makehtml.table\u0022) (cyclomatic 33): table.showdown.subParser(\u0022makehtml.table\u0022) has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 2 of the 33 points are its own statements and the rest belongs to 7 function items inside it that branch (parseTable, preParse, parse, \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/subParsers/makehtml/table.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3e2dce38246f1dc1e3d0b78a16aacbc2c2b9bd666a803ba3951f9b59363432"}},{"ruleId":"D1","level":"warning","message":{"text":"pushDelim (cyclomatic 33): pushDelim has cyclomatic complexity 33 (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/subParsers/makehtml/spanGamut.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05b34f19d8f1bdc7d2e83cdb61d905c7e7e5e7a6bf753c3495c15531f6f3976"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 33): (anonymous) has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 2 of the 33 points are its own statements and the rest belongs to 13 function items inside it that branch (parseTable, preParse, parse, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/table.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c9ecbad22ae8dfeb29ba109d59df617dc80df6b7cc217302d5f42a65973f85"}},{"ruleId":"D1","level":"warning","message":{"text":"url.URLUtils (cyclomatic 31): url.URLUtils has cyclomatic complexity 31 (threshold 15). Of this number, 30 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/helpers/url.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d0a69e993ffd6879606454f000127e3b23bc790f1fb2507d77ac5bfe8d6d1c"}},{"ruleId":"D1","level":"warning","message":{"text":"heading.showdown.subParser(\u0022makehtml.heading.setext\u0022) (cyclomatic 29): heading.showdown.subParser(\u0022makehtml.heading.setext\u0022) has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to 5 function items inside it that branch (parseSetextHeading::resolveMultilineFalsePositive, parseSetextHeading::resolveOneLinerFalsePositive, parseSetextHeading, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/heading.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"094faafbd0ae81e36149d0a54663747ecc22613bdee79b11b73e6ec59c7dd057"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 29): (anonymous) has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to 6 function items inside it that branch (parseSetextHeading::resolveMultilineFalsePositive, parseSetextHeading::resolveOneLinerFalsePositive, parseSetextHeading, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/heading.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4352fddbc836d2606190e9334679e145e98894974a5f86f520826b7e0b9a0bd"}},{"ruleId":"D1","level":"warning","message":{"text":"processEmphasis (cyclomatic 28): processEmphasis has cyclomatic complexity 28 (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/subParsers/makehtml/spanGamut.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c6f3cf3616bab5efc2c01588c4a089dc562115010da5d6191428ebe86262d6"}},{"ruleId":"D1","level":"warning","message":{"text":"footnotes.showdown.subParser(\u0022makehtml.footnotes\u0022)::tryParseDefinition (cyclomatic 27): footnotes.showdown.subParser(\u0022makehtml.footnotes\u0022)::tryParseDefinition has cyclomatic complexity 27 (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/subParsers/makehtml/footnotes.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7d9c6ee17ecf8d7ede0bee23c15466ca34a113d99b0bc55e430243c0ffbf76"}},{"ruleId":"D1","level":"warning","message":{"text":"list.showdown.subParser(\u0022makehtml.list\u0022)::renderItem (cyclomatic 27): list.showdown.subParser(\u0022makehtml.list\u0022)::renderItem has cyclomatic complexity 27 (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 shape REPEATS in the file: 2 other methods here (list.showdown.subParser(\u0022makehtml.list\u0022)::gatherItem, list.showdown.subParser(\u0022makehtml.list\u0022)::parseList) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/subParsers/makehtml/list.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21946214433de82954b88f1f7d7b9c64c0b1feaa0d1625e5c2b316a572a94dd"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::tryParseDefinition (cyclomatic 27): (anonymous)::tryParseDefinition has cyclomatic complexity 27 (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/subParsers/makehtml/footnotes.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"4513c68187c95243c25ec3f49f027a66b97e7b53ff9e3bb8318fb758e644fdc8"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::renderItem (cyclomatic 27): (anonymous)::renderItem has cyclomatic complexity 27 (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/subParsers/makehtml/list.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33743ecdaef3b40ddadfd28b3f0a377679a0e0d5c2ed606b63517d2b1d53f62"}},{"ruleId":"D1","level":"warning","message":{"text":"showdown.validate (cyclomatic 26): showdown.validate has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/showdown.js"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cdf16a0a223bdd144b3e159f9e09c478b097f8d630eb9c6f6913d7296ca536"}},{"ruleId":"D1","level":"warning","message":{"text":"list.showdown.subParser(\u0022makehtml.list\u0022)::gatherItem (cyclomatic 23): list.showdown.subParser(\u0022makehtml.list\u0022)::gatherItem 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 shape REPEATS in the file: 2 other methods here (list.showdown.subParser(\u0022makehtml.list\u0022)::renderItem, list.showdown.subParser(\u0022makehtml.list\u0022)::parseList) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/subParsers/makehtml/list.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c29e4ab9a3628a8b38141a2759a7cd36d3f30bd236ca61ce235d027a90fa15"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::gatherItem (cyclomatic 23): (anonymous)::gatherItem 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/list.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e998895f59b3dd1fdfa272162d04737f7538ae2225f3631dcbe242afd13d6a4"}},{"ruleId":"D1","level":"warning","message":{"text":"commonmark.showdown.helper.cmScanDestination (cyclomatic 22): commonmark.showdown.helper.cmScanDestination has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/helpers/commonmark.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6f30f62d0aaeefa92119d36f943634703cde4dc6495d95db362a25d0b51d8b"}},{"ruleId":"D1","level":"warning","message":{"text":"gfmAutolinks.showdown.helper.writeAnchorTag (cyclomatic 21): gfmAutolinks.showdown.helper.writeAnchorTag has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/helpers/gfmAutolinks.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2542a58336fdd2203cd25668470603da178918c969524bf0d867d5e7767923f"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 21): (anonymous) has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 183, a function literal at line 259, a function literal at line 275, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/nakedUrl.js"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b05e2e4e8a30ae53dd49eaa49ee1c8b571be59b3204e669a8a7e045ac73a71"}},{"ruleId":"D1","level":"warning","message":{"text":"blockquote.showdown.subParser(\u0022makehtml.blockquote\u0022)::parseBlockquotes (cyclomatic 20): blockquote.showdown.subParser(\u0022makehtml.blockquote\u0022)::parseBlockquotes has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/blockquote.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"65eb142c1b7c84634b7565002b1e37e5a1e32c3f6a65be08927fb79a081d5034"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::parseBlockquotes (cyclomatic 20): (anonymous)::parseBlockquotes has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/blockquote.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7939e57d1357d13ada5118e11c1572d2e44d6da0bbc76b19bbb7f88c3961f75"}},{"ruleId":"D1","level":"warning","message":{"text":"rawHtml.scanHTMLComment (cyclomatic 19): rawHtml.scanHTMLComment 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/subParsers/makehtml/rawHtml.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4586d62afbf6f371a7c5dfa970dcfc6b13ba2ec67fcc377a3a0df46daf83e74"}},{"ruleId":"D1","level":"warning","message":{"text":"misc.showdown.helper._populateAttributes (cyclomatic 18): misc.showdown.helper._populateAttributes has cyclomatic complexity 18 (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/helpers/misc.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c257d8522ebe4b638a5fb1a4178bcea6570d1cd75b563273f281aa4253189e"}},{"ruleId":"D1","level":"warning","message":{"text":"text.rgxFindMatchPos (cyclomatic 18): text.rgxFindMatchPos has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/helpers/text.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c02047fb52ae573ef06fb674c623bfc4534405cee26f79ae24cfc4d970c0f34"}},{"ruleId":"D1","level":"warning","message":{"text":"githubCodeBlock.showdown.subParser(\u0022makehtml.githubCodeBlock\u0022) (cyclomatic 18): githubCodeBlock.showdown.subParser(\u0022makehtml.githubCodeBlock\u0022) has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (parse). 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/subParsers/makehtml/githubCodeBlock.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f7d86e0e0ac436c2e1047032e83aa3b7b68c1066c04e5421d9c467d1ad2a0f"}},{"ruleId":"D1","level":"warning","message":{"text":"image.showdown.subParser(\u0022makeMarkdown.image\u0022) (cyclomatic 18): image.showdown.subParser(\u0022makeMarkdown.image\u0022) has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. 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/subParsers/makemarkdown/image.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"48660314ba242fb9f3ec4c41329d2d5978d9549e9510d43ff0f2d5f81a266914"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 18): (anonymous) has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to 4 function items inside it that branch (parse, a function literal at line 43, a function literal at line 47, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/githubCodeBlock.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14ab214bdcdf2d5c2b66c10017a058c59ecac310ccf7092c86c8134ac7702ce"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 18): (anonymous) has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 35). 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/subParsers/makemarkdown/image.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0442e26c93a49287d0707d5801169a3921fb2804c0071d202b16150529037b"}},{"ruleId":"D1","level":"warning","message":{"text":"autolink.showdown.subParser(\u0022makehtml.inline.autolink\u0022) (cyclomatic 17): autolink.showdown.subParser(\u0022makehtml.inline.autolink\u0022) has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (parseAutolink, emitAngleAutolink). 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/subParsers/makehtml/autolink.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0969bb80659730e3c17056d316551503b1660d6618630c1bc272b06dbc030d9"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 17): (anonymous) has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (parseAutolink, emitAngleAutolink). 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/subParsers/makehtml/autolink.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9621e371989c6cfeea59a4a7a6951359fe1fc3e0ab800b6ce44d20941356ec12"}},{"ruleId":"D1","level":"warning","message":{"text":"event.showdown.Event.dispatchCapture (cyclomatic 16): event.showdown.Event.dispatchCapture 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/event.js"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49ab66c2db9be77da22738234498f1c8cc4d8f29ca04108cb48122fe099e315"}},{"ruleId":"D1","level":"warning","message":{"text":"footnotes.showdown.subParser(\u0022makeMarkdown.footnotes\u0022) (cyclomatic 16): footnotes.showdown.subParser(\u0022makeMarkdown.footnotes\u0022) has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 4 function items inside it that branch (renderSection, a function literal at line 24, renderReference, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makemarkdown/footnotes.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73ff073bf996c56bd5649477f4826973224bfb19d7a26b813df3115469f46de"}},{"ruleId":"D1","level":"warning","message":{"text":"Messenger (cyclomatic 16): Messenger has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 6 function items inside it that branch (printMsg, printVerbose, errorExit, \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/cli/cli.js"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9626296205ea545dcc937d523b6320a3f022174dd50cb07f0e304df3135547f"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 16): (anonymous) has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 4 function items inside it that branch (renderSection, a function literal at line 24, renderReference, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makemarkdown/footnotes.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"733a78cd8846a0abd7ad2422454b97e11b615096a98406f1d0c8e9f2b5aff6bf"}},{"ruleId":"D2","level":"warning","message":{"text":"spanGamut.showdown.subParser(\u0022makehtml.spanGamut\u0022)::parseCmInline (cognitive 105): spanGamut.showdown.subParser(\u0022makehtml.spanGamut\u0022)::parseCmInline has cognitive complexity 105 (threshold 15). Drivers by points: if/else 34 (87 pts), boolean chains 15, loops 2 (3 pts) (nesting depth added 54). 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/subParsers/makehtml/spanGamut.js"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"62498f1e7ce0e0f71b4d86eb0df16eea064c81ed16d33ef8766c8e53369328c2"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parseCmInline (cognitive 105): (anonymous)::parseCmInline has cognitive complexity 105 (threshold 15). Drivers by points: if/else 34 (87 pts), boolean chains 15, loops 2 (3 pts) (nesting depth added 54). 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/subParsers/makehtml/spanGamut.js"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"6950c0bab767d4c7edf2d2a31b4d3d53e9ab02932c208a45ca10f16e29227cb3"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 104): (anonymous) has cognitive complexity 104 (threshold 15). Drivers by points: if/else 32 (66 pts), loops 6 (16 pts), boolean chains 13, ternaries 3 (9 pts) (nesting depth added 50). Of this number, 98 points are the body\u0027s own statements and 6 belong to 2 function items 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/subParsers/makehtml/link.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b98b164d7d393292f34fde579fecc83e1b102f3fb301a0e36b8f9067f58e8fd"}},{"ruleId":"D2","level":"warning","message":{"text":"link.showdown.subParser(\u0022makehtml.inline.link\u0022) (cognitive 96): link.showdown.subParser(\u0022makehtml.inline.link\u0022) has cognitive complexity 96 (threshold 15). Drivers by points: if/else 32 (66 pts), loops 6 (16 pts), boolean chains 13, ternaries 1 (nesting depth added 44). Of this number, 90 points are the body\u0027s own statements and 6 belong to 2 function items 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/subParsers/makehtml/link.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bdc3eccb475953f1a16e6c6a329a16c010299c8491efd67b97de9cbc16ae80"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 94): (anonymous) has cognitive complexity 94 (threshold 15). Drivers by points: if/else 27 (71 pts), ternaries 3 (10 pts), boolean chains 8, loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 54). Most of this is not in the body itself: 5 of the 94 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 37, (anonymous)::renderRawElement). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makemarkdown/node.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95d73aed84aaee1e567f13fc90dbbba3041e32d78f18f9356eb90297b515148"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::tryParseCmDefinition (cognitive 77): (anonymous)::tryParseCmDefinition has cognitive complexity 77 (threshold 15). Drivers by points: if/else 25 (41 pts), boolean chains 16, loops 9 (14 pts), ternaries 2 (6 pts) (nesting depth added 25). 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/subParsers/makehtml/stripLinkDefinitions.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"684bd0c719358bc4545284761780db0a6a4dcaefe8d6a95d129d084014665f35"}},{"ruleId":"D2","level":"warning","message":{"text":"stripLinkDefinitions.showdown.subParser(\u0022makehtml.stripLinkDefinitions\u0022)::tryParseCmDefinition (cognitive 71): stripLinkDefinitions.showdown.subParser(\u0022makehtml.stripLinkDefinitions\u0022)::tryParseCmDefinition has cognitive complexity 71 (threshold 15). Drivers by points: if/else 25 (41 pts), boolean chains 16, loops 9 (14 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/stripLinkDefinitions.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f354c2390624e9295746a23ff48c835a1cc1d62695f2b9b5429e2533fee0a7"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parseList (cognitive 66): (anonymous)::parseList has cognitive complexity 66 (threshold 15). Drivers by points: if/else 12 (32 pts), ternaries 4 (15 pts), boolean chains 13, loops 3 (6 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/list.js"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"391b827af29d68ac58de51be6235d221e3b9145f5407add4ba50ac6bda00143f"}},{"ruleId":"D2","level":"warning","message":{"text":"table.showdown.subParser(\u0022makeMarkdown.table\u0022) (cognitive 59): table.showdown.subParser(\u0022makeMarkdown.table\u0022) has cognitive complexity 59 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 12 (19 pts), boolean chains 6, match/switch 2 (6 pts) (nesting depth added 23). Most of this is not in the body itself: 3 of the 59 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 26, 38). 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/subParsers/makemarkdown/table.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d196061f8fcd0d1fce5c57a5aceafcb3a9c8896e8fdb97dee18d74d6e3661f"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 59): (anonymous) has cognitive complexity 59 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 12 (19 pts), boolean chains 6, match/switch 2 (6 pts) (nesting depth added 23). Most of this is not in the body itself: 3 of the 59 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 26, (anonymous)::iterateRow). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makemarkdown/table.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"489aa9ac3dde2ea205dd87abdcc243360cdb28e90b729d84cbcd917e65dd52c0"}},{"ruleId":"D2","level":"warning","message":{"text":"showdown.validate (cognitive 56): showdown.validate has cognitive complexity 56 (threshold 15). Drivers by points: if/else 20 (49 pts), loops 2 (4 pts), boolean chains 2, ternaries 1 (nesting depth added 31). 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/showdown.js"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9bab452d521f241758feeea6ea7e63504eb38008c2c03c53481ecb56231ded"}},{"ruleId":"D2","level":"warning","message":{"text":"list.showdown.subParser(\u0022makehtml.list\u0022)::parseList (cognitive 55): list.showdown.subParser(\u0022makehtml.list\u0022)::parseList has cognitive complexity 55 (threshold 15). Drivers by points: if/else 12 (32 pts), boolean chains 13, loops 3 (6 pts), ternaries 1 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (list.showdown.subParser(\u0022makehtml.list\u0022)::gatherItem, list.showdown.subParser(\u0022makehtml.list\u0022)::itemLoose, list.showdown.subParser(\u0022makehtml.list\u0022)::renderItem) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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/subParsers/makehtml/list.js"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d902236552a2958fd0a36a67382e55b3e44d006e968cf867caff5f3cbe8b30"}},{"ruleId":"D2","level":"warning","message":{"text":"processEmphasis (cognitive 48): processEmphasis has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (22 pts), ternaries 4 (11 pts), boolean chains 8, loops 4 (7 pts) (nesting depth added 23). 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/subParsers/makehtml/spanGamut.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ae2b8a52a8847362ac113649bffac0c70b2b40bff88698f6ff9386b72d8324"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 48): (anonymous) has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 10, ternaries 5 (9 pts), loops 6 (nesting depth added 12). Of this number, 32 points are the body\u0027s own statements and 16 belong to 3 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/subParsers/makehtml/strikethrough.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a32e5d607eece8e0139491c1257905fa3f773e5ef9f1512b65c9531aa2d329f"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parseBlockquotes (cognitive 47): (anonymous)::parseBlockquotes has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (12 pts), ternaries 2 (8 pts), boolean chains 6 (nesting depth added 26). 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/subParsers/makehtml/blockquote.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"140b63a0e407d25090f5ea1a94896e32f146b48d16b651543fdedf6fb3223f42"}},{"ruleId":"D2","level":"warning","message":{"text":"list.showdown.subParser(\u0022makehtml.list\u0022)::renderItem (cognitive 46): list.showdown.subParser(\u0022makehtml.list\u0022)::renderItem has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 9, ternaries 4 (8 pts), loops 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (list.showdown.subParser(\u0022makehtml.list\u0022)::gatherItem, list.showdown.subParser(\u0022makehtml.list\u0022)::itemLoose, list.showdown.subParser(\u0022makehtml.list\u0022)::parseList) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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/subParsers/makehtml/list.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7415345682f860554db8f3222f0bec672b113ca621b429cd3928f1e9eabe6c"}},{"ruleId":"D2","level":"warning","message":{"text":"conversionCommand (cognitive 46): conversionCommand has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (15 pts), ternaries 12 (13 pts), boolean chains 9, error handling 5 (8 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/cli.js"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95c4886149aa6e743a718babcfaf6db6d1ec5a457f595553fc5aceca1e219e3"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::renderItem (cognitive 46): (anonymous)::renderItem has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 9, ternaries 4 (8 pts), loops 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/list.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3b7431b74947e860b00bb3bb308cf3f1f188f43db814cfd7a22a571e6a05ad"}},{"ruleId":"D2","level":"warning","message":{"text":"strikethrough.showdown.subParser(\u0022makehtml.inline.strikethrough.pair\u0022) (cognitive 45): strikethrough.showdown.subParser(\u0022makehtml.inline.strikethrough.pair\u0022) has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 10, loops 6, ternaries 3 (6 pts) (nesting depth added 11). Of this number, 28 points are the body\u0027s own statements and 17 belong to 3 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/subParsers/makehtml/strikethrough.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8137bebfb033599d4fb46dba28b6248673fad1bb9a3ebf713c414c74d034a805"}},{"ruleId":"D2","level":"warning","message":{"text":"list.showdown.subParser(\u0022makehtml.list\u0022)::gatherItem (cognitive 40): list.showdown.subParser(\u0022makehtml.list\u0022)::gatherItem has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 4 (10 pts), boolean chains 5 (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. This shape REPEATS in the file: 3 other methods here (list.showdown.subParser(\u0022makehtml.list\u0022)::itemLoose, list.showdown.subParser(\u0022makehtml.list\u0022)::renderItem, list.showdown.subParser(\u0022makehtml.list\u0022)::parseList) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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/subParsers/makehtml/list.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a801c1911892bcd8d567683653a177651479811293802c16d7d98754c1d5b06b"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::gatherItem (cognitive 40): (anonymous)::gatherItem has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 4 (10 pts), boolean chains 5 (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/subParsers/makehtml/list.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4ca90009cecb020fa1e0482bd55f01b2117ae7bbaa572a35f0214b7e2e6efb"}},{"ruleId":"D2","level":"warning","message":{"text":"blockquote.showdown.subParser(\u0022makehtml.blockquote\u0022)::parseBlockquotes (cognitive 39): blockquote.showdown.subParser(\u0022makehtml.blockquote\u0022)::parseBlockquotes has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (12 pts), boolean chains 6 (nesting depth added 20). 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/subParsers/makehtml/blockquote.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8583ba1db27e969f4108bf863993413d2fcce27016f229fc2b4cf263e5447601"}},{"ruleId":"D2","level":"warning","message":{"text":"URLUtils (cognitive 39): URLUtils has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 15, if/else 8 (13 pts), ternaries 6 (11 pts) (nesting depth added 10). Of this number, 36 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/helpers/url.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e35307de302e03f5603b306d2bcce179d02a6312a5daa5e65a95669a2db60cf"}},{"ruleId":"D2","level":"warning","message":{"text":"pushDelim (cognitive 39): pushDelim has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 18, if/else 9 (13 pts), ternaries 4 (8 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/subParsers/makehtml/spanGamut.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e0f96fd7119d8fae7b44610d752f6716783691b23742732d714561aa0951ce"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 37): (anonymous) has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (23 pts), ternaries 4 (7 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 16). Most of this is not in the body itself: 4 of the 37 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 183, a function literal at line 259, a function literal at line 275, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/nakedUrl.js"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1561ef133a81e59938aee2b4c6a59da96a7bc0cfb3a0351c750663520435ec98"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::tryParseDefinition (cognitive 36): (anonymous)::tryParseDefinition has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 5 (10 pts), boolean chains 6, loops 4 (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/subParsers/makehtml/footnotes.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa50a4871228dd83ca06b39e118cdd6c358f77872e59f1e00b522d16f06d2af"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 34): (anonymous) has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 4 (10 pts), boolean chains 6 (nesting depth added 16). Most of this is not in the body itself: 6 of the 34 points are its own statements and the rest belongs to one function literal inside it that branches (line 35). 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/subParsers/makemarkdown/image.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eab56379d2e4c9151cd5d20613126dd3c5a3b3dc391880d3b8e4d39a33562c7"}},{"ruleId":"D2","level":"warning","message":{"text":"commonmark.showdown.helper.cmScanDestination (cognitive 33): commonmark.showdown.helper.cmScanDestination has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/helpers/commonmark.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3589e552bb732241c43bee380706acad9f4d0a86a73fb749c7431ce55b94b0"}},{"ruleId":"D2","level":"warning","message":{"text":"githubCodeBlock.showdown.subParser(\u0022makehtml.githubCodeBlock\u0022)::parse (cognitive 33): githubCodeBlock.showdown.subParser(\u0022makehtml.githubCodeBlock\u0022)::parse has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (30 pts), boolean chains 2, ternaries 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/githubCodeBlock.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6464a7260b59615355fdebd55eb245a44c7b22bc1e6bf1c014d133fca84d32ea"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parse (cognitive 33): (anonymous)::parse has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (30 pts), boolean chains 2, ternaries 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/githubCodeBlock.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbb17d1e6bbaee470be6e82ede368429987856740638f887a84e548433c8312"}},{"ruleId":"D2","level":"warning","message":{"text":"_populateAttributes (cognitive 32): _populateAttributes has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 1 (4 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (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/helpers/misc.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c31847d206a9e66383bbf55bb16b3a40768b4614cfa8b78b924e39a385f40d"}},{"ruleId":"D2","level":"warning","message":{"text":"footnotes.showdown.subParser(\u0022makehtml.footnotes\u0022)::tryParseDefinition (cognitive 30): footnotes.showdown.subParser(\u0022makehtml.footnotes\u0022)::tryParseDefinition has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 6, loops 4, ternaries 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (footnotes.showdown.subParser(\u0022makehtml.footnotes\u0022)::hashInlineCodeSpans) 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/subParsers/makehtml/footnotes.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e89608e472e8e5e1d3355217569f9934b77e88a58c563ba706b04a185c839a4"}},{"ruleId":"D2","level":"warning","message":{"text":"htmlBlock.showdown.subParser(\u0022makehtml.htmlBlock\u0022)::parseCmHTMLBlocks (cognitive 30): htmlBlock.showdown.subParser(\u0022makehtml.htmlBlock\u0022)::parseCmHTMLBlocks has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (11 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (htmlBlock.showdown.subParser(\u0022makehtml.htmlBlock\u0022)::hashLegacyHTMLBlocks) 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/subParsers/makehtml/htmlBlock.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"447424d4c23ceb0b7cd10e66e81fe9137e79eb06fca529cce283a5f19c905208"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parseCmHTMLBlocks (cognitive 30): (anonymous)::parseCmHTMLBlocks has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (11 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/htmlBlock.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4d30df30d14470b77afaf60d9f1de52f75d46ffc6516cbb39275cb3a7c4d15"}},{"ruleId":"D2","level":"warning","message":{"text":"gfmAutolinks.showdown.helper.writeAnchorTag (cognitive 28): gfmAutolinks.showdown.helper.writeAnchorTag has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 7 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/helpers/gfmAutolinks.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba0ab81d2f92f2cc71ecf714b4fb0357a875025064f2374390c4d7b16607da0"}},{"ruleId":"D2","level":"warning","message":{"text":"rgxFindMatchPos (cognitive 26): rgxFindMatchPos has cognitive complexity 26 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 4 (8 pts), ternaries 2 (4 pts), boolean chains 3 (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/helpers/text.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da4fd86e97c63b1a632aa36d4c71a347b5eb8852f1d8f335ef6e7d32dd94982"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.expandInputs (cognitive 25): cli.expandInputs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (5 pts), error handling 1 (3 pts), boolean chains 1 (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/cli/cli.js"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f20b0855cdcf3ac24a2dea82da9a2dc40742c61e885b2be4c7b49bfeaa0873"}},{"ruleId":"D2","level":"warning","message":{"text":"codeSpan.parseBacktick (cognitive 25): codeSpan.parseBacktick has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 2, loops 1 (nesting depth added 13). 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/subParsers/makehtml/codeSpan.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aef8aab67cdd44072d979d6d7e40a48308b7770b7be8468dc297f194ab45879"}},{"ruleId":"D2","level":"warning","message":{"text":"list.showdown.subParser(\u0022makehtml.list\u0022)::itemLoose (cognitive 25): list.showdown.subParser(\u0022makehtml.list\u0022)::itemLoose has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (5 pts), boolean chains 3 (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. This shape REPEATS in the file: 3 other methods here (list.showdown.subParser(\u0022makehtml.list\u0022)::gatherItem, list.showdown.subParser(\u0022makehtml.list\u0022)::renderItem, list.showdown.subParser(\u0022makehtml.list\u0022)::parseList) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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/subParsers/makehtml/list.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"375e2d89bfc3e6528ceba724b9cbd33996c1b419102d8226b4d5e5ad5009d031"}},{"ruleId":"D2","level":"warning","message":{"text":"paragraphs.showdown.subParser(\u0022makehtml.paragraphs\u0022) (cognitive 25): paragraphs.showdown.subParser(\u0022makehtml.paragraphs\u0022) has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (4 pts), boolean chains 1 (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/subParsers/makehtml/paragraphs.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"23544fd2732896b282f224343b1ccd5bcf94452c7dd2b567198343fd399a2711"}},{"ruleId":"D2","level":"warning","message":{"text":"rawHtml.scanHTMLComment (cognitive 25): rawHtml.scanHTMLComment has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 2, loops 2 (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/subParsers/makehtml/rawHtml.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f649e686ce8b3e0edd2ffe4adfeb81d1c8a2570b4d8e68f46012a01fef1aaf4b"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parseSetextHeading::resolveMultilineFalsePositive (cognitive 25): (anonymous)::parseSetextHeading::resolveMultilineFalsePositive has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 3 (7 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/subParsers/makehtml/heading.js"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7298f110c93acf85bb0e9fa373174df576b1fbdf31ad9de76bf2aa9ab4b4b1"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::itemLoose (cognitive 25): (anonymous)::itemLoose has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (5 pts), boolean chains 3 (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/subParsers/makehtml/list.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d1ae89a7e4aa904460adc581dd5be3d2cc8498fc0e3a791c7b837b69f76003"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 25): (anonymous) has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (4 pts), boolean chains 1 (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/subParsers/makehtml/paragraphs.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa933b0081835847c8576bfa3eaf683be926a54908c59ec5465085484fd62fb"}},{"ruleId":"D2","level":"warning","message":{"text":"footnotes.showdown.subParser(\u0022makehtml.footnotes\u0022)::hashInlineCodeSpans (cognitive 24): footnotes.showdown.subParser(\u0022makehtml.footnotes\u0022)::hashInlineCodeSpans has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (9 pts), boolean chains 2 (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. This shape REPEATS in the file: one other method here (footnotes.showdown.subParser(\u0022makehtml.footnotes\u0022)::tryParseDefinition) 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/subParsers/makehtml/footnotes.js"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8401bab7255fc90572602ca7cb5697f1d1fe0873489a3a6b9f4e6c931f77871"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::hashInlineCodeSpans (cognitive 24): (anonymous)::hashInlineCodeSpans has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (9 pts), boolean chains 2 (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/subParsers/makehtml/footnotes.js"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fef0a2fadb0390507fb69914f7590240480adc104f52c61a844b5fa8c59aecc"}},{"ruleId":"D2","level":"warning","message":{"text":"table.showdown.subParser(\u0022makehtml.table\u0022)::parseTable (cognitive 23): table.showdown.subParser(\u0022makehtml.table\u0022)::parseTable has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (6 pts), loops 4 (5 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/subParsers/makehtml/table.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a1bea53ac1a5d4351bd7f954b311c7c05722ad6701dd19b380d9446d606a3d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parseAutolink (cognitive 23): (anonymous)::parseAutolink has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, ternaries 1 (3 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/subParsers/makehtml/autolink.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f428f739da9e09b4d4a3f5c78c38799369588a29f8bb2587cc2349f5054b17"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parseTable (cognitive 23): (anonymous)::parseTable has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (6 pts), loops 4 (5 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/subParsers/makehtml/table.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2b034c933406dbe6f73dd8c4b0a2fcfb5c36b422fb8e9e4ba4db26563b7fa7"}},{"ruleId":"D2","level":"warning","message":{"text":"dispatchCapture (cognitive 22): dispatchCapture has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 4 (6 pts), boolean chains 4 (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/event.js"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce286f3b07df148263f5ab6045b30c1c9c7713ecd35e50cd85b9049eb693539"}},{"ruleId":"D2","level":"warning","message":{"text":"coerceOptionValue (cognitive 21): coerceOptionValue has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, error handling 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/cli/cli.js"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"20867b932d29c97497f21521296ef5cbdc9b9c470a64479ffc77fae6a7dadd7a"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 21): (anonymous) has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 6, boolean chains 4, ternaries 1 (3 pts), error handling 1 (nesting depth added 5). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 4 function items inside it that branch (renderSection, a function literal at line 24, renderReference, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makemarkdown/footnotes.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d712155ede43f9af6a1bef92ea174a5831846dbd23cf9ffafb3371a9bffc6627"}},{"ruleId":"D2","level":"warning","message":{"text":"converter.showdown.Converter::_parseExtension (cognitive 20): converter.showdown.Converter::_parseExtension has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/converter.js"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a251d066ad529048257d1cf8f64ced24bfae8a7831c048bc55c98c5ea48bb4cf"}},{"ruleId":"D2","level":"warning","message":{"text":"hashHTMLSpans.showdown.helper.hashHTMLSpans::hashPairedTags (cognitive 20): hashHTMLSpans.showdown.helper.hashHTMLSpans::hashPairedTags has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (19 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/helpers/hashHTMLSpans.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f525e207b967a377ece38b14935c6d4ce72dabcd6ff2589f2fd1cdb46d54b8ce"}},{"ruleId":"D2","level":"warning","message":{"text":"autolink.showdown.subParser(\u0022makehtml.inline.autolink\u0022)::parseAutolink (cognitive 20): autolink.showdown.subParser(\u0022makehtml.inline.autolink\u0022)::parseAutolink has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4 (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/subParsers/makehtml/autolink.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"304f41a592f5d1241078cb73a84aa2732eec812779d2a8b057a998850b79867d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 20): (anonymous) has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 3 (7 pts), boolean chains 2 (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/subParsers/makehtml/image.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fef3f8f2f3e609269d9b3b85ae54d6634917e628f1cdf6b16a4de26f1f5d3f"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 20): (anonymous) has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 6). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 42). 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/subParsers/makemarkdown/links.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9db90fa8a7befc2b23ac81c12236b0f71b9df3e27b817e0a54cdb9afe262387"}},{"ruleId":"D2","level":"warning","message":{"text":"nakedUrl.trimUrlPunctuation (cognitive 19): nakedUrl.trimUrlPunctuation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (6 pts), loops 2 (nesting depth added 8). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item 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/subParsers/makehtml/nakedUrl.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8251ce3b145a6d6e343edc960321703f698582073525cdcbe02fcb95640acfc8"}},{"ruleId":"D2","level":"warning","message":{"text":"heading.showdown.subParser(\u0022makehtml.heading.setext\u0022)::parseSetextHeading::resolveMultilineFalsePositive (cognitive 18): heading.showdown.subParser(\u0022makehtml.heading.setext\u0022)::parseSetextHeading::resolveMultilineFalsePositive has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2 (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/subParsers/makehtml/heading.js"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f65c3789bd3ed286a99d3dac04b13fe2d691d48cfa927639cc3507e3a6b4d75"}},{"ruleId":"D2","level":"warning","message":{"text":"footnotes.showdown.subParser(\u0022makeMarkdown.footnotes\u0022) (cognitive 18): footnotes.showdown.subParser(\u0022makeMarkdown.footnotes\u0022) has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 6, boolean chains 4, error handling 1 (nesting depth added 3). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 4 function items inside it that branch (renderSection, a function literal at line 24, renderReference, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makemarkdown/footnotes.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b5cf6a752b65c6cf9707f891cb9ad05171f6a8f00f23c1fbd6a794dd8e7c45"}},{"ruleId":"D2","level":"warning","message":{"text":"Converter::makeMarkdown::substitutePreCodeTags (cognitive 18): Converter::makeMarkdown::substitutePreCodeTags has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 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/converter.js"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef0e644babdf86cda57f07731abadc7f20a370c5adf312a08129d8f39b65653"}},{"ruleId":"D2","level":"warning","message":{"text":"completeHTMLDocument.showdown.subParser(\u0022makehtml.completeHTMLDocument\u0022) (cognitive 17): completeHTMLDocument.showdown.subParser(\u0022makehtml.completeHTMLDocument\u0022) has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/completeHTMLDocument.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5fef5e7ef58056a71044d3804a056974a774063fc2e1d00ffdfe7db21146bd"}},{"ruleId":"D2","level":"warning","message":{"text":"htmlBlock.showdown.subParser(\u0022makehtml.htmlBlock\u0022)::hashLegacyHTMLBlocks (cognitive 17): htmlBlock.showdown.subParser(\u0022makehtml.htmlBlock\u0022)::hashLegacyHTMLBlocks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (htmlBlock.showdown.subParser(\u0022makehtml.htmlBlock\u0022)::parseCmHTMLBlocks) 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/subParsers/makehtml/htmlBlock.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf490f4335918c199386b12a7fdcb1a22790cb32805339694dae988fb1358269"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 17): (anonymous) has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/completeHTMLDocument.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe4a3793f790f8cb8945adf7b590ed0b5a8d60b47f1529257e236f0d883692a"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::hashLegacyHTMLBlocks (cognitive 17): (anonymous)::hashLegacyHTMLBlocks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/htmlBlock.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e171d648cd9b629d3d7e872800ecd6802d722ae47c58bec77c29e39f474200fd"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 17): (anonymous) has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 2, ternaries 1 (2 pts) (nesting depth added 4). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (hasFollowingContent, isInsideListItem). 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/subParsers/makemarkdown/input.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3a7dbba7f80910e3c2b936c1b7d2c0cfc6a47446b6d4f3a378c86e1b600fd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: converter.showdown.Converter: FunctionTooLong \u2014 showdown.Converter runs 253 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 153 over it, 2.53\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/converter.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fadadead99280f86ea890e47299663dabe79779afdfa207a986ab9546b7b223"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: footnotes.showdown.subParser(\u0022makehtml.footnotes\u0022): FunctionTooLong \u2014 showdown.subParser(\u0022makehtml.footnotes\u0022) runs 183 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\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/subParsers/makehtml/footnotes.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"687f3a6079e1a37ba34cfd0a5e8e11d5185c2ba3131d1b36cdcf18e826028ed4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: node.showdown.subParser(\u0022makeMarkdown.node\u0022): FunctionTooLong \u2014 showdown.subParser(\u0022makeMarkdown.node\u0022) runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\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/subParsers/makemarkdown/node.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f14633ca6157ef0eeb94146b777895fac6c20b5d8824e4a4d6d9e14988e405e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: blockquote.showdown.subParser(\u0022makehtml.blockquote\u0022): FunctionTooLong \u2014 showdown.subParser(\u0022makehtml.blockquote\u0022) runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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/subParsers/makehtml/blockquote.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeeb1c58bfba05da2f6b02c883c9580cd2a2b00f5ebe3c71847b31c384bd6702"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: table.showdown.subParser(\u0022makeMarkdown.table\u0022): FunctionTooLong \u2014 showdown.subParser(\u0022makeMarkdown.table\u0022) runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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/subParsers/makemarkdown/table.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9577c7340c319b544a41c1b405ae23ecea0b6799b80f4680f0486cf643c5e5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Event (LCOM4 8): Event\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/event.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c258683ac0a3460981ed99cc474314d189e1da17d62ad137d5f556b69c9b7d"}},{"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 vitest but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060@vitest/coverage-v8\u0060 (or \u0060@vitest/coverage-istanbul\u0060) as a devDependency. 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: setOption() should set option foo=baz: 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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":"test/unit/showdown.Converter.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"751009dca9f6d44adb020564419d6d68fc742cb47f14fa69a4879bb24a489116"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should register a listener extension: 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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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":"test/unit/showdown.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"987a2dad9628a56ef5ab432e26270258a96a9ba7eafdb8d5384f1c8683f41bf9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/converter.js: src/converter.js changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in converter.showdown.Converter at line 146. 3 of those changes were fix/bug commits, and the other 25 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-05-21..2026-08-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-21 19:37:12 \u002B01:00\u0027 --until=\u00272026-08-19 19:37:12 \u002B01:00\u0027 --full-history --no-merges -- src/converter.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/converter.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a3c8f21696b9934aebba4dfe4f4df8b59de002cf0abfd71c2200d4d3ddb3ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/subParsers/makehtml/link.js: src/subParsers/makehtml/link.js changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in link.showdown.subParser(\u0022makehtml.inline.link\u0022) at line 39. 4 of those changes were fix/bug commits, and the other 20 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-05-21..2026-08-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-21 19:37:12 \u002B01:00\u0027 --until=\u00272026-08-19 19:37:12 \u002B01:00\u0027 --full-history --no-merges -- src/subParsers/makehtml/link.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/link.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca16b0e4382f246a3f6cbb7ad35ef1893f5680d52e3f6e2a9796f9525f6f66d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/subParsers/makehtml/spanGamut.js: src/subParsers/makehtml/spanGamut.js changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in spanGamut.showdown.subParser(\u0022makehtml.spanGamut\u0022) at line 381. 1 of those changes was a fix/bug commit, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-05-21..2026-08-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-21 19:37:12 \u002B01:00\u0027 --until=\u00272026-08-19 19:37:12 \u002B01:00\u0027 --full-history --no-merges -- src/subParsers/makehtml/spanGamut.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/spanGamut.js"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab2a486f53942a14659190ef2baab92fd1cb2f43fa2f8110be595adb239e55e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/subParsers/makehtml/stripLinkDefinitions.js: src/subParsers/makehtml/stripLinkDefinitions.js changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in stripLinkDefinitions.showdown.subParser(\u0022makehtml.stripLinkDefinitions\u0022) at line 17. 2 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-05-21..2026-08-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-21 19:37:12 \u002B01:00\u0027 --until=\u00272026-08-19 19:37:12 \u002B01:00\u0027 --full-history --no-merges -- src/subParsers/makehtml/stripLinkDefinitions.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/stripLinkDefinitions.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc168eb178b73bdff5e537b93942979729a36f4b6f125b56988831408cc52d1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/showdown.js: src/showdown.js changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in showdown.validate at line 278. 2 of those changes were fix/bug commits, and the other 26 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-05-21..2026-08-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-21 19:37:12 \u002B01:00\u0027 --until=\u00272026-08-19 19:37:12 \u002B01:00\u0027 --full-history --no-merges -- src/showdown.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/showdown.js"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6d709577181f4a5673526586d1c45553eeab5037e3b401d8c3651044148ad5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/subParsers/makehtml/heading.js: src/subParsers/makehtml/heading.js changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in heading.showdown.subParser(\u0022makehtml.heading.setext\u0022) at line 166. 5 of those changes were fix/bug commits, and the other 15 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-05-21..2026-08-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-21 19:37:12 \u002B01:00\u0027 --until=\u00272026-08-19 19:37:12 \u002B01:00\u0027 --full-history --no-merges -- src/subParsers/makehtml/heading.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/heading.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86c167781e74c5593fed4de67963c10ec7ae4a1626007c0da712d066195c817"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/cli.js: src/cli/cli.js changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in cli.conversionCommand at line 685. 3 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-05-21..2026-08-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-21 19:37:12 \u002B01:00\u0027 --until=\u00272026-08-19 19:37:12 \u002B01:00\u0027 --full-history --no-merges -- src/cli/cli.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/cli.js"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8ca4e795837c4f1aba9aa751feafad609b32211c4bd7640f61a786bf7c5af9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/subParsers/makemarkdown/node.js: src/subParsers/makemarkdown/node.js changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in node.showdown.subParser(\u0022makeMarkdown.node\u0022) at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-21..2026-08-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-21 19:37:12 \u002B01:00\u0027 --until=\u00272026-08-19 19:37:12 \u002B01:00\u0027 --full-history --no-merges -- src/subParsers/makemarkdown/node.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makemarkdown/node.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98a890ff71a8eb0ea79f18e1f38aed9e2059bdf518b60daa166578b9252aa93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/subParsers/makehtml/blockquote.js: src/subParsers/makehtml/blockquote.js changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in blockquote.showdown.subParser(\u0022makehtml.blockquote\u0022) at line 14. 2 of those changes were fix/bug commits, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-05-21..2026-08-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-21 19:37:12 \u002B01:00\u0027 --until=\u00272026-08-19 19:37:12 \u002B01:00\u0027 --full-history --no-merges -- src/subParsers/makehtml/blockquote.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/blockquote.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"73cb790bb81cad142efe468a376b881249eb10e2c057a346508d97b46fc3aa0c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/subParsers/makehtml/footnotes.js: src/subParsers/makehtml/footnotes.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in footnotes.showdown.subParser(\u0022makehtml.footnotes\u0022) at line 14. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-05-21..2026-08-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-21 19:37:12 \u002B01:00\u0027 --until=\u00272026-08-19 19:37:12 \u002B01:00\u0027 --full-history --no-merges -- src/subParsers/makehtml/footnotes.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/footnotes.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a2cea20f4be58031e67ba4143fa42e3915e531e8e96b61308b49e26c76af6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/subParsers/makemarkdown/table.js: src/subParsers/makemarkdown/table.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in table.showdown.subParser(\u0022makeMarkdown.table\u0022) at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-21..2026-08-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-21 19:37:12 \u002B01:00\u0027 --until=\u00272026-08-19 19:37:12 \u002B01:00\u0027 --full-history --no-merges -- src/subParsers/makemarkdown/table.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makemarkdown/table.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ada7b4af81296afe5a441b763b50c7405a3a055212f69eadd19c4939287afe8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/subParsers/makehtml/githubCodeBlock.js: src/subParsers/makehtml/githubCodeBlock.js changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in githubCodeBlock.showdown.subParser(\u0022makehtml.githubCodeBlock\u0022) at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-21..2026-08-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-21 19:37:12 \u002B01:00\u0027 --until=\u00272026-08-19 19:37:12 \u002B01:00\u0027 --full-history --no-merges -- src/subParsers/makehtml/githubCodeBlock.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/githubCodeBlock.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6d569d7456fe77955abc9c5f56db6f4f57016d90b5f1c259a4c8e4e48752f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/subParsers/makemarkdown/image.js: src/subParsers/makemarkdown/image.js changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in image.showdown.subParser(\u0022makeMarkdown.image\u0022) at line 10. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-21..2026-08-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-21 19:37:12 \u002B01:00\u0027 --until=\u00272026-08-19 19:37:12 \u002B01:00\u0027 --full-history --no-merges -- src/subParsers/makemarkdown/image.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makemarkdown/image.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a224ec7fe03b42621c2fac9b6fcb69115bc6c2fc7cb3d04940dcb2de2e77b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/subParsers/makehtml/strikethrough.js: src/subParsers/makehtml/strikethrough.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in strikethrough.showdown.subParser(\u0022makehtml.inline.strikethrough.pair\u0022) at line 68. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-21..2026-08-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-21 19:37:12 \u002B01:00\u0027 --until=\u00272026-08-19 19:37:12 \u002B01:00\u0027 --full-history --no-merges -- src/subParsers/makehtml/strikethrough.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/strikethrough.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c005d4c8550df27df15fead209589975a512a2d2652753f1164b02aa67ac093"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/subParsers/makehtml/htmlBlock.js: src/subParsers/makehtml/htmlBlock.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in htmlBlock.showdown.subParser(\u0022makehtml.htmlBlock\u0022) at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-21..2026-08-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-21 19:37:12 \u002B01:00\u0027 --until=\u00272026-08-19 19:37:12 \u002B01:00\u0027 --full-history --no-merges -- src/subParsers/makehtml/htmlBlock.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/htmlBlock.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"997357a424ad50d6e56382713e4a8c2af4158e2ae4e89d8c21dd10798018fa75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/event.js: src/event.js changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in event.showdown.Event.dispatchCapture at line 366. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-21..2026-08-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-21 19:37:12 \u002B01:00\u0027 --until=\u00272026-08-19 19:37:12 \u002B01:00\u0027 --full-history --no-merges -- src/event.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/event.js"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"5143273bd444f77538702cd683e17b76ce57e55b6dab2d08662e277152087ae8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/helpers/gfmAutolinks.js: src/helpers/gfmAutolinks.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in gfmAutolinks.showdown.helper.writeAnchorTag at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-21..2026-08-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-21 19:37:12 \u002B01:00\u0027 --until=\u00272026-08-19 19:37:12 \u002B01:00\u0027 --full-history --no-merges -- src/helpers/gfmAutolinks.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/helpers/gfmAutolinks.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2606015e9130edf6f0196bbac4b08bafe8a4928bc1a1c898709df4d772e87e82"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/subParsers/makemarkdown/footnotes.js: src/subParsers/makemarkdown/footnotes.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in footnotes.showdown.subParser(\u0022makeMarkdown.footnotes\u0022) at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-21..2026-08-19, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-21 19:37:12 \u002B01:00\u0027 --until=\u00272026-08-19 19:37:12 \u002B01:00\u0027 --full-history --no-merges -- src/subParsers/makemarkdown/footnotes.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makemarkdown/footnotes.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88cd0c2166d6ebc5e7aac351d79a8590c4e20daf26efcf789d6c7595bb91f72"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 48 significant file(s) lose their only recent owner: src/subParsers/makehtml/spanGamut.js, src/cli/cli.js, src/subParsers/makehtml/list.js, src/converter.js, src/subParsers/makehtml/heading.js, src/subParsers/makehtml/htmlBlock.js, src/subParsers/makehtml/nakedUrl.js, src/event.js (\u002B40 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"904533782d1f838cd2992f771b4af875f0d8d32cde044d1a29aa5def03221312"}},{"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. ADRs are expected here because \u0060package.json\u0060 makes this repository a deployable product (line 71)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f571cc2c2542badcf90ae46e31e24c43d9ca80090c40fca9fd1434a5c34546"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022unescape html entities in content\u0022 repeats the code it sits on: 4 of its 4 words (unescape, html, entities, content) are already in \u0060content = showdown.helper.unescapeHTMLEntities(content);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/converter.js"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fb707ef6aa39e67e4a32fa38d64751cdb7942a37a5c9b994ae0cc573841dff"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022render the node list\u0022 repeats the code it sits on: 3 of its 3 words (render, node, list) are already in \u0060return stack.renderList(renderNode);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/spanGamut.js"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83cd277f8ebe73a6f4a31492c136539d5b53edde0d20490914eca000d2967b0"}},{"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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d05817332f792eb326c4d4d7d5e1ec405d41442661f39d16cb80d41190abe7fd"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ef117e1eacebfd807cf4fece5ebf326d0116024dfd02fe2600f7e62ed401fe9"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03985eeb5bff7e2b8f3f085ab5180cade2e721ca47407dae3d086ba24160622a"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"595af736e41d53ed92822f5ce43b1d6a264708ad631874f6fa8353537426f174"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3216db03bb8d25d80a6d639e662c3fe69ef273f3b2298267372cc099d862707"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce1125404fd8037ada7f8d1c687a8b98e9fea966f72ad9d3fda6995907ac754e"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7dc1b8fe2fbf7d63735ba2ca0e725e389d652a18f778cea370af77f8e9418e2e"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c34b530e6ce99e9ef5bd2267ef095c308ccbef4ef8c99b80988dc7123987e669"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2f1e2d9c359e66b76754a252e3eeedf87993f8d7859d162f66e851486fe14c70"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9afb6f9051e9c086e717257b81262382f2067c286c34c5f5a3c1b7f117fe4536"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3362df14127d8418b7f7cf194a6e3e310d0a259cc3d6c2ad2e2a0e840500670c"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"d6821733bbbfe5765082722fb150c9f8d8ea56639f9381a568c6291bd8c64cc0"},"properties":{"dependency":{"package":"@simple-git/argv-parser","version":"1.1.1","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":"f95758a2552a136be86846d43eeeb3a532f1aa4c9d5d6e776da51760ee89ee94"},"properties":{"dependency":{"package":"simple-git","version":"3.36.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE 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":"af424b73bee4b88feab78ce3159faffc377acc09d77108eed102e0f7ac960362"},"properties":{"dependency":{"package":"@grpc/grpc-js","version":"1.14.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[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":"eb354110d4b9e8b10e4103c9441c209949e03ab05dbabeaa342188f4dfcd03a4"},"properties":{"dependency":{"package":"basic-ftp","version":"5.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE 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":"e7dad34d8e10536415bf38ced50e8654937ec9bbe89af5b7a934352188cee76c"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE 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":"9d861d97c9e6c69cb47d2f5bc645ecdddee4776c7500c34080ca158cbba2b714"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.5","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":"ec98ce9551df602242a7f118a0edde5356cbd1400c0abc82227a52f1a97280a6"},"properties":{"dependency":{"package":"follow-redirects","version":"1.16.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE 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":"9478d9baf6a0802f602dd2dbd1f6c9d8b34235a65e987e619ac6b9cd31d1c54f"},"properties":{"dependency":{"package":"brace-expansion","version":"2.1.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE 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":"b8f60ddd284a0ee123ef9d952609592132c876f8a457e6c0343c28a43505c2ef"},"properties":{"dependency":{"package":"happy-dom","version":"20.11.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"src/helpers/lazyDocument.js","line":24}}}},{"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":"e1171b6563be799878964ba4f452e3955e7471764fc37013b976361533d3de57"},"properties":{"dependency":{"package":"js-yaml","version":"4.3.1","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":"a24cb75230937b09893789889a16c0a9d5fde4dd73a0346e86cd6b4e7af3c3a9"},"properties":{"dependency":{"package":"js-yaml","version":"3.15.1","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":"a143e49def50f6267786be10dea52190e0d09245364207bf6c8be5fcae3b49ff"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","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":"b694dace86fb7d15873b2ddd65002632093db12bc6146d23cde087273cc549f5"},"properties":{"dependency":{"package":"vite","version":"8.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA 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":"cf3efdab7f9486659511cd5c3b55773bb474b1f054cfd0a4b6adb62b94a1e84e"},"properties":{"dependency":{"package":"@vitest/mocker","version":"4.1.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[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":"254e159535de5a467ea5671a4a81fbc3bf399623b11dcd1fc4071f2230ac5cd0"},"properties":{"dependency":{"package":"glob","version":"10.5.0","advisory":"[GHSA redacted]","aliases":["[CVE 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":"eb2467624ccb328fbdf3dbe3c13448df535776614f1fe9fcec992da59afe0052"},"properties":{"dependency":{"package":"minimatch","version":"9.0.9","advisory":"[GHSA redacted]","aliases":["[CVE 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":"ef7b61662aad73439eec0d494cf24b1cb31c781694acbc07a155ba26d21c4c4f"},"properties":{"dependency":{"package":"ip-address","version":"10.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA 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":"3ad5a24eb9bd18957d94482e87821df5f89e17a38ba5c81b49822e403ba45c1a"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE 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":"98645b36f3d8a19e1462b10ae8d23a6853b810993981c4fc4065e762fff2771b"},"properties":{"dependency":{"package":"qs","version":"6.15.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: converter.js \u2194 paragraphs.js: \u0060src/converter.js\u0060 and \u0060src/subParsers/makehtml/paragraphs.js\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060fc20ad47\u0060 refactor(converter): one block-stage ordering and role-based raw stores; \u0060245fdb69\u0060 fix(commonmark): keep entities in raw HTML blocks verbatim; \u006071a58739\u0060 fix(HTMLParser): fix code tags parsing (at that commit the file was still \u0060src/subParsers/paragraphs.js\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/converter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"235a3dac1ba209e10ea3700da37369519c4b6fe32c6f76bfc18a49028c1b7112"}},{"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":"69a115ceae9b824becd13280b353d09967ea287b4fd3c73d2774b400a9974864"},"taxa":[{"id":"CICD-SEC-1","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c593d4dbd23724f337bfb8d2c1653812f143ae255bd9b59d4b3e9c37779fa6f4"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"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":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch pip: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060pip\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf68ee1ea2969cbbdae4336ca738b5320c565628ea6ee894219d523831dd0f17"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 115 plain JS \u2014 the untyped files are scripts/build-testbundle.mjs, scripts/build.mjs, scripts/changelog.mjs, scripts/concat.mjs, scripts/extract-commonmark.mjs, scripts/extract-spec-tests.mjs (\u002B109 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (24 matched lines \u00D7 2 locations): src/helpers/hashHTMLBlocks.js:55 \u00B7 src/subParsers/makehtml/htmlBlock.js:157 \u2014 the two spans are one implementation copied and then locally edited \u2014 237 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/helpers/hashHTMLBlocks.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec438870611d2e70310389d60f7771fe587f35e5230c0817146567f4b17262d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/subParsers/makemarkdown/blockquote.js:11 \u00B7 src/subParsers/makemarkdown/paragraph.js:10 \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/subParsers/makemarkdown/blockquote.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1f5327b61d1abee238b31ece76e706c87df7d25b95a10ffe0ff5a3726d587c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/subParsers/makemarkdown/emphasis.js:26 \u00B7 src/subParsers/makemarkdown/header.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/subParsers/makemarkdown/emphasis.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8ae322f1d1fd4044614520653b8788c296aa8f5e70af3cc839270c4f9286c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/subParsers/makemarkdown/break.js:10 \u00B7 src/subParsers/makemarkdown/hr.js:10 \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/subParsers/makemarkdown/break.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bda99adf6b128d1fe51f3169fc59dfa2ab4404f147d129a9d3c0a9336796e4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/subParsers/makehtml/hardLineBreaks.js:53 \u00B7 src/subParsers/makehtml/horizontalRule.js:102 \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/subParsers/makehtml/hardLineBreaks.js"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d9fe8e0e70faafc112b14bc59b9ae0e481fd1bd1d2663d0986e8ba1936e460"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/subParsers/makemarkdown/image.js:22 \u00B7 src/subParsers/makemarkdown/links.js:29 \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/subParsers/makemarkdown/image.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7559eaa6135a0fe5ab4df701433e6b675f791558b68ed0222e398a152bc5b81a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/subParsers/makehtml/blockquote.js:14 \u00B7 src/subParsers/makehtml/list.js:19 \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/subParsers/makehtml/blockquote.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f501745aa3cc7a9b61a1699974c2ca60772c9516239aa8c2230e6681d6d7aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/subParsers/makehtml/spanGamut.js:541 \u00B7 src/subParsers/makehtml/spanGamut.js:570 \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/subParsers/makehtml/spanGamut.js"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"6955962e10c635f4c16f59d17352572e2463ac70bfe3fc2b34c5e21fa190447b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6 locations): src/subParsers/makemarkdown/footnotes.js:36 \u00B7 src/subParsers/makemarkdown/listItem.js:48 \u00B7 src/subParsers/makemarkdown/paragraph.js:27 \u00B7 src/subParsers/makemarkdown/table.js:191 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 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 6 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/subParsers/makemarkdown/footnotes.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b0e882f53c8d6c236914ea3ae9a59faacd21894c35f641549e0614bee18bc0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/subParsers/makehtml/autolink.js:43 \u00B7 src/subParsers/makehtml/link.js:218 \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/subParsers/makehtml/autolink.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcc2f4c4b14b59fdaf5273cfda10e6402f965008b4d36e6063bcde23bb478f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/subParsers/makehtml/blockquote.js:48 \u00B7 src/subParsers/makehtml/ellipsis.js:36 \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/subParsers/makehtml/blockquote.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5f590c5f29b573ee27a92ba623aa1cfc1813f7d6b7fd880760e1519d036809"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/subParsers/makehtml/disallowedHtmlTags.js:39 \u00B7 src/subParsers/makehtml/table.js:102 \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/subParsers/makehtml/disallowedHtmlTags.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b971ccc84e3978b8d88ddb20641dfca7a34ecf418d366c82315cb5e5a2b6bfd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/cli/cli.js:53 \u00B7 src/cli/cli.js:71 \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/cli/cli.js"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e80bcffe629e5f1728d1fae6132d554d0d48ccae16625dd7e9679729814a57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/helpers/commonmark.js:196 \u00B7 src/subParsers/makehtml/stripLinkDefinitions.js:142 \u2014 the two spans are one implementation copied and then locally edited \u2014 82 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/helpers/commonmark.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fa11dc32e9bc66b7e4d9d02c41e6a5ec60e6fb2c7a55fbbec45b485d10a859"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/subParsers/makehtml/horizontalRule.js:29 \u00B7 src/subParsers/makehtml/horizontalRule.js:57 \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/subParsers/makehtml/horizontalRule.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"429c92be7a06fa99f6a8cab10906abada34a977da4dd9d89f50b6b8bc3899feb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/subParsers/makehtml/link.js:76 \u00B7 src/subParsers/makehtml/stripLinkDefinitions.js:201 \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/subParsers/makehtml/link.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2250ee8fb6f8378a95789615bbcc92b1eb93be1f77d933321db38ca30cfbee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/subParsers/makemarkdown/codeBlock.js:21 \u00B7 src/subParsers/makemarkdown/emphasis.js:40 \u00B7 src/subParsers/makemarkdown/header.js:27 \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/subParsers/makemarkdown/codeBlock.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"742d48621429e032fcee03c1e0b86a226b67e8ddbf6536066ee708c8aa3650a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/subParsers/makemarkdown/paragraph.js:10 \u00B7 src/subParsers/makemarkdown/tableCell.js:10 \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/subParsers/makemarkdown/paragraph.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cd3d5c3c0dfecffb02c21badb399646b6615eb14fc875acff5ee27373e3644"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/subParsers/makehtml/autolink.js:43 \u00B7 src/subParsers/makehtml/emphasis.js:88 \u00B7 src/subParsers/makehtml/link.js:218 \u2014 the 3 copies are spread across 3 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/subParsers/makehtml/autolink.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ae72ffda2282957bd8d72bb2f062edb4147d756c29c0d6854f0686181f3008"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/subParsers/makehtml/codeBlock.js:59 \u00B7 src/subParsers/makehtml/githubCodeBlock.js:148 \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/subParsers/makehtml/codeBlock.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a97ef7732cd8ace12771d850f5f17868f85082949c50f0e8927c6aeecbd021"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/subParsers/makehtml/codeBlock.js:48 \u00B7 src/subParsers/makehtml/githubCodeBlock.js:116 \u2014 the two spans are one implementation copied and then locally edited \u2014 81 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/subParsers/makehtml/codeBlock.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae209f6f2ac7f437f6c383aac0d8e2656215f077a57dd8c232a2ba002c4a701a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/subParsers/makehtml/codeSpan.js:105 \u00B7 src/subParsers/makehtml/htmlBlock.js:72 \u00B7 src/subParsers/makehtml/list.js:556 \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/subParsers/makehtml/codeSpan.js"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1d46608aa459b8ce3aa2541895d7b2e9480734dd35b4fb0ed47469e4e5dd9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/subParsers/makehtml/heading.js:272 \u00B7 src/subParsers/makehtml/heading.js:283 \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/subParsers/makehtml/heading.js"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9e6b4df13c7be51ae4deb429704aa9d655e3dc5e7ffd271973ea9713fa7318"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 10 locations): src/subParsers/makemarkdown/blockquote.js:28 \u00B7 src/subParsers/makemarkdown/codeSpan.js:19 \u00B7 src/subParsers/makemarkdown/footnotes.js:36 \u00B7 src/subParsers/makemarkdown/input.js:36 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 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 10 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/subParsers/makemarkdown/blockquote.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0692cebb0359f2a1d12407b36234b7e6508d7f4cf514832498756df27b0476c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/subParsers/makemarkdown/codeSpan.js:21 \u00B7 src/subParsers/makemarkdown/header.js:29 \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/subParsers/makemarkdown/codeSpan.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eadb57cb5e7b47ffa8310c272c66fafa9fd7b19dcef73d17dad6e7024b4c8c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): src/subParsers/makehtml/autolink.js:43 \u00B7 src/subParsers/makehtml/image.js:74 \u00B7 src/subParsers/makehtml/link.js:218 \u00B7 src/subParsers/makehtml/taskListItem.js:58 \u2014 the 4 copies are spread across 4 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/subParsers/makehtml/autolink.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0bbb61b90f42c9547c6828dd9fe2632adcea6b4ce4b32dc6640d522cca2725"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/subParsers/makehtml/ellipsis.js:35 \u00B7 src/subParsers/makehtml/paragraphs.js:42 \u00B7 src/subParsers/makehtml/strikethrough.js:152 \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/subParsers/makehtml/ellipsis.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35c8385e3d287e1f13f3b370234fc2c9e5c7f144adeb3f3eb28b2a8861cc04a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/subParsers/makehtml/image.js:74 \u00B7 src/subParsers/makehtml/link.js:218 \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/subParsers/makehtml/image.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"33add795b314dd7eee70715cb30e60fd4b40fd78e6145925b22333c855fdcff4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/subParsers/makehtml/strikethrough.js:154 \u00B7 src/subParsers/makehtml/underline.js:123 \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/subParsers/makehtml/strikethrough.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fb3f411e273ee348cc7370f11aaf3969b16d4c8e38c7ce2b8b07ddc4418de1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 14 locations): src/subParsers/makemarkdown/blockquote.js:30 \u00B7 src/subParsers/makemarkdown/codeBlock.js:23 \u00B7 src/subParsers/makemarkdown/codeSpan.js:21 \u00B7 src/subParsers/makemarkdown/emphasis.js:42 \u00B7 \u002B10 more site(s) not listed \u2014 the 14 copies are spread across 14 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/subParsers/makemarkdown/blockquote.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56d37acb0269ebc76d49691b61a20f8c2bf25f7e3b0da748c6fad7bd10f79f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/subParsers/makemarkdown/header.js:14 \u00B7 src/subParsers/makemarkdown/links.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/subParsers/makemarkdown/header.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a43fb23eb22ad13871c88cb8de037b8637a052624a71668f7b574a518895789"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/subParsers/makemarkdown/node.js:89 \u00B7 src/subParsers/makemarkdown/node.js:98 \u00B7 src/subParsers/makemarkdown/node.js:116 \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/subParsers/makemarkdown/node.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f597fea1d4620c7746467603f2738ffb992ceecdc15198627247e95fec71772"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/subParsers/makemarkdown/table.js:57 \u00B7 src/subParsers/makemarkdown/table.js:69 \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/subParsers/makemarkdown/table.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"df753c503384c43c1f1d1bf73dc16e510dfa4ab23a71b12b4aaee0338285c7b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/subParsers/makehtml/link.js:236 \u00B7 src/subParsers/makehtml/stripLinkDefinitions.js:154 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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/subParsers/makehtml/link.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"651e1d7d80e759149168958bf03dddffb35d3ac952b30755e4b0f62df97a1ec0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): src/subParsers/makemarkdown/footnotes.js:18 \u00B7 src/subParsers/makemarkdown/listItem.js:10 \u00B7 src/subParsers/makemarkdown/table.js:10 \u00B7 src/subParsers/makemarkdown/txt.js:10 \u2014 the 4 copies are spread across 4 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/subParsers/makemarkdown/footnotes.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b789a2878d090adf913c8dc6d2b5cf30e3f789bd5d594d747481c9552c690d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/helpers/commonmark.js:241 \u00B7 src/subParsers/makehtml/footnotes.js:100 \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/helpers/commonmark.js"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"382fd321a5be5f4a933346ca94f5c566b210ac5c052c3822701a5771e32631a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 60, cognitive 57): (anonymous) has cyclomatic complexity 60 and cognitive complexity 57; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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/subParsers/makemarkdown/node.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2273122b2fa5e0b81e48323bf5d3affd5df2ff03a817ca7235e13780708422a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCmInline (cyclomatic 59, cognitive 105): parseCmInline has cyclomatic complexity 59 and cognitive complexity 105; 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/subParsers/makehtml/spanGamut.js"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe12105d42f0f320c3ef676ff2d720391ee994d76adb16a2f39a63aa40f0b64a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryParseCmDefinition (cyclomatic 56, cognitive 77): tryParseCmDefinition has cyclomatic complexity 56 and cognitive complexity 77; 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/subParsers/makehtml/stripLinkDefinitions.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfc2dc80efaedc125867641300ce99399a5f1ed008fd62756f1c7e940a5ab88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 47, cognitive 98): (anonymous) has cyclomatic complexity 47 and cognitive complexity 98; 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/subParsers/makehtml/link.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"698985dc54e40a084bfb1a6cfd5e7c38eac0779a2d62691574cd0dff07cc64fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function conversionCommand (cyclomatic 43, cognitive 46): conversionCommand has cyclomatic complexity 43 and cognitive complexity 46; 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/cli/cli.js"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bddefbdcebc1cd418e0602e2b4f27cd13cbc6e71dd74361ed0a29310047b86c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseList (cyclomatic 34, cognitive 66): parseList has cyclomatic complexity 34 and cognitive complexity 66; 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/subParsers/makehtml/list.js"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fede76af8a078772b3e677638fd171e1d2b292ceae0c9bba2c5d968f34944e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 33, cognitive 52): (anonymous) has cyclomatic complexity 33 and cognitive complexity 52; 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/subParsers/makemarkdown/table.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bd9f2a10c597cdecf66f1fcaa1088fc07fbe87b78f23e7978024fee75133a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pushDelim (cyclomatic 33, cognitive 39): pushDelim has cyclomatic complexity 33 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/subParsers/makehtml/spanGamut.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8f52f8e7ccc1748161d1365b2024fefb86480e350e3912973bf701f1f13d3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function URLUtils (cyclomatic 30, cognitive 36): URLUtils has cyclomatic complexity 30 and cognitive complexity 36; 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/helpers/url.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0b6efd985ed99bc9c518bf9f6d9612dfad96b1c8502fc0258bda96103ad65d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processEmphasis (cyclomatic 28, cognitive 48): processEmphasis has cyclomatic complexity 28 and cognitive complexity 48; 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/subParsers/makehtml/spanGamut.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"caec4d2a8df6957396c9fe8324ea31f5c31ded80dbedcb0769875e224b76f2a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderItem (cyclomatic 27, cognitive 46): renderItem has cyclomatic complexity 27 and cognitive complexity 46; 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/subParsers/makehtml/list.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"b978429bc54b43102bfc066292277dde140037d9092e78073124482d21d2cb2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryParseDefinition (cyclomatic 27, cognitive 36): tryParseDefinition has cyclomatic complexity 27 and cognitive complexity 36; 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/subParsers/makehtml/footnotes.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee54c3440bf933bf4637db2e3d0c537caf716b96024181b1efe03b75a84563e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 26, cognitive 56): validate has cyclomatic complexity 26 and cognitive complexity 56; 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/showdown.js"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2cbf0ed32126216f77d686eda3503f8733a214ee3eed47f5c123ff3c6cb8b2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gatherItem (cyclomatic 23, cognitive 40): gatherItem has cyclomatic complexity 23 and cognitive complexity 40; 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/subParsers/makehtml/list.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b411dddbc7cdd9249e317948586f8124f8a5c13e82230c6994414f37b9e92992"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cmScanDestination (cyclomatic 22, cognitive 33): cmScanDestination has cyclomatic complexity 22 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/helpers/commonmark.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"915573ea4cbcaaa650fe96a7f3b6162a6616144643d143d26e19669bab6ae835"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 32): (anonymous) has cyclomatic complexity 22 and cognitive complexity 32; 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/subParsers/makehtml/strikethrough.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01716474e705e1c515ae080642fd64988a87da9bb83198e3013f4463bf4a369"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeAnchorTag (cyclomatic 21, cognitive 28): writeAnchorTag has cyclomatic complexity 21 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/helpers/gfmAutolinks.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d267b4be64fd6b684eb79027cedc65b64b281d6f0941b98779811937c36d0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBlockquotes (cyclomatic 20, cognitive 47): parseBlockquotes has cyclomatic complexity 20 and cognitive complexity 47; 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/subParsers/makehtml/blockquote.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7f98375fe31e9a4048ee764ea789f87c8daf268aa1857350936b4827f97c78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanHTMLComment (cyclomatic 19, cognitive 25): scanHTMLComment has cyclomatic complexity 19 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/subParsers/makehtml/rawHtml.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c05383572343768ffa76b8f4a8fb84e1ee69901de57719a862cc0dd7a6c4bd6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _populateAttributes (cyclomatic 18, cognitive 32): _populateAttributes has cyclomatic complexity 18 and cognitive complexity 32; 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/helpers/misc.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"884ab0d8805490b1578f981a7e4749a17c576ad277341425566374eaf6e0a534"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rgxFindMatchPos (cyclomatic 18, cognitive 26): rgxFindMatchPos has cyclomatic complexity 18 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/helpers/text.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7763ae985581973f7c4ca23af382613e4aa39a7f9be39f1d1da0d5154f5523e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extract (cyclomatic 17, cognitive 35): extract has cyclomatic complexity 17 and cognitive complexity 35; 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":"scripts/extract-spec-tests.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"71958c44959ab16301233c20c62ec60923928e71dc69010e178da5294ad4be3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatchCapture (cyclomatic 16, cognitive 22): dispatchCapture has cyclomatic complexity 16 and cognitive complexity 22; 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/event.js"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b543e0bdf5c627c3eb0ef503833ad8681923c8b400990f511f93e46dcfb5487"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 15, cognitive 33): parse has cyclomatic complexity 15 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/subParsers/makehtml/githubCodeBlock.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b036697808de0a89728471c34b50fd55f325d122c5b6a5dc100f6d66283ac3d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function coerceOptionValue (cyclomatic 15, cognitive 21): coerceOptionValue has cyclomatic complexity 15 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/cli/cli.js"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97fb52065bc3aa5f3e841e77ea9901947495cf423e333bfabc8cedda75cd5cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveMultilineFalsePositive (cyclomatic 14, cognitive 25): resolveMultilineFalsePositive has cyclomatic complexity 14 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/subParsers/makehtml/heading.js"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e93eab24551ea8037ed6822dcb3f5f1bc9313f2b83804fc7eded09f03a5290c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAutolink (cyclomatic 14, cognitive 23): parseAutolink has cyclomatic complexity 14 and cognitive complexity 23; 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/subParsers/makehtml/autolink.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9767c1276cf3ba75ce77e9e098892321bc78d59eca48f394bf365034898270cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 17): (anonymous) has cyclomatic complexity 14 and cognitive complexity 17; 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/subParsers/makehtml/completeHTMLDocument.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee58a582999a9fe40cd498ab037695d2d26f3ea76dea014bcdce0b6770df182a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function itemLoose (cyclomatic 13, cognitive 25): itemLoose has cyclomatic complexity 13 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/subParsers/makehtml/list.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"24dbfdebf64ecd58ef623263189d3ffc3d49b7de728e7706f926bee2ed1d78d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseExtension (cyclomatic 13, cognitive 20): _parseExtension has cyclomatic complexity 13 and cognitive complexity 20; 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/converter.js"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04a7febbde047f45f929b4678e1af07fe865257ea8d2ea8aeb7954b40b774ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 20): (anonymous) has cyclomatic complexity 13 and cognitive complexity 20; 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/subParsers/makemarkdown/image.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a46258ae8dd88abdc73eceaf0a075c2db2c253d4b883de49b4d1d0ea14d9013"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCaptureEvent (cyclomatic 13, cognitive 12): validateCaptureEvent has cyclomatic complexity 13 and cognitive complexity 12; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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":"test/unit/showdown.events.js"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cdb66ca0af64322a32543203717d362627b231698013757296e8b04dc12ff0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCmHTMLBlocks (cyclomatic 12, cognitive 30): parseCmHTMLBlocks has cyclomatic complexity 12 and cognitive complexity 30; 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/subParsers/makehtml/htmlBlock.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6260fc399cd3811577f290de33f514584d0af1ab3b0139912a733b1a1798bed5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBacktick (cyclomatic 12, cognitive 25): parseBacktick has cyclomatic complexity 12 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/subParsers/makehtml/codeSpan.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7623e6a3f1a35b6889ac7462b6790ae3f3de43bbea423bf1a86466362b226f1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 25): (anonymous) has cyclomatic complexity 12 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/subParsers/makehtml/paragraphs.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca93ad4e968b764bea32b21c83d63b64686386c971997c2bbbbd89f781143a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTable (cyclomatic 12, cognitive 23): parseTable has cyclomatic complexity 12 and cognitive complexity 23; 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/subParsers/makehtml/table.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"626108441bb63caed1d2a4a7f482d579ac22f7d3255e6601d570c5ea3f2dafd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 20): (anonymous) has cyclomatic complexity 12 and cognitive complexity 20; 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/subParsers/makehtml/image.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04a9b5dc601c8026d620828d93c6cb02feb3423645cccb794e808e14ccb7316"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 19): (anonymous) has cyclomatic complexity 12 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":"test/functional/makehtml/testsuite.issues.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"828887a71dbe408a7ab3bcfa7cd8ee24b35ec892bd11298e25d850e308251160"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cmScanTitle (cyclomatic 12, cognitive 15): cmScanTitle has cyclomatic complexity 12 and cognitive complexity 15; 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/helpers/commonmark.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b95aa5f315094e170765703e71b22d916c3a716720d23125ffe617bfd5797e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCapture (cyclomatic 12, cognitive 14): validateCapture has cyclomatic complexity 12 and cognitive complexity 14; 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":"test/unit/showdown.events.js"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d214a173728fe5e039ae0b22c95f81108253f9ed0217e3381534eb35b2cb775"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) has cyclomatic complexity 12 and cognitive complexity 10; 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. 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/subParsers/makehtml/ghMentions.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ffc65109131bd1a2cb921154c9c0cde384913a304dd48b19c3c2b995e1141c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expandInputs (cyclomatic 11, cognitive 25): expandInputs has cyclomatic complexity 11 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/cli/cli.js"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd277c5d777193442475f6e73f6be73367f022ba647c8d0cb64364af522215dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hashInlineCodeSpans (cyclomatic 11, cognitive 24): hashInlineCodeSpans has cyclomatic complexity 11 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/subParsers/makehtml/footnotes.js"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ada9c64b137e4abc46afbcc47cfce8b4cafc238df8129926c654d5c25e987a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateLog (cyclomatic 11, cognitive 14): generateLog has cyclomatic complexity 11 and cognitive complexity 14; 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":"test/performance/lib/performance.lib.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe8e4c0a5ebb8843ae723fe6fa4ea72430d50b5c4d3f22b254b224f7a17ade3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cmEncodeURI (cyclomatic 11, cognitive 12): cmEncodeURI has cyclomatic complexity 11 and cognitive complexity 12; 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/helpers/commonmark.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b391ddb96d2063817305704858ce5fe720cfe250607c9eb4363c80c4b4a84c4"}},{"ruleId":"R3","level":"warning","message":{"text":"src/helpers/emojis.js: 1862 lines of code: src/helpers/emojis.js has 1862 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/helpers/emojis.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86170564c094d67877cda9289e3bac1256de769c36f07b1e06bc1eb4cbc05009"}},{"ruleId":"R3","level":"warning","message":{"text":"src/cli/cli.js: 756 lines of code: src/cli/cli.js has 756 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/cli.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bccd2accc9422e37bf83f2eb82f378d7e0e78becb5c347f6f496b9b8e0ec80a6"}},{"ruleId":"R3","level":"warning","message":{"text":"src/converter.js: 673 lines of code: src/converter.js has 673 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/converter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4066a610aa9ff2d59a7f2b5da5514c69ebcdc1f2a06731dcd1b1b2bedc599242"}},{"ruleId":"R3","level":"warning","message":{"text":"src/subParsers/makehtml/spanGamut.js: 667 lines of code: src/subParsers/makehtml/spanGamut.js has 667 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/spanGamut.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"231c87387f05988079f73493f22c7e7757999f9f1fa21dbf44274ec665a02e37"}},{"ruleId":"R3","level":"warning","message":{"text":"src/subParsers/makehtml/list.js: 540 lines of code: src/subParsers/makehtml/list.js has 540 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/list.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3917b6a11d56fbe7de35887012a6345e1bdff0519e2ccf31788142fc8269b57"}},{"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/helpers/htmlEntities.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f62fae2d67efc266949b1234c4efef5056a23c274b21aac6f0b76cded426e8a"}},{"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/helpers/emojis.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecf668ce9c60236b13cf5f0fb4f5518006828f4259d1112a553fd85159c8803"}},{"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/converter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d35740c9bbdf9454b1aaa1374494ade9c4515d76266edf8563e0be01852d7e2"}},{"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/subParsers/makehtml/spanGamut.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c702b1f65e1f76a902385c26ea101d2f9260cae7d8c77c89c7c1db3064677d5"}},{"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/subParsers/makehtml/list.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c17c2267e6273d9cbf2d76a1f17e2dc3a372343a1c8149af61bd2f6fd1a9cef"}},{"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/subParsers/makehtml/heading.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd9570b74f42c7afc082230310e6dbd9ee172d025ec139605298deb89542747"}},{"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/event.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d50e2906952f3ff18ba45da8c07e1075443645593dd18d9274d3612f1563d2"}},{"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/subParsers/makehtml/htmlBlock.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3760970fef921df678497730fad74e9cfab4cc3d54d2861d6f49fe96505974e2"}},{"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/subParsers/makehtml/table.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb74d84b6eabe7c4eb9baee860f10a74437ec69103c7a6787eee9627ad6ddf0"}},{"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/helpers/text.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bea051988d5939487ba18f07c7c4098ac9b904ea0f70101a6ca623972b44c06"}},{"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/subParsers/makehtml/footnotes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"404dcdc2ae64862ed73c79175ebc6400eb85950303a151e5c85ea249331aa07d"}},{"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/subParsers/makehtml/stripLinkDefinitions.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6129991b8794977ec5d60deec4aa4b0e3f26c59f97f17cbe49d3b8a93ae4f0"}},{"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/subParsers/makehtml/nakedUrl.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2845c831ba6193bb05910378886adae171be0c85d2520c86e5a362766b4b36"}},{"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/helpers/commonmark.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41a6e146c73f8cf43fc16e1505c8690691b7b9fc16ec0672df05ae2e245a37c"}},{"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/subParsers/makehtml/link.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bca565446c45230df444369b3e96ffc85c0091f45d8eb38131beef0e3b4a73"}},{"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/subParsers/makemarkdown/node.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"778fcc794564472f1fdf0d9013f925a5c7a8c53247ba6a66b854b89b6a2e9d6e"}},{"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/subParsers/makemarkdown/table.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16e24bf79b83c677e7ff740f3113cbb2283cc0c301a07f5a6a66d3203705b5d"}},{"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/subParsers/makehtml/blockquote.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b4efdac532a0d79b390162e2d66fdb19ff27fb3aefd4e3b59edae117ca5ed5"}},{"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/helpers/misc.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1392e292cd5f5c991fdb638b5a035580eb9b42c4e5d18c6cef7bdeef1ad1b50"}},{"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/options.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f0035fc4b86c6234657f31365375b47b8b87db341483641c90d02ee9437a14"}},{"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/subParsers/makehtml/rawHtml.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33283e984850b31cae638becab6ffda767c78cae37121ea639338b74e41a3f2"}},{"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/subParsers/makehtml/strikethrough.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a36ce9c8bbdafc38f45ca471d10d3058b28b89ba31bbf269da9d1f76c5ea612"}},{"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/subParsers/makehtml/githubCodeBlock.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a57555524e897d0e5e4a9999602deef770d129a85f5ceeb9e05652e0b95c9d7"}},{"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/helpers/url.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2036cf1b7f51996d6722a536f84c53bd06edc80cbd8b1284c1a849fd28ebd05c"}},{"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/helpers/gfmAutolinks.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42aa2b5016f48a9c308c3421b038649b242be8c6f85cd72590928b3cfa433877"}},{"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/subParsers/makehtml/codeSpan.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9e0a2895c68a7a06dc90cb416a68aa83830bad48bf45d78ce118bd1c9b73fc"}},{"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/subParsers/makehtml/underline.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9ace3d0915392826c257a5383685dd2e4281b17e8c05ade800a4bb1c54973e"}},{"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/helpers/hashHTMLBlocks.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5618127c6352782ff4be71456d5d1a53857b15957745a23976e3758ee6246e28"}},{"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/helpers/types.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"022053a4574fd1c263bd2765149d8ef37cf2d1f37fc62a7309805b5980815687"}},{"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/subParsers/makehtml/ghMentions.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aaf370cf6e1800a66fbe25b287dd16491ba82f5e01eadf67d0d11b0a860de7b"}},{"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/subParsers/makehtml/horizontalRule.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db15b386be13e6de9e13bb6ab33e608393193acad3f1213f1c73afc29468da3c"}},{"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/subParsers/makehtml/emoji.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03793da33d0b013bca975f12a5ccf28a94fbafc3c19282c0d935f39758669634"}},{"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/subParsers/makehtml/autolink.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cb19bb545bfb34700326e3e6202800478271f2f1b7b0f4b2c44a5ce3916983"}},{"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/subParsers/makehtml/paragraphs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"597b39c5022363c9fb8736877dee591a54c7a857137d461725da62181036224a"}},{"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/helpers/escapes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f027424495d911940b3205587f5f5a0125b282aef0aac0b9d1e55434b8cbd70a"}},{"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/subParsers/makehtml/disallowedHtmlTags.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"629b2f13f2f74ccea4bf1bbda788ec4223429f3fa8d531ee9c7312c32af349e1"}},{"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/subParsers/makehtml/emphasis.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"743d44b369cec8efdaba6b77318d9a4713f5b27003934d77ec9addd10cc520e3"}},{"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/subParsers/makemarkdown/footnotes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a788c680224fdb7d68ede092ff3cdf1a71cde7d6f4203bc6e1beef27b33c37b"}},{"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/subParsers/makehtml/hardLineBreaks.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6915889a047f74e61e735e60d6dca73615b4f16644786e02e5da4090b1ef39a8"}},{"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/subParsers/makehtml/metadata.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5976e86c7fd22b1c24cff0080fb6af5556290ea41ead4c79802ae42ac4e1813"}},{"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/subParsers/makemarkdown/txt.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0372bc29b589926a58e163681ccbdb1d5e06f2cb42f42235390275ccef57ac"}},{"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/subParsers/makehtml/image.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"734dcacffccdd431243bc7e26e8c170bcae3c5fd821007f3e0e48cdfcf33a63b"}},{"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/subParsers/makemarkdown/input.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17212aab1ea590df258b868dbc7107cf21db1ef576843111c9d23225f5737b2"}},{"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/subParsers/makehtml/taskListItem.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cc3bb2739a4d3b088e71fd51dbbfc9317aabe88e90a8f32aa23aa55090ce25"}},{"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/helpers/hashHTMLSpans.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50849873861037d0ef667f958488851254164e05352697e246369fe79ac5afda"}},{"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/subParsers/makemarkdown/links.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f33621ab1d2eab8f66b8194e0cab29a36bb4fa253309a612cd6442d785554b2"}},{"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/subParsers/makehtml/codeBlock.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"503adfca8887e0745b85d3a6de1c77aa87a91f8ef84a9419c89e7447b988c72b"}},{"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/subParsers/makemarkdown/image.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6982813ad8731d035439dd3da6c947d3ff5083aebd1444c43bfda65affb059c3"}},{"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/subParsers/makehtml/completeHTMLDocument.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"272d1db91e830a56739fec1d3e8aacdc3dde4ec55a8b9641e2b9277e7b281c26"}},{"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/subParsers/makehtml/backslash.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf559a29dede82e037f90af006c0c0151b5fea83ad8f1de39fc6dbd54343dd99"}},{"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/subParsers/makemarkdown/listItem.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb7b4d604ffc1a0867aba18e7c97a8425385b75152eb231d91f418d783f480b"}},{"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/subParsers/makehtml/blockGamut.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee609ea5e8e9b7d47acfdecfa66944797c075dd9203b13ceef408c5490b7e5d"}},{"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/helpers/lazyDocument.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2300afc4eba6d830cd6d1167baeba9ee1e3266f6e5e7b61391aff7ee48486d7"}},{"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/subParsers/makemarkdown/list.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd95a04632d1dd6383de0b6625a06114d4a2209cc61f04bed7a9f23e43f222fa"}},{"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/subParsers/makemarkdown/emphasis.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb05406deb80d4472b44123017499b36b7b51435c58d33bcb87a9cd4aed0460c"}},{"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/subParsers/makehtml/ellipsis.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd8fe135fd292546f326af2a508c274375eb9cbf102b7e0a59372bef0ff09c2"}},{"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/subParsers/makehtml/entity.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b89f1576466a1da76a37c823c6cee2c018d66df2ec7aec909f8e074b562766f"}},{"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/subParsers/makemarkdown/codeSpan.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93dac5cf61f6aba53154b9fedf9ef22cb9e75a9278ecca2cafbb764e1e2c121"}},{"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/helpers/regexes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca2ae9643394767232bd75c14d495c0963d8abf2ceb956ce34786acb24cefb0"}},{"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/subParsers/makemarkdown/codeBlock.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a60061f881d4778909d5cdc11f0833143d0af73fa62990d30e3c2699e285719"}},{"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/subParsers/makemarkdown/blockquote.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b763c128ac5d2ac505ba78017b527a685bb10f7f3449e2725f940b4ab62b0cfa"}},{"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/subParsers/makemarkdown/header.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"799b2d5bb4a5c9183b1b7f9da4450a28311b34224d1e4201cef1f1e1fbb5026f"}},{"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/helpers/unhashHTMLSpans.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0920eff80b022039f5668aa701452daf737c0353a4b9c1d72deb3ef902197a"}},{"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/subParsers/makemarkdown/paragraph.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7789a078310804d97dfc0c60696bc2a82131a995a2d2643590e24a967407a7"}},{"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/subParsers/makemarkdown/tableCell.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ec40f078c079f3ee841f81fb33ba2510f515f0fb2ac91a8fc8e1e8632096b8"}},{"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/subParsers/makemarkdown/pre.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b49d95124a9fd9b53d7468455fe64b6dcb07d7496de4b16ffb020b5d7205cb"}},{"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/helpers/markdownEscapes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf89534e598f2c527c7caa3e950df4a367abd49742f73547b87f8921040c5eb"}},{"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/loader.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf870c681318e4705e8562167f173e962315fa63183d8d7f304efdfa3b818e7"}},{"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/subParsers/makehtml/decodeEntities.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57df7def1008e6b0c7d727ed868230a62d9ba94430c2664d4f5b4deb7e0e8c60"}},{"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/subParsers/makemarkdown/break.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d0908d7c0463669a3997a2b6c3064dcf7bba26990cfa563ecad89375dff6d5"}},{"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/subParsers/makemarkdown/hr.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f535df1ac479609bc129c96294a421e41d8a4240aa8a1831e689e478bae2eac"}},{"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/helpers/encodeCode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1101c2555da79c8f9124b1027539f938455ac18b54faa81419be41dca1036248"}},{"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/helpers/hashBlock.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc002393e89c36139e2e36ee110b0f2fadf142ef81c9cad1b596d4903ddc19aa"}},{"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/subParsers/makemarkdown/underline.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aabc7623a290b6d14e827f1e29857702902fdb907c24b48e2575fc3d7d66d4d"}},{"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/subParsers/makemarkdown/strikethrough.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df9a6cce26d0c1b990d2f020070edbdee8796ecdc3bc1ff11287955a2c0ad85"}},{"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/subParsers/makemarkdown/strong.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"241dc5fab4f73a3cb488ac2be83398cb30dd5792ba66514811208e363b6216fb"}},{"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":"R8","level":"warning","message":{"text":"Unused dependency \u0027conventional-changelog-angular\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"354a18e69f9cad794f9ebf2a78f5c485fd2a6674ce17f66ef40a90fddc003f7e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060captureEvent.output \u0026\u0026 captureEvent.output !== \u0027\u0027\u0060 appears character-identically in 21 files \u2014 src/subParsers/makehtml/htmlBlock.js, src/subParsers/makehtml/stripLinkDefinitions.js, src/subParsers/makemarkdown/blockquote.js, src/subParsers/makemarkdown/break.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/htmlBlock.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"24535aa7ce92f1591c2e35415be997d8cc8f4a08d5eace9dbbc84a8204b2e071"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060captureStartEvent.output \u0026\u0026 captureStartEvent.output !== \u0027\u0027\u0060 appears character-identically in 17 files \u2014 src/helpers/gfmAutolinks.js, src/subParsers/makehtml/blockquote.js, src/subParsers/makehtml/codeBlock.js, src/subParsers/makehtml/disallowedHtmlTags.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/helpers/gfmAutolinks.js"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"1961cb95e156d7a8e4f1f3250db8ea6323c7d911d01d42823c2111715213b4d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060j \u003C n \u0026\u0026 str.charAt(j) === \u0027 \u0027 \u0026\u0026 sp \u003C 3\u0060 appears character-identically in 2 files \u2014 src/subParsers/makehtml/footnotes.js, src/subParsers/makehtml/stripLinkDefinitions.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subParsers/makehtml/footnotes.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab2b32f4e9a5ad38f1ca7798e29a6b39faf8891572d29a0c73aab2d19aa8503"}},{"ruleId":"X24","level":"warning","message":{"text":"Document value reaches a markup attribute unescaped: \u0060language\u0060 carries text this program read out of a document \u2014 an attribute or a text node, which the DOM hands back already decoded, so an entity its author wrote is a live character again \u2014 and it is written straight into the \u0060language\u0060 attribute of markup built here with nothing escaping it on the way. The value is chosen by whoever authored that document, not by this program, so it can close the attribute or element it sits in and open another \u2014 a crafted document becomes markup in what this code renders. Escape \u0060language\u0060 at this site, or validate it against the shape the position accepts before interpolating it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/converter.js"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a4d3ed626fed322283cb6dec8d58eb147d43a4a6111abe6da2cb097c566fba"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060html\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/helpers/lazyDocument.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f369888084d1c18c08d939adc7a6e1c0ca49a943b90564b1b6c3e23658e51e56"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/cli.js"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11fc6512f006083e301047fc94e7a52a9cd4bf8bb8eee6765d6a0fc544178ea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/cli.js"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e2bfa5b56648c59942305c2b6f96e7b758bc239d2273872533fea264e90353"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060fromCodePoint\u0060 (in \u0060showdown.helper.decodeCharacterReferences\u0060) swallows every exception into \u0060return \u0027\uFFFD\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/helpers/commonmark.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"82dbef0e66a2805398283e26b7e746a783b3ead0a7e2f1729f54cf4a980737b1"}}],"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-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1352","guid":"5257f322-5cfc-6b52-bedd-0b9a526b4c7d","name":"CWE-1352","shortDescription":{"text":"CWE-1352"},"helpUri":"https://cwe.mitre.org/data/definitions/1352.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-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-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":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-7","guid":"4c4af28d-49e3-2d51-b597-e1396c49658b","name":"Insecure System Configuration","shortDescription":{"text":"Insecure System Configuration"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-07-Insecure-System-Configuration"}]}],"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":34,"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."]}]}