{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"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":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"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":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"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":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"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":"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":"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":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"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":"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":"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":"parser.visitExprInOut (cyclomatic 618): parser.visitExprInOut has cyclomatic complexity 618 (threshold 15). Of this number, 598 points are the body\u0027s own statements and 20 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":13552}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2dcb1cee66f4bb6a30ab600376384a8b2f189a7218e4fd5ef01a4ea1b1eceef"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printExpr (cyclomatic 377): printer.printExpr has cyclomatic complexity 377 (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":"internal/js_printer/js_printer.go"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdfef6e457a7f1419610eedd3cd8e2889b530b587e96101a7742471d3677c63"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.visitAndAppendStmt (cyclomatic 281): parser.visitAndAppendStmt has cyclomatic complexity 281 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":10393}}}],"partialFingerprints":{"codehealthFindingId/v1":"a543573b3374dba43a135113b5a251a7c28b4eaf64ec47d7f8057c8e400ce19d"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseStmt (cyclomatic 257): parser.parseStmt has cyclomatic complexity 257 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":7101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d61cc2a7487f03773480fcee9a28be0992b939afe8161f000f34e680399e500"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.parseOptionsImpl (cyclomatic 249): cli.parseOptionsImpl has cyclomatic complexity 249 (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":"pkg/cli/cli_impl.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d400f3f0fc3a83401fccceea7b9f8feb0844645e49da5424cfba576fccc43e"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseSuffix (cyclomatic 169): parser.parseSuffix has cyclomatic complexity 169 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":4264}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6d738050d0466a8c5a74fc10a7c7dd269264b75071ee11cab3dd09e0ea702c"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseProperty (cyclomatic 161): parser.parseProperty has cyclomatic complexity 161 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f898d81184ab995830a6839827e770143b906737ea78b76f2af130d9d30763f2"}},{"ruleId":"D1","level":"warning","message":{"text":"binaryExprVisitor.visitRightAndFinish (cyclomatic 153): binaryExprVisitor.visitRightAndFinish has cyclomatic complexity 153 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":16067}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b2fd803ea1a40d2f37e99f0e4bb67ba9beeeaeb3f02629dd7b711a5f231f00"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printStmt (cyclomatic 150): printer.printStmt has cyclomatic complexity 150 (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":"internal/js_printer/js_printer.go"},"region":{"startLine":4101}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc98a40fbd4055491d23a39c53cb2fc9787c5fcec06a801e0af4eee091b340da"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.Next (cyclomatic 147): Lexer.Next has cyclomatic complexity 147 (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":"internal/js_lexer/js_lexer.go"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd179f506eae1997b9df3fd129c9caa6a483dd13b7b622d96c9236fcdd3b3e15"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.scanImportsAndExports (cyclomatic 141): linkerContext.scanImportsAndExports has cyclomatic complexity 141 (threshold 15). Of this number, 108 points are the body\u0027s own statements and 33 belong 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":"internal/linker/linker.go"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"91211ff97948b02ea24395108de209069a2b81e811c88255d86b6a67e4b33b4d"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.mangleStmts (cyclomatic 127): parser.mangleStmts has cyclomatic complexity 127 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":9156}}}],"partialFingerprints":{"codehealthFindingId/v1":"47717f65fb79e3d85a715608180a21241100d7f683fc9d055cefabb95137c116"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseAtRule (cyclomatic 122): parser.parseAtRule has cyclomatic complexity 122 (threshold 15). Of this number, 119 points are the body\u0027s own statements and 3 belong 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":"internal/css_parser/css_parser.go"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d510a041633826c130ef8477fcd6d7ffed26beb75c47fce878250f15ed5f918"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parsePrefix (cyclomatic 116): parser.parsePrefix has cyclomatic complexity 116 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":3499}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7eec87c0d88a8d27d18fae12fdb00633bcc56ae6617e30dc168801def9fc412"}},{"ruleId":"D1","level":"warning","message":{"text":"bundler.parseFile (cyclomatic 109): bundler.parseFile has cyclomatic complexity 109 (threshold 15). Of this number, 108 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":"internal/bundler/bundler.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9781b9182a0b78acc9849b996cd8534ed7492d08e479a16e19c9f947571593"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.processDeclarations (cyclomatic 104): parser.processDeclarations has cyclomatic complexity 104 (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":"internal/css_parser/css_decls.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8e1a4b9a861bd55deb7896e43ffbb53f0bee78222e236df845f70e77dd2ade"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.parseNumericLiteralOrDot (cyclomatic 96): Lexer.parseNumericLiteralOrDot has cyclomatic complexity 96 (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":"internal/js_lexer/js_lexer.go"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e429929950dcba590bb296d617f4ad38d30fc1956a15dda49a7879d8b8a485"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.skipTypeScriptTypeWithFlags (cyclomatic 94): parser.skipTypeScriptTypeWithFlags has cyclomatic complexity 94 (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":"internal/js_parser/ts_parser.go"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ca554899ba3d22fb0ecbb33d590bc8e31de0bb5bc72e858ae3898f98d980d1"}},{"ruleId":"D1","level":"warning","message":{"text":"uint8array_json_parser.JSON_parse (cyclomatic 93): uint8array_json_parser.JSON_parse has cyclomatic complexity 93 (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":"lib/shared/uint8array_json_parser.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11cabfbd8be80ab163fd12f70c2ef631e6c5b1871ccd1d5a7e0e7c45bd25528"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printRule (cyclomatic 92): printer.printRule has cyclomatic complexity 92 (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":"internal/css_printer/css_printer.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"923c603abc71df1c5cd244fcd894ed33a149b035e45675bd8aeb15d538b7c0aa"}},{"ruleId":"D1","level":"warning","message":{"text":"HelperContext.SimplifyUnusedExpr (cyclomatic 91): HelperContext.SimplifyUnusedExpr has cyclomatic complexity 91 (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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ba153e43f1f5a22327c3cbd53e019143deb81811b31f35d300c657040b5a2f"}},{"ruleId":"D1","level":"warning","message":{"text":"css_parser.parseColor (cyclomatic 88): css_parser.parseColor has cyclomatic complexity 88 (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":"internal/css_parser/css_decls_color.go"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab74e99d7ec2168b533e0c2d4cea66e75565c4e48b1d14302ede12aa9a2f4c17"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.scanForImportsAndExports (cyclomatic 87): parser.scanForImportsAndExports has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":17332}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc33f9d872ad58683e354da1dcd030d6ac0f747c1a66767c937540076b05839"}},{"ruleId":"D1","level":"warning","message":{"text":"scanner.processScannedFiles (cyclomatic 83): scanner.processScannedFiles has cyclomatic complexity 83 (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":"internal/bundler/bundler.go"},"region":{"startLine":2361}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b8f0f58fb5f5c3aa6fb7c6ed278db94a6df1c2606e5c648db362faa12ea09e"}},{"ruleId":"D1","level":"warning","message":{"text":"js_parser.ParseSourceMap (cyclomatic 81): js_parser.ParseSourceMap has cyclomatic complexity 81 (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":"internal/js_parser/sourcemap_parser.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbdee01450f823b01bc9bb9f73f725697906654ddac4a496b618f20f7e0f9d4"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.mangleTransforms (cyclomatic 79): parser.mangleTransforms has cyclomatic complexity 79 (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":"internal/css_parser/css_decls_transform.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b3755ca454d7408be899527b60a2a5730b9bfe22e0518b5f81ebbcc6cb13cd"}},{"ruleId":"D1","level":"warning","message":{"text":"apiHandler.ServeHTTP (cyclomatic 74): apiHandler.ServeHTTP has cyclomatic complexity 74 (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":"pkg/api/serve_other.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44716e38ff97d3259d989c3eba720f2b62c56cda62bdedf0653a9c7804ea205"}},{"ruleId":"D1","level":"warning","message":{"text":"resolverQuery.parseTSConfigFromSource (cyclomatic 71): resolverQuery.parseTSConfigFromSource has cyclomatic complexity 71 (threshold 15). Most of this is not in the body itself: 9 of the 71 points are its own statements and the rest belongs to one function literal inside it that branches (line 1257). 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":"internal/resolver/resolver.go"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"272fc9a40ea084062b85f09927ecb8de83c80b350360e5fb579704d6ec51be56"}},{"ruleId":"D1","level":"warning","message":{"text":"common.handlePlugins (cyclomatic 71): common.handlePlugins has cyclomatic complexity 71 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 54 belong to 7 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shared/common.ts"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"595dd21aa060ab26c0fd1141a0bac2b4955b2ae1fcc084204363258e14054902"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.substituteSingleUseSymbolInExpr (cyclomatic 69): parser.substituteSingleUseSymbolInExpr has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":9735}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2e0222fff61d8cb48afd7f268ba9814ab2348e69ae8d534bddda2a4d248009"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.visitClass (cyclomatic 69): parser.visitClass has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":12177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d909f952a69688a57c103e8898978d87b9b0d1bb3d10806008d7dfd8b4110ee"}},{"ruleId":"D1","level":"warning","message":{"text":"lowerClassContext.processProperties (cyclomatic 69): lowerClassContext.processProperties has cyclomatic complexity 69 (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":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0d8f8a81047e35407dfb39f29313a982dd607d00fca6109b9dd3f06d21ad7b"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printProperty (cyclomatic 69): printer.printProperty has cyclomatic complexity 69 (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":"internal/js_printer/js_printer.go"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72bb7dcc32326276ae764f9bccd692e388fe1d20c93fbef85a03c3f05d9e81f"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.generateChunkJS (cyclomatic 68): linkerContext.generateChunkJS has cyclomatic complexity 68 (threshold 15). Of this number, 64 points are the body\u0027s own statements and 4 belong 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":"internal/linker/linker.go"},"region":{"startLine":5568}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9650691f13ba17f4191cc7bf45db306c9c4f16bf7e74cfb4e1e12c5076ac7b"}},{"ruleId":"D1","level":"warning","message":{"text":"resolver.ParseTSConfigJSON (cyclomatic 68): resolver.ParseTSConfigJSON has cyclomatic complexity 68 (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":"internal/resolver/tsconfig_json.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6b204884c7d2afba96215d38590154cfea9c65a199d7410951e466177399ba"}},{"ruleId":"D1","level":"warning","message":{"text":"HelperContext.ExprCanBeRemovedIfUnused (cyclomatic 66): HelperContext.ExprCanBeRemovedIfUnused has cyclomatic complexity 66 (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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":2432}}}],"partialFingerprints":{"codehealthFindingId/v1":"9440603946e52d7dd52498b04130858d9feb41fe3c0f1533e76f16aa76528cca"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.convertTokensHelper (cyclomatic 65): parser.convertTokensHelper has cyclomatic complexity 65 (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":"internal/css_parser/css_parser.go"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf3a95d6a86bf57987f5230b1c0c1770071ef435eb8a61c03a0c3a634ae398f"}},{"ruleId":"D1","level":"warning","message":{"text":"HelperContext.MangleIfExpr (cyclomatic 65): HelperContext.MangleIfExpr has cyclomatic complexity 65 (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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":2788}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbc2a8922878c49bb53fe731b26043d21c38e26afffaa18e373b10a76bd8810"}},{"ruleId":"D1","level":"warning","message":{"text":"resolverQuery.finalizeImportsExportsResult (cyclomatic 65): resolverQuery.finalizeImportsExportsResult has cyclomatic complexity 65 (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":"internal/resolver/resolver.go"},"region":{"startLine":2605}}}],"partialFingerprints":{"codehealthFindingId/v1":"5068da325753ebb9e6cfbce9ec831f813266afb6a8e1cb38f4c31f9aa24cfe26"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printBinding (cyclomatic 63): printer.printBinding has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce2de950e32f871958f7af63432486d26e6722358b5c0c8e1bc0771c19b6fb7"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.generateChunkCSS (cyclomatic 62): linkerContext.generateChunkCSS has cyclomatic complexity 62 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":6098}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d09a256b0faadb1b90da53f6f18fd5ce49d53a01df503ea8e5fe6e3faf2a98b"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.findImportedFilesInCSSOrder (cyclomatic 60): linkerContext.findImportedFilesInCSSOrder has cyclomatic complexity 60 (threshold 15). Of this number, 48 points are the body\u0027s own statements and 12 belong 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":"internal/linker/linker.go"},"region":{"startLine":3411}}}],"partialFingerprints":{"codehealthFindingId/v1":"634623cde15633c9da68d9992c99bb39827d2cff98eafe2d9d6cd762e837de02"}},{"ruleId":"D1","level":"warning","message":{"text":"serviceType.convertPlugins (cyclomatic 59): serviceType.convertPlugins has cyclomatic complexity 59 (threshold 15). Most of this is not in the body itself: 5 of the 59 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 908, 865). 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":"cmd/esbuild/service.go"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"561a98a248183a0f0f36d0a44a86db465b36ed70f73750ff6a02751d04a2f9c9"}},{"ruleId":"D1","level":"warning","message":{"text":"scanner.addEntryPoints (cyclomatic 59): scanner.addEntryPoints has cyclomatic complexity 59 (threshold 15). Of this number, 47 points are the body\u0027s own statements and 12 belong 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":"internal/bundler/bundler.go"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"906ff41295efd3c3edb5f65c9ac4d82cfd031986d03578c790b6911f618f7ad8"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.convertStmtsForChunk (cyclomatic 59): linkerContext.convertStmtsForChunk 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":"internal/linker/linker.go"},"region":{"startLine":4316}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa93c4727f34c087a610f9999e4b87cc46052047975e49b6798e9b99d535d24"}},{"ruleId":"D1","level":"warning","message":{"text":"lexer.next (cyclomatic 56): lexer.next 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":"internal/css_lexer/css_lexer.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a4a25ed1eb1bf044f37be936f97efd50954ca4b4864a5bd4f4292904ac0c6d"}},{"ruleId":"D1","level":"warning","message":{"text":"js_ast.FoldBinaryOperator (cyclomatic 56): js_ast.FoldBinaryOperator 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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c9dbe13ab662c0cd088716ce699c8ecf436bccbece1bebda055a1e60b13f31"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printUnquotedUTF16 (cyclomatic 56): printer.printUnquotedUTF16 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":"internal/js_printer/js_printer.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82886880789b48bc433b92ff8bea6bc00a98de06a3e73ae905c038c66010932"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.tryToDecodeEscapeSequences (cyclomatic 55): Lexer.tryToDecodeEscapeSequences has cyclomatic complexity 55 (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":"internal/js_lexer/js_lexer.go"},"region":{"startLine":2192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a5511e13ffc9c752265b29475041a2149b507a84b0b8c9c7373244060e1dd8"}},{"ruleId":"D1","level":"warning","message":{"text":"common.flagsForBuildOptions (cyclomatic 55): common.flagsForBuildOptions has cyclomatic complexity 55 (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":"lib/shared/common.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ace2c892be1bcfc0eedb7754fcc3b5a1c2dd9e75b7845a206f5b3f571236c9"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.lowerAndMinifyColor (cyclomatic 54): parser.lowerAndMinifyColor has cyclomatic complexity 54 (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":"internal/css_parser/css_decls_color.go"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18aa4c270b58341f6e5c3a3bf6d576144dcfbddf190ff18b774767b92c7f86c"}},{"ruleId":"D1","level":"warning","message":{"text":"lowerClassContext.finishAndGenerateCode (cyclomatic 54): lowerClassContext.finishAndGenerateCode has cyclomatic complexity 54 (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":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":2054}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c127742aed73f04cc096d1fd674a3418aa5cc5614bf9f4eaf58bfee9e91ebaf"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.computeCrossChunkDependencies (cyclomatic 54): linkerContext.computeCrossChunkDependencies has cyclomatic complexity 54 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 26 belong 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":"internal/linker/linker.go"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"a892dff12faa6b160b953a46e6716bc6b74dd104d207106522109fd5295b3938"}},{"ruleId":"D1","level":"warning","message":{"text":"serviceType.handleIncomingPacket (cyclomatic 53): serviceType.handleIncomingPacket has cyclomatic complexity 53 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 19 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/esbuild/service.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"643c42f605e358ef9ff0164344a5da39f0850bd17deb292e8d8a9a211b8395aa"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.maybeRewritePropertyAccess (cyclomatic 53): parser.maybeRewritePropertyAccess has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":12939}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccc43e9042ae629987827d97643c2caf58d3bb2a417cfdc080c606e9ce0b2a6"}},{"ruleId":"D1","level":"warning","message":{"text":"css_parser.tryToParseCalcTerm (cyclomatic 52): css_parser.tryToParseCalcTerm has cyclomatic complexity 52 (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":"internal/css_parser/css_reduce_calc.go"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb61dc0373b5105cc6a54bf87d9ec4c514e285c26fe703bb1c2778bf93e6a0d"}},{"ruleId":"D1","level":"warning","message":{"text":"resolverQuery.esmPackageTargetResolve (cyclomatic 52): resolverQuery.esmPackageTargetResolve has cyclomatic complexity 52 (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":"internal/resolver/package_json.go"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fb42f627a683ee919a406254318f22b9557e43bfd93a3cb3ccca61eb29ef32"}},{"ruleId":"D1","level":"warning","message":{"text":"common.buildOrContextImpl (cyclomatic 51): common.buildOrContextImpl has cyclomatic complexity 51 (threshold 15). Most of this is not in the body itself: 8 of the 51 points are its own statements and the rest belongs to 18 function items inside it that branch (a function literal at line 1083, buildOrContextContinue, buildOrContextContinue::buildResponseToResult, \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":"lib/shared/common.ts"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cd4885ef024a846d741bb76ed2e2061a146ec40a276c30c4b1c987eebae4e4"}},{"ruleId":"D1","level":"warning","message":{"text":"resolverQuery.loadNodeModules (cyclomatic 50): resolverQuery.loadNodeModules has cyclomatic complexity 50 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 9 belong 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":"internal/resolver/resolver.go"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa532c9d9958b0c92a8f3fac65be337314e5db3d858c86865a8b59bd0ca2f368"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.lowerOptionalChain (cyclomatic 49): parser.lowerOptionalChain has cyclomatic complexity 49 (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":"internal/js_parser/js_parser_lower.go"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea05de4ed83e140feb46eb76c0a56bc5f96695aaa25b2f0c0b879a794c1cc07"}},{"ruleId":"D1","level":"warning","message":{"text":"resolverQuery.parsePackageJSON (cyclomatic 49): resolverQuery.parsePackageJSON has cyclomatic complexity 49 (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":"internal/resolver/package_json.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"08af9e71988382071da95d310d12e6d050b707297d58a5bac7fe00cf0c7d1640"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printTokens (cyclomatic 48): printer.printTokens has cyclomatic complexity 48 (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":"internal/css_printer/css_printer.go"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e923b2444516e9f884dcf8dbd7263bfa3675899c8f82ec14b934c2d06c89d4"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.generateCodeForFileInChunkJS (cyclomatic 48): linkerContext.generateCodeForFileInChunkJS has cyclomatic complexity 48 (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":"internal/linker/linker.go"},"region":{"startLine":4662}}}],"partialFingerprints":{"codehealthFindingId/v1":"2465187b7aa8bf137a4449f0ee95960451d41293ef375b3ec32a4021ce4a65a4"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseJSXElement (cyclomatic 47): parser.parseJSXElement has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":5251}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c8b3a3de191e005fab8e02a67b69f22d733d5311016ce2720fff588108c981"}},{"ruleId":"D1","level":"warning","message":{"text":"resolver.compileYarnPnPData (cyclomatic 47): resolver.compileYarnPnPData has cyclomatic complexity 47 (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":"internal/resolver/yarnpnp.go"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"305287277ab5f3dc36ead97f5a35a35113cdb3734a4fed96cfd9703c2e9cb99b"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver.Resolve (cyclomatic 47): Resolver.Resolve has cyclomatic complexity 47 (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":"internal/resolver/resolver.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a176d9f5e4e06b095701a234bc25fda90fd5f574fff4ce2f390159cb69dafb"}},{"ruleId":"D1","level":"warning","message":{"text":"js_ast.KnownPrimitiveType (cyclomatic 46): js_ast.KnownPrimitiveType has cyclomatic complexity 46 (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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2207654f46bbd439627d14b7d018f539714df487729b9172ace9a413b3f1d6"}},{"ruleId":"D1","level":"warning","message":{"text":"common.pushCommonFlags (cyclomatic 45): common.pushCommonFlags has cyclomatic complexity 45 (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":"lib/shared/common.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ba5e48d82d42a700ee858122f83ca35301996afdeb7c977bab983488978530"}},{"ruleId":"D1","level":"warning","message":{"text":"main.main (cyclomatic 44): main.main has cyclomatic complexity 44 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 23 belong 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":"cmd/esbuild/main.go"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2010437a54bb21063eb9c645fc6b8e7f2edac723aa322fb93a650f3137e5a2"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.handleIdentifier (cyclomatic 44): parser.handleIdentifier has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":17058}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d6ed44b32d62dc52c5e8cc07343353650211730fde4bc62ef60f067910f21e"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.runImpl (cyclomatic 44): cli.runImpl has cyclomatic complexity 44 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 12 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/cli/cli_impl.go"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6924b707627cb5712d9490b9103c6f4642de343bcd8c7f8d9fe1840ef5f031fb"}},{"ruleId":"D1","level":"warning","message":{"text":"js_ast.ValuesLookTheSame (cyclomatic 43): js_ast.ValuesLookTheSame has cyclomatic complexity 43 (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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a3f4bb6c2b240ff8b38de869e3ca10ec93197d7093f61e173f8c4b2264e28f"}},{"ruleId":"D1","level":"warning","message":{"text":"js_parser.Parse (cyclomatic 43): js_parser.Parse has cyclomatic complexity 43 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":17815}}}],"partialFingerprints":{"codehealthFindingId/v1":"e836852091cd8b255e7e7fb53f2484c662428c3d9401e08cb514c81c0a03665f"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.minifySwitchStmt (cyclomatic 43): parser.minifySwitchStmt has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":11612}}}],"partialFingerprints":{"codehealthFindingId/v1":"f917ad432b08763a3a16e869374a31f77aa0bf5d4d1e01141ea5af4ab4622759"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.toAST (cyclomatic 43): parser.toAST has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":18606}}}],"partialFingerprints":{"codehealthFindingId/v1":"d376da230ad9ce889424231771cb996a43d91139bcf3b557a0764356e87b910c"}},{"ruleId":"D1","level":"warning","message":{"text":"api.validateBuildOptions (cyclomatic 43): api.validateBuildOptions has cyclomatic complexity 43 (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":"pkg/api/api_impl.go"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc06970f75b6137a665093a0d86fea07568ddf062fc4f3a1f5bc87e781e87a9"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printRequireOrImportExpr (cyclomatic 42): printer.printRequireOrImportExpr has cyclomatic complexity 42 (threshold 15). Of this number, 41 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":"internal/js_printer/js_printer.go"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"049e63f64618c1abe10ee394443fa5c71378976d7b61b7123d40abe51fb031d9"}},{"ruleId":"D1","level":"warning","message":{"text":"resolverQuery.dirInfoUncached (cyclomatic 42): resolverQuery.dirInfoUncached has cyclomatic complexity 42 (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":"internal/resolver/resolver.go"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"453d4555804880752c2aca0638f8ddf1e19965aa5c4d389642a1ed208345fe6e"}},{"ruleId":"D1","level":"warning","message":{"text":"HelperContext.StmtsCanBeRemovedIfUnused (cyclomatic 41): HelperContext.StmtsCanBeRemovedIfUnused has cyclomatic complexity 41 (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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":2200}}}],"partialFingerprints":{"codehealthFindingId/v1":"75396f5fa563cf5b8318989b03d56825399f27becf70e29704e97dce1e5c7ba6"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.renameSymbolsInChunk (cyclomatic 41): linkerContext.renameSymbolsInChunk has cyclomatic complexity 41 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 5 belong 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":"internal/linker/linker.go"},"region":{"startLine":5320}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a2a3a9574ae63c968fbbb3a8ec7a04d6be5776a627367ce0735caa0118db8e"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.computeClassLoweringInfo (cyclomatic 40): parser.computeClassLoweringInfo has cyclomatic complexity 40 (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":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d70ed46c5e17ac857a11c2ed5d5ea5c7cbd1b6a54c3a0184523ffec7ed2a41d"}},{"ruleId":"D1","level":"warning","message":{"text":"api.analyzeMetafileImpl (cyclomatic 39): api.analyzeMetafileImpl has cyclomatic complexity 39 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 6 belong 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":"pkg/api/api_impl.go"},"region":{"startLine":2291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94f984257b6bf999ba6b6d24cde5308e1d7d36d46ed07d170a0b1026246199e"}},{"ruleId":"D1","level":"warning","message":{"text":"css_parser.tryToParseColorStops (cyclomatic 38): css_parser.tryToParseColorStops has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_gradient.go"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b6d8fe65da894220551d736a0814a92e9629de8a8ce4c40bcdd9bf23bd5e4a"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver.ResolveGlob (cyclomatic 38): Resolver.ResolveGlob has cyclomatic complexity 38 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 11 belong 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":"internal/resolver/resolver.go"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"210f9c76aef748750a436fd6aab073b0c4c8042e936489d24d25ed8bef56b350"}},{"ruleId":"D1","level":"warning","message":{"text":"js_ast.CheckEqualityIfNoSideEffects (cyclomatic 37): js_ast.CheckEqualityIfNoSideEffects has cyclomatic complexity 37 (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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f757269d9316f677b7499980b91dbc58a04eebd9250c11a148b15f838d76cc"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.NextInsideJSXElement (cyclomatic 37): Lexer.NextInsideJSXElement has cyclomatic complexity 37 (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":"internal/js_lexer/js_lexer.go"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d36e199217743064c6eb250e8e747661e6f13a109cf57c9900566dde81f1d8"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.hoistSymbols (cyclomatic 37): parser.hoistSymbols has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"728e9ffaa0a3229ae352b3819a837b06033c8d97c3bb1713e132f8d9f74d7a0b"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.insertPrefixedDeclaration (cyclomatic 36): parser.insertPrefixedDeclaration has cyclomatic complexity 36 (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":"internal/css_parser/css_decls.go"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a936cb1cbf4822856f593903393e1f7ec7edec7dd0da193b39e90beacfe1cd9"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseFn (cyclomatic 36): parser.parseFn has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":6152}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b115999693faf004ea0a8283d183ada4f9150d069aef2f5353fee88f191a5a"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.visitStmts (cyclomatic 36): parser.visitStmts has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":8960}}}],"partialFingerprints":{"codehealthFindingId/v1":"848b221d7a81e99280d11d1a889bec5bbf47e5c3a425084ebb1b0e0696752610"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseListOfRules (cyclomatic 35): parser.parseListOfRules has cyclomatic complexity 35 (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":"internal/css_parser/css_parser.go"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e937efbf48d5ed9b5406eb1f8cbac80278d506f6cff7a2ab4b7a85d0bb690f"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printCompoundSelector (cyclomatic 35): printer.printCompoundSelector has cyclomatic complexity 35 (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":"internal/css_printer/css_printer.go"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc65ab090a768e47bacd334eb8328fcab3cd2bbf3be126b09b8c7a6ca016bb9"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseParenExpr (cyclomatic 35): parser.parseParenExpr has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":3153}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3998ce9d4f2790f0795fb34a30bbc1ac770aca280b43bf08de1ce4c0ac0cd4"}},{"ruleId":"D1","level":"warning","message":{"text":"lowerClassContext.analyzeProperty (cyclomatic 35): lowerClassContext.analyzeProperty has cyclomatic complexity 35 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"416615bce2864a7d2225bcc5ca80c2f8c950c989d2e361fc81e8d5246b6f38e5"}},{"ruleId":"D1","level":"warning","message":{"text":"resolverQuery.checkBrowserMap (cyclomatic 35): resolverQuery.checkBrowserMap has cyclomatic complexity 35 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 15 belong 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":"internal/resolver/package_json.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"8117a5e95031d7c7b64e0dc07a501b5624181c6d2a55e3e79118a4ecbb894834"}},{"ruleId":"D1","level":"warning","message":{"text":"api.rebuildImpl (cyclomatic 35): api.rebuildImpl has cyclomatic complexity 35 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 8 belong 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":"pkg/api/api_impl.go"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"d283946e3d2589def04bb3df2a6236251eac7aa71713ef8725330aff45aa532f"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parsePseudoClassSelector (cyclomatic 34): parser.parsePseudoClassSelector 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":"internal/css_parser/css_parser_selector.go"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"189d8dc41c391e231dfb7d85c5ce24af2fbf0ee70856c913f675535f00eee106"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printIdent (cyclomatic 34): printer.printIdent 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":"internal/css_printer/css_printer.go"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff3086683d90fd28043758d605e6f1b3d52dfcd6b78cef103290dc3bd7b783d"}},{"ruleId":"D1","level":"warning","message":{"text":"HelperContext.SimplifyBooleanExpr (cyclomatic 34): HelperContext.SimplifyBooleanExpr 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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":2096}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72e3f3a6be1474388372fc8facf65b6cd35a737991a77b0b25aadadaa1df4b6"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.lowerFunction (cyclomatic 34): parser.lowerFunction 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":"internal/js_parser/js_parser_lower.go"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da1503c54bb37619dd9dad7bd7b49281bbdd56a7517c683eade54742b363d75"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printMediaQuery (cyclomatic 33): printer.printMediaQuery 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":"internal/css_printer/css_printer.go"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bba1cbac048456027b3d1bee3ebc9c7e205523e26867c4dbe44b7b1b0468d8"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseExprOrLetOrUsingStmt (cyclomatic 33): parser.parseExprOrLetOrUsingStmt 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":5019}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdf33a9939330887e1bce3357be6e405013a70c26b9cd037eee2c6dbde3302d"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.isUnsupportedRegularExpression (cyclomatic 33): parser.isUnsupportedRegularExpression 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":13415}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c04d94a4e12e88456b420b0d060f519d6248d2a02943c6cc3a3db22bf9f8564"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.lowerObjectRestHelper (cyclomatic 33): parser.lowerObjectRestHelper has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 5 of the 33 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 1473, 1647, 1543, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower.go"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"5506c5a29ebdf4993a9a61f1c1c2ab220c5046d5448ecd4dd0b378de532fdd36"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.computeChunks (cyclomatic 33): linkerContext.computeChunks 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":"internal/linker/linker.go"},"region":{"startLine":3875}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5315845dd8a00b48fae8ba2b397b1b1d79adef412eca7698cfbfaa6d7aac7ed"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseFnStmt (cyclomatic 32): parser.parseFnStmt has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":6758}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07352f2edb428ebc26a3c15de539a04313ac8a3aa7052475e06f38c15871a99"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.mangleIf (cyclomatic 32): parser.mangleIf has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":10246}}}],"partialFingerprints":{"codehealthFindingId/v1":"977464c3a5ede5056fdb721c22c40d9c3dcfb037a1e5dd288a491acabd50c9cd"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.handleGlobPattern (cyclomatic 32): parser.handleGlobPattern has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":16617}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5233d47536bbb20a2fbb5bde99335f5fc9c78e544758d74b3373f4fda0d4e2"}},{"ruleId":"D1","level":"warning","message":{"text":"binaryExprVisitor.checkAndPrepare (cyclomatic 32): binaryExprVisitor.checkAndPrepare has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":3374}}}],"partialFingerprints":{"codehealthFindingId/v1":"1784ceb1aaed163fc72297720a8d68ed0002d3c2bcf26bf82d8c34f9bb46c9af"}},{"ruleId":"D1","level":"warning","message":{"text":"resolverQuery.resolveWithoutSymlinks (cyclomatic 32): resolverQuery.resolveWithoutSymlinks has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/resolver.go"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0b2f30a0faa6be73f7ec5592f097aee87bb561548756554c3293fca1f33278"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.lowerAndMinifyGradient (cyclomatic 31): parser.lowerAndMinifyGradient has cyclomatic complexity 31 (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":"internal/css_parser/css_decls_gradient.go"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"374d6291cbcdedc763b135e7f745851c45f343a3577be916821180463c0eb21e"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.mangleRules (cyclomatic 31): parser.mangleRules has cyclomatic complexity 31 (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":"internal/css_parser/css_parser.go"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"264e583550329050052cc825bb7ee07a926f0f7f1b1abff3ed39bf71a19bc40e"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseNthIndex (cyclomatic 31): parser.parseNthIndex has cyclomatic complexity 31 (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":"internal/css_parser/css_parser_selector.go"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c218b820db56d9fde967dd30840e3b43c0177326f059ab60cecd7e207eeaac1"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.canMergeSymbols (cyclomatic 31): parser.canMergeSymbols has cyclomatic complexity 31 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"918e3828551d7cd89942db43c622b4ec1528bdf4b773060950a5cb0df7abb7da"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseClass (cyclomatic 31): parser.parseClass has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":6489}}}],"partialFingerprints":{"codehealthFindingId/v1":"b168027a1c80c2576faabd668f1dbbe5f6dfe728d1597d98697ff71db77f3ade"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printNonNegativeFloat (cyclomatic 31): printer.printNonNegativeFloat has cyclomatic complexity 31 (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":"internal/js_printer/js_printer.go"},"region":{"startLine":3564}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cb9a5324357bf4871314406b3743f841aa11e1bfe90b7c4de42184aa2a4e75"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.generateSourceMapForChunk (cyclomatic 31): linkerContext.generateSourceMapForChunk has cyclomatic complexity 31 (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":"internal/linker/linker.go"},"region":{"startLine":7001}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aeedc9c3e0fb15a69f00fae792db1a255e509887d849982c4e29fcb57687c1f"}},{"ruleId":"D1","level":"warning","message":{"text":"css_parser.parseGradient (cyclomatic 30): css_parser.parseGradient has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_gradient.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"092291fdf42ed70a89e0d3ab4343a39809201e80bcb8a1342c074478121110b1"}},{"ruleId":"D1","level":"warning","message":{"text":"css_parser.removeColorInterpolation (cyclomatic 30): css_parser.removeColorInterpolation has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_gradient.go"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff972ea515bd01ed8bef5efa0173b37706c44278e51de18042a1f127d70b169"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseCompoundSelector (cyclomatic 30): parser.parseCompoundSelector has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_parser_selector.go"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5da998d6e69d3f5600847d294cfbc18709c345a0186dd0f363db9b25f5c026"}},{"ruleId":"D1","level":"warning","message":{"text":"js_ast.ShouldFoldBinaryOperatorWhenMinifying (cyclomatic 30): js_ast.ShouldFoldBinaryOperatorWhenMinifying has cyclomatic complexity 30 (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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"15213d9cff20b14e2ecd262c9608aa3d65bb54f9bed704b70042dee3af518840"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.scanCommentText (cyclomatic 30): Lexer.scanCommentText has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_lexer/js_lexer.go"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"3478c7105e052bb81d73052d2c2e9f6d739a835a6a0ccbf6df966e5810748cb4"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseTypeScriptNamespaceStmt (cyclomatic 30): parser.parseTypeScriptNamespaceStmt has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/ts_parser.go"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc42ce41004bb4db3eeb4323eaf16bc44bca09ffb659ac4ffe2fb6e3828d6408"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.generateEntryPointTailJS (cyclomatic 30): linkerContext.generateEntryPointTailJS has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":4997}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75674c0105b612915bdab62abfbac4c0055167b93c7eebb3a2b2257100ab575"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseBinding (cyclomatic 29): parser.parseBinding has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":5999}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca366e7ad2e062424270e1a30621ebbecac9d29a232e49837b55a3307bf4b66"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.prepareForVisitPass (cyclomatic 29): parser.prepareForVisitPass has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":18319}}}],"partialFingerprints":{"codehealthFindingId/v1":"8884c0bfef62a1576d4f9d4cb470f2efa7b767db81f914eb5fce9744e0e61eb3"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.markSyntaxFeature (cyclomatic 29): parser.markSyntaxFeature has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ee1bc5caf752df3fda7ad16354d1d7accb2f9ca6dfd149737bcfcebaebe5b1"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.insertStmtsAfterSuperCall (cyclomatic 29): parser.insertStmtsAfterSuperCall has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":2451}}}],"partialFingerprints":{"codehealthFindingId/v1":"749db6e0a097d0e2b3652c125227657c0306a7e4102dbd1c1182eac2d11cacc9"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.matchImportWithExport (cyclomatic 29): linkerContext.matchImportWithExport has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":2633}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2d6bc84ee87b223d8d4429f8b24f631650618a946f66e41aea35e8eb1c06ee"}},{"ruleId":"D1","level":"warning","message":{"text":"logger.formatLineSpan (cyclomatic 29): logger.formatLineSpan has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/logger/style.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a641638632e5d47b9363c502953cc8e1b1a12cb1aa64a95f57a6aed2bfe2722"}},{"ruleId":"D1","level":"warning","message":{"text":"resolverQuery.finalizeResolve (cyclomatic 29): resolverQuery.finalizeResolve has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/resolver.go"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf46c5151b8b89573873921a296bbb875442b0b7e6a51b1ba389aab767cc1e8"}},{"ruleId":"D1","level":"warning","message":{"text":"resolverQuery.loadAsMainField (cyclomatic 29): resolverQuery.loadAsMainField has cyclomatic complexity 29 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 6 belong 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":"internal/resolver/resolver.go"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7c00f0d146b20d3f5cb901bf73bc7147f5dbda4a3a7ae3139d7638143f3626"}},{"ruleId":"D1","level":"warning","message":{"text":"resolverQuery.resolveToUnqualified (cyclomatic 29): resolverQuery.resolveToUnqualified has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/yarnpnp.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"14802694d09b0bb596324ac7c6cad5e3b5eb3d28f470babc616aa7868e9404cc"}},{"ruleId":"D1","level":"warning","message":{"text":"serviceType.handleBuildRequest (cyclomatic 28): serviceType.handleBuildRequest has cyclomatic complexity 28 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 14 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/esbuild/service.go"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b560bac9d189f63c5a2ec38251a6e94b8e137fd8768034cd190c096b71cc574"}},{"ruleId":"D1","level":"warning","message":{"text":"bundler.runOnLoadPlugins (cyclomatic 28): bundler.runOnLoadPlugins 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":"internal/bundler/bundler.go"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"557dc5381fa65dcb94d4c52eacfe535e0373583fd97ed74e377b9d9e8ea83e9d"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.skipTypeScriptTypeParameters (cyclomatic 28): parser.skipTypeScriptTypeParameters 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":"internal/js_parser/ts_parser.go"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"736194e3033c2112b2d51202e2d8c51bacc4b7953965a681e0959da6a533a5fa"}},{"ruleId":"D1","level":"warning","message":{"text":"Options.Equal (cyclomatic 28): Options.Equal has cyclomatic complexity 28 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"860b1f93e9e54915eec6b0e7d4ab08df665f4950a5fcb525cdab28351dd8002a"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.maybeAppendLegalComments (cyclomatic 28): linkerContext.maybeAppendLegalComments 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":"internal/linker/linker.go"},"region":{"startLine":6549}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbaeba9349e0c452da512e39cdc694ec3627ed8e534073e0d13f2bceea433839"}},{"ruleId":"D1","level":"warning","message":{"text":"resolver.parseImportsExportsMap (cyclomatic 28): resolver.parseImportsExportsMap has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 2 of the 28 points are its own statements and the rest belongs to one function literal inside it that branches (line 644). 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":"internal/resolver/package_json.go"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc04ebf08c812d6eafb5301ab59545d4ac63fa6fa896619c5e2d7824ebd833e"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.lowerNestingInRuleWithContext (cyclomatic 27): parser.lowerNestingInRuleWithContext has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_nesting.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96fad32abb0b1e2b07e1e2a1a315a850e33ff538ee9fc2ad6883a7b16f0bc51"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseAttributeSelector (cyclomatic 27): parser.parseAttributeSelector 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":"internal/css_parser/css_parser_selector.go"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac369bb70f8e2e48f23a43024f0ba59b5f57bd42bee16b2def3be3ba3fb4ff0"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printQuotedWithQuote (cyclomatic 27): printer.printQuotedWithQuote 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":"internal/css_printer/css_printer.go"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3565c9a877b734cda2a6343924142feea43b0c0e3404a30493b79a8b97593b"}},{"ruleId":"D1","level":"warning","message":{"text":"js_ast.ToBooleanWithSideEffects (cyclomatic 27): js_ast.ToBooleanWithSideEffects has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":2014}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e1245f63d3b87a6d87e59748eff08bd0fb5ee4eb0bb4e170f54914e459f947"}},{"ruleId":"D1","level":"warning","message":{"text":"jsonParser.parseExpr (cyclomatic 27): jsonParser.parseExpr 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":"internal/js_parser/json_parser.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9549fdbf0c7d2f74391c648ddf9addde545f3258e26fd9ebdf9c3a8d70ed74f0"}},{"ruleId":"D1","level":"warning","message":{"text":"logger.NewStderrLog (cyclomatic 27): logger.NewStderrLog has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 4 of the 27 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 730, 700). 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":"internal/logger/logger.go"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"110b1a95eb519daef4242c1d078e6aa870e580c3bc72211a80ae459284951608"}},{"ruleId":"D1","level":"warning","message":{"text":"logger.PrintSummary (cyclomatic 27): logger.PrintSummary has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to one function literal inside it that branches (line 1007). 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":"internal/logger/logger.go"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8efd1b9edc03c478a64facbd1614f66050555d1e619640ee7caac696aba843"}},{"ruleId":"D1","level":"warning","message":{"text":"resolver.NewResolver (cyclomatic 27): resolver.NewResolver 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":"internal/resolver/resolver.go"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a9815c8dc7f0c36d34b6f670691a6797858cadea3e82e22b976808033e310a"}},{"ruleId":"D1","level":"warning","message":{"text":"lowerClassContext.lowerField (cyclomatic 26): lowerClassContext.lowerField 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":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc50a64f4c593fa8cd5d8762661b35ce68706116e163cb1ab21dd87158c2650"}},{"ruleId":"D1","level":"warning","message":{"text":"resolverQuery.matchTSConfigPaths (cyclomatic 26): resolverQuery.matchTSConfigPaths 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":"internal/resolver/resolver.go"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"613b9260dd55c5f0ad3f456d3734e392b8431376e1a17ba2eb195883d9a0ae74"}},{"ruleId":"D1","level":"warning","message":{"text":"api.validateFeatures (cyclomatic 26): api.validateFeatures 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":"pkg/api/api_impl.go"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e28e505e0a90e30aa2ee3dbe8c325afa6f4dd0a22951a10604515e01c3f70a"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.mangleFont (cyclomatic 25): parser.mangleFont has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_font.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3982ab31e817c99c4d5dbbac7512c91714fb9124b2867a1b21aad1aef68de0"}},{"ruleId":"D1","level":"warning","message":{"text":"realFS.WatchData (cyclomatic 25): realFS.WatchData has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 10 of the 25 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 481, 515, 523, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fs/fs_real.go"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af99bd79526bb10754d98b2ef72417ca2bddfa83cde8c487a99eec06dfee4c9"}},{"ruleId":"D1","level":"warning","message":{"text":"graph.CloneLinkerGraph (cyclomatic 25): graph.CloneLinkerGraph has cyclomatic complexity 25 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 10 belong to one function literal inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/graph/graph.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ea840296c1a6734b83a4f6925deea81df2f35a68b23040205a6a83e44c8fd7"}},{"ruleId":"D1","level":"warning","message":{"text":"HelperContext.isSideEffectFreeUnboundIdentifierRef (cyclomatic 25): HelperContext.isSideEffectFreeUnboundIdentifierRef has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":2637}}}],"partialFingerprints":{"codehealthFindingId/v1":"37957f6e774bf368400370e870fbcb61fb73829023238128d72e6ce588bea039"}},{"ruleId":"D1","level":"warning","message":{"text":"js_parser.shouldKeepStmtInDeadControlFlow (cyclomatic 25): js_parser.shouldKeepStmtInDeadControlFlow has cyclomatic complexity 25 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":8820}}}],"partialFingerprints":{"codehealthFindingId/v1":"2253621731c1f4d951bdba843de5e75a512bd98546aecdb591aee1edaae833fa"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.instantiateDefineExpr (cyclomatic 25): parser.instantiateDefineExpr has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":12678}}}],"partialFingerprints":{"codehealthFindingId/v1":"56423e4dd288a3d50c4735527e2819dae5f00111c904c4ff5cd0059f3265ea73"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.maybeMarkKnownGlobalConstructorAsPure (cyclomatic 25): parser.maybeMarkKnownGlobalConstructorAsPure has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":16929}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59073d9583428a87e92c3f8c0dd57c2118782dc17f4bf70ae830a58be8436e4"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.lowerAndMangleBoxShadow (cyclomatic 24): parser.lowerAndMangleBoxShadow has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_box_shadow.go"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b399933620278bf9c92b25b4a379b6020c848e258c198d1c3fcb83b031c0cc"}},{"ruleId":"D1","level":"warning","message":{"text":"helpers.internalQuote (cyclomatic 24): helpers.internalQuote has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/helpers/quote.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c1a972e2540fec82440656834908b894a0becc14bc478bc52db416feb80681"}},{"ruleId":"D1","level":"warning","message":{"text":"js_parser.duplicateCaseEquals (cyclomatic 24): js_parser.duplicateCaseEquals has cyclomatic complexity 24 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c844fed3c40d4c110dcd490ef3294089f88356628411d764ba7249b27621cf"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseAndDeclareDecls (cyclomatic 24): parser.parseAndDeclareDecls has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":5601}}}],"partialFingerprints":{"codehealthFindingId/v1":"9345c63db37f31bdcb44df2e1d6437c9b5431f7127ea70de30e0e2b5300c7f70"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseExportClause (cyclomatic 24): parser.parseExportClause has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":5856}}}],"partialFingerprints":{"codehealthFindingId/v1":"78736782465b81a355a85d3cf8edecc3f685ffc2f706319b1fbcf1f3caf887db"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.skipTypeScriptObjectType (cyclomatic 24): parser.skipTypeScriptObjectType has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/ts_parser.go"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"151fe3adab811d02d56c90f1bf71d703f8c51ce6a88d9e6e6253817cb3e591a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Bundle.Compile (cyclomatic 23): Bundle.Compile 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":"internal/bundler/bundler.go"},"region":{"startLine":3050}}}],"partialFingerprints":{"codehealthFindingId/v1":"78510aaafc26c797b729163d00a7bcb08516ede967b4d788a92a99ef190b10d5"}},{"ruleId":"D1","level":"warning","message":{"text":"css_lexer.decodeEscapesInToken (cyclomatic 23): css_lexer.decodeEscapesInToken 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":"internal/css_lexer/css_lexer.go"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f00890f6e4cda129ad3da4d4f7e0c48340f8ac4590685bf80cca8b372eeda4"}},{"ruleId":"D1","level":"warning","message":{"text":"css_parser.removeImpliedPositions (cyclomatic 23): css_parser.removeImpliedPositions 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":"internal/css_parser/css_decls_gradient.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a07d3400250776e0a07cbf62300644e8893003873f869d20a739722a65b976"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.processListStyleShorthand (cyclomatic 23): parser.processListStyleShorthand 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":"internal/css_parser/css_decls_list_style.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c6575fc54274b4630c422498e7a83d291600255150121cd0c80fe78e601005"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.scanForEndOfRule (cyclomatic 23): parser.scanForEndOfRule 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":"internal/css_parser/css_parser.go"},"region":{"startLine":2308}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d1fc7251d5a31ad69981c74b050aba2f6ff8d324eca58be92cf99c0c4a2d1d"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseSelectorList (cyclomatic 23): parser.parseSelectorList 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":"internal/css_parser/css_parser_selector.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5f1b650f44381332426936fbe3eb6c5bcb38255c585838fce7e39d6b4dff03"}},{"ruleId":"D1","level":"warning","message":{"text":"js_ast.FoldStringAddition (cyclomatic 23): js_ast.FoldStringAddition 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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"218af89facba22f8ad8f101f2b1df0dd8964e03a0fb4d9a2b2e987a0efa20b22"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseAsyncPrefixExpr (cyclomatic 23): parser.parseAsyncPrefixExpr has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":2992}}}],"partialFingerprints":{"codehealthFindingId/v1":"5810b71f811de8448c3e0bd2f02b62176cee993374bd2bc09c12de98b7a43799"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.lateConstantFoldUnaryOrBinaryOrIfExpr (cyclomatic 23): printer.lateConstantFoldUnaryOrBinaryOrIfExpr 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":"internal/js_printer/js_printer.go"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafa4233cf7e6f4da4c99f3c8e4f7e6ecbf82ba0c8d48bda13e245a07f066770"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.generateCodeForLazyExport (cyclomatic 23): linkerContext.generateCodeForLazyExport has cyclomatic complexity 23 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7677db5dc671576025f127c8ca8d8353fb88c4b361bf9bca316344dcb71400c"}},{"ruleId":"D1","level":"warning","message":{"text":"apiHandler.broadcastBuildResult (cyclomatic 23): apiHandler.broadcastBuildResult has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 belong 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":"pkg/api/serve_other.go"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"71db18ca9a453fe4373070f42ea9ac2471910507d5e10a9c8b1da950d650a86e"}},{"ruleId":"D1","level":"warning","message":{"text":"scanner.maybeParseFile (cyclomatic 22): scanner.maybeParseFile 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":"internal/bundler/bundler.go"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a854bc13dfd45bb74999f326a3cda4f2106fedd41d2c02efe42e9918c86a633"}},{"ruleId":"D1","level":"warning","message":{"text":"lexer.consumeNumeric (cyclomatic 22): lexer.consumeNumeric 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":"internal/css_lexer/css_lexer.go"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0460ed6f23bd4d9de23831675417aee2a4569f19a33245e842de492f25f869d"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printWithEscape (cyclomatic 22): printer.printWithEscape has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_printer/css_printer.go"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0cd794b83b7a4a4ab8d5af0ff4f630fbea39293d6197bf83295ded7cf9f749"}},{"ruleId":"D1","level":"warning","message":{"text":"HelperContext.ClassCanBeRemovedIfUnused (cyclomatic 22): HelperContext.ClassCanBeRemovedIfUnused 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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":2335}}}],"partialFingerprints":{"codehealthFindingId/v1":"c585395f1c7b5b5e434b3079784131f4bc373cbe505bbdb73d03bf53d46e42dd"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseStmtsUpTo (cyclomatic 22): parser.parseStmtsUpTo 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":8504}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15d4c571bdd8ff37c3691415aae1f56b6e8d4539620e7723799cdc93cd60bfc"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.generateChunksInParallel (cyclomatic 22): linkerContext.generateChunksInParallel has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 9 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 659). 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":"internal/linker/linker.go"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62b2cfb9b3d3441025edc42e1ed9d849e4dead09cec2ea80bf875a86aee7eb6"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.findImportedPartsInJSOrder (cyclomatic 22): linkerContext.findImportedPartsInJSOrder has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 4168). 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":"internal/linker/linker.go"},"region":{"startLine":4144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c71bc8d5a6a4c2be3fd9bcdb77e7fd83e0d00f67e0b7752bdc95fc0ee923269"}},{"ruleId":"D1","level":"warning","message":{"text":"logger.GenerateStringInJSTable (cyclomatic 22): logger.GenerateStringInJSTable 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":"internal/logger/logger.go"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"108fc6f37094622113f059642a81d4f71a7ef47e78997ce878118a857dd32b2d"}},{"ruleId":"D1","level":"warning","message":{"text":"api.validateDefines (cyclomatic 22): api.validateDefines 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":"pkg/api/api_impl.go"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"3610ede2ed7390dee3aef3b51a3d7dc15b452290c75bd160758d3ed334cf7f38"}},{"ruleId":"D1","level":"warning","message":{"text":"api.transformImpl (cyclomatic 22): api.transformImpl has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/api/api_impl.go"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93e3688f4f3c1ea01e6755503084d61db5c9f0bccdd4ad98606902de7780567"}},{"ruleId":"D1","level":"warning","message":{"text":"main.decodePacket (cyclomatic 21): main.decodePacket 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 one function literal inside it that branches (line 113). 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":"cmd/esbuild/stdio_protocol.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd25f9e46db09e851f6b197699505b623ee8c3452b07345e4cb1f398410cb23"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseDeclaration (cyclomatic 21): parser.parseDeclaration has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_parser.go"},"region":{"startLine":2391}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a2cb517bcbd1f43ec01d5344b6acf6f2219e22e84d07d95d74b5c1e0291b46"}},{"ruleId":"D1","level":"warning","message":{"text":"js_ast.MaybeSimplifyNot (cyclomatic 21): js_ast.MaybeSimplifyNot has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd4865ab68862b25fee9f90e8dbc19b518b4a5642f0b5f9a3242eb49e45ec4d"}},{"ruleId":"D1","level":"warning","message":{"text":"lowerClassContext.hoistComputedProperties (cyclomatic 21): lowerClassContext.hoistComputedProperties has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"286104efc97bce629bef92b7bd6e4c30a5115ecaa1c98504a780f61c4f58e388"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printDecorators (cyclomatic 21): printer.printDecorators has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a07d2093bcaac4c0203e83c1fdee4e9f0935166360e710105690423bf34198"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.generateExtraDataForFileJS (cyclomatic 21): linkerContext.generateExtraDataForFileJS has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/debug.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b4e780c0fe7442b1c31fb93a72def6d6b62524e5aea23f2e9b9e21a31cc128"}},{"ruleId":"D1","level":"warning","message":{"text":"index.supportMapToVersionRanges (cyclomatic 21): index.supportMapToVersionRanges has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compat-table/src/index.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e750732e1496694add940f5de53988dede01ce26251bc5ceaee3a7f862e8cdf"}},{"ruleId":"D1","level":"warning","message":{"text":"bundler.RunOnResolvePlugins (cyclomatic 20): bundler.RunOnResolvePlugins 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":"internal/bundler/bundler.go"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"9877e20c64626d79c5a1f531d452a1ad901ae11c4136661ad2f9b91ad12a750d"}},{"ruleId":"D1","level":"warning","message":{"text":"css_parser.mangleNumber (cyclomatic 20): css_parser.mangleNumber has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_parser.go"},"region":{"startLine":2123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4dc96f95cc4acf7dff1158e5bfaf77056512e8415c59ea2c6dedc68291f4a1"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseListOfDeclarations (cyclomatic 20): parser.parseListOfDeclarations 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":"internal/css_parser/css_parser.go"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a78c7f5bcd7fdb36854c870ea6909b503f35b780fccc1b291f2a9300383acae"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseSelectorRule (cyclomatic 20): parser.parseSelectorRule 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":"internal/css_parser/css_parser.go"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"da445f489ae45e1cfbb1fa82c6ba92022095fda65c6b2cce4cb598fccf96617f"}},{"ruleId":"D1","level":"warning","message":{"text":"calcProduct.partiallySimplify (cyclomatic 20): calcProduct.partiallySimplify 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":"internal/css_parser/css_reduce_calc.go"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f4852fa65cf9d6ed1b7679ac9cf58e718fafefbd03add29aabcfa7c6ec358c"}},{"ruleId":"D1","level":"warning","message":{"text":"helpers.EncodeStringAsPercentEscapedDataURL (cyclomatic 20): helpers.EncodeStringAsPercentEscapedDataURL has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/helpers/dataurl.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e3e29141110600e13bb68f7fc209ca2e8aa3bcdfc498a18e1fff62d8a8c51b"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseImportClause (cyclomatic 20): parser.parseImportClause 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":5735}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0682df29c9db533635c9e1760a4e83b56559d5a47d2101ad7fce6860485530"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseDecorator (cyclomatic 20): parser.parseDecorator 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":6956}}}],"partialFingerprints":{"codehealthFindingId/v1":"23aac1c1605eaed432f05dd58dcd0f0d66694b7d696633789c837ab265bcc8c0"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseTypeScriptEnumStmt (cyclomatic 20): parser.parseTypeScriptEnumStmt 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":"internal/js_parser/ts_parser.go"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"00018489627f465362161e3c7f0a4b22395f04a361a03ef6ba8918b0232abe52"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printNumber (cyclomatic 20): printer.printNumber 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":"internal/js_printer/js_printer.go"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"935546a1497a290b1d58aec5a44fa9df6e7946cd139b3da04910a483ae2538e8"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.generateGlobalNamePrefix (cyclomatic 20): linkerContext.generateGlobalNamePrefix 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":"internal/linker/linker.go"},"region":{"startLine":6004}}}],"partialFingerprints":{"codehealthFindingId/v1":"0964df2cd9d12ad12957fd313598ca2eba525914633fa8273f7c68d9d1600a64"}},{"ruleId":"D1","level":"warning","message":{"text":"logger.PlatformIndependentPathDirBaseExt (cyclomatic 20): logger.PlatformIndependentPathDirBaseExt 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":"internal/logger/logger.go"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"959ddee980ac175aafdb1d39f463760d9ea6004045359ded2b111b6e7dfd384f"}},{"ruleId":"D1","level":"warning","message":{"text":"logger.msgString (cyclomatic 20): logger.msgString 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":"internal/logger/style_default.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"878e7a158b1946e12697ba4fffa97494c34b9ab4fef68e42fa4a5f200c22938d"}},{"ruleId":"D1","level":"warning","message":{"text":"resolver.isValidTSConfigPathNoBaseURLPattern (cyclomatic 20): resolver.isValidTSConfigPathNoBaseURLPattern has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/tsconfig_json.go"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d130c4e15a0ea396e474ee580e5ed2e37be6f8e2618f13e51cb2a2b5262f38b"}},{"ruleId":"D1","level":"warning","message":{"text":"resolverQuery.esmPackageTargetReverseResolve (cyclomatic 20): resolverQuery.esmPackageTargetReverseResolve 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":"internal/resolver/package_json.go"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"c241ebdb65d92cd4dbce136322f07c97b981f221b083550ba20892ea07a3521b"}},{"ruleId":"D1","level":"warning","message":{"text":"resolverQuery.checkForBuiltInNodeModules (cyclomatic 20): resolverQuery.checkForBuiltInNodeModules 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":"internal/resolver/resolver.go"},"region":{"startLine":2539}}}],"partialFingerprints":{"codehealthFindingId/v1":"62bd9e2fed7f016b6631b9fc70938fe95123867fc805cf832c676aa7475829f1"}},{"ruleId":"D1","level":"warning","message":{"text":"common.createChannel.transform (cyclomatic 20): common.createChannel.transform has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 4 of the 20 points are its own statements and the rest belongs to 5 function items inside it that branch (start, a function literal at line 724, a function literal at line 729, \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":"lib/shared/common.ts"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f441e422c3772d65823426f6793dc149eaac7dbf0a297f6ec34bbd19fbe11b2"}},{"ruleId":"D1","level":"warning","message":{"text":"bundler.ResolveFailureErrorTextSuggestionNotes (cyclomatic 19): bundler.ResolveFailureErrorTextSuggestionNotes 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":"internal/bundler/bundler.go"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4def244259130c33a9031c65e0cc988334be90a6758ae330586a90f89d97e29"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.processAnimationShorthand (cyclomatic 19): parser.processAnimationShorthand 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":"internal/css_parser/css_decls_animation.go"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8ff73ebd18c970f48ef5ab03ee1e137cf049713430f6f3afa0fedf9880f1e8"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parseMediaInParens (cyclomatic 19): parser.parseMediaInParens 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":"internal/css_parser/css_parser_media.go"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe74c7d1d580368b9d9069666323acbfc18a3e0b4621c4fc404af1aefb3ac53"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.warnAboutDuplicateProperties (cyclomatic 19): parser.warnAboutDuplicateProperties 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c651cbd4a317e0bc019e223353673dad74c363e8889a6ccedd08b312c83e37"}},{"ruleId":"D1","level":"warning","message":{"text":"Source.CommentTextWithoutIndent (cyclomatic 19): Source.CommentTextWithoutIndent 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":"internal/logger/logger.go"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"4946f1ac325adda83a2374a10ba12510828a30e6d81848f89fe720354db769f2"}},{"ruleId":"D1","level":"warning","message":{"text":"resolverQuery.esmPackageExportsResolve (cyclomatic 19): resolverQuery.esmPackageExportsResolve 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":"internal/resolver/package_json.go"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"705da7a2ab2ded24b4b92c479dff3d9c89dfbe114441baf7e3e43f0f7d97f088"}},{"ruleId":"D1","level":"warning","message":{"text":"resolverQuery.esmPackageImportsExportsResolve (cyclomatic 19): resolverQuery.esmPackageImportsExportsResolve 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":"internal/resolver/package_json.go"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8f866c550b86ed0517de88476ad3f0f0900ede7d7d248e2f4da3bcf78a3ced"}},{"ruleId":"D1","level":"warning","message":{"text":"bundler.lowestCommonAncestorDirectory (cyclomatic 18): bundler.lowestCommonAncestorDirectory 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":"internal/bundler/bundler.go"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d10bf5879bda4a4b3fd0287a73adda3e86456f7ad06d1dafdd0831f362ba77"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.captureValueWithPossibleSideEffects (cyclomatic 18): parser.captureValueWithPossibleSideEffects has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":12029}}}],"partialFingerprints":{"codehealthFindingId/v1":"584d0e31f1d92cfd5931336939c810ca8b4b4e474a62626911494da6872e1ca3"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.isDotOrIndexDefineMatch (cyclomatic 18): parser.isDotOrIndexDefineMatch 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":12619}}}],"partialFingerprints":{"codehealthFindingId/v1":"02614804842bb2853dafa9952c2a1e8f22deb39263c761949cc8297d9f41b80f"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printSpaceBeforeOperator (cyclomatic 18): printer.printSpaceBeforeOperator has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2aa1c8b80528d771beb1b04d195606366e9868297006fbc0f45db01b65e38e"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.mangleLocalCSS (cyclomatic 18): linkerContext.mangleLocalCSS 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":"internal/linker/linker.go"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fbe3a3a3a2005b60eeba2334862aaa0757da7477a6767d0db63afe35d22bd6"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.markFileLiveForTreeShaking (cyclomatic 18): linkerContext.markFileLiveForTreeShaking 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":"internal/linker/linker.go"},"region":{"startLine":3220}}}],"partialFingerprints":{"codehealthFindingId/v1":"77616b6f454aa52c630fc307c04d9cf832ea885b2484b753e4a1b41435b9480f"}},{"ruleId":"D1","level":"warning","message":{"text":"resolverQuery.loadAsFile (cyclomatic 18): resolverQuery.loadAsFile has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 4 belong 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":"internal/resolver/resolver.go"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"449c45e9d1717161609c6f9d02c8075143777a4e8b08228b500650ee887f9694"}},{"ruleId":"D1","level":"warning","message":{"text":"common.sanitizeLocation (cyclomatic 18): common.sanitizeLocation has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shared/common.ts"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f7a1d28ba39d155ce2a9f596f1ced7e630431e3001d1fb7fca33b6b047e550"}},{"ruleId":"D1","level":"warning","message":{"text":"scanner.preprocessInjectedFiles (cyclomatic 17): scanner.preprocessInjectedFiles has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 1756). 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":"internal/bundler/bundler.go"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31b4427ac26e1d333ad7b04123f659254f4b6c409646b2405a95097ee018fa2"}},{"ruleId":"D1","level":"warning","message":{"text":"compat.CompareSemver (cyclomatic 17): compat.CompareSemver has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/compat/compat.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f25342a6c39f54291acd1d72d28dc75e6e2462553b94b62e41e9a9e7c9a7b7"}},{"ruleId":"D1","level":"warning","message":{"text":"Token.Equal (cyclomatic 17): Token.Equal has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_ast/css_ast.go"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27d3db3c07bc47aab0ea6a026f871de488e128548af4980ec42a9ce0dfdd494"}},{"ruleId":"D1","level":"warning","message":{"text":"css_parser.isSafeSelectors (cyclomatic 17): css_parser.isSafeSelectors has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_parser.go"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"342ba5bce8271484221e00db5a40c147044c8d9df449d716f90cecb23d821b42"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.expectWithMatchingLoc (cyclomatic 17): parser.expectWithMatchingLoc has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_parser.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cccbaf798ddac28046aefb723581cff74a1f6b8c31259ed88ac888bd0e5a2b"}},{"ruleId":"D1","level":"warning","message":{"text":"fs.ParseYarnPnPVirtualPath (cyclomatic 17): fs.ParseYarnPnPVirtualPath has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fs/fs_zip.go"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac62f1fee066c6e99bae055d0e0719d8fa4257a120324e459ab7c2a6b754cd23"}},{"ruleId":"D1","level":"warning","message":{"text":"mockFS.Rel (cyclomatic 17): mockFS.Rel has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fs/fs_mock.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bf2c4e93abe4f3d8bc9868e4c676c036cfbb988c7acca48f77ca3f5502259e"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.NextJSXElementChild (cyclomatic 17): Lexer.NextJSXElementChild has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_lexer/js_lexer.go"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"6960edc3d1a3d9066f0c60ea8a971c1c01b2f18c7b5bb5971c43cb6914ede058"}},{"ruleId":"D1","level":"warning","message":{"text":"js_parser.duplicateCaseHash (cyclomatic 17): js_parser.duplicateCaseHash has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function taking that case\u0027s concrete type, so the dispatch reads one line per case. These arms are selected by TYPE rather than by value, so there is no key a lookup table could be built on; where you own the matched types, giving them one shared interface method and calling that is the form a table would have taken, and where you do not, keep the cases \u2014 they stay explicit and reviewable. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc4794fd5f1ad2c396cf2761fe277fee86b2a2d542c9d5441e584eb94ee29f6"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.globPatternFromExpr (cyclomatic 17): parser.globPatternFromExpr has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":16758}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df804be79a813ffd4469a41d7de56c28c58d2c2da28bbb5f0ce8c5a53131e8a"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.lowerSuperPropertyOrPrivateInAssign (cyclomatic 17): parser.lowerSuperPropertyOrPrivateInAssign has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecef4424a64434ff233449cff202d377461c83d446ca345efb39a40f795202c6"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.skipTypeScriptBinding (cyclomatic 17): parser.skipTypeScriptBinding has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/ts_parser.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f08d56f7ab1601aa9df7ad65d811e1f12b3438cda08476b8f4693f63c095b3"}},{"ruleId":"D1","level":"warning","message":{"text":"linker.Link (cyclomatic 17): linker.Link has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04b68e60b9c1c608729f6b9e6a428773b970cbe21d9940180560aab6df15b81"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.mangleProps (cyclomatic 17): linkerContext.mangleProps has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"62dbfd6130c831404d4473093413f0934f1aca6bfa451a50dafef9b918918fbe"}},{"ruleId":"D1","level":"warning","message":{"text":"mdn.addFeatures (cyclomatic 17): mdn.addFeatures has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compat-table/src/mdn.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f198ac361bc9bab5cb47b9e9e21309f1e27b144da9f14e9f3ea1bd20dd213559"}},{"ruleId":"D1","level":"warning","message":{"text":"scanner.scanAllDependencies (cyclomatic 16): scanner.scanAllDependencies 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":"internal/bundler/bundler.go"},"region":{"startLine":2176}}}],"partialFingerprints":{"codehealthFindingId/v1":"8803360b63991d520007e618aeff71c105eb1da7d11a6efbd562adbe6a5244e9"}},{"ruleId":"D1","level":"warning","message":{"text":"lexer.consumeURL (cyclomatic 16): lexer.consumeURL 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":"internal/css_lexer/css_lexer.go"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77f131cb26c37b26ceb5a3af8bd8392773402a3687156105290d849152799e3"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.handleComposesPragma (cyclomatic 16): parser.handleComposesPragma 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":"internal/css_parser/css_decls_composes.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b8054bf3c5ce4487912a3613653242818762f6248c7fc996b876c82eed3802"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.flattenLocalAndGlobalSelectors (cyclomatic 16): parser.flattenLocalAndGlobalSelectors 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":"internal/css_parser/css_parser_selector.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9d29f3242ffecaf04e67e7d9147b1f1c53bfd39c29af7ca45ac34d0ab4e8ed"}},{"ruleId":"D1","level":"warning","message":{"text":"helpers.DecodeWTF8Rune (cyclomatic 16): helpers.DecodeWTF8Rune has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/helpers/utf.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f38e8431b38479f18cbb35b08360d40eae467da4c3c4e59fae7916594484f4"}},{"ruleId":"D1","level":"warning","message":{"text":"js_ast.ToNullOrUndefinedWithSideEffects (cyclomatic 16): js_ast.ToNullOrUndefinedWithSideEffects has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":1939}}}],"partialFingerprints":{"codehealthFindingId/v1":"039e96b16f7677fd0d15004836eaf0f0c1d863aed0cd4283b405c4ebfbfaa25c"}},{"ruleId":"D1","level":"warning","message":{"text":"js_parser.analyzeSwitchCasesForLiveness (cyclomatic 16): js_parser.analyzeSwitchCasesForLiveness has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7dcf2a533093b8174ae206af7184ea2da71d8b3e667785a2de014710957b43"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parsePropertyBinding (cyclomatic 16): parser.parsePropertyBinding has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":2741}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c63f97bc93885ebdb20f2b03a58a2f747afd2a6d821ac2c37b9ca7d419cc2b4"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parsePath (cyclomatic 16): parser.parsePath has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: internal/js_parser/js_parser.go holds 49 of the 254 functions over the threshold \u2014 including the worst \u2014 and 2468 of the 7558 points over it (33%), 3.4\u00D7 the next-largest file (internal/js_printer/js_printer.go at 723). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":6648}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a4eb8b355b96c292796fd6b5197b38cd0edc179e539a95609c2d07ced17c63"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.generateClosureForTypeScriptNamespaceOrEnum (cyclomatic 16): parser.generateClosureForTypeScriptNamespaceOrEnum 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":"internal/js_parser/ts_parser.go"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa16fbf9fd6642f25e025ff42a39d3365786f1caf7dfac0375530c42f19079f5"}},{"ruleId":"D1","level":"warning","message":{"text":"lowerClassContext.insertInitializersIntoConstructor (cyclomatic 16): lowerClassContext.insertInitializersIntoConstructor 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":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4dbb1229cd9cf47975bb89e99477b0239a0998edc490af0a70c4261c8b4d52a"}},{"ruleId":"D1","level":"warning","message":{"text":"printer.printQuotedUTF16 (cyclomatic 16): printer.printQuotedUTF16 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":"internal/js_printer/js_printer.go"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"009dff6f1e2d0af74f9312db654013842488e27d7813d46148c4d75b1f41911f"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.markFileReachableForCodeSplitting (cyclomatic 16): linkerContext.markFileReachableForCodeSplitting 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":"internal/linker/linker.go"},"region":{"startLine":3167}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d3e5064d46d95efe6f700cac0d2c24bbfea8ce0fd7a34c8109f178b341737f"}},{"ruleId":"D1","level":"warning","message":{"text":"linkerContext.preventExportsFromBeingRenamed (cyclomatic 16): linkerContext.preventExportsFromBeingRenamed 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":"internal/linker/linker.go"},"region":{"startLine":6927}}}],"partialFingerprints":{"codehealthFindingId/v1":"5440447825bc1e4aa8637cabfb4aae546fa47bc95e33f7f7481088c9ba4672a0"}},{"ruleId":"D1","level":"warning","message":{"text":"pluginImpl.onResolve (cyclomatic 16): pluginImpl.onResolve has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 1963). 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. This is NOT this file\u0027s highest cyclomatic complexity: api.validateLoader (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/api/api_impl.go"},"region":{"startLine":1952}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2a11938dca9576e2202cb12804020369d99e2649e9c573a6c9f4b695c09fae"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.parseServeOptionsImpl (cyclomatic 16): cli.parseServeOptionsImpl 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":"pkg/cli/cli_impl.go"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf391b4fcb9b3b1e7a5cb4f7d18979f3b04679794e6c4a74325e84e31fb992c"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.visitExprInOut (cognitive 1654): parser.visitExprInOut has cognitive complexity 1654 (threshold 15). Drivers by points: if/else 382 (1334 pts), boolean chains 130, match/switch 26 (117 pts), loops 22 (73 pts) (nesting depth added 1094). Of this number, 1569 points are the body\u0027s own statements and 85 belong to 3 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":13552}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bff5f81401e2f870690f577db306fc2ce90991d3c219aac052544bf554b01d0"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printExpr (cognitive 745): printer.printExpr has cognitive complexity 745 (threshold 15). Drivers by points: if/else 239 (610 pts), boolean chains 83, loops 12 (31 pts), match/switch 8 (21 pts) (nesting depth added 403). 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":"internal/js_printer/js_printer.go"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"99efed931ccf13bbcb74a6802ef1db17c19ad20c8a6a6fe8efa3a2be19c4f703"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.visitAndAppendStmt (cognitive 628): parser.visitAndAppendStmt has cognitive complexity 628 (threshold 15). Drivers by points: if/else 177 (515 pts), boolean chains 56, loops 18 (48 pts), match/switch 4 (9 pts) (nesting depth added 373). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":10393}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b11b6f9f6a19f0073006d4819be12d874ac38d0559300168311d0c67b08d20a"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseStmt (cognitive 517): parser.parseStmt has cognitive complexity 517 (threshold 15). Drivers by points: if/else 127 (392 pts), boolean chains 63, match/switch 13 (45 pts), loops 5 (15 pts), jumps 2 (nesting depth added 307). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":7101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f77a96daf17ca98f4b4094f92e4653d5856b7f3ecd59023088f096d17ffaa8"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.scanImportsAndExports (cognitive 424): linkerContext.scanImportsAndExports has cognitive complexity 424 (threshold 15). Drivers by points: if/else 81 (315 pts), loops 29 (80 pts), boolean chains 22, match/switch 2 (6 pts), jumps 1 (nesting depth added 289). Of this number, 293 points are the body\u0027s own statements and 131 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80b986f8cce38ac70e2e6343c1a534046a49896a810007d10f82ae2a94e043e"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.parseOptionsImpl (cognitive 413): cli.parseOptionsImpl has cognitive complexity 413 (threshold 15). Drivers by points: if/else 153 (335 pts), boolean chains 41, match/switch 11 (33 pts), loops 2 (4 pts) (nesting depth added 206). 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":"pkg/cli/cli_impl.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67a956267c41818d6efb38baa3358aec01689dcb4a545a868efe012c5b0e975"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.mangleStmts (cognitive 380): parser.mangleStmts has cognitive complexity 380 (threshold 15). Drivers by points: if/else 80 (313 pts), boolean chains 23, loops 7 (22 pts), match/switch 5 (15 pts), jumps 7 (nesting depth added 258). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":9156}}}],"partialFingerprints":{"codehealthFindingId/v1":"137031a29fa5fc15f6a2f84e6643d0accedc1e258dd383626b00c0500058790d"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseSuffix (cognitive 331): parser.parseSuffix has cognitive complexity 331 (threshold 15). Drivers by points: if/else 94 (301 pts), boolean chains 13, match/switch 4 (13 pts), loops 2 (4 pts) (nesting depth added 218). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":4264}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e79673373d7c213ae7bc00ea4f5b0c878b75bbcf896d1ff6af571d9924d2130"}},{"ruleId":"D2","level":"warning","message":{"text":"bundler.parseFile (cognitive 325): bundler.parseFile has cognitive complexity 325 (threshold 15). Drivers by points: if/else 82 (258 pts), loops 9 (39 pts), match/switch 4 (16 pts), boolean chains 12 (nesting depth added 218). Of this number, 324 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f7b17f4cd29174348763639a20dd8a919b79e52a452873559d69e0bdd69a59"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.Next (cognitive 320): Lexer.Next has cognitive complexity 320 (threshold 15). Drivers by points: if/else 40 (140 pts), match/switch 29 (109 pts), loops 12 (46 pts), boolean chains 13, jumps 12 (nesting depth added 214). 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":"internal/js_lexer/js_lexer.go"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a146684bc2fc6828ea34230df19edfb3f6de0960fac2a9cd7474133e7faf920"}},{"ruleId":"D2","level":"warning","message":{"text":"binaryExprVisitor.visitRightAndFinish (cognitive 302): binaryExprVisitor.visitRightAndFinish has cognitive complexity 302 (threshold 15). Drivers by points: if/else 104 (276 pts), boolean chains 17, match/switch 4 (9 pts) (nesting depth added 177). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":16067}}}],"partialFingerprints":{"codehealthFindingId/v1":"06eb53b46fd66557ce73d4684d87ca59d00a8e1f77ad9eaa4160d00d61b949eb"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver.compileYarnPnPData (cognitive 285): resolver.compileYarnPnPData has cognitive complexity 285 (threshold 15). Drivers by points: if/else 36 (242 pts), loops 6 (37 pts), boolean chains 6 (nesting depth added 237). 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":"internal/resolver/yarnpnp.go"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f356aed92d6ce7730444cc659923cf3112a69220bd6c097e866f6262a793425"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseAtRule (cognitive 280): parser.parseAtRule has cognitive complexity 280 (threshold 15). Drivers by points: if/else 65 (207 pts), match/switch 9 (23 pts), boolean chains 20, loops 6 (19 pts), jumps 11 (nesting depth added 169). Of this number, 279 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_parser.go"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94e642396a3c3c24cd47d6b7d2b3c0211ee397db934062808f6f7b1ab541bd9"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseProperty (cognitive 262): parser.parseProperty has cognitive complexity 262 (threshold 15). Drivers by points: if/else 76 (201 pts), boolean chains 42, match/switch 6 (19 pts) (nesting depth added 138). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8ce618a4ea92542778168e3cff08488db287ea9df3d65d3243d0e9fda255a4"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printStmt (cognitive 259): printer.printStmt has cognitive complexity 259 (threshold 15). Drivers by points: if/else 99 (220 pts), boolean chains 17, loops 5 (12 pts), match/switch 5 (10 pts) (nesting depth added 133). 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":"internal/js_printer/js_printer.go"},"region":{"startLine":4101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2827fc44262dbc662b2d12539b3e240af4837a035730bad8e39a08d448aaa2"}},{"ruleId":"D2","level":"warning","message":{"text":"css_parser.parseColor (cognitive 257): css_parser.parseColor has cognitive complexity 257 (threshold 15). Drivers by points: if/else 45 (220 pts), match/switch 10 (33 pts), boolean chains 4 (nesting depth added 198). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_color.go"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"562cc9f77d8d2c5deec575e1878a4c29021455f3012ee48d9e6285696ea05828"}},{"ruleId":"D2","level":"warning","message":{"text":"scanner.processScannedFiles (cognitive 254): scanner.processScannedFiles has cognitive complexity 254 (threshold 15). Drivers by points: if/else 58 (211 pts), loops 10 (23 pts), boolean chains 11, match/switch 2 (9 pts) (nesting depth added 173). 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":"internal/bundler/bundler.go"},"region":{"startLine":2361}}}],"partialFingerprints":{"codehealthFindingId/v1":"5129103e269dd54ea098568c7caeb5b267042e27ecaded3da5a9c5309c3bb56b"}},{"ruleId":"D2","level":"warning","message":{"text":"js_parser.ParseSourceMap (cognitive 229): js_parser.ParseSourceMap has cognitive complexity 229 (threshold 15). Drivers by points: if/else 56 (170 pts), loops 10 (29 pts), match/switch 4 (21 pts), boolean chains 9 (nesting depth added 150). 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":"internal/js_parser/sourcemap_parser.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d11ee3a7efddf39aea194bfec9ad247c8fad5cfe5a8a08ed9dd03bd679fbbde"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.scanForImportsAndExports (cognitive 216): parser.scanForImportsAndExports has cognitive complexity 216 (threshold 15). Drivers by points: if/else 40 (150 pts), loops 10 (41 pts), boolean chains 23, match/switch 1 (2 pts) (nesting depth added 142). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":17332}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdb5d178aeccfef760cb92af0ffd70ac992f4544898af501e16e61e7b477277"}},{"ruleId":"D2","level":"warning","message":{"text":"resolverQuery.parseTSConfigFromSource (cognitive 216): resolverQuery.parseTSConfigFromSource has cognitive complexity 216 (threshold 15). Drivers by points: if/else 52 (187 pts), loops 5 (14 pts), boolean chains 13, jumps 2 (nesting depth added 144). Most of this is not in the body itself: 15 of the 216 points are its own statements and the rest belongs to one function literal inside it that branches (line 1257). 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":"internal/resolver/resolver.go"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b71d2db15b1420825063d56069c5de086e553c60de731ed8b50286a7ec3852"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.mangleTransforms (cognitive 212): parser.mangleTransforms has cognitive complexity 212 (threshold 15). Drivers by points: if/else 47 (195 pts), loops 2 (7 pts), boolean chains 6, match/switch 1 (4 pts) (nesting depth added 156). 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":"internal/css_parser/css_decls_transform.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"559538833781a55cfd727cd9755fa2fbae658b279293e21bd1f2e48bc183f46d"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.processDeclarations (cognitive 206): parser.processDeclarations has cognitive complexity 206 (threshold 15). Drivers by points: if/else 58 (174 pts), loops 9 (27 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 135). 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":"internal/css_parser/css_decls.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1c000711b19badc9b79f1db7f0597b8b8763c362801adfaeaf44586ded561c"}},{"ruleId":"D2","level":"warning","message":{"text":"HelperContext.SimplifyUnusedExpr (cognitive 204): HelperContext.SimplifyUnusedExpr has cognitive complexity 204 (threshold 15). Drivers by points: if/else 48 (154 pts), loops 10 (28 pts), match/switch 5 (13 pts), boolean chains 9 (nesting depth added 132). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea618d4643ebfdb36aa7b2d10ca3770d638c26e6a8b661399cd0273af51314a8"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver.ParseTSConfigJSON (cognitive 201): resolver.ParseTSConfigJSON has cognitive complexity 201 (threshold 15). Drivers by points: if/else 56 (166 pts), loops 4 (17 pts), match/switch 4 (16 pts), boolean chains 1, jumps 1 (nesting depth added 135). 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":"internal/resolver/tsconfig_json.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0490e6c5c2aaa2f7379cb2991e60b1ca389017a29d9e9387f6d74859a8516c0"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parsePrefix (cognitive 197): parser.parsePrefix has cognitive complexity 197 (threshold 15). Drivers by points: if/else 63 (163 pts), match/switch 8 (22 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 116). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":3499}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2f85d86306f50c02a49295a64733e607c7589e2879a8e915e61865e862fedd"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.parseNumericLiteralOrDot (cognitive 189): Lexer.parseNumericLiteralOrDot has cognitive complexity 189 (threshold 15). Drivers by points: if/else 48 (134 pts), boolean chains 29, loops 7 (20 pts), match/switch 2 (5 pts), jumps 1 (nesting depth added 102). 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":"internal/js_lexer/js_lexer.go"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af365bc94c2742796a27ec173d4ea39e9275680140377cb55544c13559b042e"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printBinding (cognitive 185): printer.printBinding has cognitive complexity 185 (threshold 15). Drivers by points: if/else 40 (156 pts), boolean chains 16, loops 4 (12 pts), match/switch 1 (nesting depth added 124). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19ec95457bb3e7a0153c7fa0c83d26d479062799a2e0f1d3b336ad06fdc8119"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printRule (cognitive 184): printer.printRule has cognitive complexity 184 (threshold 15). Drivers by points: if/else 69 (154 pts), loops 5 (13 pts), boolean chains 11, match/switch 3 (6 pts) (nesting depth added 96). 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":"internal/css_printer/css_printer.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fbf35ea0ec298e462ca12ba6829e614b253c7c15791d6c3632d2d8c93e8fde"}},{"ruleId":"D2","level":"warning","message":{"text":"resolverQuery.finalizeImportsExportsResult (cognitive 184): resolverQuery.finalizeImportsExportsResult has cognitive complexity 184 (threshold 15). Drivers by points: if/else 36 (136 pts), loops 7 (30 pts), match/switch 4 (11 pts), boolean chains 7 (nesting depth added 130). 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":"internal/resolver/resolver.go"},"region":{"startLine":2605}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5c135ecd020c5099e0a4beb2f12e15e6423ceaa506801b66898cfb94cb24ed"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.computeCrossChunkDependencies (cognitive 182): linkerContext.computeCrossChunkDependencies has cognitive complexity 182 (threshold 15). Drivers by points: if/else 31 (121 pts), loops 17 (50 pts), match/switch 3 (8 pts), boolean chains 3 (nesting depth added 128). Of this number, 65 points are the body\u0027s own statements and 117 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6130608b6d924ce5c914cb7bbafd4fff932ae8615728f8cbefea74781c1599"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.skipTypeScriptTypeWithFlags (cognitive 173): parser.skipTypeScriptTypeWithFlags has cognitive complexity 173 (threshold 15). Drivers by points: if/else 38 (129 pts), boolean chains 22, loops 5 (12 pts), match/switch 3 (7 pts), jumps 3 (nesting depth added 102). 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":"internal/js_parser/ts_parser.go"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"3055c0b7ac31a674f7e5fc04d507b22153ee7daeae2a20c19e4e823b7095ab33"}},{"ruleId":"D2","level":"warning","message":{"text":"apiHandler.ServeHTTP (cognitive 168): apiHandler.ServeHTTP has cognitive complexity 168 (threshold 15). Drivers by points: if/else 54 (137 pts), boolean chains 13, loops 5 (13 pts), match/switch 1 (5 pts) (nesting depth added 95). 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":"pkg/api/serve_other.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4845117fca237e998171c252a3fedbc1e136f0a67b06e0088db7e1d2b135a3d"}},{"ruleId":"D2","level":"warning","message":{"text":"lowerClassContext.processProperties (cognitive 166): lowerClassContext.processProperties has cognitive complexity 166 (threshold 15). Drivers by points: if/else 51 (130 pts), loops 7 (20 pts), boolean chains 9, match/switch 2 (7 pts) (nesting depth added 97). 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":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8fa58e7a1f33c4ca11b1734443819ae0cea865a7881ff4747338ac6a28dcf0"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.convertStmtsForChunk (cognitive 157): linkerContext.convertStmtsForChunk has cognitive complexity 157 (threshold 15). Drivers by points: if/else 35 (123 pts), loops 6 (21 pts), boolean chains 7, match/switch 2 (6 pts) (nesting depth added 107). 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":"internal/linker/linker.go"},"region":{"startLine":4316}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b51843201d0d35125d65151264853dd299ed2f0ee74791a188bc01274854f0"}},{"ruleId":"D2","level":"warning","message":{"text":"api.analyzeMetafileImpl (cognitive 157): api.analyzeMetafileImpl has cognitive complexity 157 (threshold 15). Drivers by points: if/else 24 (106 pts), loops 12 (49 pts), boolean chains 2 (nesting depth added 119). Of this number, 134 points are the body\u0027s own statements and 23 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/api/api_impl.go"},"region":{"startLine":2291}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f136527296914d346f7c1b3e5801dcfc0a57f0bb22c1f0e53a4c11a058bb236"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.visitClass (cognitive 151): parser.visitClass has cognitive complexity 151 (threshold 15). Drivers by points: if/else 51 (122 pts), boolean chains 13, match/switch 2 (9 pts), loops 4 (7 pts) (nesting depth added 81). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":12177}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dad1fb22acc143425dd3c826ee4bf5010a35f9a7f2b93d3354ed675c986b4e6"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.generateChunkJS (cognitive 142): linkerContext.generateChunkJS has cognitive complexity 142 (threshold 15). Drivers by points: if/else 54 (104 pts), loops 14 (33 pts), boolean chains 5 (nesting depth added 69). Of this number, 132 points are the body\u0027s own statements and 10 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":"internal/linker/linker.go"},"region":{"startLine":5568}}}],"partialFingerprints":{"codehealthFindingId/v1":"805b88c0f1548aa0044a0de6053dd3f59df4aa5317eb7892f89095ae23f81ef1"}},{"ruleId":"D2","level":"warning","message":{"text":"serviceType.handleIncomingPacket (cognitive 139): serviceType.handleIncomingPacket has cognitive complexity 139 (threshold 15). Drivers by points: if/else 41 (127 pts), loops 2 (10 pts), boolean chains 1, match/switch 1 (nesting depth added 94). Of this number, 55 points are the body\u0027s own statements and 84 belong to 5 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/esbuild/service.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ce62edc901763d1ee89fefe339ad95b4f62cb57214a8bd1986a6895a76f2e9"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.findImportedFilesInCSSOrder (cognitive 137): linkerContext.findImportedFilesInCSSOrder has cognitive complexity 137 (threshold 15). Drivers by points: if/else 30 (93 pts), loops 15 (28 pts), boolean chains 11, jumps 3, match/switch 1 (2 pts) (nesting depth added 77). Of this number, 112 points are the body\u0027s own statements and 25 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":3411}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe63ea24ee2ea0884e36ddfe40b5ea626f633d37e1b858dde6857cc0d1141d3"}},{"ruleId":"D2","level":"warning","message":{"text":"scanner.addEntryPoints (cognitive 136): scanner.addEntryPoints has cognitive complexity 136 (threshold 15). Drivers by points: if/else 43 (108 pts), loops 9 (18 pts), boolean chains 10 (nesting depth added 74). Of this number, 95 points are the body\u0027s own statements and 41 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"994d4dcf1dc632daa5a5536629532564a5395b80aa6972c91ea64cb14ce0d48d"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.generateChunkCSS (cognitive 136): linkerContext.generateChunkCSS has cognitive complexity 136 (threshold 15). Drivers by points: if/else 41 (95 pts), loops 12 (29 pts), boolean chains 6, match/switch 2 (6 pts) (nesting depth added 75). Of this number, 119 points are the body\u0027s own statements and 17 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":6098}}}],"partialFingerprints":{"codehealthFindingId/v1":"754ce9a4509e6a0906c4a2936776a1c44309bfd6b36be8388a22c03e2f922d04"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.tryToDecodeEscapeSequences (cognitive 134): Lexer.tryToDecodeEscapeSequences has cognitive complexity 134 (threshold 15). Drivers by points: if/else 19 (78 pts), match/switch 8 (36 pts), loops 4 (15 pts), boolean chains 4, jumps 1 (nesting depth added 98). 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":"internal/js_lexer/js_lexer.go"},"region":{"startLine":2192}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd988fca7954c58a55814a2595e1d2295c91b02f59824212d463dea0a83f2f7"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printProperty (cognitive 133): printer.printProperty has cognitive complexity 133 (threshold 15). Drivers by points: if/else 38 (107 pts), boolean chains 14, match/switch 5 (12 pts) (nesting depth added 76). 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":"internal/js_printer/js_printer.go"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"5324211581e02762cb8eccc55102bedeefc9eb9c41414d256f33b88c8d6e978a"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.renameSymbolsInChunk (cognitive 132): linkerContext.renameSymbolsInChunk has cognitive complexity 132 (threshold 15). Drivers by points: if/else 19 (70 pts), loops 18 (55 pts), match/switch 1 (6 pts), boolean chains 1 (nesting depth added 93). Of this number, 115 points are the body\u0027s own statements and 17 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":5320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdc69aa7e22f6b70636caaf5be76419dad679ae7b431cb0cc6dacfe4f5c1ca9"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.convertTokensHelper (cognitive 131): parser.convertTokensHelper has cognitive complexity 131 (threshold 15). Drivers by points: if/else 34 (106 pts), boolean chains 10, loops 4 (9 pts), match/switch 2 (5 pts), jumps 1 (nesting depth added 80). 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":"internal/css_parser/css_parser.go"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e6a485bd47e7e2258606aedaeb9f5098ba278b2aa0e166d18959974d38af05"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.substituteSingleUseSymbolInExpr (cognitive 121): parser.substituteSingleUseSymbolInExpr has cognitive complexity 121 (threshold 15). Drivers by points: if/else 40 (100 pts), boolean chains 9, loops 4 (9 pts), match/switch 2 (3 pts) (nesting depth added 66). 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":9735}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5ac8a4265a0f30d5030817ac3c4111ef5321953ff6a0ed2be4cf775981eed2"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.maybeRewritePropertyAccess (cognitive 120): parser.maybeRewritePropertyAccess has cognitive complexity 120 (threshold 15). Drivers by points: if/else 34 (101 pts), boolean chains 10, match/switch 2 (6 pts), loops 1 (3 pts) (nesting depth added 73). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":12939}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1fb353f249a5578ab563d2c9638a0c9419c4231c06e1693467a3fa34a562cd"}},{"ruleId":"D2","level":"warning","message":{"text":"serviceType.convertPlugins (cognitive 117): serviceType.convertPlugins has cognitive complexity 117 (threshold 15). Drivers by points: if/else 52 (99 pts), loops 9 (18 pts) (nesting depth added 56). Most of this is not in the body itself: 9 of the 117 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 908, 865). 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":"cmd/esbuild/service.go"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9351cdc7f08d22f448ff0e1b0622412b24fc584fff97530c4d1856242061ea"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.generateCodeForFileInChunkJS (cognitive 117): linkerContext.generateCodeForFileInChunkJS has cognitive complexity 117 (threshold 15). Drivers by points: if/else 34 (90 pts), loops 5 (15 pts), boolean chains 6, match/switch 2 (6 pts) (nesting depth added 70). 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":"internal/linker/linker.go"},"region":{"startLine":4662}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55aad476f80efd01babc2f0b2ad4a64df83d82d28cb36580141b21d1866213f"}},{"ruleId":"D2","level":"warning","message":{"text":"uint8array_json_parser.JSON_parse (cognitive 111): uint8array_json_parser.JSON_parse has cognitive complexity 111 (threshold 15). Drivers by points: if/else 29 (76 pts), loops 5 (15 pts), match/switch 4 (13 pts), boolean chains 7 (nesting depth added 66). 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":"lib/shared/uint8array_json_parser.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb1e9d04cbea0026e4139006222813bfcc728df6fbd7a6e43f4d4df167be233"}},{"ruleId":"D2","level":"warning","message":{"text":"resolverQuery.esmPackageTargetResolve (cognitive 107): resolverQuery.esmPackageTargetResolve has cognitive complexity 107 (threshold 15). Drivers by points: if/else 33 (89 pts), loops 4 (10 pts), boolean chains 7, match/switch 1 (nesting depth added 62). 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":"internal/resolver/package_json.go"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"639a9842b1f12fe5739bb3bf372001fe33583d33e8a6a1904c7845f81e64946a"}},{"ruleId":"D2","level":"warning","message":{"text":"resolverQuery.finalizeResolve (cognitive 106): resolverQuery.finalizeResolve has cognitive complexity 106 (threshold 15). Drivers by points: if/else 27 (97 pts), loops 2 (8 pts), boolean chains 1 (nesting depth added 76). 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":"internal/resolver/resolver.go"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b99e0c39ffbfaf6c08e76efefade3847258f2e132c08eb72ed5996d08f6e05"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseJSXElement (cognitive 104): parser.parseJSXElement has cognitive complexity 104 (threshold 15). Drivers by points: if/else 36 (88 pts), loops 3 (6 pts), match/switch 2 (5 pts), boolean chains 4, jumps 1 (nesting depth added 58). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":5251}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcffb3f3f856a2b1b0db99c222cf6b1e6b70f4a40b69c7f6512a6a0ceb66f531"}},{"ruleId":"D2","level":"warning","message":{"text":"css_parser.tryToParseColorStops (cognitive 102): css_parser.tryToParseColorStops has cognitive complexity 102 (threshold 15). Drivers by points: if/else 28 (80 pts), loops 9 (20 pts), boolean chains 2 (nesting depth added 63). 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":"internal/css_parser/css_decls_gradient.go"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc5d07d9518463870497215642a7f78104da902077929fe909e792d79c500f6"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.computeClassLoweringInfo (cognitive 102): parser.computeClassLoweringInfo has cognitive complexity 102 (threshold 15). Drivers by points: if/else 30 (83 pts), loops 4 (13 pts), boolean chains 6 (nesting depth added 62). 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":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"239e49e8bfeb89a9756c47c1ca7046bdd17f06c7f6beada0543eceb7ece084af"}},{"ruleId":"D2","level":"warning","message":{"text":"resolverQuery.parsePackageJSON (cognitive 102): resolverQuery.parsePackageJSON has cognitive complexity 102 (threshold 15). Drivers by points: if/else 36 (83 pts), loops 4 (8 pts), boolean chains 6, match/switch 2 (5 pts) (nesting depth added 54). 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":"internal/resolver/package_json.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"3023c4f8cd3af720d8465891efd4cff845505094554cb0b05e99d9d200d8ac0e"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.lowerOptionalChain (cognitive 100): parser.lowerOptionalChain has cognitive complexity 100 (threshold 15). Drivers by points: if/else 31 (79 pts), match/switch 4 (9 pts), boolean chains 7, jumps 3, loops 2 (nesting depth added 53). 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":"internal/js_parser/js_parser_lower.go"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbf01329333e69ec8d479338c36b81050f98aced631d0d1c11a3e2836a85f42"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.runImpl (cognitive 99): cli.runImpl has cognitive complexity 99 (threshold 15). Drivers by points: if/else 38 (93 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 55). Of this number, 65 points are the body\u0027s own statements and 34 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/cli/cli_impl.go"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"879fcee70e58731d3326b089835824674c252d8800d1929dc9e5d285721193d7"}},{"ruleId":"D2","level":"warning","message":{"text":"HelperContext.MangleIfExpr (cognitive 98): HelperContext.MangleIfExpr has cognitive complexity 98 (threshold 15). Drivers by points: if/else 34 (72 pts), boolean chains 20, loops 1 (4 pts), match/switch 1 (2 pts) (nesting depth added 42). 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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":2788}}}],"partialFingerprints":{"codehealthFindingId/v1":"e881ca9c97afadcb77914882245798463b2534b9e1c2db873b640233a88e4612"}},{"ruleId":"D2","level":"warning","message":{"text":"js_parser.Parse (cognitive 97): js_parser.Parse has cognitive complexity 97 (threshold 15). Drivers by points: if/else 29 (66 pts), loops 8 (21 pts), match/switch 2 (5 pts), boolean chains 4, jumps 1 (nesting depth added 53). Of this number, 95 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":17815}}}],"partialFingerprints":{"codehealthFindingId/v1":"157c27cc306b7dfe235b62f6204d30c490a9e75de470c028e682dd73365e33d8"}},{"ruleId":"D2","level":"warning","message":{"text":"resolverQuery.loadNodeModules (cognitive 96): resolverQuery.loadNodeModules has cognitive complexity 96 (threshold 15). Drivers by points: if/else 35 (83 pts), boolean chains 7, loops 3, match/switch 1 (3 pts) (nesting depth added 50). Of this number, 76 points are the body\u0027s own statements and 20 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/resolver.go"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a77971ce1e226c10af0df917aef0cacfe46b97c7cd47d499fe02b9e42df684b"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.lowerAndMinifyColor (cognitive 95): parser.lowerAndMinifyColor has cognitive complexity 95 (threshold 15). Drivers by points: if/else 23 (78 pts), match/switch 4 (10 pts), boolean chains 7 (nesting depth added 61). 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":"internal/css_parser/css_decls_color.go"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aeac59f15b6bb6fa1c569aa4c126641c4f68a0544c42b35754f235c17bd3521"}},{"ruleId":"D2","level":"warning","message":{"text":"HelperContext.StmtsCanBeRemovedIfUnused (cognitive 95): HelperContext.StmtsCanBeRemovedIfUnused has cognitive complexity 95 (threshold 15). Drivers by points: if/else 16 (63 pts), match/switch 4 (16 pts), loops 3 (10 pts), boolean chains 6 (nesting depth added 66). 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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":2200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00face0c1e68954ff530a0514fdf0d526ffd910041609e41d163cca0843a9f1"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.hoistSymbols (cognitive 95): parser.hoistSymbols has cognitive complexity 95 (threshold 15). Drivers by points: if/else 20 (72 pts), boolean chains 11, loops 5 (10 pts), jumps 2 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"7561aa0fb1ee83a76b6e4c04e0cfb3b02f33dbb704d2c92fc3bc01cfe547eaeb"}},{"ruleId":"D2","level":"warning","message":{"text":"common.flagsForBuildOptions (cognitive 95): common.flagsForBuildOptions has cognitive complexity 95 (threshold 15). Drivers by points: if/else 44 (70 pts), loops 10 (22 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shared/common.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd42c5acd3a67d4889f6434d49d37ddf85e3ea6729b14ed486c50ed5736afe3"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.minifySwitchStmt (cognitive 94): parser.minifySwitchStmt has cognitive complexity 94 (threshold 15). Drivers by points: if/else 32 (75 pts), loops 4 (12 pts), boolean chains 7 (nesting depth added 51). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":11612}}}],"partialFingerprints":{"codehealthFindingId/v1":"351baa0f83f5a9e5854a7fb0e961be3164557df6259de822062e89f26fd1a4f8"}},{"ruleId":"D2","level":"warning","message":{"text":"css_parser.tryToParseCalcTerm (cognitive 92): css_parser.tryToParseCalcTerm has cognitive complexity 92 (threshold 15). Drivers by points: if/else 27 (58 pts), boolean chains 19, loops 7 (15 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_reduce_calc.go"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"719632c4b72f876a8e05465cd1bfbf8276d9960874b974b777ce8bc705c5e30a"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printUnquotedUTF16 (cognitive 86): printer.printUnquotedUTF16 has cognitive complexity 86 (threshold 15). Drivers by points: if/else 20 (65 pts), boolean chains 11, loops 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 51). 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":"internal/js_printer/js_printer.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf540153a49292e3284fd433ba0ee830de2bbc77640a2e89ef016b5aad848fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver.Resolve (cognitive 86): Resolver.Resolve has cognitive complexity 86 (threshold 15). Drivers by points: if/else 36 (76 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 42). 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":"internal/resolver/resolver.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1a699eef4dfb9cdc418b6043d10910b79fb7e9607d906fec34127bb760a918"}},{"ruleId":"D2","level":"warning","message":{"text":"api.rebuildImpl (cognitive 86): api.rebuildImpl has cognitive complexity 86 (threshold 15). Drivers by points: if/else 26 (64 pts), loops 9 (20 pts), boolean chains 2 (nesting depth added 49). Of this number, 56 points are the body\u0027s own statements and 30 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/api/api_impl.go"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd14e8228c7817a7865dcea12df40236eb1599ef4643a9f7cd9e8db2f97eaec"}},{"ruleId":"D2","level":"warning","message":{"text":"HelperContext.ExprCanBeRemovedIfUnused (cognitive 85): HelperContext.ExprCanBeRemovedIfUnused has cognitive complexity 85 (threshold 15). Drivers by points: if/else 16 (47 pts), boolean chains 17, loops 5 (13 pts), match/switch 4 (8 pts) (nesting depth added 43). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":2432}}}],"partialFingerprints":{"codehealthFindingId/v1":"018c266a8b35d2c7a80d4bdab770649db977c6880ad008550572a1ba876feecd"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.maybeMarkKnownGlobalConstructorAsPure (cognitive 84): parser.maybeMarkKnownGlobalConstructorAsPure has cognitive complexity 84 (threshold 15). Drivers by points: if/else 14 (55 pts), match/switch 5 (23 pts), loops 1 (6 pts) (nesting depth added 64). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":16929}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0cc473c200bd3d7f7a416704806c8329ebae1bd7686201cadb50bbc74f67ae"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.mangleIf (cognitive 82): parser.mangleIf has cognitive complexity 82 (threshold 15). Drivers by points: if/else 36 (76 pts), boolean chains 6 (nesting depth added 40). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":10246}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4ede48382189daf2d4045e45cadff3d2bfef8021235edd3693c4ea8f81dc33"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.generateEntryPointTailJS (cognitive 81): linkerContext.generateEntryPointTailJS has cognitive complexity 81 (threshold 15). Drivers by points: if/else 27 (69 pts), loops 3 (10 pts), boolean chains 1, match/switch 1 (nesting depth added 49). 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":"internal/linker/linker.go"},"region":{"startLine":4997}}}],"partialFingerprints":{"codehealthFindingId/v1":"271e3cb544cc991717470f810789e5a7746240c767fbb1007e8ef826f32690a9"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parsePseudoClassSelector (cognitive 76): parser.parsePseudoClassSelector has cognitive complexity 76 (threshold 15). Drivers by points: if/else 18 (66 pts), match/switch 2 (6 pts), boolean chains 4 (nesting depth added 52). 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":"internal/css_parser/css_parser_selector.go"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d492d9d4b6ba68529d377622b6d3d7b29d1273582d00f1cc82c0534bb8fe006"}},{"ruleId":"D2","level":"warning","message":{"text":"main.main (cognitive 74): main.main has cognitive complexity 74 (threshold 15). Drivers by points: if/else 28 (57 pts), loops 4 (9 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 35). Of this number, 16 points are the body\u0027s own statements and 58 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/esbuild/main.go"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"126569a609b6a085949a093d0fac5ad5fb6e3ea095041b428ac4a6858f610f40"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printRequireOrImportExpr (cognitive 74): printer.printRequireOrImportExpr has cognitive complexity 74 (threshold 15). Drivers by points: if/else 32 (64 pts), boolean chains 7, match/switch 1 (3 pts) (nesting depth added 34). Of this number, 70 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b5be2d9842b74788fdb7b64facf0a8d959c9824443978734c7bd15cccb866c"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.handleGlobPattern (cognitive 73): parser.handleGlobPattern has cognitive complexity 73 (threshold 15). Drivers by points: if/else 23 (54 pts), loops 6 (12 pts), boolean chains 5, jumps 2 (nesting depth added 37). 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":16617}}}],"partialFingerprints":{"codehealthFindingId/v1":"8812005fe7674702a28257d2e15ac28048b24143d6d9386d3e73907005405be7"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.computeChunks (cognitive 73): linkerContext.computeChunks has cognitive complexity 73 (threshold 15). Drivers by points: if/else 20 (52 pts), loops 11 (16 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":3875}}}],"partialFingerprints":{"codehealthFindingId/v1":"910e6e2a8b27e9ed6d0c9049cf74abee966589a96b7946fc06d562696f16b862"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.isUnsupportedRegularExpression (cognitive 72): parser.isUnsupportedRegularExpression has cognitive complexity 72 (threshold 15). Drivers by points: if/else 15 (50 pts), match/switch 3 (9 pts), loops 3 (6 pts), jumps 4, boolean chains 3 (nesting depth added 44). 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":13415}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e54004680c2b96635cdae328f03152d4838a1eefaa2fa55ced4484a35af3268"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseListOfRules (cognitive 71): parser.parseListOfRules has cognitive complexity 71 (threshold 15). Drivers by points: if/else 21 (56 pts), match/switch 2 (6 pts), boolean chains 4, loops 2 (3 pts), jumps 2 (nesting depth added 40). 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":"internal/css_parser/css_parser.go"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfaad9c8bae424bad5797a52ee5b454ef9fbc5fc0bdb7e3bfa145997749dfd18"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.visitStmts (cognitive 71): parser.visitStmts has cognitive complexity 71 (threshold 15). Drivers by points: if/else 23 (57 pts), loops 5 (9 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 39). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":8960}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c68e22375f9884187ab393685a30bae2d6cba896b4e903276bf48318eb251c"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.maybeAppendLegalComments (cognitive 71): linkerContext.maybeAppendLegalComments has cognitive complexity 71 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 12 (34 pts), match/switch 2, boolean chains 1 (nesting depth added 43). 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":"internal/linker/linker.go"},"region":{"startLine":6549}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c69f7c5d72fc58d5b9ba2bcc4ff3e0486a56a3b30a4aa646d3eec8c912db4e"}},{"ruleId":"D2","level":"warning","message":{"text":"resolverQuery.dirInfoUncached (cognitive 71): resolverQuery.dirInfoUncached has cognitive complexity 71 (threshold 15). Drivers by points: if/else 31 (61 pts), boolean chains 10 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/resolver.go"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f5c85628b7c4439897fe223bbb5deb96c6775c3d43645720b75c40e2c54261"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.mangleRules (cognitive 70): parser.mangleRules has cognitive complexity 70 (threshold 15). Drivers by points: if/else 13 (44 pts), loops 4 (17 pts), boolean chains 5, jumps 2, match/switch 1 (2 pts) (nesting depth added 45). 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":"internal/css_parser/css_parser.go"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1f597cc52605dc29815cfe34265e4627cb808f705fe867f95124b93874d112"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printTokens (cognitive 70): printer.printTokens has cognitive complexity 70 (threshold 15). Drivers by points: if/else 21 (51 pts), boolean chains 11, match/switch 2 (5 pts), loops 2 (3 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":"internal/css_printer/css_printer.go"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b89a611b02f3051d1482810985570093a9c9e865a06566b7792539297ce7d1e"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.NextInsideJSXElement (cognitive 70): Lexer.NextInsideJSXElement has cognitive complexity 70 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 6 (20 pts), match/switch 5 (19 pts), jumps 4, boolean chains 1 (nesting depth added 47). 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":"internal/js_lexer/js_lexer.go"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"483964c9227e3afe566e3bc87fbd329b186b2d23db983167af37c546cd4f0c81"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.insertStmtsAfterSuperCall (cognitive 70): parser.insertStmtsAfterSuperCall has cognitive complexity 70 (threshold 15). Drivers by points: if/else 17 (60 pts), boolean chains 5, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 46). 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":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":2451}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ccc30f8536a22b44c0d62fed337562155891cf1ceaf379bcded2db84ecd97e"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printCompoundSelector (cognitive 69): printer.printCompoundSelector has cognitive complexity 69 (threshold 15). Drivers by points: if/else 21 (53 pts), boolean chains 7, loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 37). 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":"internal/css_printer/css_printer.go"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"c330bf8ac94e8f579b639b11e6703ae0318b1bab535de1361d66a3408d3ecb56"}},{"ruleId":"D2","level":"warning","message":{"text":"js_ast.FoldBinaryOperator (cognitive 69): js_ast.FoldBinaryOperator has cognitive complexity 69 (threshold 15). Drivers by points: if/else 34 (68 pts), match/switch 1 (nesting depth added 34). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d0fbb75ba51fed4b3bd5f6e66ec98c6de8ec46664d35c69411a1a5ac4eb7ba"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.handleIdentifier (cognitive 68): parser.handleIdentifier has cognitive complexity 68 (threshold 15). Drivers by points: if/else 24 (46 pts), boolean chains 14, match/switch 2 (8 pts) (nesting depth added 28). 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":17058}}}],"partialFingerprints":{"codehealthFindingId/v1":"196120804a0fee44a2e5ea6f29c8f01abe1387fa2df158824ad331c90d46f260"}},{"ruleId":"D2","level":"warning","message":{"text":"lowerClassContext.finishAndGenerateCode (cognitive 68): lowerClassContext.finishAndGenerateCode has cognitive complexity 68 (threshold 15). Drivers by points: if/else 35 (53 pts), boolean chains 9, loops 3 (4 pts), match/switch 1 (2 pts) (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":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":2054}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a9be5c727bb6b5e615b7b9ecb91ce0265856c82e63feaddd0a637307efdf99"}},{"ruleId":"D2","level":"warning","message":{"text":"resolverQuery.resolveWithoutSymlinks (cognitive 68): resolverQuery.resolveWithoutSymlinks has cognitive complexity 68 (threshold 15). Drivers by points: if/else 28 (64 pts), boolean chains 4 (nesting depth added 36). 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":"internal/resolver/resolver.go"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8fdf3f65148e32b8e027a7e1af7b14bbdf469dc8753f7df5be7efa8eaf26cc"}},{"ruleId":"D2","level":"warning","message":{"text":"lexer.next (cognitive 67): lexer.next has cognitive complexity 67 (threshold 15). Drivers by points: if/else 23 (48 pts), loops 3 (9 pts), boolean chains 5, match/switch 2 (5 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":"internal/css_lexer/css_lexer.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd48198eda1594addb470cbe464aeead87f13d58ea5114e5203e46c03d58cb6c"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseCompoundSelector (cognitive 67): parser.parseCompoundSelector has cognitive complexity 67 (threshold 15). Drivers by points: if/else 17 (44 pts), match/switch 4 (11 pts), loops 2 (5 pts), boolean chains 4, jumps 3 (nesting depth added 37). 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":"internal/css_parser/css_parser_selector.go"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"82178db0d24101c950281912c2ead5408cacee2e57a074dd5a83174a56ac36ae"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseFn (cognitive 67): parser.parseFn has cognitive complexity 67 (threshold 15). Drivers by points: if/else 25 (54 pts), boolean chains 8, loops 2 (5 pts) (nesting depth added 32). 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":6152}}}],"partialFingerprints":{"codehealthFindingId/v1":"3145ba97b0198786a2e40c5d1236f304cd7e08fb6409524d617753f1bce4d46e"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.toAST (cognitive 67): parser.toAST has cognitive complexity 67 (threshold 15). Drivers by points: if/else 17 (33 pts), loops 10 (19 pts), boolean chains 13, match/switch 1 (2 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":18606}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4add92d9727cd8c0df908eaf3eac4d149079e6df210e413be5177de5f0f287"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.generateSourceMapForChunk (cognitive 67): linkerContext.generateSourceMapForChunk has cognitive complexity 67 (threshold 15). Drivers by points: if/else 27 (56 pts), loops 7 (10 pts), boolean chains 1 (nesting depth added 32). 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":"internal/linker/linker.go"},"region":{"startLine":7001}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81175003979648129a1bb121cb0967b7cb2a4b083df55aa8e73c4801ec29cd7"}},{"ruleId":"D2","level":"warning","message":{"text":"bundler.runOnLoadPlugins (cognitive 66): bundler.runOnLoadPlugins has cognitive complexity 66 (threshold 15). Drivers by points: if/else 20 (49 pts), loops 4 (9 pts), match/switch 1 (5 pts), boolean chains 3 (nesting depth added 38). 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":"internal/bundler/bundler.go"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4081637743b458a482d2d2a1de1e9bb7ae6fde0f4a674efa8fe33281f87d9d"}},{"ruleId":"D2","level":"warning","message":{"text":"HelperContext.isSideEffectFreeUnboundIdentifierRef (cognitive 66): HelperContext.isSideEffectFreeUnboundIdentifierRef has cognitive complexity 66 (threshold 15). Drivers by points: if/else 12 (55 pts), boolean chains 8, match/switch 1 (3 pts) (nesting depth added 45). 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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":2637}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e25ad4a90f830f036c5246002b5925b0f10ba70efb30fb4ae9d01ce2cfee70d"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.matchImportWithExport (cognitive 66): linkerContext.matchImportWithExport has cognitive complexity 66 (threshold 15). Drivers by points: if/else 18 (51 pts), loops 5 (10 pts), boolean chains 2, match/switch 1 (2 pts), jumps 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":2633}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0a9662391b59466ba22ba096a6c2b4990bf5cd91c54caf1795e4db0d944c41"}},{"ruleId":"D2","level":"warning","message":{"text":"resolverQuery.loadAsMainField (cognitive 66): resolverQuery.loadAsMainField has cognitive complexity 66 (threshold 15). Drivers by points: if/else 27 (61 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 35). Of this number, 58 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/resolver.go"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"552200ce0641dc0dc83204a64e846cae423f09d6851b2ba2afe38576e71f9f8b"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.lowerFunction (cognitive 65): parser.lowerFunction has cognitive complexity 65 (threshold 15). Drivers by points: if/else 18 (42 pts), boolean chains 12, loops 4 (11 pts) (nesting depth added 31). 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":"internal/js_parser/js_parser_lower.go"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacc5d1bf8b3ed560f9cd7f7a9697b8d965dd975a655fd00ddb4c265bc3d2aa5"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.generateCodeForLazyExport (cognitive 65): linkerContext.generateCodeForLazyExport has cognitive complexity 65 (threshold 15). Drivers by points: if/else 14 (47 pts), loops 4 (15 pts), boolean chains 3 (nesting depth added 44). Of this number, 26 points are the body\u0027s own statements and 39 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8486e846cfe5fcb1ea22439fcb6ee2d07483786260df581763195c1f1bfebf"}},{"ruleId":"D2","level":"warning","message":{"text":"logger.PrintSummary (cognitive 65): logger.PrintSummary has cognitive complexity 65 (threshold 15). Drivers by points: if/else 22 (59 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 39). None of this is in the body itself: all 65 points belong to one function literal inside it that branches (line 1007). 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":"internal/logger/logger.go"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedfb1e2923cc9f8e68f974665f53a9533f087e6eb3547f8003d3fe1ff3f2134"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver.ResolveGlob (cognitive 64): Resolver.ResolveGlob has cognitive complexity 64 (threshold 15). Drivers by points: if/else 25 (52 pts), boolean chains 5, match/switch 2 (4 pts), loops 3 (nesting depth added 29). Of this number, 36 points are the body\u0027s own statements and 28 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":"internal/resolver/resolver.go"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"648e7afd4d9aadafd43afa2973d21db75762c45da9de16b61d670fa5e5678802"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseListOfDeclarations (cognitive 63): parser.parseListOfDeclarations has cognitive complexity 63 (threshold 15). Drivers by points: if/else 12 (50 pts), loops 2 (7 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 44). 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":"internal/css_parser/css_parser.go"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"758e4a66ed8e625dd30c6c028725f628f53bea99350db1328cc3939ff0933a94"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseBinding (cognitive 63): parser.parseBinding has cognitive complexity 63 (threshold 15). Drivers by points: if/else 18 (52 pts), boolean chains 6, loops 2 (4 pts), match/switch 1 (nesting depth added 36). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":5999}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc98ded1d4c368ff2ff4ab591990d4e88d382789890b3ee9c2b1af4bf2ae40e"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.lowerNestingInRuleWithContext (cognitive 62): parser.lowerNestingInRuleWithContext has cognitive complexity 62 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 7 (25 pts), boolean chains 3, match/switch 1 (nesting depth added 38). Of this number, 58 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_nesting.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e61bd9efd288f874a1c15460bf972d472231416cc392cf2ed749a064c1dde34"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseParenExpr (cognitive 61): parser.parseParenExpr has cognitive complexity 61 (threshold 15). Drivers by points: if/else 22 (45 pts), loops 4 (10 pts), boolean chains 6 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":3153}}}],"partialFingerprints":{"codehealthFindingId/v1":"058ccb238386ed9a21f9e96a9795b9ada24bc3c397eb3abe0bc4289a8ac319c7"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseAndDeclareDecls (cognitive 61): parser.parseAndDeclareDecls has cognitive complexity 61 (threshold 15). Drivers by points: if/else 13 (49 pts), boolean chains 7, match/switch 1 (4 pts), loops 1 (nesting depth added 39). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":5601}}}],"partialFingerprints":{"codehealthFindingId/v1":"65991c21abdcb3639aae42f6002383c3b2962d9ea468762a5520286a0e4fb4b1"}},{"ruleId":"D2","level":"warning","message":{"text":"resolverQuery.checkBrowserMap (cognitive 61): resolverQuery.checkBrowserMap has cognitive complexity 61 (threshold 15). Drivers by points: if/else 27 (48 pts), loops 3 (7 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 26). Of this number, 36 points are the body\u0027s own statements and 25 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":"internal/resolver/package_json.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"709f297cd47f9897998bfe14d11a6208899102c49b35ba73af6168c5ac8d4c26"}},{"ruleId":"D2","level":"warning","message":{"text":"lowerClassContext.lowerField (cognitive 59): lowerClassContext.lowerField has cognitive complexity 59 (threshold 15). Drivers by points: if/else 27 (54 pts), boolean chains 5 (nesting depth added 27). 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":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a69892b8f0704b7345b54931bfc045cd940e76ff1f48bea7f1417841bdb637"}},{"ruleId":"D2","level":"warning","message":{"text":"common.pushCommonFlags (cognitive 59): common.pushCommonFlags has cognitive complexity 59 (threshold 15). Drivers by points: if/else 37 (45 pts), loops 5 (10 pts), ternaries 2 (4 pts) (nesting depth added 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shared/common.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1745d5f4a4d0b8a91ef9b9294bd3f7664d53e9f8d21854cb9f8e0ede6d429dcf"}},{"ruleId":"D2","level":"warning","message":{"text":"realFS.WatchData (cognitive 58): realFS.WatchData has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (40 pts), loops 4 (13 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 36). Most of this is not in the body itself: 10 of the 58 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 481, 515, 523, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fs/fs_real.go"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d719ddf0fefe77432e860add0fd643e964bd7bb5e35d7061262ef3ca99abba3"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseSelectorRule (cognitive 57): parser.parseSelectorRule has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (43 pts), loops 3 (12 pts), boolean chains 2 (nesting depth added 37). 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":"internal/css_parser/css_parser.go"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"476f257c9fa6b7b731076c3e138f7225209ca9b7a3ba6952933e210f7fe4e967"}},{"ruleId":"D2","level":"warning","message":{"text":"index.supportMapToVersionRanges (cognitive 57): index.supportMapToVersionRanges has cognitive complexity 57 (threshold 15). Drivers by points: if/else 8 (30 pts), loops 7 (19 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 37). 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":"compat-table/src/index.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"618fd436a7983c807bbe6ef837c09049ddbc87108d2bacf979734c4584a9373f"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.lowerAndMinifyGradient (cognitive 56): parser.lowerAndMinifyGradient has cognitive complexity 56 (threshold 15). Drivers by points: if/else 17 (40 pts), boolean chains 8, loops 4 (8 pts) (nesting depth added 27). 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":"internal/css_parser/css_decls_gradient.go"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c03b42cec7fee35cc7411026f79a8f9feeaf74a2dc5bcc93c6a6c354dde8aa7"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printMediaQuery (cognitive 56): printer.printMediaQuery has cognitive complexity 56 (threshold 15). Drivers by points: if/else 22 (46 pts), match/switch 3 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 29). 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":"internal/css_printer/css_printer.go"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3286afb880a3735a9329962917e3edf5c326a3502a4670a23a198b88cf8b3c"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printNonNegativeFloat (cognitive 56): printer.printNonNegativeFloat has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (37 pts), loops 4 (12 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 27). 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":"internal/js_printer/js_printer.go"},"region":{"startLine":3564}}}],"partialFingerprints":{"codehealthFindingId/v1":"29944152fa555c0844415431c17e524392cfc313d806f62ccec2f3fd5eba5b55"}},{"ruleId":"D2","level":"warning","message":{"text":"resolverQuery.matchTSConfigPaths (cognitive 56): resolverQuery.matchTSConfigPaths has cognitive complexity 56 (threshold 15). Drivers by points: if/else 17 (46 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 32). 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":"internal/resolver/resolver.go"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b727cbbafb6276211b937f5ebd3889666ab199ca4f690dfd00d5dd4e2311c00e"}},{"ruleId":"D2","level":"warning","message":{"text":"scanner.scanAllDependencies (cognitive 55): scanner.scanAllDependencies has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (49 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 37). 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":"internal/bundler/bundler.go"},"region":{"startLine":2176}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc64abbcb603815e98d9f2d64a6188911f473c2da5c4d48cd56ee80847320c3c"}},{"ruleId":"D2","level":"warning","message":{"text":"js_ast.CheckEqualityIfNoSideEffects (cognitive 54): js_ast.CheckEqualityIfNoSideEffects has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (37 pts), match/switch 7 (13 pts), boolean chains 4 (nesting depth added 28). 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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"01261615ef9f47ba97ff768734d151787ce69e5c618d2dba4aee7d45d7e88872"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseTypeScriptNamespaceStmt (cognitive 54): parser.parseTypeScriptNamespaceStmt has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (46 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (nesting depth added 28). 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":"internal/js_parser/ts_parser.go"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebacf0534b6c8a3ec8503bfdb6a8092f883c1595f006d7c65b87044cad7817d"}},{"ruleId":"D2","level":"warning","message":{"text":"graph.CloneLinkerGraph (cognitive 53): graph.CloneLinkerGraph has cognitive complexity 53 (threshold 15). Drivers by points: loops 12 (28 pts), if/else 7 (20 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 30). Of this number, 25 points are the body\u0027s own statements and 28 belong to one function literal inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/graph/graph.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"510034ab444f63934cb95fcebb6b6c9c70a0b1243182bcea537887bf4bcc97e4"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonParser.parseExpr (cognitive 53): jsonParser.parseExpr has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (47 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 34). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/json_parser.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d30edab2c7f5c8fd683bb27e4ac3d669df3cdce29dece889e2b1dc15bac318"}},{"ruleId":"D2","level":"warning","message":{"text":"common.buildOrContextImpl (cognitive 53): common.buildOrContextImpl has cognitive complexity 53 (threshold 15). Drivers by points: if/else 37 (43 pts), boolean chains 5, error handling 3 (4 pts), ternaries 1 (nesting depth added 7). Most of this is not in the body itself: 11 of the 53 points are its own statements and the rest belongs to 18 function items inside it that branch (a function literal at line 1083, buildOrContextContinue, buildOrContextContinue::buildResponseToResult, \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":"lib/shared/common.ts"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a0acf93b1c80b2837532f1d5aeb61d50ecbe2cf124e356c496f89937c4ac52"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseStmtsUpTo (cognitive 52): parser.parseStmtsUpTo has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (45 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":8504}}}],"partialFingerprints":{"codehealthFindingId/v1":"a392342556dd26f7f0f43c08fc76e690b158491145f528730b556738f674fb69"}},{"ruleId":"D2","level":"warning","message":{"text":"lowerClassContext.hoistComputedProperties (cognitive 52): lowerClassContext.hoistComputedProperties has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (43 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 29). 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":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f8a690f28af7940a12e87bbb72bf4ddd297744b20edff41f4459abe2184987"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.generateExtraDataForFileJS (cognitive 52): linkerContext.generateExtraDataForFileJS has cognitive complexity 52 (threshold 15). Drivers by points: if/else 18 (43 pts), loops 5 (9 pts) (nesting depth added 29). 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":"internal/linker/debug.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"428e1f4181dfea0c47e777743323063aeef24a17846d705a699c6ab6cb8fe161"}},{"ruleId":"D2","level":"warning","message":{"text":"HelperContext.SimplifyBooleanExpr (cognitive 51): HelperContext.SimplifyBooleanExpr has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (37 pts), boolean chains 11, match/switch 2 (3 pts) (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":2096}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ad32904aaa8c103aaa122769c1cab3d73b06a7232b247f3dac040469ae8da1"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.scanCommentText (cognitive 51): Lexer.scanCommentText has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (44 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (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":"internal/js_lexer/js_lexer.go"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b2eb175a68ca1112073afa11fd664630677e0d60a82fb3f47a0239a8f38e69"}},{"ruleId":"D2","level":"warning","message":{"text":"lowerClassContext.lowerMethod (cognitive 51): lowerClassContext.lowerMethod has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (44 pts), loops 1 (4 pts), boolean chains 3 (nesting depth added 35). 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":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"104ba6a04ae17c134b823855a4b95489f1b5128c15c61f7f2d22c1565ff69408"}},{"ruleId":"D2","level":"warning","message":{"text":"api.validateBuildOptions (cognitive 51): api.validateBuildOptions has cognitive complexity 51 (threshold 15). Drivers by points: if/else 24 (34 pts), boolean chains 10, loops 4 (5 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/api/api_impl.go"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fea57c3024284a5c4f338f1a6f18b71b63daa83d67481ea32cacaf8c088490d"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseExprOrLetOrUsingStmt (cognitive 50): parser.parseExprOrLetOrUsingStmt has cognitive complexity 50 (threshold 15). Drivers by points: if/else 21 (41 pts), boolean chains 7, match/switch 1 (2 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":5019}}}],"partialFingerprints":{"codehealthFindingId/v1":"262bc875915206dec839b685f058e1d14dcdb04f2476323d08a771884c6012ac"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.skipTypeScriptTypeParameters (cognitive 50): parser.skipTypeScriptTypeParameters has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (39 pts), boolean chains 8, loops 2 (3 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":"internal/js_parser/ts_parser.go"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"437259f4651d15e1652a1b5961f73f6b037aa0562dbf52be6cae4494c797c94c"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver.parseImportsExportsMap (cognitive 50): resolver.parseImportsExportsMap has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 3 (7 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 28). Most of this is not in the body itself: 1 of the 50 points is its own statement and the rest belongs to one function literal inside it that branches (line 644). 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":"internal/resolver/package_json.go"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"d650ad3e63363a2f727e2049a4b95a56f0a5ed206c978e628ab9b4723059787b"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseNthIndex (cognitive 49): parser.parseNthIndex has cognitive complexity 49 (threshold 15). Drivers by points: if/else 31 (46 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_parser_selector.go"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e849f85b7a11103918325cb1880fcc61dba413c3a63fdfe978fbf6bf3d69684"}},{"ruleId":"D2","level":"warning","message":{"text":"bundler.RunOnResolvePlugins (cognitive 48): bundler.RunOnResolvePlugins has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (36 pts), loops 4 (9 pts), boolean chains 3 (nesting depth added 28). 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":"internal/bundler/bundler.go"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13fe37d291ddf43dd5703bfc77a167becf4e9a26608c8db74ab8af6158ada58"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.flattenLocalAndGlobalSelectors (cognitive 48): parser.flattenLocalAndGlobalSelectors has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (36 pts), loops 2 (5 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 33). 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":"internal/css_parser/css_parser_selector.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d806a527d9f9d86dfcf17fc11b9b7499a779a110740930079f33a61a7b54f9"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseClass (cognitive 47): parser.parseClass has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 12, loops 2 (3 pts) (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":6489}}}],"partialFingerprints":{"codehealthFindingId/v1":"775c030cd19bd140388d3696734168b16650be8195281c3ad9c6ea55950f14d2"}},{"ruleId":"D2","level":"warning","message":{"text":"apiHandler.broadcastBuildResult (cognitive 47): apiHandler.broadcastBuildResult has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 6 (12 pts), boolean chains 2 (nesting depth added 26). Of this number, 43 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/api/serve_other.go"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c886a2bf0ac2bd7bb18d3f8c82444363d89376a0aaf42a109a614eaa8788d5c"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseSelectorList (cognitive 46): parser.parseSelectorList has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 4 (11 pts), boolean chains 4, match/switch 1 (2 pts), jumps 1 (nesting depth added 24). 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":"internal/css_parser/css_parser_selector.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5081a6e292126d3785febd184f6afc322b27bc9d4494a613646709c0747e9b6f"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseExportClause (cognitive 46): parser.parseExportClause has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (39 pts), boolean chains 6, loops 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":5856}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4aafedfaf8f9f58c4569b5eb2a02af9ea396ea2f0e2763d63c0a781d24c1de"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.lowerObjectRestHelper (cognitive 46): parser.lowerObjectRestHelper has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (30 pts), loops 5 (9 pts), boolean chains 4, match/switch 3 (nesting depth added 17). Most of this is not in the body itself: 4 of the 46 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 1647, 1473, 1543, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower.go"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"b121f3bf561674b46e33761e66450c43ec43bf2870b7deaa33fec1a1f2c821cf"}},{"ruleId":"D2","level":"warning","message":{"text":"css_parser.isSafeSelectors (cognitive 45): css_parser.isSafeSelectors has cognitive complexity 45 (threshold 15). Drivers by points: if/else 7 (27 pts), match/switch 2 (10 pts), loops 3 (6 pts), boolean chains 2 (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":"internal/css_parser/css_parser.go"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4d993396c12f99563ec5da962c96e98a2a41b0629f50fb5ff172329467127c"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver.NewResolver (cognitive 45): resolver.NewResolver has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 7 (10 pts), boolean chains 3, match/switch 1 (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":"internal/resolver/resolver.go"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fe6b1004aa56587f3567e0c28e6de22a9cfda7bdcc30985a4246af3d8bfeac"}},{"ruleId":"D2","level":"warning","message":{"text":"common.handlePlugins (cognitive 45): common.handlePlugins has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (35 pts), boolean chains 7, error handling 1 (2 pts), loops 1 (nesting depth added 17). Of this number, 23 points are the body\u0027s own statements and 22 belong to 7 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":"lib/shared/common.ts"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"52982b8b8623c521d54a363923f61c61ac44a2ea5b439bdfee3b6e25e0773b2a"}},{"ruleId":"D2","level":"warning","message":{"text":"scanner.reportInvalidTLA (cognitive 44): scanner.reportInvalidTLA has cognitive complexity 44 (threshold 15). Drivers by points: if/else 7 (31 pts), loops 3 (11 pts), boolean chains 2 (nesting depth added 32). 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":"internal/bundler/bundler.go"},"region":{"startLine":2887}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79ecc8fc6523140227d8b132d5e56cc00d46323ad1ae7c4f08c48c80509a6dd"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.processAnimationShorthand (cognitive 44): parser.processAnimationShorthand has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 5 (18 pts), boolean chains 1, loops 1 (nesting depth added 29). 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":"internal/css_parser/css_decls_animation.go"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1c6a11759d7179260b47a2e59de0139d97784c992292a3833ca9e658e02e70"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.handleComposesPragma (cognitive 44): parser.handleComposesPragma has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 5 (15 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 28). 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":"internal/css_parser/css_decls_composes.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa22cd2340edfbaa7aea4045e99b25b04aec1013951d32ba23cba2ff23703858"}},{"ruleId":"D2","level":"warning","message":{"text":"helpers.internalQuote (cognitive 44): helpers.internalQuote has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 3 (5 pts), match/switch 2 (5 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":"internal/helpers/quote.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bd29e320afba4eb817fe91f477738b3e0d6b762546c3242549048fd19fa4f6"}},{"ruleId":"D2","level":"warning","message":{"text":"js_ast.KnownPrimitiveType (cognitive 44): js_ast.KnownPrimitiveType has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (34 pts), boolean chains 5, match/switch 3 (5 pts) (nesting depth added 25). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4a67f66f7e4b8a6c277d19c968f9ba3aba0970b58dff834b52fdf1453f2b9e"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseImportClause (cognitive 44): parser.parseImportClause has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (42 pts), boolean chains 1, loops 1 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":5735}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffac19d451438010956aa81bf71bb1dcd006843e568e2cf2653cc2399343fa3"}},{"ruleId":"D2","level":"warning","message":{"text":"logger.GenerateStringInJSTable (cognitive 44): logger.GenerateStringInJSTable has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 3 (8 pts), match/switch 3 (8 pts), boolean chains 4 (nesting depth added 24). 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":"internal/logger/logger.go"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd30f628f0ef7f8bd2e1b9192aaceb19265550b61b4cf0c287528cbe41f1a2c"}},{"ruleId":"D2","level":"warning","message":{"text":"mdn.addFeatures (cognitive 44): mdn.addFeatures has cognitive complexity 44 (threshold 15). Drivers by points: if/else 3 (17 pts), loops 5 (13 pts), ternaries 2 (9 pts), boolean chains 5 (nesting depth added 29). 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":"compat-table/src/mdn.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b3acfce43bd078ebf013f95510887f0638411c804793df805e2dfd080b0d12"}},{"ruleId":"D2","level":"warning","message":{"text":"Bundle.Compile (cognitive 43): Bundle.Compile has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 6 (12 pts), match/switch 1 (5 pts), boolean chains 2 (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":"internal/bundler/bundler.go"},"region":{"startLine":3050}}}],"partialFingerprints":{"codehealthFindingId/v1":"e142719bfa7049dd5c2baa8604c227663fc6bddf28d5853fcba5476d55f41a08"}},{"ruleId":"D2","level":"warning","message":{"text":"css_parser.parseGradient (cognitive 43): css_parser.parseGradient has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 8, loops 4 (6 pts), match/switch 1 (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":"internal/css_parser/css_decls_gradient.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c759a0d5102782dfbb76dd5b972886d64f608983b952ea0448ca2c54177030f0"}},{"ruleId":"D2","level":"warning","message":{"text":"css_parser.removeImpliedPositions (cognitive 43): css_parser.removeImpliedPositions has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 5 (13 pts), boolean chains 7, jumps 1 (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":"internal/css_parser/css_decls_gradient.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"da776d759d6100a6fcd760aee0133f4826180b5b021a71f2c6bd3fc423463ede"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseMediaInParens (cognitive 43): parser.parseMediaInParens has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (38 pts), boolean chains 4, loops 1 (nesting depth added 23). 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":"internal/css_parser/css_parser_media.go"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e053955d34d20c729ebcb11fdf93b752b88c0d9675848c36103cc791a933d8e"}},{"ruleId":"D2","level":"warning","message":{"text":"calcProduct.partiallySimplify (cognitive 43): calcProduct.partiallySimplify has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_reduce_calc.go"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd05c7839f2feb0699c687f5731aa6832ae058e81f01ec518cd532ff2c62d18"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printIdent (cognitive 43): printer.printIdent has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 10, loops 2 (3 pts), jumps 1, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_printer/css_printer.go"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"f111ffdf6f79835035c9c210d14fcc6c88076d3adbf5d360b808e28d4f127a58"}},{"ruleId":"D2","level":"warning","message":{"text":"js_ast.FoldStringAddition (cognitive 43): js_ast.FoldStringAddition has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (32 pts), match/switch 4 (8 pts), boolean chains 3 (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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f22f01e68e11213e19015818ecdeab6998796fdab49c395d86c471d35528b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.NextJSXElementChild (cognitive 43): Lexer.NextJSXElementChild has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (27 pts), loops 3 (8 pts), match/switch 2 (6 pts), boolean chains 1, jumps 1 (nesting depth added 28). 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":"internal/js_lexer/js_lexer.go"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15e4b5c4baafeefd971841a20c7b220eeaa823a7282dfb590260e98abd13973"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.prepareForVisitPass (cognitive 43): parser.prepareForVisitPass has cognitive complexity 43 (threshold 15). Drivers by points: if/else 24 (36 pts), boolean chains 7 (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 file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":18319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e08309ec955036e3e22826c86fbdd9f99dbee2cec8eeb958ff755120308a245"}},{"ruleId":"D2","level":"warning","message":{"text":"binaryExprVisitor.checkAndPrepare (cognitive 43): binaryExprVisitor.checkAndPrepare has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (32 pts), boolean chains 10, match/switch 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":"internal/js_printer/js_printer.go"},"region":{"startLine":3374}}}],"partialFingerprints":{"codehealthFindingId/v1":"3126fba43a2f4fcad2e943b1b38a8962ff3d1507fb4ed752f34fef5eae335775"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.mangleLocalCSS (cognitive 43): linkerContext.mangleLocalCSS has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 7 (16 pts), boolean chains 3 (nesting depth added 24). 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":"internal/linker/linker.go"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82cc3e2dab9dcd51b422a78837a98d85ae8b01eff1162e01b58c2c48ff18ab5"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.findImportedPartsInJSOrder (cognitive 43): linkerContext.findImportedPartsInJSOrder has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 4 (7 pts), boolean chains 5 (nesting depth added 23). Most of this is not in the body itself: 2 of the 43 points are its own statements and the rest belongs to one function literal inside it that branches (line 4168). 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":"internal/linker/linker.go"},"region":{"startLine":4144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e317439cb18863211f1bb5ec81f2cb0d3351c45ee8e114adc03750caaa4d3ab7"}},{"ruleId":"D2","level":"warning","message":{"text":"resolverQuery.resolveToUnqualified (cognitive 43): resolverQuery.resolveToUnqualified has cognitive complexity 43 (threshold 15). Drivers by points: if/else 28 (41 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/yarnpnp.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb4a38b642a11d66eb3976aa6e146f578b17bedc9d8f782c63585c6019eadfe"}},{"ruleId":"D2","level":"warning","message":{"text":"css_lexer.decodeEscapesInToken (cognitive 42): css_lexer.decodeEscapesInToken has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 5, loops 3 (4 pts) (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":"internal/css_lexer/css_lexer.go"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"656a0dcdccff3ce900d403d80c6fa421ce3d33b176c7ef51df50a3e0cfa9deb8"}},{"ruleId":"D2","level":"warning","message":{"text":"HelperContext.ClassCanBeRemovedIfUnused (cognitive 42): HelperContext.ClassCanBeRemovedIfUnused has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (32 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":2335}}}],"partialFingerprints":{"codehealthFindingId/v1":"41114872341c79327dbfe5e23de3dacc2cc70ad22644d0af5b95bf5b9feb41c9"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.lateConstantFoldUnaryOrBinaryOrIfExpr (cognitive 42): printer.lateConstantFoldUnaryOrBinaryOrIfExpr has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (35 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb5c6c24ef755f51bad7b5888076505da037fc87fb0cc6ff58bac87356d12d4"}},{"ruleId":"D2","level":"warning","message":{"text":"js_ast.IsBinaryNullAndUndefined (cognitive 41): js_ast.IsBinaryNullAndUndefined has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (38 pts), boolean chains 3 (nesting depth added 28). 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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb31778b71f5c2cf957ab6582b81b826f16819b11498f56fde59fa431648680"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.skipTypeScriptObjectType (cognitive 41): parser.skipTypeScriptObjectType has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 5, match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/ts_parser.go"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c347e1f1fbcb42c27d29339e88a458f8c4fb30f9cc72e0e8ff62123592aa7eb"}},{"ruleId":"D2","level":"warning","message":{"text":"duplicateCaseChecker.check (cognitive 41): duplicateCaseChecker.check has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (38 pts), loops 1 (3 pts) (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7daf1000953e0ef9440a59ca6ae5f06bdd1157081bdeb97b6e0ea11d52c6330"}},{"ruleId":"D2","level":"warning","message":{"text":"logger.formatLineSpan (cognitive 41): logger.formatLineSpan has cognitive complexity 41 (threshold 15). Drivers by points: if/else 25 (38 pts), boolean chains 3 (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":"internal/logger/style.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e4b07e83baa773538ae135d5a012e27fcd4a4dc9170c3bfb993bfb703a0c8c"}},{"ruleId":"D2","level":"warning","message":{"text":"resolverQuery.esmPackageImportsExportsResolve (cognitive 41): resolverQuery.esmPackageImportsExportsResolve has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (36 pts), boolean chains 4, loops 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/package_json.go"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"3425aa076d60742c0ed60e4c1e40127c67863060440ee84ea276c5bb3a102d2b"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseAttributeSelector (cognitive 40): parser.parseAttributeSelector has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 3, match/switch 2 (3 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":"internal/css_parser/css_parser_selector.go"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1b06861e124cbd436912e53740177f9688598a9c509395d98e500a027db2ec"}},{"ruleId":"D2","level":"warning","message":{"text":"fs.ParseYarnPnPVirtualPath (cognitive 40): fs.ParseYarnPnPVirtualPath has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 2 (6 pts), boolean chains 5 (nesting depth added 23). 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":"internal/fs/fs_zip.go"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f0c73fdb2569a2f51b44e9a7cd82140456ae4b2f504b67be4d28a66e619f04"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printDecorators (cognitive 40): printer.printDecorators has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (28 pts), match/switch 2 (5 pts), jumps 3, loops 2 (3 pts), boolean chains 1 (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":"internal/js_printer/js_printer.go"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"7795261e7bdda168d574679d5a54f99e465721f1ed0fecd47de6719136a26581"}},{"ruleId":"D2","level":"warning","message":{"text":"css_parser.removeColorInterpolation (cognitive 39): css_parser.removeColorInterpolation has cognitive complexity 39 (threshold 15). Drivers by points: if/else 6 (24 pts), match/switch 2 (11 pts), boolean chains 3, loops 1 (nesting depth added 27). 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":"internal/css_parser/css_decls_gradient.go"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b339746bdd47106cb391d0ba2d4a3d7cd11e131c7156ea87b7d5325dda57eef"}},{"ruleId":"D2","level":"warning","message":{"text":"css_parser.parseRangeMediaFeature (cognitive 39): css_parser.parseRangeMediaFeature has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (35 pts), boolean chains 4 (nesting depth added 25). 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":"internal/css_parser/css_parser_media.go"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"164e4ce20247e00c59cc75fe0548f37210eb008aacea56b36ec7c6ba5302ad0f"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.processListStyleShorthand (cognitive 39): parser.processListStyleShorthand has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (27 pts), match/switch 2 (6 pts), boolean chains 5, loops 1 (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":"internal/css_parser/css_decls_list_style.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"19516c75a42e2b569aee98e1f6985bc134147e0dccefe23ee6e4523135c6bdc1"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.warnAboutDuplicateProperties (cognitive 39): parser.warnAboutDuplicateProperties has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 6, match/switch 1 (6 pts), loops 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cbb68a0313b918a63df6ee90f5ab7a0cf1e6fe3f264e9d1ce32d9384ba3439"}},{"ruleId":"D2","level":"warning","message":{"text":"resolverQuery.esmPackageTargetReverseResolve (cognitive 39): resolverQuery.esmPackageTargetReverseResolve has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (30 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/package_json.go"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2bfce5a82aadd41fbdf2b0a3aa2bbb3b1ec6d84e82b2996b03296efb662e93"}},{"ruleId":"D2","level":"warning","message":{"text":"api.validateDefines (cognitive 39): api.validateDefines has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 4, match/switch 1 (4 pts), boolean chains 3 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/api/api_impl.go"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c50e9ec70acbd18bf5f217ec499120d4f959d1d0b59d1cb4ecbb577497ac37"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.insertPrefixedDeclaration (cognitive 38): parser.insertPrefixedDeclaration has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 4 (9 pts), boolean chains 5, loops 2 (5 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":"internal/css_parser/css_decls.go"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a4c725b8c9b27f6030bfa7639e8e8e23fd2a1c39d05436790ecc1cd7a645a1"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseAsyncPrefixExpr (cognitive 38): parser.parseAsyncPrefixExpr has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (29 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":2992}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ebd876c875e79441f0ac9902f9e9811894aed0f694c0131cfd0be18f599bd2"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseDecorator (cognitive 38): parser.parseDecorator has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 4, jumps 3, match/switch 1 (2 pts), loops 1 (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 file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":6956}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd95600d8176623c34f08bb70eaefb9c67da2495a730ca65f9b8625447f01ea"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseTypeScriptEnumStmt (cognitive 38): parser.parseTypeScriptEnumStmt has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (33 pts), boolean chains 4, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/ts_parser.go"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e6d0689fb06d3486385fd2052ee3a8671ed48d4fb664880497761ca9e443f2"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.generateGlobalNamePrefix (cognitive 38): linkerContext.generateGlobalNamePrefix has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (33 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":6004}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b26073e7362aa8be1085b13903f8defc12a7f84080f0e94e1ef0fc94cdc7121"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printNumber (cognitive 37): printer.printNumber has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (31 pts), boolean chains 6 (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":"internal/js_printer/js_printer.go"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"54db44637506fa74edd1e7b68763d5884720dcaaaca1a9b3c1492c8e3a0c0373"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.generateChunksInParallel (cognitive 37): linkerContext.generateChunksInParallel has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 7 (11 pts), match/switch 4 (10 pts), boolean chains 1 (nesting depth added 19). Most of this is not in the body itself: 9 of the 37 points are its own statements and the rest belongs to one function literal inside it that branches (line 659). 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":"internal/linker/linker.go"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"868ed39cfae3a40a2ba5fcf47f27b6e675311b4d2955e031dbfa7f046e7934fd"}},{"ruleId":"D2","level":"warning","message":{"text":"Bundle.computeDataForSourceMapsInParallel (cognitive 36): Bundle.computeDataForSourceMapsInParallel has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 2 (6 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 23). Most of this is not in the body itself: 7 of the 36 points are its own statements and the rest belongs to one function literal inside it that branches (line 3278). 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":"internal/bundler/bundler.go"},"region":{"startLine":3258}}}],"partialFingerprints":{"codehealthFindingId/v1":"83326634e0b994625c90a9a5cae6256a13362a51d27b6e775b78222d7f9f222b"}},{"ruleId":"D2","level":"warning","message":{"text":"Token.Equal (cognitive 36): Token.Equal has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (33 pts), boolean chains 3 (nesting depth added 20). 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":"internal/css_ast/css_ast.go"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5266a8a90524d5e9a88eacabf3a3486548a1dd4652842c975e6af94e5428b0c"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.instantiateDefineExpr (cognitive 36): parser.instantiateDefineExpr has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (27 pts), loops 3 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":12678}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b4fd5f7940751939dba283d4b2cd8dea0e519222e050dcb3a79fad4ec289c7"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.lowerAndMangleBoxShadow (cognitive 35): parser.lowerAndMangleBoxShadow has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_box_shadow.go"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc0c42c2f6c1a31e3aaa0945f78fb32327963954e9294636b20efe4feff208a"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.mangleFamilyNameOrGenericName (cognitive 35): parser.mangleFamilyNameOrGenericName has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 3 (9 pts), boolean chains 3 (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":"internal/css_parser/css_decls_font_family.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c87237bb0222f726e1f0a19a4fcd2fc28501d12ac9f299cb79b972efe8c07fe"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.scanForEndOfRule (cognitive 35): parser.scanForEndOfRule has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 2 (5 pts), boolean chains 4, loops 1 (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":"internal/css_parser/css_parser.go"},"region":{"startLine":2308}}}],"partialFingerprints":{"codehealthFindingId/v1":"9654c07ddadf7922f290e788f783ed3eb2e29e7b88009b4a5886a2dd0d2bf1bd"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.scanIdentifierWithEscapes (cognitive 35): Lexer.scanIdentifierWithEscapes has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2 (10 pts), loops 3 (9 pts) (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":"internal/js_lexer/js_lexer.go"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2fa10f99e0f8b3120ad3b900fe0d8a48efa84cc0de2b1826e498d92252624c"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.mangleProps (cognitive 35): linkerContext.mangleProps has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 8 (13 pts) (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":"internal/linker/linker.go"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adab65eb0d1e2480e5f6c71d50f8c553607f95802329ca6bc79138057b5666c"}},{"ruleId":"D2","level":"warning","message":{"text":"serviceType.handleBuildRequest (cognitive 34): serviceType.handleBuildRequest has cognitive complexity 34 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 4, loops 1 (nesting depth added 9). Of this number, 16 points are the body\u0027s own statements and 18 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/esbuild/service.go"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2368f07822e9f775f8b154791a50a790803c784d6f204350f12d37a50d5a6f0"}},{"ruleId":"D2","level":"warning","message":{"text":"js_ast.ValuesLookTheSame (cognitive 34): js_ast.ValuesLookTheSame has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 9, loops 1 (3 pts), match/switch 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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cecb6850ff4cc07209ea9bcd88db69bddca6e41a02ab105ae28308313890263"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseFnStmt (cognitive 34): parser.parseFnStmt has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 8, match/switch 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":6758}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05b0319d22859f07cef034bc2700cb3811353aa1629a98a6c4d01fb7dc55889"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.markFileLiveForTreeShaking (cognitive 34): linkerContext.markFileLiveForTreeShaking has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 3 (7 pts), boolean chains 3, match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":3220}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5ebbadb03d851e5dacb3a552ed33fb95589996bdc32008ced064a073756fdb"}},{"ruleId":"D2","level":"warning","message":{"text":"lexer.consumeNumeric (cognitive 33): lexer.consumeNumeric has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 9, loops 3 (7 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_lexer/css_lexer.go"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"045aeae7db8e85d251387c45bb909ee00e8a23148ec59322242d1280f741c577"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printQuotedWithQuote (cognitive 33): printer.printQuotedWithQuote has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_printer/css_printer.go"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"11420c4108660d2aae126b2361681a816bfaff5c87c36b57b2daaac9c9532a70"}},{"ruleId":"D2","level":"warning","message":{"text":"common.parseStackLinesV8 (cognitive 33): common.parseStackLinesV8 has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (16 pts), error handling 1 (5 pts), loops 2 (5 pts), ternaries 1 (5 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shared/common.ts"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8a183b30c60022fea81b879ac76d724664f4d0a6363d397f583a4bcbfc1084"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.skipTypeScriptBinding (cognitive 32): parser.skipTypeScriptBinding has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (6 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/ts_parser.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e64810e8cbd99fdc13e883bc6c9c30e74c05f4b07e04a4211ae34452fd8684f"}},{"ruleId":"D2","level":"warning","message":{"text":"compat.CompareSemver (cognitive 31): compat.CompareSemver has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 3, loops 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":"internal/compat/compat.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"983deb10225359c0f26d9944e330113d19ce512432151f2a77f20b666f5ccdf9"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.breakOutputIntoPieces (cognitive 31): linkerContext.breakOutputIntoPieces has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 2 (6 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":6744}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6eb66fca989f810437bd6afde7c1139b0b2c7fe4c67fabc09397956c227cd5"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.substituteAmpersandsInCompoundSelector (cognitive 30): parser.substituteAmpersandsInCompoundSelector has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 4 (9 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_nesting.go"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"efee9c58a888b00f62ab460caddc7720b7dbfeb0fe5d11076ace7ce4e074b346"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parsePath (cognitive 30): parser.parsePath has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":6648}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9b05ca8ab25678024618e2aa0a26ef261d900881def74bc203c8e2d8d05f78"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.warnAboutEqualityCheck (cognitive 30): parser.warnAboutEqualityCheck has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 2, match/switch 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":12867}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecf3b000b3b4888197ce8061c12356bfb3de5c8d84f9a28569762d8009b7cf0"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.warnAboutImportNamespaceCall (cognitive 30): parser.warnAboutImportNamespaceCall has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":16859}}}],"partialFingerprints":{"codehealthFindingId/v1":"096a21e176620a09f9b8ac9e4f68133dc7bc5bab4a6036b693b5858cf577c722"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.validateComposesFromProperties (cognitive 30): linkerContext.validateComposesFromProperties has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 18). Most of this is not in the body itself: 1 of the 30 points is its own statement and the rest belongs to one function literal inside it that branches (line 2041). 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":"internal/linker/linker.go"},"region":{"startLine":2030}}}],"partialFingerprints":{"codehealthFindingId/v1":"f473b03089ecf68d5a0b843deac9a97dbca4a09fa36a90dba6e109042b16080f"}},{"ruleId":"D2","level":"warning","message":{"text":"logger.NewStderrLog (cognitive 30): logger.NewStderrLog has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 4, match/switch 3, loops 1 (nesting depth added 9). Most of this is not in the body itself: 2 of the 30 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 730, 700). 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":"internal/logger/logger.go"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c34eaadb7a6d3fd4d2b8b1ff9410a2a6697bc5471c85c446607e6e0b5483a22"}},{"ruleId":"D2","level":"warning","message":{"text":"resolverQuery.esmPackageExportsResolve (cognitive 30): resolverQuery.esmPackageExportsResolve has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 5 (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":"internal/resolver/package_json.go"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3d27d8866bb251b42f5daf247405e16fab46c73c9f3a49f69f402f5ed3cf2e"}},{"ruleId":"D2","level":"warning","message":{"text":"node-platform.generateBinPath (cognitive 30): node-platform.generateBinPath has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), error handling 3 (6 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/npm/node-platform.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6fb9a3f47fbf3f9c5fc19ddc9d120da808ab2e4e7d09be6a515346494c374c"}},{"ruleId":"D2","level":"warning","message":{"text":"lexer.consumeURL (cognitive 29): lexer.consumeURL has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (5 pts), jumps 4, match/switch 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_lexer/css_lexer.go"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc8a5f63b82aca5277f11a93dfd92ece079c907f9259490aea88af8643c88aa"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseDeclaration (cognitive 29): parser.parseDeclaration has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 5, match/switch 1 (2 pts), jumps 1, loops 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":"internal/css_parser/css_parser.go"},"region":{"startLine":2391}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f0a3ec74d384105ff3dccef50859a860f99ecd1156a237f2f37d3f3a2d089e"}},{"ruleId":"D2","level":"warning","message":{"text":"js_ast.MangleObjectSpread (cognitive 29): js_ast.MangleObjectSpread has cognitive complexity 29 (threshold 15). Drivers by points: if/else 4 (18 pts), loops 2 (5 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":2737}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe13f78492a4411051b93d3bd4e6ffe7293da7ab469d54f21d29b36b41cf3a6"}},{"ruleId":"D2","level":"warning","message":{"text":"MinifyRenamer.AssignNamesByFrequency (cognitive 29): MinifyRenamer.AssignNamesByFrequency has cognitive complexity 29 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 2 (7 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/renamer/renamer.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"77570d6f27fb9407f5f90d5c5fda3544115856390d35fcdc9417e4f431903bf1"}},{"ruleId":"D2","level":"warning","message":{"text":"apiHandler.serveEventStream (cognitive 29): apiHandler.serveEventStream has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 2 (7 pts), loops 2 (6 pts) (nesting depth added 20). Most of this is not in the body itself: 13 of the 29 points are its own statements and the rest belongs to one function literal inside it that branches (line 438). 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":"pkg/api/serve_other.go"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f2cee464191d8ae1fbb5e6371f3d3110e668b123a4ce486c4ea371ae73bc45"}},{"ruleId":"D2","level":"warning","message":{"text":"scanner.preprocessInjectedFiles (cognitive 28): scanner.preprocessInjectedFiles has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 3, loops 3 (nesting depth added 11). Most of this is not in the body itself: 6 of the 28 points are its own statements and the rest belongs to one function literal inside it that branches (line 1756). 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":"internal/bundler/bundler.go"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6dbb198226f7589f046d1dea270808210a988cc758fa71053b1af2cdfc731c"}},{"ruleId":"D2","level":"warning","message":{"text":"lexer.consumeToEndOfMultiLineComment (cognitive 28): lexer.consumeToEndOfMultiLineComment has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (6 pts), match/switch 2 (3 pts), boolean chains 2 (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":"internal/css_lexer/css_lexer.go"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff62ca9d011b0ff8ddf944d452b5dea0b468b419d70b2c6b89000a024431617"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.mangleFont (cognitive 28): parser.mangleFont has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_font.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53245b49bbc76aad155fe19c24c2f6329ca13cc6bb465b1b62ed4bf0bc6544c"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.ScanRegExp (cognitive 28): Lexer.ScanRegExp has cognitive complexity 28 (threshold 15). Drivers by points: loops 4 (13 pts), if/else 3 (7 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 17). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_lexer/js_lexer.go"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee3101926f6f8418febb086e31e821704c4083176e3a56cc9a527293a8f738c"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.canMergeSymbols (cognitive 28): parser.canMergeSymbols has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 15, if/else 11, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4213765753f21dccffbfaedac670e2079b97a0803065a33d4554642137dd642"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.visitBinding (cognitive 28): parser.visitBinding has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":10083}}}],"partialFingerprints":{"codehealthFindingId/v1":"015c4fd1e15711aaca5420957a53afb1b35381c3fcf3711d1ecb79446aed8f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.globPatternFromExpr (cognitive 28): parser.globPatternFromExpr has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":16758}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d75bc6e4c5d3ab7a2bb402efeaaa3bae78323b9621a4ca0260f3d8a15d309e"}},{"ruleId":"D2","level":"warning","message":{"text":"Source.CommentTextWithoutIndent (cognitive 28): Source.CommentTextWithoutIndent has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (6 pts), match/switch 2 (4 pts), boolean chains 3, jumps 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":"internal/logger/logger.go"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"342026260862f832ce9715db930fb28cf177526e7f281c9935567ee96a03cf30"}},{"ruleId":"D2","level":"warning","message":{"text":"LineColumnTracker.scanTo (cognitive 28): LineColumnTracker.scanTo has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/logger/logger.go"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f6fcc664f44876f9be42c89d03643b7437a5fdac808aff1aac873195a60daa"}},{"ruleId":"D2","level":"warning","message":{"text":"api.validateExternals (cognitive 28): api.validateExternals has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (26 pts), boolean chains 1, loops 1 (nesting depth added 17). 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":"pkg/api/api_impl.go"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"44496402ddd234e0e418c91822b5c0a696fde64abbb19a5c29f92457746c68fe"}},{"ruleId":"D2","level":"warning","message":{"text":"compat-table.mergeAllTestResults (cognitive 28): compat-table.mergeAllTestResults has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 3 (8 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":"compat-table/src/compat-table.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efb1d6265c91c0e076834ce21a0d1a8c96c9ab8974ef24aa55f25cf3fdd6173"}},{"ruleId":"D2","level":"warning","message":{"text":"main.decodePacket (cognitive 27): main.decodePacket has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 13). Most of this is not in the body itself: 3 of the 27 points are its own statements and the rest belongs to one function literal inside it that branches (line 113). 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":"cmd/esbuild/stdio_protocol.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b068c94054e6544e54702df038556417837450cb7f6875aa686e8133dabaea70"}},{"ruleId":"D2","level":"warning","message":{"text":"calcSum.convertToToken (cognitive 27): calcSum.convertToToken has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 1, loops 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":"internal/css_parser/css_reduce_calc.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eff0cc5cbbfe259ea42c7e77755c1ebf72cb52d3c4b0c118f0b5fe81805c397"}},{"ruleId":"D2","level":"warning","message":{"text":"js_lexer.RangeOfIdentifier (cognitive 27): js_lexer.RangeOfIdentifier has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (7 pts), boolean chains 2 (nesting depth added 15). 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":"internal/js_lexer/js_lexer.go"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"951c66e021850b27d0a6d47056f3610f7035915f34e3f6bb53c96032638d003b"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.lowerSuperPropertyOrPrivateInAssign (cognitive 27): parser.lowerSuperPropertyOrPrivateInAssign has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31a8c4c4158e67349ef4a971dc9413d6ba7f062837690561c6e285219544422"}},{"ruleId":"D2","level":"warning","message":{"text":"lowerUsingDeclarationContext.scanStmts (cognitive 27): lowerUsingDeclarationContext.scanStmts has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower.go"},"region":{"startLine":1931}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f29a25c3e5f792592aaa576d54f51d9730bd70902a2f8fe9927c7d66821e811"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.markFileReachableForCodeSplitting (cognitive 27): linkerContext.markFileReachableForCodeSplitting has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (9 pts), boolean chains 2, match/switch 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":"internal/linker/linker.go"},"region":{"startLine":3167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2039b005b5f4884734902d4475ea70076c1c7ebf2cd9ebe04c4894d5caf9a39"}},{"ruleId":"D2","level":"warning","message":{"text":"logger.msgString (cognitive 27): logger.msgString has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/logger/style_default.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4246acc36c6e51bd2d31ea5792f6a53f0b9ffb26a63a59540ebba0f5578fd6"}},{"ruleId":"D2","level":"warning","message":{"text":"resolverQuery.checkForBuiltInNodeModules (cognitive 27): resolverQuery.checkForBuiltInNodeModules has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 9 (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":"internal/resolver/resolver.go"},"region":{"startLine":2539}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5da1bbc233058c6db20522e74419f428b4a1e744298e909b13e7139073d42f3"}},{"ruleId":"D2","level":"warning","message":{"text":"common.createChannel.transform (cognitive 27): common.createChannel.transform has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 3, error handling 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 6). Most of this is not in the body itself: 3 of the 27 points are its own statements and the rest belongs to 5 function items inside it that branch (start, a function literal at line 729, a function literal at line 724, \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":"lib/shared/common.ts"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"67442aaa89210b19ba8bb4a0ce16875742816eb36709e48e7d7957bfc3cb72cb"}},{"ruleId":"D2","level":"warning","message":{"text":"bundler.ResolveFailureErrorTextSuggestionNotes (cognitive 26): bundler.ResolveFailureErrorTextSuggestionNotes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 3, match/switch 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":"internal/bundler/bundler.go"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c5af6c97b70ed7190d1c1a3ae7027d9d254359657d0c509abbbf0ac3c7ed6f"}},{"ruleId":"D2","level":"warning","message":{"text":"bundler.lowestCommonAncestorDirectory (cognitive 26): bundler.lowestCommonAncestorDirectory has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90301f689ba89ac9acd9aeb53dd57779e44fd0d3c417ebb1307c5d8675af31f"}},{"ruleId":"D2","level":"warning","message":{"text":"scanner.maybeParseFile (cognitive 26): scanner.maybeParseFile has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"26834586ce6c96c3564b3bd86e12923efb977f27a1a4675712cd68ac2a29865a"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseMediaCondition (cognitive 26): parser.parseMediaCondition has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_parser_media.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"201d6ab4177176c1889340ab675d1cada4fd0998c769a525a560acd670b65291"}},{"ruleId":"D2","level":"warning","message":{"text":"js_parser.analyzeSwitchCasesForLiveness (cognitive 26): js_parser.analyzeSwitchCasesForLiveness has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 3 (5 pts), boolean chains 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"3068b1bcf1c2b362568f7390442ebf094d06051cf653fe2ace34d9985c681406"}},{"ruleId":"D2","level":"warning","message":{"text":"js_parser.mangleFor (cognitive 26): js_parser.mangleFor has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":10184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88a3879a44329a3f4b44af5ba26ae0005088c7b0203e90da991934391884fd0"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseDecorators (cognitive 26): parser.parseDecorators has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":6890}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde255fbff5c3c6f2560cc785d801f5926d83aa1673527ff6c16d943e0559183"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.generateClosureForTypeScriptNamespaceOrEnum (cognitive 26): parser.generateClosureForTypeScriptNamespaceOrEnum has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 6, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/ts_parser.go"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f18ad68faf44387342c4fb5c8fcd5f40f2c0bf3ae7155f456327d0b3a00d199"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.preventExportsFromBeingRenamed (cognitive 26): linkerContext.preventExportsFromBeingRenamed has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (5 pts), match/switch 1 (3 pts) (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":"internal/linker/linker.go"},"region":{"startLine":6927}}}],"partialFingerprints":{"codehealthFindingId/v1":"8898820e0ec9abfcb9411511535a0443f68197d8ec1b91f3333b093d058544fb"}},{"ruleId":"D2","level":"warning","message":{"text":"css_lexer.RangeOfIdentifier (cognitive 25): css_lexer.RangeOfIdentifier has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_lexer/css_lexer.go"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"442474a143018c3ca6fc526b29f7e475b1f8176a77304990950e0566f2983226"}},{"ruleId":"D2","level":"warning","message":{"text":"js_ast.ToBooleanWithSideEffects (cognitive 25): js_ast.ToBooleanWithSideEffects has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":2014}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9f6aee7e0b758442ad7a5f482d7fe24342d296cdbd81c2065946568b17d1da"}},{"ruleId":"D2","level":"warning","message":{"text":"js_lexer.decodeJSXEntities (cognitive 25): js_lexer.decodeJSXEntities has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 1, loops 1 (nesting depth added 15). 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":"internal/js_lexer/js_lexer.go"},"region":{"startLine":2095}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a36c3bed712798c2154b03e9f593ddcbbff5dcbff4ef07231df311c4c249cc2"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.findSymbol (cognitive 25): parser.findSymbol 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, 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":8682}}}],"partialFingerprints":{"codehealthFindingId/v1":"1283d73cc4e25a789d382496f109f552bd964c3e5dd5ced5da946ace58442ed9"}},{"ruleId":"D2","level":"warning","message":{"text":"Options.Equal (cognitive 25): Options.Equal has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b84a44f7448f34c0c056261aeff6db6a08a1fbd4a8806ce3fdd2027a86090a6"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.addExportsForExportStar (cognitive 25): linkerContext.addExportsForExportStar has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (7 pts), jumps 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":"internal/linker/linker.go"},"region":{"startLine":2970}}}],"partialFingerprints":{"codehealthFindingId/v1":"7079eb43e05fd61d7298962ba0c15dbc1a6163572aa6e810f8b928d9ec0cf937"}},{"ruleId":"D2","level":"warning","message":{"text":"logger.PlatformIndependentPathDirBaseExt (cognitive 25): logger.PlatformIndependentPathDirBaseExt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 8, 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":"internal/logger/logger.go"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"22da444aaf9ae228a634191da010528aa94a9f716dbb8663ffd382988a0a9337"}},{"ruleId":"D2","level":"warning","message":{"text":"sourcemap.GenerateLineOffsetTables (cognitive 25): sourcemap.GenerateLineOffsetTables has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (6 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/sourcemap/sourcemap.go"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"777fca2a638a1c1295eca57e8fb3511fd8b16cc8d7b5b7c8f03384c7ae79dc81"}},{"ruleId":"D2","level":"warning","message":{"text":"api.validateFeatures (cognitive 25): api.validateFeatures has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 2, loops 2, match/switch 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":"pkg/api/api_impl.go"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e64754f1b3b7b6ccbef952063fca473ef2c728c06f4e0a12ca3314b877c8c2"}},{"ruleId":"D2","level":"warning","message":{"text":"api.transformImpl (cognitive 25): api.transformImpl has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (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":"pkg/api/api_impl.go"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"4227d9494cf140b54a9a7ffd890b4c5cd9708f2c2d650fd22a1e1bbd2552ba7a"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.printMangleCache (cognitive 25): cli.printMangleCache has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 4 (10 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/cli/mangle_cache.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5712de599e941deb801f8359b0ce335eaa4da46ae709d3298132a38d4f48ce7a"}},{"ruleId":"D2","level":"warning","message":{"text":"bundler.PathRelativeToOutbase (cognitive 24): bundler.PathRelativeToOutbase has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":3443}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d355e848598fb87cf35fc2417bcec6061be977fdfa86ad1c3cd62690a13b88"}},{"ruleId":"D2","level":"warning","message":{"text":"js_ast.MaybeSimplifyEqualityComparison (cognitive 24): js_ast.MaybeSimplifyEqualityComparison has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d205e73a1c3ddf704604182a8be4f00fc5f57ae154c60d313f82655f443b3832"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.simplifyUnusedExpr (cognitive 24): printer.simplifyUnusedExpr has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (3 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0b3557405e182cc18f00b07e6348fdaa4043e9b31b6a5384ef729bb496ad51"}},{"ruleId":"D2","level":"warning","message":{"text":"logger.wrapWordsInString (cognitive 24): logger.wrapWordsInString has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (7 pts), boolean chains 4, jumps 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/logger/style.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1a2ea4640956cb36bac8c2ed3323e5b6da833a86555179770a3534c99e4bd9"}},{"ruleId":"D2","level":"warning","message":{"text":"resolverQuery.loadAsFile (cognitive 24): resolverQuery.loadAsFile has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 7). Of this number, 19 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/resolver.go"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1bd8f13d20db2869ed563e1d86e7320cdc4e1264bda7a882480d614aa7811f"}},{"ruleId":"D2","level":"warning","message":{"text":"scanner.recursivelyValidateTLA (cognitive 23): scanner.recursivelyValidateTLA has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":2851}}}],"partialFingerprints":{"codehealthFindingId/v1":"66628f17bda3a7d20049cf660439d18e534bd8d270b21e9cb29ba0fe45eb996a"}},{"ruleId":"D2","level":"warning","message":{"text":"config.ProcessDefines (cognitive 23): config.ProcessDefines has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/config/globals.go"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a78593bc5c8d75115b01a50cd1b0455ff5da7d3b344951a97774143619c1e2"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printImportAssertOrWithClause (cognitive 23): printer.printImportAssertOrWithClause has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2 (3 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":"internal/js_printer/js_printer.go"},"region":{"startLine":4028}}}],"partialFingerprints":{"codehealthFindingId/v1":"3876eb0fa06acdfe27fd5573f0e0776f7323d3cd02ba9002b0a06cd914828e77"}},{"ruleId":"D2","level":"warning","message":{"text":"linker.Link (cognitive 23): linker.Link has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"76620378e279a7fccd89ec9cca99de6c399d3deed7dfcf57b7ab7e803497a65f"}},{"ruleId":"D2","level":"warning","message":{"text":"linkerContext.createExportsForFile (cognitive 23): linkerContext.createExportsForFile has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 3 (5 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":"internal/linker/linker.go"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"973135a8cea44f52246e60b3e4f36350aef48ed188db357c8dc9cc85ec93daf1"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceMapPieces.Finalize (cognitive 23): SourceMapPieces.Finalize has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/sourcemap/sourcemap.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"735f130e870ca93c57b9c4a5d64555f255c30cc8ad174220b36e5bae16772dcd"}},{"ruleId":"D2","level":"warning","message":{"text":"css_parser.tryToParseValue (cognitive 22): css_parser.tryToParseValue has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_gradient.go"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9323c396fa796415d52e56e0382f3e5c22a5759b904b4e69740f90670df8bb2"}},{"ruleId":"D2","level":"warning","message":{"text":"borderRadiusTracker.mangleCorners (cognitive 22): borderRadiusTracker.mangleCorners has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 5 (6 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":"internal/css_parser/css_decls_border_radius.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a753a2a03d6f68a6dd2b31230e83e7449a6249500c0721446a61a7e082d07a7c"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.tryToGenerateColor (cognitive 22): parser.tryToGenerateColor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_color.go"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2c65792cd9453305eab78bf46184394e5226280df46c66b7d441b29ce9b152"}},{"ruleId":"D2","level":"warning","message":{"text":"fs.tryToReadZipArchive (cognitive 22): fs.tryToReadZipArchive has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fs/fs_zip.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6519761ca0a940b915a7f5fe2197ecc6f9990b084034d863112344415af3915"}},{"ruleId":"D2","level":"warning","message":{"text":"mockFS.Rel (cognitive 22): mockFS.Rel has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fs/fs_mock.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b0111c73b686cbb2aaa58a10ffebb82943c9d4a35cd982c5ca39ce80876cdb"}},{"ruleId":"D2","level":"warning","message":{"text":"js_ast.TryToInsertOptionalChain (cognitive 22): js_ast.TryToInsertOptionalChain has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cb1a6a88e44f6fe2489ded1a12b7485defc5c22c717811a9c2a696c2fe2aa7"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.convertExprToBinding (cognitive 22): parser.convertExprToBinding has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":3399}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc89f4218a84a02a52f511331911fe883bc05710133b7d6f2774f3d4b003685"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.maybeInlineIIFE (cognitive 22): parser.maybeInlineIIFE has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":11927}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e555331e03943d001226813eb46e3b3e0a628e5379aab84d37d0180ecf2279"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.isDotOrIndexDefineMatch (cognitive 22): parser.isDotOrIndexDefineMatch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":12619}}}],"partialFingerprints":{"codehealthFindingId/v1":"447f8d2fc5af970a500bcd4d2bb215fb4521f15d9e1ff487aeda401919e900f7"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.lowerTemplateLiteral (cognitive 22): parser.lowerTemplateLiteral has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower.go"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"4649150698372748e806425375eb7abfe4d0c4894fc428d25b138e67e2f1db77"}},{"ruleId":"D2","level":"warning","message":{"text":"lowerClassContext.analyzeProperty (cognitive 22): lowerClassContext.analyzeProperty has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, if/else 9 (11 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c12a173ec27d03cfe87dc2dae86b51c9fe43d595b1da188fe89ff6797a8d35c"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printExprCommentsAtLoc (cognitive 22): printer.printExprCommentsAtLoc has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":1917}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adc7c636b92625b4bb60966faad9e7dc54e41f1411c82a6c3dc1f9bdc643664"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printIf (cognitive 22): printer.printIf has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17 (22 pts) (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":"internal/js_printer/js_printer.go"},"region":{"startLine":3825}}}],"partialFingerprints":{"codehealthFindingId/v1":"318a212b61888f853a10d8b11e17052f2684b777c8581abf99eb4d52c395fab8"}},{"ruleId":"D2","level":"warning","message":{"text":"linker.wrapRulesWithConditions (cognitive 22): linker.wrapRulesWithConditions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":6478}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c40896b966ff1d46fe518aa66e12d363eb9ddd3c729f1d6cb9b5852f567baf"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printWithEscape (cognitive 21): printer.printWithEscape has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 9, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_printer/css_printer.go"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebb4cad6aafa74ad2fbdc7a3b4d6c2a955f1035053f18b5998a7359c6d62d7e"}},{"ruleId":"D2","level":"warning","message":{"text":"js_ast.ShouldFoldBinaryOperatorWhenMinifying (cognitive 21): js_ast.ShouldFoldBinaryOperatorWhenMinifying has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42716201044822f8ce4da6b6dfd34c7b454906067217a1b0ec41afccfe829d8"}},{"ruleId":"D2","level":"warning","message":{"text":"js_lexer.fixWhitespaceAndDecodeJSXEntities (cognitive 21): js_lexer.fixWhitespaceAndDecodeJSXEntities has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_lexer/js_lexer.go"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"46377a0d0c5ec5bfde4a2ca10a56ef711ba3328868650c861710679e8757fcc3"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.lowerClass (cognitive 21): parser.lowerClass has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (20 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":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68bd849df214fc81e9e4dc1de030b456f001c82631e9e530195fd8cf6fd8162"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver.isValidTSConfigPathNoBaseURLPattern (cognitive 21): resolver.isValidTSConfigPathNoBaseURLPattern has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 10 (nesting depth added 3). 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":"internal/resolver/tsconfig_json.go"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1346eda61c1ccd05ee0165c7fa6f686752f996158546ce2536aba8e567e3925"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.parseServeOptionsImpl (cognitive 21): cli.parseServeOptionsImpl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/cli/cli_impl.go"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba03079b5c91b2d7d26fd543fe67476013155671102755656f3ac2f0a1fef51"}},{"ruleId":"D2","level":"warning","message":{"text":"borderRadiusTracker.mangleCorner (cognitive 20): borderRadiusTracker.mangleCorner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5 (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":"internal/css_parser/css_decls_border_radius.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8963e2932c0997a1bbdfed412fc0211e67b7d69dd4ed4b582efd29abf8c16b05"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.maybeSimplifyMediaNot (cognitive 20): parser.maybeSimplifyMediaNot has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_parser_media.go"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3f9605551850bdaf49e090de59842645160ed328ff7d30cc4b7d06b1735458"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver.globstarToEscapedRegexp (cognitive 20): resolver.globstarToEscapedRegexp has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/package_json.go"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0a916245e23c88da7931e06d618c767dc70247b85e4f7422c26c804ce4b4fa"}},{"ruleId":"D2","level":"warning","message":{"text":"apiHandler.matchQueryPathToResult (cognitive 20): apiHandler.matchQueryPathToResult has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 1, 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":"pkg/api/serve_other.go"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40f041dcde3e06e072048d551259f6871185953da9f587b57a7a7d524912bac"}},{"ruleId":"D2","level":"warning","message":{"text":"Bundle.generateMetadataJSON (cognitive 19): Bundle.generateMetadataJSON has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), 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":"internal/bundler/bundler.go"},"region":{"startLine":3321}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5828ca9133fc82c0586a2bc0e2be89d92a90183aeaa57bd35d13b7fdbeb18a"}},{"ruleId":"D2","level":"warning","message":{"text":"lexer.wouldStartNumber (cognitive 19): lexer.wouldStartNumber has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6 (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":"internal/css_lexer/css_lexer.go"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04ea831b133326441443b30f062ebfbdde10eac2a5c64f352f502440a8365ab"}},{"ruleId":"D2","level":"warning","message":{"text":"lexer.consumeIdentLike (cognitive 19): lexer.consumeIdentLike has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 5, loops 1 (4 pts) (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_lexer/css_lexer.go"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b469ba348848c97a1a3e4438841807ec6b29f17f392e5d6f75b488298f9556"}},{"ruleId":"D2","level":"warning","message":{"text":"DeadRuleRemover.RemoveDeadRulesInPlace (cognitive 19): DeadRuleRemover.RemoveDeadRulesInPlace has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), jumps 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_parser.go"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbe6d45b658675455a022910736fcfcb1f23f040b7264d6df49f8ea4e005f7f"}},{"ruleId":"D2","level":"warning","message":{"text":"fs.MockFS (cognitive 19): fs.MockFS has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fs/fs_mock.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f29f988514e8893fb572a53d5cd6add722107cca69d658f729171980ce775d"}},{"ruleId":"D2","level":"warning","message":{"text":"helpers.PrettyPrintedStack (cognitive 19): helpers.PrettyPrintedStack has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/helpers/stack.go"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e07821cfe6894dac46efed5f925517f899731f8142d3a8cd95658705d05ca2"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parsePropertyBinding (cognitive 19): parser.parsePropertyBinding has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, match/switch 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":2741}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7569bf848cac59882b21d2dad023a0c7e2bcc63bc9f370cc7a18aa0a8ff59f"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.generateClosureForTypeScriptEnum (cognitive 19): parser.generateClosureForTypeScriptEnum has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/ts_parser.go"},"region":{"startLine":1954}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3aefece50b1aa29f3479a747ef3f599b77900def74515bb71ce107f797eb25"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkBuilder.updateGeneratedLineAndColumn (cognitive 19): ChunkBuilder.updateGeneratedLineAndColumn has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 2, match/switch 1 (2 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":"internal/sourcemap/sourcemap.go"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bca22978756901ad7854ef469c228aa3926f0dbb7c62c528723acf774aa722"}},{"ruleId":"D2","level":"warning","message":{"text":"bundler.logPluginMessages (cognitive 18): bundler.logPluginMessages has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (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":"internal/bundler/bundler.go"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81c1d0bd1f7205b57cb59590bf7d8711583b844b4608d8a2b934fd880ecc840"}},{"ruleId":"D2","level":"warning","message":{"text":"css_parser.mangleNumber (cognitive 18): css_parser.mangleNumber has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_parser.go"},"region":{"startLine":2123}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc454b8c5072e831cb64756fdad7b50728dbbd735a77850b3686aaae1bd8a584"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseURLOrString (cognitive 18): parser.parseURLOrString has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_parser.go"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d89d44aff803f28f189a03a8b2647f28cb681e5cd0ddf8393f706b9368742f"}},{"ruleId":"D2","level":"warning","message":{"text":"helpers.DecodeWTF8Rune (cognitive 18): helpers.DecodeWTF8Rune has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/helpers/utf.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54c68bb6bebdb6c3167791c5315b03fabcf6af961ebd81a34ad55f29a521444"}},{"ruleId":"D2","level":"warning","message":{"text":"js_ast.ConvertBindingToExpr (cognitive 18): js_ast.ConvertBindingToExpr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"094af71e27713fb58ca80444ec98e881e5bc299568b0bbb08dc2d0aae96c115d"}},{"ruleId":"D2","level":"warning","message":{"text":"js_ast.simplifyUnusedStringAdditionChain (cognitive 18): js_ast.simplifyUnusedStringAdditionChain has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa1252238de144443f5922ff3de687c3b413c14fbbcd0e26ea989e2f984c38f"}},{"ruleId":"D2","level":"warning","message":{"text":"js_ast.IsIdentifierUTF16 (cognitive 18): js_ast.IsIdentifierUTF16 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 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 (js_ast.IsIdentifierES5AndESNextUTF16) 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":"internal/js_ast/js_ident.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5254bf571e9474ac139e81da116353d3c6baba9392174b5b1e20b41e4bbb7559"}},{"ruleId":"D2","level":"warning","message":{"text":"js_ast.IsIdentifierES5AndESNextUTF16 (cognitive 18): js_ast.IsIdentifierES5AndESNextUTF16 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 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 (js_ast.IsIdentifierUTF16) 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":"internal/js_ast/js_ident.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e940e0299ae38d09a75b3f476e4498ca5cf83e6645a0c66f128bb370c64e4fd7"}},{"ruleId":"D2","level":"warning","message":{"text":"js_parser.duplicateCaseEquals (cognitive 18): js_parser.duplicateCaseEquals has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 7, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c92807b51f510470fbd75f38ce2a30332d9ff1b05893919e56313247f3b9b67"}},{"ruleId":"D2","level":"warning","message":{"text":"js_parser.isValidJSON (cognitive 18): js_parser.isValidJSON has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/json_parser.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd2f3c964800b9f17652436a49490aa55154b09bcb8db6e20b2f8a42bb23dac"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.warnAboutTypeofAndString (cognitive 18): parser.warnAboutTypeofAndString has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":12832}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3284b23518b5ee1613ea275fd95790388a0754254d7fb122dc6aba614ac34ae"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.lowerObjectSpread (cognitive 18): parser.lowerObjectSpread has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower.go"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eddabc8c9c52156e0fbebdcc86d74806922636cfe73083267e922b89d508ab1"}},{"ruleId":"D2","level":"warning","message":{"text":"lowerClassContext.insertInitializersIntoConstructor (cognitive 18): lowerClassContext.insertInitializersIntoConstructor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"be48e63421a4ac10a3468f9855cfe1bb49d8ac9177c94da276c0c4d9451bb6fa"}},{"ruleId":"D2","level":"warning","message":{"text":"linker.mergeAdjacentLocalStmts (cognitive 18): linker.mergeAdjacentLocalStmts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":4590}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc0fb4c5a99f17ab3b5f2241f1dffd3143eb4238eff6c93e75ca235758d4302"}},{"ruleId":"D2","level":"warning","message":{"text":"Source.RangeOfString (cognitive 18): Source.RangeOfString has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/logger/logger.go"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d70719ccf8702b02c6a50dfc096c5e4937f20e84b63a4b9bbd720fa4f53131c"}},{"ruleId":"D2","level":"warning","message":{"text":"numberScope.findUnusedName (cognitive 18): numberScope.findUnusedName has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/renamer/renamer.go"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94ef45a6fec07bf5ccb265a9f4563d353cf9faf3195728a26967ef13f63bcfe"}},{"ruleId":"D2","level":"warning","message":{"text":"caniuse.addFeatures (cognitive 18): caniuse.addFeatures has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (8 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compat-table/src/caniuse.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd06c7946e74755c738ddd0080802b6a282ed5c33825e0ea1412928096cc235"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runService (cognitive 17): main.runService has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 7). Of this number, 12 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/esbuild/service.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40d33cb608978c38a4bfef254ae8a889889fab5cdca940c14bd3312f45bb774"}},{"ruleId":"D2","level":"warning","message":{"text":"RAtKeyframes.Equal (cognitive 17): RAtKeyframes.Equal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_ast/css_ast.go"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"4939f89727a4e833ca95f152167d4ae51f82da402534c0a76a5d26af3e0c5cf6"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplexSelector.ContainsNestingCombinator (cognitive 17): ComplexSelector.ContainsNestingCombinator has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_ast/css_ast.go"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c36bf50266f80b50f4c879a9d94641276a19a9f56fb22403e3951087c0bd417"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.lowerNestingInRule (cognitive 17): parser.lowerNestingInRule has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 2 (5 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_nesting.go"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"731f361e9429e739906cd2db154a6ba63b82db4485409d0737ea97c43e3cbf72"}},{"ruleId":"D2","level":"warning","message":{"text":"calcSum.partiallySimplify (cognitive 17): calcSum.partiallySimplify has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_reduce_calc.go"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadb71b6e404b532bad9f63e053cd7d2b1172762a243e722845f308a1c988db4"}},{"ruleId":"D2","level":"warning","message":{"text":"css_printer.functionMultiLineCommaPeriod (cognitive 17): css_printer.functionMultiLineCommaPeriod has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_printer/css_printer.go"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12d47995587b7c0114c25847576496af33ed3bb5d716c4e620b72cb884eeabc"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.logAssignToDefine (cognitive 17): parser.logAssignToDefine has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":2016}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6c555399d70f096e0763b367a8a703922cda688f63caba7a8a9dbe8d926657"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseClassStmt (cognitive 17): parser.parseClassStmt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5 (nesting depth added 3). 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":6395}}}],"partialFingerprints":{"codehealthFindingId/v1":"133c7ae69458088b500f80007447aac2d9c765a8dcd6da799f0fb51724b805bd"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.appendPart (cognitive 17): parser.appendPart has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (5 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":17682}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9ac2a5bdb3857840a1fdc0fcf136a3b4d9c0cbafd1e8b1feba7a0a9790d808"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.lowerObjectRestInDecls (cognitive 17): parser.lowerObjectRestInDecls has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower.go"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea08294c428ed0125f57e6d35a089e282cc5ab001a54437ddd7df818edb283b4"}},{"ruleId":"D2","level":"warning","message":{"text":"lowerUsingDeclarationContext.finalize (cognitive 17): lowerUsingDeclarationContext.finalize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower.go"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"51988491e2d06a2a97d0d988859061d9931202f4239705670f8af165e874544f"}},{"ruleId":"D2","level":"warning","message":{"text":"js_printer.QuoteIdentifier (cognitive 17): js_printer.QuoteIdentifier has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, 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":"internal/js_printer/js_printer.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5ae7c8c0ea01e29e48d16ea7667edf7345c5acd12126ddaeba8f79c622260b"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printFnArgs (cognitive 17): printer.printFnArgs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d70f79b89a6d3aa0acbf07c88e11c3e6f4f49793cdb390a11f5c9cff0f67ef"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printQuotedUTF16 (cognitive 17): printer.printQuotedUTF16 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c24af45013f565880d232052e978755bdd97848bf02673a6a0ff9737d115f59"}},{"ruleId":"D2","level":"warning","message":{"text":"pluginImpl.onResolve (cognitive 17): pluginImpl.onResolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2 (nesting depth added 4). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 1963). 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":"pkg/api/api_impl.go"},"region":{"startLine":1952}}}],"partialFingerprints":{"codehealthFindingId/v1":"6869ef7d362811a3fbb68f0634547b1dd2e8820564504133406677ded7d8cb5e"}},{"ruleId":"D2","level":"warning","message":{"text":"watcher.tryToFindDirtyPath (cognitive 17): watcher.tryToFindDirtyPath has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (6 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":"pkg/api/watcher.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"773603f67ad4310f4997950ef6b011faf6b49089071f8d74b8a185de951c23d4"}},{"ruleId":"D2","level":"warning","message":{"text":"node-platform.pkgForSomeOtherPlatform (cognitive 17): node-platform.pkgForSomeOtherPlatform has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), error handling 2 (6 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/npm/node-platform.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"47735d8f5b7df3174be1d85dc474ba521e56a7b4801fc23e5fb66fdf2444fb58"}},{"ruleId":"D2","level":"warning","message":{"text":"serviceType.handleTransformRequest (cognitive 16): serviceType.handleTransformRequest has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/esbuild/service.go"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"981540ef4271996349293929a08c0002d6704137af0ee489501a36f94356ca56"}},{"ruleId":"D2","level":"warning","message":{"text":"bundler.extractSourceMapFromComment (cognitive 16): bundler.extractSourceMapFromComment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d54e41da73928e8707ec411b00bb004b3bc6d66996c23378c402a73ea60638e"}},{"ruleId":"D2","level":"warning","message":{"text":"scanner.generateResultForGlobResolve (cognitive 16): scanner.generateResultForGlobResolve has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3, match/switch 1 (2 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":"internal/bundler/bundler.go"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec6235c11c3f1b1c931aa968b48c793aa9554fbc5d0eb8e12a7a97853f6443a"}},{"ruleId":"D2","level":"warning","message":{"text":"RAtLayer.Equal (cognitive 16): RAtLayer.Equal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_ast/css_ast.go"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e14da1fd80105171c64c103c9d1712922d21257a2432cd2316eac2355f6d4d9"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplexSelector.Equal (cognitive 16): ComplexSelector.Equal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_ast/css_ast.go"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8df2f31b0cf643788b41bd5830ad3e845e08cf61558ad36eef95e5246f439f"}},{"ruleId":"D2","level":"warning","message":{"text":"css_parser.containsLocalOrGlobalSelector (cognitive 16): css_parser.containsLocalOrGlobalSelector has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 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":"internal/css_parser/css_parser_selector.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7a72c38705a02de7c7bc21eec778caa8afb148c01ea6722ea10cb2ecc67884"}},{"ruleId":"D2","level":"warning","message":{"text":"helpers.EncodeStringAsPercentEscapedDataURL (cognitive 16): helpers.EncodeStringAsPercentEscapedDataURL has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/helpers/dataurl.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fd5683a6a63f05966f302738af82e4008f7f2c6089d4437a931a07afe8bfa6"}},{"ruleId":"D2","level":"warning","message":{"text":"helpers.UTF16ToStringWithValidation (cognitive 16): helpers.UTF16ToStringWithValidation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/helpers/utf.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6799d0985afef3998519416e6ef34c4f206e50a776b91368554a6f87d32bfa3"}},{"ruleId":"D2","level":"warning","message":{"text":"helpers.UTF16EqualsString (cognitive 16): helpers.UTF16EqualsString has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 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":"internal/helpers/utf.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3615b89edc063989be5e17fa502e45604218da77485bf92f1a0eed294684c16b"}},{"ruleId":"D2","level":"warning","message":{"text":"js_ast.foldAdditionPreProcess (cognitive 16): js_ast.foldAdditionPreProcess has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fe85f62bba649da4cd7671eb0340179a941e74a8f99c631c9023038ae32290"}},{"ruleId":"D2","level":"warning","message":{"text":"js_ast.InlineSpreadsOfArrayLiterals (cognitive 16): js_ast.InlineSpreadsOfArrayLiterals has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":2716}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6fe7f19c6eff64c55e6526a668cd71e00670ed65ee2b8f112f6bcac53c7e05"}},{"ruleId":"D2","level":"warning","message":{"text":"js_parser.shouldKeepStmtInDeadControlFlow (cognitive 16): js_parser.shouldKeepStmtInDeadControlFlow has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 2 (4 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 3). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":8820}}}],"partialFingerprints":{"codehealthFindingId/v1":"c790174d1618a49e7b33331951726c76342d6104da4322ad6fd329155555d1cc"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.visitStmtsAndPrependTempRefs (cognitive 16): parser.visitStmtsAndPrependTempRefs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":8884}}}],"partialFingerprints":{"codehealthFindingId/v1":"417aa2099fc6ba66f09aa034c7684ee687ad2b6f9171060ae188433d56093205"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.checkForUnusedTSImportEquals (cognitive 16): parser.checkForUnusedTSImportEquals has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 1 (2 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: internal/js_parser/js_parser.go holds 62 of the 362 functions over the threshold \u2014 including the worst \u2014 and 6138 of the 20068 points over it (31%), 3.3\u00D7 the next-largest file (internal/linker/linker.go at 1871). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":17270}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bce28499fdb697b98793e749a396a3b307016db955d049ff083f2c1b490a2e"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.getOrCreateExportedNamespaceMembers (cognitive 16): parser.getOrCreateExportedNamespaceMembers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (16 pts) (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/ts_parser.go"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7ec75e7c4dfd5aad116ec5e7e1d5ad006f64354df6aab9fd6103e511d3b0a1"}},{"ruleId":"D2","level":"warning","message":{"text":"lowerClassContext.lowerPrivateMethod (cognitive 16): lowerClassContext.lowerPrivateMethod has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddca0d8a489446d1bb443e60cbe67f65d8a5d18ef5e80ac48022c184a0ed122"}},{"ruleId":"D2","level":"warning","message":{"text":"printer.printIdentifierUTF16 (cognitive 16): printer.printIdentifierUTF16 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"950a7a8d1951e95b660900630e0b50696fbf338ebe1f2d147e206669f0dca5ed"}},{"ruleId":"D2","level":"warning","message":{"text":"linker.isConditionalImportRedundant (cognitive 16): linker.isConditionalImportRedundant has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, 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":"internal/linker/linker.go"},"region":{"startLine":3819}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2abb7ff815c3cfd75cb228deed1483a2ee372da43da74f9662d60325314a4d"}},{"ruleId":"D2","level":"warning","message":{"text":"resolverQuery.esmHandlePostConditions (cognitive 16): resolverQuery.esmHandlePostConditions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/package_json.go"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"03db2cf49729bad0d07157e72e3f6bb92ed0ba686b773f75eafb0e56d70dd16d"}},{"ruleId":"D2","level":"warning","message":{"text":"resolverQuery.findLocator (cognitive 16): resolverQuery.findLocator has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/yarnpnp.go"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"2211d3d7efbdb325485d2b69e8fc8b19e8ad7e479abde70c29ab7cecab75c936"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: parser: ClassTooLong \u2014 9055 significant lines (blank, comment-only and punctuation-only lines excluded), 232 methods, 150 blocks, lines 36-18846. The bar is 400 significant lines; this is 8655 over it, 22.64\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a216a3788b9837d0ae5428f14ec1210f306d83752c6dab994793848bb8c159"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js_parser/js_parser.go: FileTooLong \u2014 10546 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: parser (150 blocks, 36-18846). The bar is 500 significant lines; this is 10046 over it, 21.09\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82fdc0882056972cd93c98d1c8d5c1e97b76a2ec6696f0636b4a3ccf5eaa446"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.visitExprInOut: MethodTooLong \u2014 visitExprInOut runs 1391 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1291 over it, 13.91\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":"internal/js_parser/js_parser.go"},"region":{"startLine":13552}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5b794e09323dfa641c6c3f2a63ba75a5443864f4d97df3771cc76e5ceffd95"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: printer.printExpr: MethodTooLong \u2014 printExpr runs 930 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 830 over it, 9.30\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":"internal/js_printer/js_printer.go"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"a241e484478fd0f5477bdb7475ac2f1da70fe36334c7f62c39e50c12c222a50b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: linkerContext: ClassTooLong \u2014 3432 significant lines (blank, comment-only and punctuation-only lines excluded), 52 methods, 52 blocks, lines 45-7269. The bar is 400 significant lines; this is 3032 over it, 8.58\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"065025f83a8eb2ace2044d0a93da7b0a3e02125ecc29a00cba91e8223cd50001"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.parseStmt: MethodTooLong \u2014 parseStmt runs 842 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 742 over it, 8.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":7101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7891ecd807af2d633b588ee79be4330ea14e9b52fda87eff5e4383447b7775a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: parser: TooManyMethods \u2014 232 methods, declared across 4 files: js_parser/js_parser.go (151), js_parser/js_parser_lower.go (31), js_parser/ts_parser.go (31), js_parser/js_parser_lower_class.go (19). The bar is 30 methods; this is 202 over it, 7.73\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5ff2b178df4f04f4545754b643ed3d0733092825b2da1c0d62cb3aa9ca1209"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: linker/linker.go: FileTooLong \u2014 3832 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: linkerContext (52 blocks, 45-7269). The bar is 500 significant lines; this is 3332 over it, 7.66\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c718ab82bf7bb4378b12c214b374aa124be2b6ff5f2ae9372ceec448f83c1e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.visitAndAppendStmt: MethodTooLong \u2014 visitAndAppendStmt runs 677 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 577 over it, 6.77\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":"internal/js_parser/js_parser.go"},"region":{"startLine":10393}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f16d5286169f1b65b4610b8b11e00c952d4f4016a13eed0d1578dd53040f61f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js_printer/js_printer.go: FileTooLong \u2014 3352 significant lines (blank, comment-only and punctuation-only lines excluded), about 73% of them inside a single declaration: printer (63 blocks, 65-4093). The bar is 500 significant lines; this is 2852 over it, 6.70\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe832ccd93ca5f7cd48ca582ac95a0cf846c12b9ed5a737ae2bdb0abca0ef5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.parseOptionsImpl: FunctionTooLong \u2014 parseOptionsImpl runs 661 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 561 over it, 6.61\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":"pkg/cli/cli_impl.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade183a7083e64d00eec8c4ff0344e21d098b7bfda0b5784dfb9e3225c47b2fa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: printer: ClassTooLong \u2014 2445 significant lines (blank, comment-only and punctuation-only lines excluded), 63 methods, 63 blocks, lines 65-4093. The bar is 400 significant lines; this is 2045 over it, 6.11\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c3eac2909e0e2c10b1e91994bdd1f3cd8e22369adb8530b29b8fac6858681c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.parseSuffix: MethodTooLong \u2014 parseSuffix runs 495 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 395 over it, 4.95\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":"internal/js_parser/js_parser.go"},"region":{"startLine":4264}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b5f688d09118f41dbbeb69b5e1f0257ec4d8ae7a19fdb62912766f6d42f5e7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lexer.Next: MethodTooLong \u2014 Next runs 453 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 353 over it, 4.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":"internal/js_lexer/js_lexer.go"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d5770df82120c911a431837ecd856dfe54c332974dc0ae7ad21748cca4b6db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bundler/bundler.go: FileTooLong \u2014 2179 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1679 over it, 4.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14308168faf009c73fba7dc3975709db5b4900d76c1294fed16aff07dd44e6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bundler.parseFile: FunctionTooLong \u2014 parseFile runs 417 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 317 over it, 4.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38c7d35838a75740f92323a1312f7e25f7beccebccf31cf26907f5008dd0098"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: parser: TooManyFields \u2014 111 stored fields beside 232 methods. The bar is 30 stored fields; this is 81 over it, 3.70\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cc0f85184f60e08cfb03eab553adc5a563a71f82981b904e7616b43287a123"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.parsePrefix: MethodTooLong \u2014 parsePrefix runs 369 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 269 over it, 3.69\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":"internal/js_parser/js_parser.go"},"region":{"startLine":3499}}}],"partialFingerprints":{"codehealthFindingId/v1":"833fec12eb61d1ac7bcf94fbb97aad3f839043ef29655eec218594d5fbb2394a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: linkerContext.scanImportsAndExports: MethodTooLong \u2014 scanImportsAndExports runs 369 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 269 over it, 3.69\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":"internal/linker/linker.go"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"190587929340960f35d1a180d46dab161ef0d0d97c6912ee7bc5f58d958833d2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.parseProperty: MethodTooLong \u2014 parseProperty runs 350 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 250 over it, 3.50\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":"internal/js_parser/js_parser.go"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"303209348c7a796be739ffceecd27c35e3fdbcb872ae083456aad6f59178c2e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js_lexer/js_lexer.go: FileTooLong \u2014 1719 significant lines (blank, comment-only and punctuation-only lines excluded), about 79% of them inside a single declaration: Lexer (34 blocks, 241-2665). The bar is 500 significant lines; this is 1219 over it, 3.44\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_lexer/js_lexer.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e9ec2a990d6c57a487b7b8301421f723a3ad2e6a8fe00135762b8df5e6ce14"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Lexer: ClassTooLong \u2014 1358 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods, 34 blocks, lines 241-2665. The bar is 400 significant lines; this is 958 over it, 3.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_lexer/js_lexer.go"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"4805e9e1aba37438d0e6979b8cf5ecc5ac77c1fd10f2fd47bc9c70b75db44f03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: api/api_impl.go: FileTooLong \u2014 1684 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1184 over it, 3.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/api/api_impl.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"114eb1132b4c5cf608a2188e2ff9cc4699b51b07b01d55d8d75bb03defd9aa71"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js_ast/js_ast_helpers.go: FileTooLong \u2014 1605 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1105 over it, 3.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d857b8acf3c05bb065eafcb01ebccde79fed07941f29c3f27c4178c9c8ac2e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: binaryExprVisitor.visitRightAndFinish: MethodTooLong \u2014 visitRightAndFinish runs 307 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 207 over it, 3.07\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":"internal/js_parser/js_parser.go"},"region":{"startLine":16067}}}],"partialFingerprints":{"codehealthFindingId/v1":"29305078c9a9fc3599169fea1acf485d185a1f6dbb2b2dfbb6497d733f476884"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolver/resolver.go: FileTooLong \u2014 1510 significant lines (blank, comment-only and punctuation-only lines excluded), about 68% of them inside a single declaration: resolverQuery (23 blocks, 235-2891). The bar is 500 significant lines; this is 1010 over it, 3.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/resolver.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7eb85fb68503973272f58dd38ba8e8f948c3b1aef61d43b8888af85719ff63"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: scanner.processScannedFiles: MethodTooLong \u2014 processScannedFiles runs 290 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 190 over it, 2.90\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":"internal/bundler/bundler.go"},"region":{"startLine":2361}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e046257beaaae78808c103305e4c7ef1a33712cd60be5ffcd2ad1c7265f481"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css_parser/css_parser.go: FileTooLong \u2014 1422 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 922 over it, 2.84\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_parser.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0547144ffccdd37305ad1c3b11b4baae47660b33e04c2eeb108eb198049ec346"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js_parser/js_parser_lower_class.go: FileTooLong \u2014 1390 significant lines (blank, comment-only and punctuation-only lines excluded), about 65% of them inside a single declaration: lowerClassContext (12 blocks, 624-2423). The bar is 500 significant lines; this is 890 over it, 2.78\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41763720658fa039089925da9adf2e6e982efa61f36c2856bb83b0817a693336"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: linkerContext.generateChunkJS: MethodTooLong \u2014 generateChunkJS runs 278 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 178 over it, 2.78\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":"internal/linker/linker.go"},"region":{"startLine":5568}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6fe21b16218f081166bbb68a43bce6a861f6c7386822d99039418d79476437"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shared/common.ts: FileTooLong \u2014 1303 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 803 over it, 2.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shared/common.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfec5a088ad1ea0198bddceedeec43276abf209e513d3d61b98cace4284ad7a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: parser: TooManyMethods \u2014 78 methods, declared across 17 files: css_parser/css_parser.go (29), css_parser/css_parser_selector.go (10), css_parser/css_nesting.go (7), css_parser/css_parser_media.go (7), \u002B13 more file(s). The bar is 30 methods; this is 48 over it, 2.60\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_parser.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d449e1fc9576a3474a2558565936d03b9a0c5eaad373707e25f73cef3a97e414"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Options: TooManyFields \u2014 78 stored fields. The bar is 30 stored fields; this is 48 over it, 2.60\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/config/config.go"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"2702d7ff69821bdaba5ad968bd939a9b62796552295c5f70cc59ab43a5031bda"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: resolverQuery: ClassTooLong \u2014 1034 significant lines (blank, comment-only and punctuation-only lines excluded), 38 methods, 23 blocks, lines 235-2891. The bar is 400 significant lines; this is 634 over it, 2.59\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/resolver.go"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"8062623c79b6c3e6c1a284d3dd552825f7e59b04bff5e4e1c36088488683e71f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: js_parser.ParseSourceMap: FunctionTooLong \u2014 ParseSourceMap runs 251 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 151 over it, 2.51\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":"internal/js_parser/sourcemap_parser.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5a72afe1a73ed8b62a9a3bdbcbca2830c54f5e8743a0a247ddf5b92a9fec4c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.mangleStmts: MethodTooLong \u2014 mangleStmts runs 249 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 149 over it, 2.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":9156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cb918270ca380dd4990141c5625762c618c8fec7cd28bc7fa2dad74a1422bd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: serviceType.handleIncomingPacket: MethodTooLong \u2014 handleIncomingPacket runs 248 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 148 over it, 2.48\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":"cmd/esbuild/service.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df979be428d7d0ea6b369b021164bf43a75c8701675eff70281536565809c83"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js_parser/js_parser_lower.go: FileTooLong \u2014 1206 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: parser (31 blocks, 18-2152). The bar is 500 significant lines; this is 706 over it, 2.41\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db229818e3edf193e382d01ff585f3ed630b88eb722c685a16fe3098bf8ac570"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: linkerContext.generateChunkCSS: MethodTooLong \u2014 generateChunkCSS runs 238 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 138 over it, 2.38\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":"internal/linker/linker.go"},"region":{"startLine":6098}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf60423c56ff7e4f05e88ee2a5cb7661fb7f707ff51e9772575ab87268fd9a5f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: BuildOptions: TooManyFields \u2014 70 stored fields. The bar is 30 stored fields; this is 40 over it, 2.33\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/api/api.go"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"4077479bf93a648d31d22e198ac41ffb1d4d9dd0f8bacd7e877c13543f5949c6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: lowerClassContext: ClassTooLong \u2014 903 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods, 12 blocks, lines 624-2423. The bar is 400 significant lines; this is 503 over it, 2.26\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"4846853784352f88cdaf669c9c92442b8492273fabae4d01998567e8803b1a7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js_parser/ts_parser.go: FileTooLong \u2014 1118 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: parser (31 blocks, 19-2086). The bar is 500 significant lines; this is 618 over it, 2.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/ts_parser.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82ce7801b54ebf17ccd02ab9d1e63cf3827955964a831189acc2fb560b2e216"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.processDeclarations: MethodTooLong \u2014 processDeclarations runs 221 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 121 over it, 2.21\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":"internal/css_parser/css_decls.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"86be26769406b11e5fd653d622ec1a2cfddd87bbc817f3116cc5eb993fab193c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: common.createChannel: FunctionTooLong \u2014 createChannel runs 217 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 117 over it, 2.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shared/common.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0bfe4a1a9e2e931c600960f5609bd9b30c6a92c52e438fceba6d3d6749723a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: printer.printRule: MethodTooLong \u2014 printRule runs 216 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\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":"internal/css_printer/css_printer.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5ad48550dc081723cc08f5f3e9b0e4c83e791aae678aaa5bbcef81bb8a5f28"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/cli_impl.go: FileTooLong \u2014 1076 significant lines (blank, comment-only and punctuation-only lines excluded), about 61% of them inside a single declaration: parseOptionsImpl (85-1023). The bar is 500 significant lines; this is 576 over it, 2.15\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/cli/cli_impl.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c3c8f5f56d3082d4e092d83273175d52e8560ea50fa311090586954340f48c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: printer: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f134ce0942a489bac1d646cc19782509d177f4805cdc9c3e912b289496da5ae1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: scanner: ClassTooLong \u2014 838 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods, 12 blocks, lines 1324-2952. The bar is 400 significant lines; this is 438 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0dfb2bfadd487fda3f370c6f41d178590141bec650687653dc35aaabd3bf2e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: lowerClassContext.processProperties: MethodTooLong \u2014 processProperties runs 208 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 108 over it, 2.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"79655ca27c6d0637b3972e97caeeb798ae2f8ad67a89e49b2b34cb2bca29a7f5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: serviceType.convertPlugins: MethodTooLong \u2014 convertPlugins runs 207 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 107 over it, 2.07\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":"cmd/esbuild/service.go"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5e0cd921dd975e9a59773e9e19fe91b95f15dd6f333a03401c873af1b92c43"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: apiHandler.ServeHTTP: MethodTooLong \u2014 ServeHTTP runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\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":"pkg/api/serve_other.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d27977ab939f3a19d01847cfdc8bdbbf37ef485a05df4d83b3a818894f633f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: logger/logger.go: FileTooLong \u2014 1003 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 503 over it, 2.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/logger/logger.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cf5403b777f5f73a015e71aac33ed2f15431d33e28eefe3b37a367edc30c81"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: uint8array_json_parser.JSON_parse: FunctionTooLong \u2014 JSON_parse runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\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":"lib/shared/uint8array_json_parser.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e340fd77ea867a446fc74edb2bfc0f939e0ef8fb23fad230f9652d9dcb28976"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.skipTypeScriptTypeWithFlags: MethodTooLong \u2014 skipTypeScriptTypeWithFlags runs 187 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\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":"internal/js_parser/ts_parser.go"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48da2355d445ceb01ae7613681bf6754b3151e2c312bf18d9be9b9858ce176f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: linkerContext.generateCodeForFileInChunkJS: MethodTooLong \u2014 generateCodeForFileInChunkJS runs 187 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\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":"internal/linker/linker.go"},"region":{"startLine":4662}}}],"partialFingerprints":{"codehealthFindingId/v1":"8edd710238dcbbe479949f184a8847f55db8769aec068ca1706bcc8ac98e22d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css_ast/css_ast.go: FileTooLong \u2014 929 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 429 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_ast/css_ast.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0816ae685fa188a2ba8287552fb411b027d0e45e4b0110a19529d0a060a6be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js_ast/js_ast.go: FileTooLong \u2014 929 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 429 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdc5919fb9bd1bb3392818eb55de9a688153c83a906e8fdd1cca74e600958e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: esbuild/service.go: FileTooLong \u2014 926 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: serviceType (12 blocks, 42-1295). The bar is 500 significant lines; this is 426 over it, 1.85\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/esbuild/service.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a4b81d6fc6fc33f6eda7569814e78a193d6443d06f44a3203fe8dcbdc90ad9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: resolverQuery.finalizeImportsExportsResult: MethodTooLong \u2014 finalizeImportsExportsResult runs 184 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\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":"internal/resolver/resolver.go"},"region":{"startLine":2605}}}],"partialFingerprints":{"codehealthFindingId/v1":"747d923668540b59d994645040eaf5b5a8e74c7578618ccd4c93529d4a672613"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.visitClass: MethodTooLong \u2014 visitClass 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":"internal/js_parser/js_parser.go"},"region":{"startLine":12177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9673cf0289274b0a4c1995eac92f309b0e2e81eafd9cc2e8e1c46ced06f4509"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: printer: ClassTooLong \u2014 729 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods, 21 blocks, lines 20-1323. The bar is 400 significant lines; this is 329 over it, 1.82\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_printer/css_printer.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"677ef9599cd7f456ebf5479a1079a214dd2e2307a2e1a6a40a115d1fb1ed6da7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.parseJSXElement: MethodTooLong \u2014 parseJSXElement runs 181 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\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":"internal/js_parser/js_parser.go"},"region":{"startLine":5251}}}],"partialFingerprints":{"codehealthFindingId/v1":"5254f32593902a7fb5a1b5cc3186d4c4ca51b57a5cb7f704707af5913d98c1b3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: lowerClassContext.finishAndGenerateCode: MethodTooLong \u2014 finishAndGenerateCode runs 181 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\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":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":2054}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa93845501c7e4a3f95456a5f98d5533b5d52e1a1c1b643e4e2d5f009833b2d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HelperContext.SimplifyUnusedExpr: MethodTooLong \u2014 SimplifyUnusedExpr runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f3cb23e844fbd4727d01958d2ee1fd8863f76a9c54fa10f478ea1a561b9b87"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: serviceType: ClassTooLong \u2014 703 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods, 12 blocks, lines 42-1295. The bar is 400 significant lines; this is 303 over it, 1.76\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/esbuild/service.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc7750b45f06204743a996b62e6333b339e2119e1bfc8a845ac9ae3a1b14b32"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: printer.printProperty: MethodTooLong \u2014 printProperty runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\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":"internal/js_printer/js_printer.go"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c1f05f6535d747ef5bd0614e2f55d25daed32a9a2ebce8b97b99967e488db3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lexer.parseNumericLiteralOrDot: MethodTooLong \u2014 parseNumericLiteralOrDot runs 174 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\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":"internal/js_lexer/js_lexer.go"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"067313ee21134c1c1644be5dd1a04f96545e32f5c6e62632b452bce7dac3d831"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: linkerContext: TooManyMethods \u2014 52 methods, declared across 2 files: linker/linker.go (51), linker/debug.go (1). The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b057cba2c4a0fd03a57f8fdb4321fc3dd827de7f163c5212f1ffdb9d45dfb304"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css_printer/css_printer.go: FileTooLong \u2014 848 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: printer (21 blocks, 20-1323). The bar is 500 significant lines; this is 348 over it, 1.70\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_printer/css_printer.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca4975c2887da01cee4554d1b395994bca706c78560a8ca3acab03cdd72deaf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: css_parser.parseColor: FunctionTooLong \u2014 parseColor runs 169 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\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":"internal/css_parser/css_decls_color.go"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ec94df9a7527ca85efba3ebdbff0e61e9c41e7a739d9f6c31bb74a792e141b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolver/package_json.go: FileTooLong \u2014 835 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 335 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/package_json.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9890511f9de69bebb8dbe5529667b18898b80a04f8fc1650c6e428651bd1504f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.lowerOptionalChain: MethodTooLong \u2014 lowerOptionalChain runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\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":"internal/js_parser/js_parser_lower.go"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"75275da18ff38ad5184f1dd4b1e0f23a8e363f536ec7ed4493d31ef52c67fa57"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: resolver.ParseTSConfigJSON: FunctionTooLong \u2014 ParseTSConfigJSON runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\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":"internal/resolver/tsconfig_json.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe2b7fbe62ed87136d3928f0f58b4925d68ee1c7751a3e72bcbb60c43dbdf27"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: api.analyzeMetafileImpl: FunctionTooLong \u2014 analyzeMetafileImpl runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\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":"pkg/api/api_impl.go"},"region":{"startLine":2291}}}],"partialFingerprints":{"codehealthFindingId/v1":"81404609826b0efc7ac2fcdbd3686224670e9d4afd6d893042708b17d25e9274"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: lexer.next: MethodTooLong \u2014 next runs 161 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\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":"internal/css_lexer/css_lexer.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c7b5e83c67bfec3246580ed9b310a7b08d9e59eb61443eed3ae99a2209ea31"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.scanForImportsAndExports: MethodTooLong \u2014 scanForImportsAndExports runs 161 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\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":"internal/js_parser/js_parser.go"},"region":{"startLine":17332}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad16c96a0bb0e5c601175fdcce530071b83bc19478ecfebc46ad681f73b8fbcf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: scanner.addEntryPoints: MethodTooLong \u2014 addEntryPoints runs 160 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\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":"internal/bundler/bundler.go"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82a89c3bb2a657231632cac0ecde72e886e5e82842195876fa9476346b1b460"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: printStmtFlags: ClassTooLong \u2014 633 significant lines (blank, comment-only and punctuation-only lines excluded), 0 methods. The bar is 400 significant lines; this is 233 over it, 1.58\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":4095}}}],"partialFingerprints":{"codehealthFindingId/v1":"6666dbc0cae9c526d42a3823e8319f969fd8c5588ebef13a14abc64f40e0f53d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: api.validateBuildOptions: FunctionTooLong \u2014 validateBuildOptions runs 158 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\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":"pkg/api/api_impl.go"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e7d5dc04a35f10c797b6439f2532230b4263145399666c016c947d2d84c8f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: printer.printBinding: MethodTooLong \u2014 printBinding runs 155 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\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":"internal/js_printer/js_printer.go"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ec4cbeac6cf9619f509d56fa763fc09caa84cf1a760b7cbbcb3a47e87216ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: linkerContext.findImportedFilesInCSSOrder: MethodTooLong \u2014 findImportedFilesInCSSOrder runs 154 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\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":"internal/linker/linker.go"},"region":{"startLine":3411}}}],"partialFingerprints":{"codehealthFindingId/v1":"652b2b0486ff7a75d5284a20242455abb1e02cfb3ad329d339dd0c8e20d8634f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lexer.tryToDecodeEscapeSequences: MethodTooLong \u2014 tryToDecodeEscapeSequences runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.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":"internal/js_lexer/js_lexer.go"},"region":{"startLine":2192}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7a81c721433cb71565a799bafc6599962ae0007be094c357e73f690e24683b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.mangleTransforms: MethodTooLong \u2014 mangleTransforms runs 149 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_transform.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f52f7adbabe16144590de8ae87c8199de822c4697af8161aa109e8855273f2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: linkerContext.computeCrossChunkDependencies: MethodTooLong \u2014 computeCrossChunkDependencies runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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":"internal/linker/linker.go"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b8a6bdfe824ea3e3554bbf22818b7d340a7081d6aea481caa8d80de13cfe1a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: linkerContext.convertStmtsForChunk: MethodTooLong \u2014 convertStmtsForChunk runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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":"internal/linker/linker.go"},"region":{"startLine":4316}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af8a9e03dfd5dc08941f3bf392ba4bde6e4de328ac4e9194051a3bc2f159976"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: internalContext.Serve: MethodTooLong \u2014 Serve runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\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":"pkg/api/serve_other.go"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"545d63c94c167bf086a3495d217ecdfef06e62271d2e1ab14803cc7a7e28f05e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: js_parser.Parse: FunctionTooLong \u2014 Parse runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\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":"internal/js_parser/js_parser.go"},"region":{"startLine":17815}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ed83f29b83b54dfb102a7e592d87d0918155a043c9df1723b18b79958e7c39"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TransformOptions: TooManyFields \u2014 43 stored fields. The bar is 30 stored fields; this is 13 over it, 1.43\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/api/api.go"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"b190148c750580f2f68751824b6ebfe3d50080cd1c92a48fcb0af6d5d049004f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css_lexer/css_lexer.go: FileTooLong \u2014 714 significant lines (blank, comment-only and punctuation-only lines excluded), about 60% of them inside a single declaration: lexer (13 blocks, 174-954). The bar is 500 significant lines; this is 214 over it, 1.43\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_lexer/css_lexer.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0230963f98934c1d5df113b9106ae9fb7ef754ede4ac3df8425303885bf03fec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.lowerObjectRestHelper: MethodTooLong \u2014 lowerObjectRestHelper runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower.go"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cf23f03d6feb4ca3f28d7e5040846092d2def9e940c8aaa912cdf7e611207a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: printer.printRequireOrImportExpr: MethodTooLong \u2014 printRequireOrImportExpr runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b20a39f5c0e4d03ef608633edddf29402ad410c55e32286477459aef8fec6d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: resolverQuery.parseTSConfigFromSource: MethodTooLong \u2014 parseTSConfigFromSource runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\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":"internal/resolver/resolver.go"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b02dc57ffca10127d561464dc018cac75ef412fdbb4194646f4b754d8a7a13"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: common.flagsForBuildOptions: FunctionTooLong \u2014 flagsForBuildOptions runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\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":"lib/shared/common.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"0226f1cded7dc7d30b2b6be24c9589fe48f6a8c172ac7c4c8694a8376d5f1be4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: linkerContext.generateEntryPointTailJS: MethodTooLong \u2014 generateEntryPointTailJS runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\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":"internal/linker/linker.go"},"region":{"startLine":4997}}}],"partialFingerprints":{"codehealthFindingId/v1":"9216faaaaa6657752014152ec3964756fb7bc714880270fa57f7d089e352aec5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Lexer: TooManyFields \u2014 41 stored fields beside 33 methods. The bar is 30 stored fields; this is 11 over it, 1.37\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_lexer/js_lexer.go"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c99c648c84eaca3b12b2741b382482bace0a341b992d361bfbb266f852d5c64"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HelperContext: ClassTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods, 8 blocks, lines 14-2988. The bar is 400 significant lines; this is 138 over it, 1.35\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dad872e05f290b582751544270fb18671ca46af03459601962a1f629c86a685"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css_parser/css_decls_gradient.go: FileTooLong \u2014 671 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 171 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_gradient.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c633763e31609cbd1cf0805e793f97400a0066886678d5e8db5097935984cf1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.runImpl: FunctionTooLong \u2014 runImpl runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\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":"pkg/cli/cli_impl.go"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f5d5c515719eb932e3857901e4a84be72afe1c2a2627794780b813e8cbdd10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: api/serve_other.go: FileTooLong \u2014 658 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 158 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/api/serve_other.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8c69c3ddc761168e5d90963f75fd8bcc378b4338c88d6110155ad6b3a210aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: linkerContext.computeChunks: MethodTooLong \u2014 computeChunks runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\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":"internal/linker/linker.go"},"region":{"startLine":3875}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d44da2a17c0e7cd67eca094886371de39be678baa5f1cb2a2c3e0a7bb580bc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: linkerContext.generateSourceMapForChunk: MethodTooLong \u2014 generateSourceMapForChunk runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\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":"internal/linker/linker.go"},"region":{"startLine":7001}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca916353170a88cad9d2cf40a3c396d7fb15c1c49a4514cada605dae6d1e2253"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.toAST: MethodTooLong \u2014 toAST runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\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":"internal/js_parser/js_parser.go"},"region":{"startLine":18606}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d55088d261ac0732eabb8127bcae9d713a61514886b951fae890f8be76612b2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: resolverQuery: TooManyMethods \u2014 38 methods, declared across 3 files: resolver/resolver.go (22), resolver/package_json.go (10), resolver/yarnpnp.go (6). The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/resolver.go"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85ffbde8de5067837c0a33b7f25306ae1d564b40dadb4d1570e5323e964afd5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: linkerContext.matchImportWithExport: MethodTooLong \u2014 matchImportWithExport runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\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":"internal/linker/linker.go"},"region":{"startLine":2633}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0b78d2f9bbeb8132c1ef313eb28874954af4c32dccc0b8c36a759a47704bd4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lexer.NextInsideJSXElement: MethodTooLong \u2014 NextInsideJSXElement runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\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":"internal/js_lexer/js_lexer.go"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"530f49a2eaa270211cc69b3efa15a1bb2660febd3f0732c4992ffaa71aba7fdc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.substituteSingleUseSymbolInExpr: MethodTooLong \u2014 substituteSingleUseSymbolInExpr runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\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":"internal/js_parser/js_parser.go"},"region":{"startLine":9735}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3fbbe2e9d7f51e3365182e7786202789489d5a5b782e56407b056734d351e7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: linkerContext.generateChunksInParallel: MethodTooLong \u2014 generateChunksInParallel runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\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":"internal/linker/linker.go"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53a0c6a3b4c36f00d06f9dd160529bfca06b868f5667afadc718fc99450a2d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.maybeRewritePropertyAccess: MethodTooLong \u2014 maybeRewritePropertyAccess runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\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":"internal/js_parser/js_parser.go"},"region":{"startLine":12939}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ca46295712774dc02dbff2261855fb654a6d9157cb0b1b78803796a61ee638"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: api.rebuildImpl: FunctionTooLong \u2014 rebuildImpl runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/api/api_impl.go"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe257dec05a4de256afa317831ea704efe359e40ae3ec290027510411192668"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css_parser/css_parser_selector.go: FileTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: parser (10 blocks, 22-1030). The bar is 500 significant lines; this is 107 over it, 1.21\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_parser_selector.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"306c2dda3d2f4ad5c93a0975316c340b7896f42ca6101d52982a34320d8a4951"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: linkerContext.renameSymbolsInChunk: MethodTooLong \u2014 renameSymbolsInChunk runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\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":"internal/linker/linker.go"},"region":{"startLine":5320}}}],"partialFingerprints":{"codehealthFindingId/v1":"1166c438692e42ab6f102c1cf05d81be329beb0ccb8c8db90f62a66579f0ec38"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: api.transformImpl: FunctionTooLong \u2014 transformImpl runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\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":"pkg/api/api_impl.go"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af08cf25e16e3cf7aaec3eb8a1657e73bd994c240244a06ae547c6308f35f56"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: logger.StringToMsgIDs: FunctionTooLong \u2014 StringToMsgIDs runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/logger/msg_ids.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"98594b8fe2f4032741090c3d09dd9ae9e9f4239aa496d5e70aa6038fba17b86d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.parseCompoundSelector: MethodTooLong \u2014 parseCompoundSelector runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\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":"internal/css_parser/css_parser_selector.go"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c9153b6ec961d7b464780ddb3d14e32ef73460b46989a33669f4a294e27157"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: logger.msgIDToInfo: FunctionTooLong \u2014 msgIDToInfo runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\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":"internal/logger/msg_ids.go"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"35147d8fc1b815242409c2dc8999f013506717247064926747c75071d851f155"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.lowerForAwaitLoop: MethodTooLong \u2014 lowerForAwaitLoop runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\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":"internal/js_parser/js_parser_lower.go"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0d54518159e64c601411813489e665c0fa67d4e6ad8633ecc7f32da2ad61dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Resolver.Resolve: MethodTooLong \u2014 Resolve runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"internal/resolver/resolver.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b9099ba09f626d4faed8c28fd76e4a82b0f7c0f13482d1a151d5a3cee828b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.main: FunctionTooLong \u2014 main runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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":"cmd/esbuild/main.go"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"466622a58c32d0d1e3377e29967207af822debf952d885dfc71d8e686c27fa9d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.parseTypeScriptNamespaceStmt: MethodTooLong \u2014 parseTypeScriptNamespaceStmt runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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":"internal/js_parser/ts_parser.go"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc20040382b8773eae5290ec188b8f9ac24220c0c0c72ffbe8a64266b3a3388"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: printer.printUnquotedUTF16: MethodTooLong \u2014 printUnquotedUTF16 runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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":"internal/js_printer/js_printer.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"387e5366de9ea6a26344d27d02c73c8eab1951e28af021cd7924a7a0d6d74db1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Lexer: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_lexer/js_lexer.go"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb98d65e104ba34458a8f95459810aee7ef1b175772b989757540123d17f024d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: lowerClassContext: TooManyFields \u2014 33 stored fields beside 11 methods. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1d704b0c20a248c9a63b90efb5c4e7d41e0efe8b5b881dc09b198c5bd0f008"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: serviceType.handleBuildRequest: MethodTooLong \u2014 handleBuildRequest runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"cmd/esbuild/service.go"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"6632f1878a47a0c3d246238de87ddf42a3f6a1f2dfa9824ac5f84802631c3565"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HelperContext.MangleIfExpr: MethodTooLong \u2014 MangleIfExpr runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":2788}}}],"partialFingerprints":{"codehealthFindingId/v1":"3895e85c419ac8c1a4e105c09696602a72cebc8fb86a6ca3b2f7711cdd08fe2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/config.go: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/config/config.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55f5c9b7f232b4454852d318af718c59d65dc567702cb1ab21eb7ba1fa99b1c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AST: TooManyFields \u2014 32 stored fields. The bar is 30 stored fields; this is 2 over it, 1.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast.go"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"3639efa64b290cdb08b476010849216e7767e2bd7d26d1c57b12cb4d6b1feaf7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: lexer: ClassTooLong \u2014 425 significant lines (blank, comment-only and punctuation-only lines excluded), 12 methods, 13 blocks, lines 174-954. The bar is 400 significant lines; this is 25 over it, 1.06\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_lexer/css_lexer.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20005fc89246b7da889c6702ae9c3f8da7a855088f72da02a27b578833f309f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: css_parser.tryToParseColorStops: FunctionTooLong \u2014 tryToParseColorStops runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\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":"internal/css_parser/css_decls_gradient.go"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3bdb58b7a4cef97aaefc9a08bf83c6efd6054d34289ad067fe6e35a4f7ad63"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: printer.printTokens: MethodTooLong \u2014 printTokens runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\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":"internal/css_printer/css_printer.go"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"851f45a4081afd2aa54b469e5545b27e8f6449328d50c9e8e5a023d649317415"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.parseParenExpr: MethodTooLong \u2014 parseParenExpr runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\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":"internal/js_parser/js_parser.go"},"region":{"startLine":3153}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4d8f8bcd97062e52b94d3d58a99c7d826a35f95fb61d8c91bafa876b3d85b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graph.CloneLinkerGraph: FunctionTooLong \u2014 CloneLinkerGraph runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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":"internal/graph/graph.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5539c011b216981020aa8c6d546b0be625bef308037c8f64ec58b79606a7e7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css_parser/css_decls_color.go: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 19 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_color.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1df9857ebef82213b948b85ae9c336c138ba9aa86afbe9ca4f4938d07c5f90"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: printer: TooManyFields \u2014 31 stored fields beside 63 methods. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"76adf4c495ca8af93d540626892da4e7e6e1839c6dcd4d2ac515698a2ca0b6dd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.parseFn: MethodTooLong \u2014 parseFn 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":"internal/js_parser/js_parser.go"},"region":{"startLine":6152}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e933a6264e1d91ffcc14b0e9e67bb420ab7cb8f8a0d77fab9b252909faeb10"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: lowerClassContext.lowerField: MethodTooLong \u2014 lowerField 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":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"9166ca48ed6f17475af15de3a7c38753fde582b8495d410721e912c0d642ddaf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Resolver.ResolveGlob: MethodTooLong \u2014 ResolveGlob 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":"internal/resolver/resolver.go"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e48597c7ad6833ff035b67afb0bab6205f23a9642e054954387102e97a62f4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: parser.visitStmts: MethodTooLong \u2014 visitStmts runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"internal/js_parser/js_parser.go"},"region":{"startLine":8960}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57fc5441cd3ec2b696f4c63ecdb3838e5dd4048772123145ae2431e65b59876"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 9 shared lines): internal/js_ast/js_ident.go:132-148 | internal/js_ast/js_ident.go:150-171 | internal/js_ast/js_ident.go:173-189 | internal/js_ast/js_ident.go:191-212 \u2014 These 4 members are variants of one another: a block of 9 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ident.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8471f0b312a1298b4fab7adbff8b5cc505988056edfcc6ac4c0351f74405c9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): internal/css_parser/css_color_spaces.go:82-89 | internal/css_parser/css_color_spaces.go:108-115 | internal/css_parser/css_color_spaces.go:182-189 | internal/css_parser/css_color_spaces.go:226-233 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_color_spaces.go"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d885e76f33bfa5541d352b7a565a3a3ddbc73d237411ed729c5e06b8e3f10c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): internal/js_parser/js_parser.go:2969-2988 | internal/js_parser/ts_parser.go:895-921 | internal/js_parser/ts_parser.go:1001-1022 | internal/js_parser/ts_parser.go:1024-1048 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":2969}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c78689ebb6499a59cbebc7a94173a9c79abc1f233a3d5dde6c327b4420eba77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): internal/resolver/yarnpnp.go:629-653 | internal/resolver/yarnpnp.go:655-684 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/yarnpnp.go"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"14065aab3e5a4208a591209d043053a0b195e680a1cad5971c1c9baf457467d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): internal/css_parser/css_color_spaces.go:524-571 | internal/css_parser/css_color_spaces.go:573-620 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_color_spaces.go"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d7fe4df45adb0d86c73edd9f8f4a962ded6c3b9302368f64e93e51810abc6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 38\u002B corresponding lines): internal/cache/cache_ast.go:41-78 | internal/cache/cache_ast.go:96-134 | internal/cache/cache_ast.go:152-190 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 38 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cache/cache_ast.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04ce105130e473931f43deb1f4efcb7ee8eea2df561a8d743b6226e90f6e0f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): internal/js_parser/js_parser_lower_class.go:259-282 | internal/js_parser/js_parser_lower_class.go:284-307 | internal/js_parser/js_parser_lower_class.go:309-335 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"28cce3dd040e4f7274eb82fd42192d70458d09f26c0c03fe5264d567a68feddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): internal/js_ast/js_ident.go:77-102 | internal/js_ast/js_ident.go:105-130 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ident.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ce142dadfa591c710da4126571fc41ef95c8ffebe4b867bca3df9dce1415ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): cmd/esbuild/service.go:1390-1411 | cmd/esbuild/service.go:1434-1452 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/esbuild/service.go"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"38444b93deac45aecce4584f9f6391241951846c44371dcd179fc7c3e80014d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): internal/helpers/utf.go:46-62 | internal/helpers/utf.go:64-88 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/helpers/utf.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c387bed3a7356da173a544d735b177662e78efa46db5a5324f57894b488832b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): internal/css_parser/css_color_spaces.go:502-515 | internal/css_parser/css_decls_color.go:752-763 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_color_spaces.go"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"09395ff5acb6552644527030fdf79326454d4e95178d199f49e06f7c7fc742b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): cmd/esbuild/service.go:1370-1388 | cmd/esbuild/service.go:1413-1432 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/esbuild/service.go"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"038b7be3feade2f98be36c811effc06408e793e3344982cff8cfc74db9deb738"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): internal/css_ast/css_ast.go:560-579 | internal/css_ast/css_ast.go:741-759 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_ast/css_ast.go"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a1d852ccc7af5fb894a334570c750eb21d948b3715953e00a614cafb55818f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): internal/js_printer/js_printer.go:377-388 | internal/js_printer/js_printer.go:390-402 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8662caffc44dae93cdfad5ca3ade147bf7e8988eedfceb1722ecf7cc835629"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): internal/css_parser/css_color_spaces.go:332-345 | internal/css_parser/css_color_spaces.go:347-360 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_color_spaces.go"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"987a202ebde0b3f2e0f2b2f70c1cab685f26f99977b7d5f0400d0b081f27b24f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): internal/css_ast/css_ast.go:850-856 | internal/css_ast/css_ast.go:858-864 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_ast/css_ast.go"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49f8c6fb7a767e866d76c45ad740391a8323877b529b5af81bb61d03b14b565"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): internal/js_parser/ts_parser.go:843-868 | internal/js_parser/ts_parser.go:870-893 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/ts_parser.go"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"55031b41b07cc8fe797fb3b270ae8e65e639433e06726cda856277aa458fcefe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): internal/bundler/bundler.go:1657-1675 | internal/bundler/bundler.go:1677-1695 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfde42990f7ca2d7db69d510a761b8147146f36bc82a321cfed04f350f9c9f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): internal/ast/ast.go:700-720 | internal/js_parser/js_parser.go:1358-1378 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ast/ast.go"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d69c9646124c8de8316c14318d4d3310ba3cd6de8c327145852c918620d12d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): internal/css_printer/css_printer.go:538-557 | internal/js_printer/js_printer.go:3905-3929 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_printer/css_printer.go"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"214c4210beb9275f5e878ecd9dde670e477c078163eb699500603b29d10dac35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): internal/sourcemap/sourcemap.go:206-232 | internal/sourcemap/sourcemap.go:234-258 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/sourcemap/sourcemap.go"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d57f669e7c1e2306be29dcb1de461c11c97ed530f70a3dca179ee5fffeab5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): internal/css_parser/css_reduce_calc.go:423-440 | internal/css_parser/css_reduce_calc.go:442-459 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_reduce_calc.go"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"b435a2f0799ddd804c57dd577e0e0c4244f9b4f94e50f1ac7e09d02d6b5a93ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): internal/css_parser/css_decls_gradient.go:1008-1022 | internal/css_parser/css_decls_gradient.go:1024-1038 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_gradient.go"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc56676c64becc1a8baacb80fd0ae798b18b688fe9b5dce8ea2d19d9dafce84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): internal/js_parser/js_parser_lower_class.go:137-145 | internal/js_parser/js_parser_lower_class.go:337-347 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5699afada637db9dc68be31a1b524a67185e96c252f1136734f31d5794a10e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): internal/js_parser/js_parser.go:2897-2912 | internal/js_parser/js_parser.go:2914-2927 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":2897}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdb7fe34d6ee7aaaed924f0c5125f9af1e9ab230a892d030ea0ef88c8577451"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): internal/css_parser/css_color_spaces.go:62-71 | internal/css_parser/css_color_spaces.go:129-139 | internal/css_parser/css_color_spaces.go:204-215 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_color_spaces.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7058d599fee14066bd650bc0bf1d4a8578a4a012b68fe540676c0b5a32d71705"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): internal/css_parser/css_decls_border_radius.go:29-36 | internal/css_parser/css_decls_box.go:87-94 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_border_radius.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"737b953359b3cdae3a726b73fa8467fb18cf708bf4b71c14e991ff664c861068"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): internal/css_printer/css_printer.go:982-997 | internal/js_printer/js_printer.go:791-806 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_printer/css_printer.go"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18ac63f2759b7bded7b1933ea095e0f86d9655312b05efd2828ffd89679e722"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): internal/css_parser/css_color_spaces.go:51-60 | internal/css_parser/css_color_spaces.go:117-127 | internal/css_parser/css_color_spaces.go:191-202 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_color_spaces.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbecd4d0075bb59ba0f330ca0ebcd3533770137b1822a56f3de93bfef4e9b69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): internal/js_lexer/js_lexer.go:305-318 | internal/js_lexer/js_lexer.go:320-333 | internal/js_lexer/js_lexer.go:351-364 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_lexer/js_lexer.go"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c31a25318ba6aad46760ba4e23e1725da11fb727bb3fb2b43648d18205a97e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): internal/logger/logger.go:480-487 | internal/logger/logger.go:489-496 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/logger/logger.go"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f845049d3d82778eda85d2503904aa69c555416e37bd785a520f4afcd98bd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): internal/css_ast/css_ast.go:1012-1016 | internal/css_ast/css_ast.go:1018-1022 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_ast/css_ast.go"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"023fe4c15c51833cfb5ea1dba4b54590e85b130d851fd0cda84f374c2c6edf83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): cmd/esbuild/main_other.go:15-27 | cmd/esbuild/main_other.go:45-57 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/esbuild/main_other.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48970ae8233e7900fdc192b6d583af5100383dc26a268945fa75c93b4de265d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): internal/cache/cache.go:91-102 | internal/cache/cache.go:104-115 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cache/cache.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"865b8c05d12f9cba6d058bf0c475b93b0ce0c8233d2eb70e8c3dd691ee698031"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): internal/css_lexer/css_lexer.go:256-277 | internal/js_lexer/js_lexer.go:2447-2468 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_lexer/css_lexer.go"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4748c32455576c6caf30d6accf4f8f54a812962d0d0da48e0ce089d4853d9cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): internal/css_parser/css_decls_list_style.go:99-106 | internal/css_parser/css_decls_container.go:46-53 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_list_style.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"144de7cd986626a2c5b311dc726a6370b98402ccdaa5b34c19bb1a59ed4c2ff8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/css_ast/css_ast.go:218-228 | internal/helpers/strings.go:20-30 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_ast/css_ast.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e63e9ca05d74b3904afdc2db96dce493372d3e3ebb0825835b736a9199b3afb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): internal/css_ast/css_ast.go:260-270 | internal/helpers/strings.go:8-18 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_ast/css_ast.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ebe1646bc75fc75eb1779740b645edf1fd5932fe230a1471edb915482f2c7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): internal/ast/ast.go:781-785 | internal/renamer/renamer.go:395-398 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/ast/ast.go"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de2e543fb74d9e80f11199a4a98ad2e6ff3eb8139a6025b0a0a9caf9e4d989d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): internal/css_ast/css_ast.go:828-834 | internal/helpers/hash.go:8-14 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_ast/css_ast.go"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87674e6125a48826ded6d19f90b071b1bb0b8ea906f24c2a7609696b2eceea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): internal/css_printer/css_printer.go:999-1008 | internal/js_printer/js_printer.go:808-815 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_printer/css_printer.go"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1ddbc6e401c2bbdbddebab9f9b1f45c0888c611bf213fabc9ddb8c419a39d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): internal/js_lexer/js_lexer.go:883-911 | internal/js_lexer/js_lexer.go:1300-1328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_lexer/js_lexer.go"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"8938db6abe83c68bae46f57152d87e2997bd4e43724d01cffc8361d70d7e36ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201327 lines \u00D7 2): internal/js_parser/ts_parser.go:1498-1507 | internal/js_parser/ts_parser.go:1780-1806 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/ts_parser.go:1780\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/ts_parser.go"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbaa78f073d9cf6154c36fd740c84261b0d34e2a64303eb3f6bdd9edfa87e1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): internal/linker/linker.go:5754-5779 | internal/linker/linker.go:6319-6343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/linker/linker.go:5754\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":5754}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d581b00a2aeb5f56891b4ac0617a670179da35802a36a02fe605b22e4d7234f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): internal/js_parser/js_parser.go:5829-5852 | internal/js_parser/js_parser.go:5959-5982 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:5829\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":5829}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7ece844bee99d5b37bb1473dca008160475f2b5dbeb88c3eb7a427e5e58f1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): internal/js_printer/js_printer.go:4268-4291 | internal/js_printer/js_printer.go:4315-4338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_printer/js_printer.go:4268\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":4268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77b5d7e2bf9f8445e9c47fd5ce3557d729922efad8e5beed7504d3fe200d2b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): internal/resolver/package_json.go:125-147 | internal/resolver/package_json.go:156-178 \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":"internal/resolver/package_json.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c8a94dddb4f167b87fbaeae3f26ec65175d56ba686a61471b7cc2c9c0f0618"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): cmd/esbuild/service.go:1011-1032 | cmd/esbuild/service.go:1100-1121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cmd/esbuild/service.go:1011\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060cmd/esbuild/service.go:1010\u0060 calls \u0060resolveKindToString\u0060 and \u0060cmd/esbuild/service.go:1099\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/esbuild/service.go"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9f8248c012c0d964544d9f1c93c1bc40763b34308fe4b38bae8dd3f1af4135"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): internal/bundler/bundler.go:1086-1107 | internal/bundler/bundler.go:1204-1225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/bundler/bundler.go:1086\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"51887612603af2d8e906a7cb10d810df4ca089578a7e6990c9cbcadca42a76f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): internal/css_parser/css_decls_color.go:505-527 | internal/css_parser/css_decls_color.go:543-565 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/css_parser/css_decls_color.go:505\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_color.go"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6787be0e7d641343c800833edf970ff3a71a77d0c9af49f99ef558993deb4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): internal/js_parser/js_parser.go:4307-4327 | internal/js_parser/js_parser.go:4418-4437 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:4307\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":4307}}}],"partialFingerprints":{"codehealthFindingId/v1":"457d1a8f48dca3d2cc68fd2927c469d046d06eb55ea8c083fdaa672cbf555c2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): internal/js_parser/js_parser.go:14360-14379 | internal/js_parser/js_parser.go:14533-14552 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:14360\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":14360}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c265eaf781fc291871a032d23c20ca2c00a7d0cec2324f69a376caebc00a6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): cmd/esbuild/service.go:1052-1070 | cmd/esbuild/service.go:1136-1154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cmd/esbuild/service.go:1052\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/esbuild/service.go"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfeca335584b8e27d7139406793002d87dfd5727ed3843e6a8c230db8d758ecc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): internal/js_printer/js_printer.go:583-601 | internal/js_printer/js_printer.go:2815-2833 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_printer/js_printer.go:583\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"859f4f4e81425afebd7359d74a83f976ef9b09186c308bfc980cbc58b8b7d302"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): internal/js_printer/js_printer.go:643-661 | internal/js_printer/js_printer.go:2870-2888 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_printer/js_printer.go:643\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fa04cebb36b510b4df823645a2bede7c836ec775389396eb35a420dcd0cb4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): internal/js_parser/js_parser.go:4350-4367 | internal/js_parser/js_parser.go:4489-4506 \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":"internal/js_parser/js_parser.go"},"region":{"startLine":4350}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec26189532277bd12ab6dd078203cf579063d2eec090fa72f2a9ee4356e07168"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): internal/js_parser/js_parser.go:6072-6089 | internal/js_parser/js_parser.go:6122-6139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:6072\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":6072}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03d4667ba9d5e24f911a961e09627d326057bd00970d7b15c6b32cdb707a7e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): internal/js_parser/js_parser.go:14301-14318 | internal/js_parser/js_parser.go:14438-14455 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:14301\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":14301}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea25fb25dd1749d944a9e3251e022adc02f0688532c2e69615cb314bdd23c10c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): internal/js_parser/js_parser.go:4371-4386 | internal/js_parser/js_parser.go:4398-4413 | internal/js_parser/js_parser.go:4510-4525 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":4371}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d29f7793a1bafc77eeafb3dd3d685478b92150c894987feb5be2b2b359aee7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): internal/js_parser/js_parser_lower_class.go:260-275 | internal/js_parser/js_parser_lower_class.go:285-300 | internal/js_parser/js_parser_lower_class.go:312-327 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2894d628841f45eae5a0d788649c44ae164e1ba2178aac0e681629ddcc099d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): internal/js_parser/js_parser.go:3881-3896 | internal/js_parser/js_parser.go:3950-3965 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:3881\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":3881}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b5f3dbe19f8e76d3fb44591a265492a8c2bbf477383954ab9e20bbb8c43716"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): internal/js_parser/js_parser.go:16934-16949 | internal/js_parser/js_parser.go:17010-17025 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:16934\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":16934}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d37184ac5469b3d540293070e0dc70cae6b93866b8ba8de728080700793e94c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): internal/js_parser/ts_parser.go:116-131 | internal/js_parser/ts_parser.go:439-450 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/ts_parser.go:116\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/ts_parser.go"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7a8e87ece76e123d9f6bdc640dede23317dcfaa82548fe5cd448c89a949759"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): internal/js_printer/js_printer.go:1686-1701 | internal/js_printer/js_printer.go:2305-2320 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_printer/js_printer.go:1686\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":1686}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03dde7f79c21541d7009e5b1aebab3ca2ca43d2a3b449723148ed6f1a14a74a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): internal/css_parser/css_parser.go:1630-1644 | internal/css_parser/css_parser.go:1739-1753 \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":"internal/css_parser/css_parser.go"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bb6133f993de5b2e507e1358a438c76e9d9b947bc2ce694b6f91181f5f5317"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): internal/js_printer/js_printer.go:2772-2786 | internal/js_printer/js_printer.go:4214-4228 \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":"internal/js_printer/js_printer.go"},"region":{"startLine":2772}}}],"partialFingerprints":{"codehealthFindingId/v1":"2464aaabcbdd9de37d38ea22108b15a9068e0dbe3afd2628a7bf76a446811a99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): internal/resolver/yarnpnp.go:630-650 | internal/resolver/yarnpnp.go:656-677 \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":"internal/resolver/yarnpnp.go"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"90523108561e5c3a81fe010c79762a21cb96dfe71ea84253d3c31c3f057c80d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): internal/js_printer/js_printer.go:3828-3841 | internal/js_printer/js_printer.go:4403-4416 | internal/js_printer/js_printer.go:4498-4511 | internal/js_printer/js_printer.go:4650-4663 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":3828}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5104bb34f5a5771495ed61e7c701e11cb7df4dbe3cd63d317044ad5c8977b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/css_parser/css_decls_color.go:583-596 | internal/css_parser/css_decls_color.go:677-690 \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":"internal/css_parser/css_decls_color.go"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbba966d0d211161de8ae6e661b195298ac24004ad8a88475a8d9a0aaa225c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/css_parser/css_nesting.go:299-312 | internal/css_parser/css_nesting.go:322-335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_nesting.go"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7f6b60eda0fec0557079c116defc0c901a7ea8d75349ca44f2c8652e686b05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/css_printer/css_printer.go:984-997 | internal/js_printer/js_printer.go:793-806 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/css_printer/css_printer.go:984\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_printer/css_printer.go"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bfd75254e8445e4d52c0a8ed47f1bdc0801b6d8c8247efa6fab8c14f05830b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/js_ast/js_ident.go:78-91 | internal/js_ast/js_ident.go:106-119 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_ast/js_ident.go:78\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ident.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2bf1cada416613608f2da58ee1cca33bbc0683c6b5de7262f5d9db27ea1a15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/js_parser/js_parser.go:14286-14299 | internal/js_parser/js_parser.go:14419-14432 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:14286\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":14286}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66146b89fe8d4e7c0acab37bb1d5a1a2000f93d41b10137e826d5f9d0f59d26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/js_parser/js_parser.go:16170-16183 | internal/js_parser/js_parser.go:16214-16227 \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":"internal/js_parser/js_parser.go"},"region":{"startLine":16170}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f543ee5480f2800a3aa41170be98563a59db6dd07da5ffe84bce6795884e89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/js_parser/ts_parser.go:1705-1718 | internal/js_parser/ts_parser.go:1721-1734 \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":"internal/js_parser/ts_parser.go"},"region":{"startLine":1705}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc69a44fde6f9229eaefed0b09023f08b823438e445b33479b786d922e4b044"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): internal/js_printer/js_printer.go:2437-2450 | internal/js_printer/js_printer.go:2473-2485 \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":"internal/js_printer/js_printer.go"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6a74e976c61ded3bd1d275d5ee922e24d82b6f6082403bc0e734885cafe5b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/js_printer/js_printer.go:4298-4311 | internal/js_printer/js_printer.go:4345-4358 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_printer/js_printer.go:4298\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":4298}}}],"partialFingerprints":{"codehealthFindingId/v1":"faaae9b6985bba41cefe0d3b8c31e7fadf0761b256576f8fbba06a30afa41483"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): internal/css_parser/css_nesting.go:292-304 | internal/css_parser/css_nesting.go:315-327 | internal/css_parser/css_nesting.go:339-351 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_nesting.go"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"e381ba5de79f2e32a91784e0bafa007619970920bd98b009ecb4219267a07b3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): cmd/esbuild/service.go:324-336 | cmd/esbuild/service.go:361-373 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cmd/esbuild/service.go:324\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/esbuild/service.go"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e62a68926c52e4a9406c924b8a810373453456b9c900937a4b3143ed1fd9f30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): internal/js_ast/js_ident.go:156-168 | internal/js_ast/js_ident.go:197-209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_ast/js_ident.go:156\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ident.go"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fcaaeedd175400e845312f1cecc57388b254171896d4e3d655a92373111a94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pkg/api/api_impl.go:1279-1291 | pkg/api/api_impl.go:1747-1759 \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":"pkg/api/api_impl.go"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0036554ccbc2d24929200d053877f669122a2099be92e0dec366ab1f565800f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): internal/js_parser/js_parser.go:2970-2981 | internal/js_parser/ts_parser.go:896-907 | internal/js_parser/ts_parser.go:1002-1013 | internal/js_parser/ts_parser.go:1025-1036 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":2970}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4bc439ed798faa27fbd384fcdff1ca93d84d9516b73c974c7568f05408e565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cmd/esbuild/service.go:489-500 | cmd/esbuild/service.go:534-545 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cmd/esbuild/service.go:489\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/esbuild/service.go"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"2097e610c557cb3f19555123ee4540faa83c8bbb73ddd958b8977252e2adb05d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/bundler/bundler.go:1664-1675 | internal/bundler/bundler.go:1684-1695 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/bundler/bundler.go:1664\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cc0301a328c4e5346f940d9f58f56b52e8a94d4148c6f09992a9f4585d3c56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/js_parser/js_parser.go:5782-5793 | internal/js_parser/js_parser.go:5824-5835 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:5782\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/js_parser/js_parser.go:5820\u0060 calls \u0060ExpectedString\u0060 and \u0060internal/js_parser/js_parser.go:5779\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":5782}}}],"partialFingerprints":{"codehealthFindingId/v1":"f967170675b9424227844be15758ad6e780ea1e1130446241938e7da6745c130"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/js_parser/js_parser.go:10583-10594 | internal/js_parser/js_parser.go:11390-11401 \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":"internal/js_parser/js_parser.go"},"region":{"startLine":10583}}}],"partialFingerprints":{"codehealthFindingId/v1":"85842216915a2c488e3f17404980f263243737ff8b440398e9134d5468bc376b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): internal/js_parser/js_parser.go:12352-12363 | internal/js_parser/js_parser.go:14919-14929 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:12352\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":12352}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36efc8a72f1f81ae70110403f0df1f67a30b3373dec9285f7abbd2ee925e4bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/js_printer/js_printer.go:1223-1234 | internal/js_printer/js_printer.go:1265-1276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_printer/js_printer.go:1223\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4903a2f42bd68ae2a327373dcf35e9acc573c18dd291698ea9b123c4d3d341"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/js_printer/js_printer.go:2424-2435 | internal/js_printer/js_printer.go:2823-2834 \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":"internal/js_printer/js_printer.go"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"381d8b9edde8cee77d40480e30bf75c8907f6a3470f0c25477f65d36c8294eae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/js_printer/js_printer.go:4327-4338 | internal/js_printer/js_printer.go:4746-4757 \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":"internal/js_printer/js_printer.go"},"region":{"startLine":4327}}}],"partialFingerprints":{"codehealthFindingId/v1":"5873c84f87459c7ad27c2c1fc2b3d4bb206cbe61165b27e79a2e3d5a54e6f939"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/linker/linker.go:2448-2459 | internal/linker/linker.go:2484-2495 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/linker/linker.go:2448\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":2448}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f8a86c9196a919a7fd5aa91eab6583384297abcacad3c271997dafa06fa3c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pkg/cli/cli_impl.go:1289-1300 | pkg/cli/cli_impl.go:1335-1346 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/cli/cli_impl.go:1289\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/cli/cli_impl.go"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"66068d2be737095990bd6de773c833dad2951ee03b60eab200f6a93f467196dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): internal/cache/cache_ast.go:44-54 | internal/cache/cache_ast.go:155-164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/cache/cache_ast.go:44\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cache/cache_ast.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e44eb4faaf1438975b59277cbb4ee03ce138f003906bbfeda586a23d03506a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/css_parser/css_reduce_calc.go:123-133 | internal/css_parser/css_reduce_calc.go:140-150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/css_parser/css_reduce_calc.go:123\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_reduce_calc.go"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a8592d26ca9fa9363e2f4e714d5fcb036fe45de3cdb233cf34fd15ea91f7eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/css_printer/css_printer.go:109-119 | internal/js_printer/js_printer.go:4111-4121 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/css_printer/css_printer.go:109\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_printer/css_printer.go"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fd2e4ddad1ac87d982639121daab1e6d0a0a0e52cdec8dfb8213b8b1ae9832"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/js_ast/js_ast_helpers.go:2941-2951 | internal/js_ast/js_ast_helpers.go:2954-2964 \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":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":2941}}}],"partialFingerprints":{"codehealthFindingId/v1":"e995cb5bf5e3cd499be39ed131977c6b6ca418483a0305e57e3cfc1f8db9a965"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/js_lexer/js_lexer.go:2602-2612 | internal/js_lexer/js_lexer.go:2620-2630 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_lexer/js_lexer.go:2602\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_lexer/js_lexer.go"},"region":{"startLine":2602}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb637594992aa95d58df392f4ec964585fd19307d30ed890bb91df921befa289"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/js_parser/js_parser.go:3094-3104 | internal/js_parser/js_parser.go:6759-6769 \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":"internal/js_parser/js_parser.go"},"region":{"startLine":3094}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc842961676d8cc43d7bcd100ffc78d7743edb7cf2fd75409b39ccd8ca385ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/js_parser/js_parser.go:3553-3563 | internal/js_parser/json_parser.go:40-50 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:3553\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":3553}}}],"partialFingerprints":{"codehealthFindingId/v1":"181efc77957e5a0cc377bce3c497b8549db2c6d042751143b746258e8e37fc6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/js_parser/js_parser.go:16307-16317 | internal/js_parser/js_parser.go:16354-16364 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:16307\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":16307}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b4b69b58f6d40e6042bd622e3066f6c6ee1d05f971d2e99328060c99f8b149"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/js_printer/js_printer.go:1191-1201 | internal/js_printer/js_printer.go:1326-1336 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_printer/js_printer.go:1191\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_printer/js_printer.go"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca04f5dd13686725487dcc15b2f9cd15a76b4c75a39ad4d109a4187192786de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201311 lines \u00D7 3): internal/linker/linker.go:4403-4413 | internal/linker/linker.go:4428-4429 | internal/linker/linker.go:4448-4458 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/linker/linker.go:4403\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":4403}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfd5b2d81d6e7dc030242fb6b5be9926ab4a611a6dee174dcc11c59f31af1b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cmd/esbuild/service.go:993-1002 | cmd/esbuild/service.go:1084-1093 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cmd/esbuild/service.go:993\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/esbuild/service.go"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1368dfcbbb3c424b07a3fab6f328e8c1d22f8b9f677bdcf3ec79c8daab0164"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): internal/bundler/bundler.go:392-400 | internal/bundler/bundler.go:408-417 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/bundler/bundler.go:408\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"d711a79d09120d445fabe26a3e340ed43b55050567460d67d00cdd1a4d4e7015"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/js_ast/js_ast_helpers.go:815-824 | internal/js_ast/js_ast_helpers.go:876-885 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fbfd76e26099ab65da11ed83d6db4be6465ed15d861158acda0839108e2361"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/js_lexer/js_lexer.go:1859-1868 | internal/js_lexer/js_lexer.go:1978-1987 \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":"internal/js_lexer/js_lexer.go"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbaea6e295eea3769e55df741d6de67af977067b4c81ce327447175f4637280"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/linker/linker.go:826-835 | internal/linker/linker.go:863-872 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/linker/linker.go:826\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7d0c595351cef1e14615aae7e69e858ff3b2a3d757963f8ac798d881626a66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/linker/linker.go:1327-1337 | internal/linker/linker.go:1384-1394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/linker/linker.go:1327\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a6c6da3ccc7d5d2a43ad3c2f46e80564a544e54c820973df02080f870ee8c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/linker/linker.go:5957-5966 | internal/linker/linker.go:6435-6444 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/linker/linker.go:5957\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":5957}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4b75eb172054a869b9b11ed39840abc29925fcfcc99a5bbcb7ff4fd9beafa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/resolver/package_json.go:263-272 | internal/resolver/resolver.go:1226-1235 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/package_json.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1833d2c7800d7feca3a2480ff599cb445d7d69daceae4be4d98c8b7ee40c107"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): internal/css_parser/css_decls_color.go:505-513 | internal/css_parser/css_decls_color.go:543-551 | internal/css_parser/css_decls_color.go:583-591 | internal/css_parser/css_decls_color.go:677-685 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/css_parser/css_decls_color.go:505\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_color.go"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7c27089b7431d3fbf506d03fee3f30b1f8c3f79d6e9beccbb4e4ed7d9ce858"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): internal/js_ast/js_ident.go:137-145 | internal/js_ast/js_ident.go:155-163 | internal/js_ast/js_ident.go:178-186 | internal/js_ast/js_ident.go:196-204 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_ast/js_ident.go:137\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ident.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5a5c4e095be5f4f0d73b0a11e7fe00bc9458be52d69d60029489981d3ea351"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/js_lexer/js_lexer.go:1656-1664 | internal/js_lexer/js_lexer.go:1669-1677 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_lexer/js_lexer.go:1656\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_lexer/js_lexer.go"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81de7641f56f1aed7e13dbc5740a372aa7cd2df08e4304e15246495cad0b38f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): internal/js_parser/js_parser.go:4911-4925 | internal/js_parser/js_parser.go:4936-4951 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:4911\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":4911}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf12a8f14522354f51b707eafd278a2c7f814e560e67d730dc5d6984e5f62f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): internal/js_parser/js_parser.go:7705-7711 | internal/js_parser/js_parser.go:7750-7758 \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":"internal/js_parser/js_parser.go"},"region":{"startLine":7705}}}],"partialFingerprints":{"codehealthFindingId/v1":"85064b575bed7feab33f4ad6ab21eebff409da34ac5d26acfd8554f34014c443"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/js_printer/js_printer.go:634-642 | internal/js_printer/js_printer.go:2856-2864 \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":"internal/js_printer/js_printer.go"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24e6df213d3b46eed0e5455a8739f424ddb92218cfbb80c4fa5cf6ac3f552ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/linker/linker.go:4825-4834 | internal/linker/linker.go:4897-4906 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/linker/linker.go:4825\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":4825}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb3ffd42938cfdf5aeac77012f75e608e00af4d48f3cfe43de2452e4a56ef38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/linker/linker.go:5991-5999 | internal/linker/linker.go:6466-6474 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/linker/linker.go:5991\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":5991}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed6a41fa4e227a3328f2c3c2b88bdba4e55f0f4ca7b988ddf563d10c10aca37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): internal/linker/linker.go:828-835 | internal/linker/linker.go:865-872 | internal/linker/linker.go:6716-6723 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"3634ed685ccfda20bbff994daec04fe0483f2be362e11220845ca03fcdd928a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): pkg/api/serve_other.go:247-254 | pkg/api/serve_other.go:300-307 | pkg/api/serve_other.go:314-321 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/api/serve_other.go:247\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/api/serve_other.go"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9ecb241750f4f1e05f378779344b3b002b9a0f19860020efccefb6fb1159b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cmd/esbuild/service.go:1381-1388 | cmd/esbuild/service.go:1425-1432 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cmd/esbuild/service.go:1381\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/esbuild/service.go"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42b66324e2fc83e0dc13e1d0ee5d3beda1f82dbdd157b727ead009b42c335d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/bundler/bundler.go:2471-2478 | internal/bundler/bundler.go:2509-2516 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/bundler/bundler.go:2471\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":2471}}}],"partialFingerprints":{"codehealthFindingId/v1":"deccd92e90b6d77cd5ec1ecdaac75a00baaf47966be37054380e2bf378c97c29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/js_parser/js_parser.go:5069-5076 | internal/js_parser/js_parser.go:5096-5103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:5069\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":5069}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9899c45d23d4ea42864d5cb31153e1c6b5a30b058098e1c096a8e06883a4ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/js_printer/js_printer.go:671-678 | internal/js_printer/js_printer.go:1165-1172 \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":"internal/js_printer/js_printer.go"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f2cf20b609c5c6f00166ca61dc378d4a37745ba4b8f56d2fc3b717a9169306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/js_printer/js_printer.go:2801-2808 | internal/js_printer/js_printer.go:4233-4240 \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":"internal/js_printer/js_printer.go"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c55dc2446da81e6aa384e14bb5b11ebffcca03bd7629e57ab1d3b8e59e583e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/linker/linker.go:2279-2286 | internal/linker/linker.go:5190-5197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/linker/linker.go:2279\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":2279}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6003e87e66813af0bd9a63b44b45f720326edee49f5991ea92872d52cffa71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pkg/api/api_impl.go:1295-1303 | pkg/api/api_impl.go:1765-1773 \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":"pkg/api/api_impl.go"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e444d04ef87030e7f1e1673673de0e08956f906ff73449b533ba474cf392a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): internal/bundler/bundler.go:339-345 | internal/bundler/bundler.go:353-359 | internal/bundler/bundler.go:376-382 | internal/bundler/bundler.go:394-400 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060internal/bundler/bundler.go:348\u0060 calls \u0060guessMimeType\u0060 and \u0060internal/bundler/bundler.go:362\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd90829a0912b22fa0e63b5fd36b856a7c96e9e7e8e5a2a7ddad59220b385ea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): internal/css_parser/css_color_spaces.go:83-89 | internal/css_parser/css_color_spaces.go:109-115 | internal/css_parser/css_color_spaces.go:183-189 | internal/css_parser/css_color_spaces.go:227-233 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_color_spaces.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a5b864fabc84a460f508e21b695c12b9c772566ce25b5648713369f3529261"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): pkg/api/serve_other.go:276-282 | pkg/api/serve_other.go:301-307 | pkg/api/serve_other.go:315-321 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pkg/api/serve_other.go:276\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/api/serve_other.go"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e61b3968b812ee6600de3d3405a131e108205140c42693adcdcee4501ea108"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cmd/esbuild/service.go:984-990 | cmd/esbuild/service.go:1075-1081 \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":"cmd/esbuild/service.go"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa78c7329664f3bb1e7b01ac9ddda60cbf48923c86164993a0f7d7f8a05d9d2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/css_parser/css_decls_color.go:566-572 | internal/css_parser/css_decls_color.go:594-600 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/css_parser/css_decls_color.go:566\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_color.go"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71c12b6543ab92cdc87fca0a7b291bec7c6861464dee6c0bb985bf4d12a603b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/css_parser/css_nesting.go:419-425 | internal/css_parser/css_parser_selector.go:135-141 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/css_parser/css_nesting.go:419\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_nesting.go"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f87b6c90cebc6a688db423bfa8992159c174c8f3a7080710ec11aec0ca3dea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/css_printer/css_printer.go:95-101 | internal/js_printer/js_printer.go:3937-3943 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/css_printer/css_printer.go:95\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_printer/css_printer.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf3d7745a2739cc09c30ffa74d412c676e8a3372830a24a1d4db107669f317d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): internal/helpers/utf.go:50-58 | internal/helpers/utf.go:99-107 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/helpers/utf.go:50\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/helpers/utf.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a7e019e9f4273b1753a3f8004b8372fc9d8e29f7cfdc5766def0929f792e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/js_lexer/js_lexer.go:2124-2132 | internal/js_lexer/js_lexer.go:2423-2429 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_lexer/js_lexer.go:2124\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_lexer/js_lexer.go"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee2e9b62c9ee14a35506f45ccf39bd94e3ba46acad62b2b56aebdc7864b0497"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/js_lexer/js_lexer.go:2307-2313 | internal/js_lexer/js_lexer.go:2373-2379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_lexer/js_lexer.go:2307\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_lexer/js_lexer.go"},"region":{"startLine":2307}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1bbe74850825f696714c08f4b2fdcfdc3739447f3f2da229c4b40cf41fd6de3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/js_parser/js_parser.go:2192-2198 | internal/js_parser/js_parser.go:2759-2765 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:2192\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":2192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50ba908a6f566e9db4389cdf2c9744fbb8af8cdec6654a4555079066ee50ce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/js_parser/js_parser.go:2346-2352 | internal/js_parser/js_parser.go:2361-2387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:2346\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":2346}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d269fb3a858c6528a4dc8cd86baec2311cacdc34008a7eb755fd3baf7c5f6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/js_parser/js_parser.go:7975-7981 | internal/js_parser/js_parser.go:8013-8019 \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":"internal/js_parser/js_parser.go"},"region":{"startLine":7975}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbb6c6f7776574a9432aa7860cf30e4153003af44a57fed286ee7789aee8756"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/js_parser/js_parser.go:15155-15161 | internal/js_parser/js_parser.go:15747-15753 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:15155\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":15155}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9dbb0b0e89b5af1b10781fd97e75eab12086c98a102bc9043d565084dea83b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/js_printer/js_printer.go:4833-4839 | internal/js_printer/js_printer.go:4846-4852 \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":"internal/js_printer/js_printer.go"},"region":{"startLine":4833}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed6989cfb8df6084e859bcdefcdae3a9649eb20f8e7a2dc9510c5a733fe9a8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/resolver/resolver.go:1876-1882 | internal/resolver/resolver.go:2005-2011 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/resolver/resolver.go:1876\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/resolver.go"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"140c761d6689d753129772b06b4c1fb60288f911a49c70e25f753e43089ee027"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/bundler/bundler.go:1761-1767 | internal/bundler/bundler.go:1881-1887 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/bundler/bundler.go:1761\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0fdd465f1fc4699c868022073e754af723aab7258f65467c57fabb7a86f8909"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/js_parser/js_parser.go:4272-4277 | internal/js_parser/js_parser.go:4584-4589 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:4272\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":4272}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f92dc327a69cabafd469961fb0b8a46d7eb5927a95ea4f2d3e0c9a12525db6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/js_parser/js_parser.go:9317-9323 | internal/js_parser/js_parser.go:9327-9333 \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":"internal/js_parser/js_parser.go"},"region":{"startLine":9317}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40c4385d66ac4b05eb37b5bdd911681c25012cd56dce3dded18c5f6e3d6a89a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/js_parser/js_parser.go:12799-12804 | internal/js_parser/js_parser.go:13753-13758 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:12799\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":12799}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccf7a424264b6559444f75a6ee5becc376aa72562de090cd2d271d037a4f217"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/js_parser/js_parser.go:15538-15543 | internal/js_parser/js_parser.go:15756-15761 \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":"internal/js_parser/js_parser.go"},"region":{"startLine":15538}}}],"partialFingerprints":{"codehealthFindingId/v1":"010172ff39c6e24e5ff9309435d8c61ff43bd72bc58c03a3794b6aa5a0927a61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/js_printer/js_printer.go:3845-3851 | internal/js_printer/js_printer.go:4587-4593 \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":"internal/js_printer/js_printer.go"},"region":{"startLine":3845}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ddcfc462c26ec132a24a126cd5b44dd6254b742a9a6f08d605d7c4b0835260"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/linker/linker.go:2388-2394 | internal/linker/linker.go:5052-5057 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/linker/linker.go:2388\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":2388}}}],"partialFingerprints":{"codehealthFindingId/v1":"803ae50edca3bfcefe18773f408d1a8e9e6f5554e0bb3d1581aee195f3fb7db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/resolver/resolver.go:2803-2809 | internal/resolver/resolver.go:2820-2826 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/resolver/resolver.go:2803\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/resolver.go"},"region":{"startLine":2803}}}],"partialFingerprints":{"codehealthFindingId/v1":"848836bc5cc8af1eec3c2595b3754217f8e5e4a2414ccf6dda5e3bf3a0bf155d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): internal/bundler/bundler.go:269-274 | internal/bundler/bundler.go:278-283 | internal/bundler/bundler.go:288-293 | internal/bundler/bundler.go:298-303 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"6381254ae541e2642a95f988d533c8ba9ccac6bfff67817cbb8d33708c108019"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): internal/js_ast/js_ast_helpers.go:1168-1172 | internal/js_ast/js_ast_helpers.go:1182-1186 | internal/js_ast/js_ast_helpers.go:1191-1195 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060internal/js_ast/js_ast_helpers.go:1175\u0060 calls \u0060extractStringValues\u0060 and \u0060internal/js_ast/js_ast_helpers.go:1188\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_ast/js_ast_helpers.go"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef2c85016fb53fbdea354833ba9ba3648e6f1529b8ff78356d9b9dec36aa26e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/css_parser/css_parser.go:1727-1731 | internal/css_parser/css_parser.go:1759-1763 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/css_parser/css_parser.go:1727\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_parser.go"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5668af70581182ab3723596a569cc703c955fedd9b31fbf98b9ac3edabf70bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/css_parser/css_reduce_calc.go:539-543 | internal/css_parser/css_reduce_calc.go:579-583 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/css_parser/css_reduce_calc.go:539\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_reduce_calc.go"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"850ed4cb10a5d5064ece5d7af22d3d6958d4fe9069cc9ac6a7d6d2a34747a780"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/js_lexer/js_lexer.go:2303-2307 | internal/js_lexer/js_lexer.go:2337-2342 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_lexer/js_lexer.go:2303\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_lexer/js_lexer.go"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca8392cde439737eeb26b139cc17ad9b9ea5c7bbb4417320c319a3cffe9500f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): internal/js_parser/js_parser.go:2441-2445 | internal/js_parser/js_parser.go:2795-2799 | internal/js_parser/js_parser.go:6969-6972 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":2441}}}],"partialFingerprints":{"codehealthFindingId/v1":"950096af77a9291dd95987727e34f30c38e4c0f1d059bec5898cc47f26016c0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/js_parser/js_parser.go:5746-5756 | internal/js_parser/js_parser.go:5881-5885 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:5746\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060internal/js_parser/js_parser.go:5879\u0060 calls \u0060Loc\u0060 and \u0060internal/js_parser/js_parser.go:5745\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":5746}}}],"partialFingerprints":{"codehealthFindingId/v1":"821714f28cc517d3a7797eaf85e602307596f072004fabe4e6fb5643c6136776"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/js_parser/js_parser.go:7530-7534 | internal/js_parser/js_parser.go:7561-7565 \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":"internal/js_parser/js_parser.go"},"region":{"startLine":7530}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc84de6c6f2857d715c59fbcd7cbac17792dfa8d08ff15b84413139bc1fcca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/js_parser/js_parser.go:9591-9595 | internal/js_parser/js_parser.go:9648-9653 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:9591\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":9591}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0afe9d8f09bba710a0f6f1196800fdb838eb5cafd1ed7d073cd37525f14f2d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/js_parser/js_parser.go:9606-9610 | internal/js_parser/js_parser.go:9662-9666 \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":"internal/js_parser/js_parser.go"},"region":{"startLine":9606}}}],"partialFingerprints":{"codehealthFindingId/v1":"542f9db62bcfb570be82a4cbf918f0a51964a0b94c410b916e0151d5ae75467f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): internal/js_parser/js_parser.go:14838-14844 | internal/js_parser/js_parser.go:14877-14884 \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":"internal/js_parser/js_parser.go"},"region":{"startLine":14838}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d790e9e6c2f16199c3a559a35873a613ba1f0df74813fe40602e0442b0e760"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/js_parser/js_parser_lower_class.go:2319-2323 | internal/js_parser/js_parser_lower_class.go:2365-2369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser_lower_class.go:2319\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":2319}}}],"partialFingerprints":{"codehealthFindingId/v1":"944316320aec835ab22ea8e7c6a84e67244f133d54c974c14bc7566bad7e6485"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/js_parser/ts_parser.go:1924-1931 | internal/js_parser/ts_parser.go:2034-2041 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/ts_parser.go:1924\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/ts_parser.go"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"420f2329bd11c90bf936ba9ad9da72044b01843add97dcff6da7aac22397e333"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/compat/compat.go:129-134 | internal/fs/fs_mock.go:233-238 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/compat/compat.go"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"99040be1e2c81e127c872518a216631baabc42668078d7ce5c8cd0e0f92e7188"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/resolver/resolver.go:369-379 | internal/resolver/resolver.go:581-592 \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":"internal/resolver/resolver.go"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ebdcdc6293a3c1e26ba0642e706feb90535a6d336dd440f1f78eca6459ccf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/css_parser/css_decls_color.go:700-707 | internal/css_parser/css_decls_color.go:713-720 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/css_parser/css_decls_color.go:700\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_color.go"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"860ebe8dbe5cdece911fefae9ef7733ef6da6abfcd0d0639053ad475766e2bf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): internal/css_parser/css_decls_color.go:702-708 | internal/css_parser/css_decls_color.go:715-721 | internal/css_parser/css_decls_color.go:726-732 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/css_parser/css_decls_color.go:702\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_color.go"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c01c9ed87062aad79d3d25c401566ad1f6bffe5991566f5006890021ad8e3f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/resolver/resolver.go:1302-1307 | internal/resolver/resolver.go:1308-1313 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/resolver/resolver.go:1302\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/resolver/resolver.go"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1b09b627feb9c08bce605ce7c7757788ddf248c21014edfd6dc1c3f53991be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/css_parser/css_decls_color.go:236-241 | internal/css_parser/css_reduce_calc.go:80-85 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_color.go"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f0b2542e29d9cd5d1bad5bac791fb4b648972bcc15442e6091c75e2b97d587"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/bundler/bundler.go:2549-2553 | internal/bundler/bundler.go:2561-2565 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/bundler/bundler.go:2549\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67e5105bbc31c2d277b3eb933fad14bf1b3fdbb13fba56ae61db0edc6a3d2d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/linker/linker.go:6028-6032 | internal/linker/linker.go:6070-6074 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/linker/linker.go:6028\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":6028}}}],"partialFingerprints":{"codehealthFindingId/v1":"5592fd2938a37c2d819195b62f6bb6d9d8b8dde08735f9a1cca1f4ff9b62aa41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/js_parser/js_parser_lower.go:1158-1162 | internal/js_parser/js_parser_lower.go:1166-1170 \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":"internal/js_parser/js_parser_lower.go"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7eacd3e731cd4fefe66458108859c34d38fa382cbed8ec0998c9cabcfd92f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): internal/bundler/bundler.go:2549-2553 | internal/bundler/bundler.go:2561-2565 | internal/bundler/bundler.go:2584-2588 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/bundler/bundler.go:2549\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/bundler/bundler.go"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"c412b477895af005fc737f1ffb003063ac3180120e4368adfe63b640c040f29b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/js_parser/js_parser.go:10253-10258 | internal/js_parser/js_parser.go:10267-10272 \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":"internal/js_parser/js_parser.go"},"region":{"startLine":10253}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bdcb5e3d46a743cea6adc509f50e580fa1144be4c0d94374b6467b54ecedf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/js_parser/js_parser.go:12112-12116 | internal/js_parser/js_parser.go:12137-12141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:12112\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":12112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f662d62aefb70f721c6a78308cc9a8865ce492b4082e84658e2757c47af18b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/js_parser/js_parser.go:16300-16305 | internal/js_parser/js_parser.go:16347-16352 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/js_parser/js_parser.go:16300\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/js_parser.go"},"region":{"startLine":16300}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bbcf7f109799f11fc3e98113b2e84644dba00752a3ac57bef8cc4d741c7e37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): internal/js_parser/js_parser_lower_class.go:2495-2499 | internal/js_parser/js_parser_lower_class.go:2502-2506 \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":"internal/js_parser/js_parser_lower_class.go"},"region":{"startLine":2495}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c665f19aa9eaf33f68e799896b8ebf57cc3a2628fc1724d0a1abd6fb60c6d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/linker/linker.go:5030-5035 | internal/linker/linker.go:5061-5066 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/linker/linker.go:5030\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/linker/linker.go"},"region":{"startLine":5030}}}],"partialFingerprints":{"codehealthFindingId/v1":"97851ad3034e0b9433fec5aa3b9089dc32b5d09d510044babd5214c02f839430"}},{"ruleId":"D12","level":"warning","message":{"text":"Dependency pinned to a stale untagged commit: golang.org/x/sys: Direct dependency \u0060golang.org/x/sys\u0060 is required at \u0060v0.0.0-20220715151400-c0bba94af5f8\u0060 in go.mod \u2014 a pseudo-version, which pins an UNTAGGED commit from 2022-07-15, 4.3 years ago. The pin itself is exact, so this is not a reproducibility defect, and it is not a claim that the module is unmaintained. What it says is that this repository tracks no RELEASE of \u0060golang.org/x/sys\u0060 and has not moved this requirement in 4.3 years: every fix the module has published since that commit \u2014 including any security fix \u2014 is absent from this build, whether the module went quiet or moved on without you. Check whether \u0060golang.org/x/sys\u0060 now publishes tagged releases and move the requirement to one; if it publishes none, re-pin to a current commit."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"259a55e92598195865219566baaf2f45b712262390065fe82a486b7a6071f1d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/js_parser/js_parser.go: internal/js_parser/js_parser.go changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 169 in parser.parseSuffix at line 4264. 6 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-05-11..2026-08-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-11 13:17:12 -04:00\u0027 --until=\u00272026-08-09 13:17:12 -04:00\u0027 --full-history --no-merges -- internal/js_parser/js_parser.go\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":"internal/js_parser/js_parser.go"},"region":{"startLine":4264}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a72837b0cdd082332721d78acb81a370ed5178737075dc6635c7a03aae24ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/js_printer/js_printer.go: internal/js_printer/js_printer.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 377 in printer.printExpr at line 2005. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-05-11..2026-08-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-11 13:17:12 -04:00\u0027 --until=\u00272026-08-09 13:17:12 -04:00\u0027 --full-history --no-merges -- internal/js_printer/js_printer.go\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":"internal/js_printer/js_printer.go"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b33cfa00e04d686ab7eec64d6bc160d25e5a32a5929889285b6dac384bd30b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/api/serve_other.go: pkg/api/serve_other.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in apiHandler.ServeHTTP at line 105. 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-11..2026-08-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-11 13:17:12 -04:00\u0027 --until=\u00272026-08-09 13:17:12 -04:00\u0027 --full-history --no-merges -- pkg/api/serve_other.go\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":"pkg/api/serve_other.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f683a62e3bc9f2ebfdeecb18e12ab70e31224afc9f37036f9fee9623d4f7c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/bundler/bundler.go: internal/bundler/bundler.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in scanner.processScannedFiles at line 2361. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-05-11..2026-08-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-11 13:17:12 -04:00\u0027 --until=\u00272026-08-09 13:17:12 -04:00\u0027 --full-history --no-merges -- internal/bundler/bundler.go\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":"internal/bundler/bundler.go"},"region":{"startLine":2361}}}],"partialFingerprints":{"codehealthFindingId/v1":"571a366267156a5b9f56fa2bcc91bf87b0313ac9e4ff5391f825cdf0256c61e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pkg/api/api_impl.go: pkg/api/api_impl.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in api.validateFeatures at line 313. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-05-11..2026-08-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-11 13:17:12 -04:00\u0027 --until=\u00272026-08-09 13:17:12 -04:00\u0027 --full-history --no-merges -- pkg/api/api_impl.go\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":"pkg/api/api_impl.go"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"f739121297b468902244572f129ac15a9a621b698899a1f7d98b759776ff6028"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Go\u0027s HTTP API doesn\u0027t appear to provide a way to separate argument \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/api/serve_other.go"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7b2ac7b133156c0b7d1582a4c6116eb2fc6a245fdcab42443289fd4761ed5e"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // THIS IS A GROSS HACK. Some context: \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js_parser/ts_parser.go"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f15cca5a946f5aa696b57dec09bbacb5e6f12e0a9b4e37df19c3750c6ff82d"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack: Assume that we\u0027re on Windows if we\u0027re running WebAssembly and \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fs/iswin_wasm.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a86f6944593e8ed609ff7283149765d5eb0d03fd3ae5fba7041c9886abfea9c"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack: Create an empty \u0022identifier\u0022 to represent this \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_parser_selector.go"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9f6f4c61d400c25da4b618a238c901bba2dfc514ea26a1240891b1f043dbcb"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: the repository holds project manifests and neither \u0060README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33a5992d4bd6ac1ea4b853ae69753fcd7e0410099c58731c86be53325ba8c96"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060aix-ppc64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/aix-ppc64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/aix-ppc64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9296b331ef903ad0d95fbbf54498d48a678f4231f48bb000f1ce612eb3e4c183"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060android-arm\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/android-arm/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/android-arm/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"743b207b302fe9c3c38378cda8b2a2065f7c06ef7bb579d2d371c5d86d5ca833"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060android-arm64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/android-arm64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/android-arm64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"883e0cd82e27f9c54030da011cfc7e21905ff3a3a9350ec85e1be931e0eac688"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060android-x64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/android-x64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/android-x64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c9c630c29cf8867570e35777f86ee9b0c17555753c1461ad57c8707218174d"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060darwin-arm64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/darwin-arm64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/darwin-arm64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"070dd0bf31479252f8e2d615e1703b28036ae2ef371e21ea2c3a54beea3914ae"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060darwin-x64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/darwin-x64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/darwin-x64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74124f38e6e452548574a809d675f9b5c889414a7a353624728fd9150f40c2c1"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060freebsd-arm64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/freebsd-arm64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/freebsd-arm64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efa095c260934d427256877579292a55f180f1649321eeae916011bf4d94321"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060freebsd-x64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/freebsd-x64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/freebsd-x64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"902a7a161062a373bfc2b03f46708fde434c732149d0b98cd28ac46420135ddc"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060linux-arm\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/linux-arm/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/linux-arm/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45dd948cab50a0d44097877259d58e9843c55a5221d157652892899384fff669"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060linux-arm64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/linux-arm64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/linux-arm64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2b94c728331fba693971b419302a90c197ea607b6f723623b89a14f6822028"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060linux-ia32\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/linux-ia32/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/linux-ia32/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d874456e53588a8fa0b0b4f0217174616edc896003f12b7de1ee122efec6cab"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060linux-loong64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/linux-loong64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/linux-loong64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f3e09a82fe434c68780d1cb0438fd26844a9fe4ee507ee225b5d87709cb596"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060linux-mips64el\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/linux-mips64el/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/linux-mips64el/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b2096e8b26c754d5be32318713952649845c57352cb8ed7a83534fccb738d3"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060linux-ppc64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/linux-ppc64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/linux-ppc64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa33df648e4d710e9f7eba7e388a98e3a72beb393a7397f01bc331d0a7c7a396"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060linux-riscv64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/linux-riscv64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/linux-riscv64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca74283ccfe0425be8ae1d659cfd2f727854ca08b9b8814f30769d5bae8f6fb0"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060linux-s390x\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/linux-s390x/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/linux-s390x/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9914df1fb24d42584410d72cf7e893c5c5cc9c7addbef3c4b7659dbad954ef6"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060linux-x64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/linux-x64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/linux-x64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ba6198424c869db721992105c47fb0c67192482d96992b377e49cd5f30ae41"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060netbsd-arm64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/netbsd-arm64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/netbsd-arm64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1e618cca337938519438c34643de5cff70433bc9659979d7fe8d5d43945134"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060netbsd-x64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/netbsd-x64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/netbsd-x64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2fd3b1cd8846e159e3205f8573cff93c8fa3fc94905ae392567ff713d2b58e"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060openbsd-arm64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/openbsd-arm64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/openbsd-arm64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"070f6d246d7b4f4d0b317cff888074d2ad0a155a7e054c04821c78bb2625b41e"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060openbsd-x64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/openbsd-x64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/openbsd-x64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"500a04691383df0e15d0d58ae72b6778aae053a8ef1db2f74db9b99d8ab09c74"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060openharmony-arm64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/openharmony-arm64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/openharmony-arm64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a8675ae9774e8b7fa9736e47741f84599bd7ead88ab47091bf849da7d62e46"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060sunos-x64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/sunos-x64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/sunos-x64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56cae520b0a6a9c78b5615df9d4dd5366f99a7e3559e9fb1b62eb86d4b43478"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060wasi-preview1\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/wasi-preview1/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/wasi-preview1/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b1cb2d59b584f94e448e170da953acbb916393d6e792a3b4a29702b983ee7c"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060win32-arm64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/win32-arm64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/win32-arm64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6469ddf50501446196fabcbe5a51663d6b5ec1329b2cc476d53e1c39434b89cc"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060win32-ia32\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/win32-ia32/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/win32-ia32/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"489b11d94d76f17bef79bf96bd43f9b4c2f60ce54186c6e4a3b5fc1fc28dd9cb"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060win32-x64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/@esbuild/win32-x64/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/@esbuild/win32-x64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ee24a0c74cd250cec4b60692d4615f77d69acc7db2e810eec8a4fb6fda18ce"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060esbuild\u0060 is a command-line package (\u0060bin\u0060 in \u0060package.json\u0060) and neither \u0060npm/esbuild/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/esbuild/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1eef1d7e1446a8e2ef930b9d0bee49a7167e4ae3bc6a2b1e516b8ddfa1c4f7"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060esbuild-wasm\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060npm/esbuild-wasm/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/esbuild-wasm/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cb29d080c021717942fec38602bd07e76768346c51dd9029abe346af805135"}},{"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 \u0060cmd/esbuild/main.go\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/esbuild/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"807141269532713715f904cbf8f7a85eba1c30e80553396afecf1f04c5b33fd1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test the \u0022browser\u0022 field in \u0022package.json\u0022\u0022 repeats the code it sits on: 4 of its 5 words (test, browser, package, json) are already in \u0060tests.push(\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":"scripts/end-to-end-tests.js"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"dceaf709870bde229a1499fca9059d8df5c1dfaa5c708e85a0afa284bde24142"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test class accessors\u0022 repeats the code it sits on: 3 of its 3 words (test, class, accessors) are already in \u0060const classAccessorTest = \u0060\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":"scripts/end-to-end-tests.js"},"region":{"startLine":6591}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd81d52c435300c76e152ccccbd196cf70d83272ed300ffdd09e2de2da09ccde"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Generate \u0022npm/esbuild/install.js\u0022\u0022 repeats the code it sits on: 4 of its 5 words (npm, esbuild, install, js) are already in \u0060childProcess.execFileSync(esbuildPath, [\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":"scripts/esbuild.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e9d822e22ff7ee721a6ad5dc5858948a3ea2aedd48d7cb348cdd9a8f4974b9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Generate \u0022npm/esbuild/lib/main.js\u0022\u0022 repeats the code it sits on: 5 of its 6 words (npm, esbuild, lib, main, js) are already in \u0060childProcess.execFileSync(esbuildPath, [\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":"scripts/esbuild.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e8e63f860bd9516ce1029d2c2cf96f2339a3a42a894a36d02fba0d51a14af6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022UnicodeIDContinue: any Unicode code point with the Unicode property \u201CID_Continue\u201D\u0022 repeats the code it sits on: 6 of its 6 words (unicode, id, continue, code, point, property) are already in \u0060const idContinueESNext = require(\u0027@unicode/unicode-15.1.0/Binary_Property/ID_Continue/code-points\u0027)\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":"scripts/gen-unicode-table.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57d86a10b85cdb1855d6bf3b0d5645ac1d21ff891bffd16a75ab20ca81a3bc9"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 2 of 7 project(s) overshoot their size bounds, lowering Project Cohesion to 4.3/10. The most over is \u0060(repository root)\u0060 (82891 LoC, 469 module-visible types across 28 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"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":"27f312a32c89bc85bbc107b81e8cfe04881b739b28727ce0cbf248438c5ccacc"},"taxa":[{"id":"CWE-494","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":"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":"03efd88e8ac676e778db8e20764a224eb8cfe7d6227f7b647ec51f8a4f8d2438"},"taxa":[{"id":"CWE-494","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":"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":"9beaed88831530d89ed54c94d7b3802a0db46bfb33a6e798528f26fbc45e9070"},"taxa":[{"id":"CWE-494","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":"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":"7ec2b46823e36524b54f06283d79d4e7be2507014b84b981abc403fa394c081d"},"taxa":[{"id":"CWE-494","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":"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":"fb5512f2ad8a59ff793adedf361254c74d8e7ce8f483db83e5e81b413fb42605"},"taxa":[{"id":"CWE-494","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":"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":"eb0392d3f4647105cadeaa42c82bd928c25f5b04edf7b2e6d206eb3dc08a970d"},"taxa":[{"id":"CWE-494","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":"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":"0c5d0e3c539075d2b17273f689305d924959e1bbbc393d55e109b528f68bf991"},"taxa":[{"id":"CWE-494","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":"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":"56b26fdbac008a770e9945c17a24891f684ed065bbb97a5b4f79e6a3a851ffc6"},"taxa":[{"id":"CWE-78","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":"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":"17bfbf4fa2f139dad81404c04c54f5299409b73064e80d2e4f43c25673980af1"},"taxa":[{"id":"CWE-94","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":"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":"607ff9d7ce7435f0582554ae63c097836aa39c7578a536a99a979de610070f2b"},"taxa":[{"id":"CWE-94","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":"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":"cb522683eca452d690edf1e8651e4cb9171ec8f97a79d3eba6515a84592d4f56"},"taxa":[{"id":"CWE-94","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":"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":"c67f9853c9c86c7271abc6740b8984571f3eb1a977adc4a17535de4dbe57c7a5"},"taxa":[{"id":"CWE-94","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":"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":"eb0da0a1270dfdc0c33cda648944b394e9fe16f5d5f3e1db8e5d75851070f6e5"},"taxa":[{"id":"CWE-94","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":"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":"1f61952daf0071b0b6d30c31a829d73497ac5c5ea587d3439ea14a0de1042ff4"},"taxa":[{"id":"CWE-94","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":"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":"e8062d22998bc9756e346150ad3906f7d3f6699f26bc9c19ff50ebc67415903a"},"taxa":[{"id":"CWE-94","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":"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":"bcb10062ff124989d0ce52ef3007b87e5435dbb85f762d28271cc225bf7aa1b2"},"taxa":[{"id":"CWE-78","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":"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":"3191aec227238b04619e73cba881ee2ce7709b7549c53b8bf84a844e8de64f83"},"taxa":[{"id":"CWE-94","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":"95740b583969c78c7132f35629806263a32606dcd6d14eefa8ad5abaeaae0af3"},"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":"e0a6a76e357f79280fe1ed2631220f5ab2288335a7c53507bfa9e530ecbece13"},"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":"d23dc5356e24d6be3ee06ddd8f4da2d7886273b7810072ab4b5e4ec2b1f633c5"},"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":"802306358db31e73c4181258c4aeb10e440955e3d00a91a16283182f4041ac0d"},"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":"82e3d78a01404c987c7ad67e66d588b10bea8a9c0b5111c98d0864d5d4474b4e"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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-8","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":"7c318cf6a2a620cf459ecd556cfac276db2755fbbe5762e685c5f3257c16be7c"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"81d657bc744f61f1f2c3f00f62de2399ab57bf7e0c763cbc54d71630fbf32dc2"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"76e50e8bdefd8937b7ebcf5b04ed04ca1ca0dc0befb3a852961a6662377bce9d"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"c15e01463f6687da044e0f601e5cf032683123fc1f4dd9b77be4b49011590525"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"9733670f9b6053849b4b029e6ebc013168fd684d1e32b33deb4e2ca121ca9113"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"fed0343e83bb564bb1412b0d7c72c42433a6f4539780d8ea292a104eb54b70e0"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"5c4a6c069280ca4bb9e095be4e241ccf0750cd88f7a2e63777ea2bdb65d4f25b"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"0c06c7198e5994922e29c28a96afe79ac972eaf6756e3fdca0109aef15e04173"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"2b04a5915010219cc7dd6f1a78925891fa5ebeefc7c5953c57304812dfba358d"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"c821bfee51f0b7ae9667e25f8553a1b132024412dc2dc70e0df9d2132a0c16da"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"c7f581f67afcd60e9a1ef85fe729acca2b833830fa77e4e5c3b70010f970e2b4"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"d99386aa23c35767feed2eea0759694284f95409da3e71565eec9c9c064828d1"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"b6ddefe75f667a97bd1bce40ed81eec523f02865e61832c82eba77e8c48e3629"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"5753c964e9d50bfcddc0329ab71fa2ea940d859ebc9c3b06ca5d6084c85ed2cc"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"88bebba0d568afc4bcf9e906ad91af120048dff66d4ac4ef981e16fc056dec94"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"5fe76d5decbc5c55ebba89ea12ae6b63cb07ec8eb48ee6e05b25c02382dc3955"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"6a9222d401183a0de31a64ac6ec33d2ebf6c2e3a2cfab2b6e406486c4ae517de"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"a3160e48ae32b9c2bab646b7fb0371e8b59677e915168360f2fd547174719954"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"69b80a7bf1dd364750fe14deb05e90b3ea088e0eb8d68ed6c56ae6c39475e915"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"1a9925cf40dfbd9d4148feafd4e81d9f477328b9446641d8bcbe0cedb89c142c"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"810c024ead29c1c562d85c16777c05d45f15d768515c63df136e7250552494d3"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"be14b2362ea7518f9953830b36ef5b134ab645847c1741f8caa1d2758d6ea596"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"10dbfa5e1ce8749932ca188c47c57efa2370bdb227c71b249e9ebf9c12827d4f"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"bc4fd21ba5110ffbeb7cb8c125572c40008697aa2e7bb546531d678eb99baf4a"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"996e4174510a6f1fa6ed65193493b12fb5cedb41a92e9f4b6e1c8aeb959271c3"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"9ac9ac7bf679a56314bcbb7d19b8237cc502012839d6eb9fe5768d1f5e7c57b0"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"47c01a1e4ccddaf98eac72d162fab21afd9979ec488eb6e01bf4772f7fb2e275"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"ea78e306b159c4a5e1b5858997a96d54b45f4dd5189ba7f98566779647598a84"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"fc9c0d951d66b41483e1a4ae2d1460969dfedc33cb77eee5ebdb5a2c809e6d96"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"ed434b0c9920cf1e57f26359ae6826b95afafdf0a447b3a4b97cd4ddb7d4d01c"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"f1e640b0507f318bd2645fcc088c5c69035254b1a6d56516a434b175d5d842f4"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"337266464e40a1d5982721ca438e3c6d14b5bc306aaad83e3579826997339204"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"7fafbd7bb3f42838262e541fde8fc79a9a91685b9dd04fa2e53743fb22579bad"},"taxa":[{"id":"CWE-665","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-908","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"923633b70223031d22593efe5ec74320994b307f58da0c3943e0ff79fd157180"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-476","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"0be18953e09ae077c395382b9283c2a6299f20ea22a98a595795a5428047c534"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"59bcfa938073c3fb22c9e9bc724fb9a3fcfa396bd9d392652bfed3ebef072d3a"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"f308d3525b61933cab5323c97a660d2f1130be54509b65087c411b8208976477"},"taxa":[{"id":"CWE-400","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":"dc3cd2e6e3b135d80b4437d58f5d34bfe4a0aa604d56c21fbf7c1c5deae80771"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"387723364b2fa6210ab94846613697bd17c312c73a83d94b34d7f9e218e6d771"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"9676458f6b82f2f6204aacf419558de89faead1db87e399d1ce15eaa3c35976c"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"3b892ba39d30b8d680e0af128cfa89a02c1305e641dfc63a199439207002ab53"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"732e6712cb7a1e45e24531204959627943a94c723a62abd57429554023918504"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"32be0125791f7c22f06bd8c4e6bca1f654c48b4b3fec913a30f13f2fcc165de4"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"ab6101b5fedef18e1028935b6460d7b138a8466053359c958a39e5322dc838c6"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"ab8326896f9dd535e83559d6a3e942c73a18ad6f68454a4f1610cbeea5164911"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"5afa2a0a453788c11423839a36f7062ba9916f93907c8f5ba6ce2bb90b0e4cf1"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"1979364ac5a845f96c3e5e78d6695112248c551586594ed2f899f641a3197698"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"9d43f44f9d8078de8970b7a1b908e285062de7e6edf827ceff51d3f3582a16e2"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"5a13fad5e5d7e621da13670b19535663141d1ea6eefe7935ca306a4ff227d524"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"9eb53724ed46c2ff209500962f53cc1c88f8c7d439e9a1c8b2e36f8557eb78db"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"e5e0167264ab3a368c68ab288e0ecf228b388651f476d2fb358a7b55f31aa806"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"85f9009fccd588680760fc6589439ea2ed5faff2260c1bdb9dad2c017e77eea0"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"14d38c0e0a3daeed24e49c0ec715d936ae629f49f66349b494568934ea18f826"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"5e5477deb3e475110965f184e6587668acef518d77bcd3b5a12c635b252a8e9d"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"e43c5c58fd207c2505790187a89160485a49723f0c5ef4d45289b8055c44e351"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"cb3efc8692b829e9ffa7dc60faed53278684ecebc3df3da9aa747ac5674ede17"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"20614baac1b3924d8005660a0d56a2bc2edfd73ff1398eaae6db5ea5d15ea941"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71fe7832e468c8ec5d1a8cc2a1c459d0ac00ea8b6215e69e429741005693c108"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b9488592d8cb2f172ec968d90771b413cc40f178a5035674a3b39a31be520370"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"112ebc51996a22417bf594487fc8c9bc9551c34440a17d6b13928df94e13f039"},"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":"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":"b0c49ec53ae24c8df1eca7446dbd979c597802aa6a18e2721d71f9ea906f08d8"},"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":"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":"f18d7be6bdc219d8f60a0a951615ca49e595e47466ab7c1103371af022c0b1f3"},"properties":{"dependency":{"package":"basic-ftp","version":"5.0.5","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]","[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":"ee5672e83fb77abf741e976a3b195a8f736f8f06f3d2aeecff26d805690c3ff4"},"properties":{"dependency":{"package":"svgo","version":"2.8.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"d9cd7c1f8549557680af0440c3d19d67ab16f065870f1371029ce639894df83a"},"properties":{"dependency":{"package":"base-x","version":"3.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"c67bed6130a146a17a07219cdfa830f78587e4284dc8f26f118244cd6c0d9f0d"},"properties":{"dependency":{"package":"braces","version":"3.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"8e8c73a94536b2c459f6afb5840e8a27a13f62420025ca1aa742981ca211b0ec"},"properties":{"dependency":{"package":"browserslist","version":"4.22.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"21570fa3de155e90296d76cd95ec54258acd0256c5aac75f4202d2e548363451"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"bb13c90781e170694560e35e60d00e01860ae986f0cb938f6cc4d9a7255489c4"},"properties":{"dependency":{"package":"msgpackr","version":"1.9.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"fa41ab65d73de07ca9f50199a66c2b5ab6c438754db89160e779cb48ea709407"},"properties":{"dependency":{"package":"picomatch","version":"2.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"1e508525ea8f8394ea214afcac61cfa32d03bc3f2ba961446e4e036db5e03bb7"},"properties":{"dependency":{"package":"source-map-js","version":"1.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"29c9905c1ca2a779769fe0f93c9b67b953a88fcdbe7b5c2d23f6c7d306aabd62"},"properties":{"dependency":{"package":"svgo","version":"3.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"e3a3ad7cef6e779aa13a05b258bd51e3c31203ca530d156a7298b35ccb4106d0"},"properties":{"dependency":{"package":"serialize-javascript","version":"6.0.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"d12c529d0d7faafd014c572ea20f59f45ad2fe49e40ccde3bc6178d4842763d7"},"properties":{"dependency":{"package":"rollup","version":"4.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"d28228a49d7c032518393dfd72089384a679ca7715d8ae86e4c24f70336c6ba3"},"properties":{"dependency":{"package":"braces","version":"3.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"1af3ce7acad6a2435484ebdf4a41f960c063d73a8f19a5e8fc2e95166930f051"},"properties":{"dependency":{"package":"browserslist","version":"4.17.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"0f8c1759985d770b817c7c4f96249721cf27467147aaa991ac02737cab43dc1f"},"properties":{"dependency":{"package":"cross-spawn","version":"7.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"96b3c036f95d3346bb085aad3abc284f7eb3a2fe4b8e0a7928b0f6090c0d095c"},"properties":{"dependency":{"package":"picomatch","version":"2.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"4c50c323ea18d749dec28289d8fe343e21de908f28eaedc877ac4752eb736310"},"properties":{"dependency":{"package":"semver","version":"7.3.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"2da71783144420efeebd2712d733e8c45f3c94f5fcec72772287d8faca31ce85"},"properties":{"dependency":{"package":"serialize-javascript","version":"6.0.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"a944d408513ff0221f2cb666f1114ac27ae893bbcf48713f61cf086e48b655a0"},"properties":{"dependency":{"package":"extract-zip","version":"2.0.1","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":"68361818704aa45be50feb140fbb5949e666e1a78012cd0bbd5d0eb9d21e0128"},"properties":{"dependency":{"package":"ip-address","version":"9.0.5","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":"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":"b20aa14ea75e401f680202bd27fc00bc1420e7997ae0b2422fa04af295607ce5"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"43494d1edbc03b456af7ae2a52a7efc050a4d6c66d8d04a51f53bbd2d385f659"},"properties":{"dependency":{"package":"tar-fs","version":"3.0.6","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":"cf8bb10da1fba1fc1f2ed12ea10ed2ddfb51467aed2a1f70aa7f2806a4eb0399"},"properties":{"dependency":{"package":"ws","version":"8.18.0","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":"0ac8c3af2d7522247d1e0b9525083d1920999e325b78dce0b50cfdb58b7763e3"},"properties":{"dependency":{"package":"zod","version":"3.23.8","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":"97d55c3046070d389cd271470785def5122f707857f7cce67cbff62a6a11f6cf"},"properties":{"dependency":{"package":"js-yaml","version":"3.14.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"fd37de9760785235958932fe8859f2fb7a20c42247f57b11a229cdef130f5df6"},"properties":{"dependency":{"package":"stdlib","version":"1.13.99","advisory":"GO-2021-0226","aliases":["BIT-golang-2020-24553","BIT-golang-2021-27918","BIT-golang-2021-3114","BIT-golang-2021-31525","BIT-golang-2021-33195","BIT-golang-2021-33196","BIT-golang-2021-33197","BIT-golang-2021-33198","BIT-golang-2021-34558","BIT-golang-2021-36221","BIT-golang-2021-39293","BIT-golang-2021-41771","BIT-golang-2021-41772","BIT-golang-2021-44716","BIT-golang-2021-44717","BIT-golang-2022-1705","BIT-golang-2022-1962","BIT-golang-2022-23772","BIT-golang-2022-23806","BIT-golang-2022-24675","BIT-golang-2022-24921","BIT-golang-2022-27664","BIT-golang-2022-28131","BIT-golang-2022-28327","BIT-golang-2022-2879","BIT-golang-2022-2880","BIT-golang-2022-29526","BIT-golang-2022-29804","BIT-golang-2022-30580","BIT-golang-2022-30629","BIT-golang-2022-30630","BIT-golang-2022-30631","BIT-golang-2022-30632","BIT-golang-2022-30633","BIT-golang-2022-30634","BIT-golang-2022-30635","BIT-golang-2022-32148","BIT-golang-2022-32189","BIT-golang-2022-41715","BIT-golang-2022-41716","BIT-golang-2022-41717","BIT-golang-2022-41720","BIT-golang-2022-41722","BIT-golang-2022-41723","BIT-golang-2022-41724","BIT-golang-2022-41725","BIT-golang-2023-24532","BIT-golang-2023-24534","BIT-golang-2023-24536","BIT-golang-2023-24537","BIT-golang-2023-24538","BIT-golang-2023-24539","BIT-golang-2023-24540","BIT-golang-2023-29400","BIT-golang-2023-29403","BIT-golang-2023-29406","BIT-golang-2023-29409","BIT-golang-2023-39318","BIT-golang-2023-39319","BIT-golang-2023-39325","BIT-golang-2023-39326","BIT-golang-2023-45283","BIT-golang-2023-45284","BIT-golang-2023-45287","BIT-golang-2023-45288","BIT-golang-2023-45289","BIT-golang-2023-45290","BIT-golang-2024-24783","BIT-golang-2024-24784","BIT-golang-2024-24785","BIT-golang-2024-24789","BIT-golang-2024-24790","BIT-golang-2024-24791","BIT-golang-2024-34155","BIT-golang-2024-34156","BIT-golang-2024-34158","BIT-golang-2024-45336","BIT-golang-2024-45341","BIT-golang-2025-0913","BIT-golang-2025-22866","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[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]","[GHSA redacted]","GO-2021-0234","GO-2021-0235","GO-2021-0239","GO-2021-0240","GO-2021-0241","GO-2021-0242","GO-2021-0243","GO-2021-0245","GO-2021-0263","GO-2021-0264","GO-2021-0317","GO-2021-0319","GO-2021-0347","GO-2022-0236","GO-2022-0273","GO-2022-0288","GO-2022-0289","GO-2022-0433","GO-2022-0435","GO-2022-0477","GO-2022-0493","GO-2022-0515","GO-2022-0520","GO-2022-0521","GO-2022-0522","GO-2022-0523","GO-2022-0524","GO-2022-0525","GO-2022-0526","GO-2022-0527","GO-2022-0531","GO-2022-0532","GO-2022-0533","GO-2022-0537","GO-2022-0969","GO-2022-1037","GO-2022-1038","GO-2022-1039","GO-2022-1095","GO-2022-1143","GO-2022-1144","GO-2023-1568","GO-2023-1569","GO-2023-1570","GO-2023-1571","GO-2023-1621","GO-2023-1702","GO-2023-1703","GO-2023-1704","GO-2023-1705","GO-2023-1751","GO-2023-1752","GO-2023-1753","GO-2023-1840","GO-2023-1878","GO-2023-1987","GO-2023-2041","GO-2023-2043","GO-2023-2102","GO-2023-2185","GO-2023-2186","GO-2023-2375","GO-2023-2382","GO-2024-2598","GO-2024-2599","GO-2024-2600","GO-2024-2609","GO-2024-2610","GO-2024-2687","GO-2024-2887","GO-2024-2888","GO-2024-2963","GO-2024-3105","GO-2024-3106","GO-2024-3107","GO-2025-3373","GO-2025-3420","GO-2025-3447","GO-2025-3503","GO-2025-3563","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"cmd/esbuild/main_other.go","line":16,"symbol":"os.Create"}}}},{"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":"362d19fbc20680c130f6d3f829465778e97203407075f4ceb76a4cf0cc41a027"},"properties":{"dependency":{"package":"golang.org/x/sys","version":"0.0.0-20220715151400-c0bba94af5f8","advisory":"GO-2026-5024","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":"c1664e1d4678c1320e0deb2949adc339b67626baa238228d0e056a0c0afdddf7"},"properties":{"dependency":{"package":"@parcel/reporter-dev-server","version":"2.10.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"f4312e80915c1fe8e76469daf720e571d3e34ffcb4e93441dd8b5ae4bc415ac6"},"properties":{"dependency":{"package":"micromatch","version":"4.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"e02ced912b8564ffd897c0f7c9c7249200373eaa3a76880782c894e2ba757cca"},"properties":{"dependency":{"package":"ajv","version":"6.12.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"dc84df38680286950c7e667615b31b32d54507ba7ae9dd843ad1586c63eec7c7"},"properties":{"dependency":{"package":"micromatch","version":"4.0.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"bfdace9dd191d5c428708d7eb8f47668ec348bdd7633943d094281ed1e9916d9"},"properties":{"dependency":{"package":"webpack","version":"5.88.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 2 of 95 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 95 of the 137 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: internal/css_parser/css_decls_font_family.go, internal/css_parser/css_decls_font.go. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_font_family.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"793a43d20d34401a90095382cbe44763368fddeda6433eeaf104b39dbb94a927"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/css_parser/css_decls_font.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83da693d36baf9353e750732f0130fcb9c81ad8b064d0623f166af7dbb5844b5"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add gosec / govulncheck (or golangci-lint) (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 4 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060compat-table/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compat-table/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68e9747992239c84430432113bbded1b740e2eb4124edaeaa82d42f88650034"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060windowsBackslashPathTest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce6212e6e0314099df2ec53b27e6d1f59d5fa7d6147ebf9bc6fe9945d33dfb6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060windowsBackslashPathTest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bb05eb7e8d37b4c428eb2e7db8822ac8f86d7022d276a76143b7bfed58bcd8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060workingDirTest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e398359abc8df2640719237410ee5fd60e822e56fbd13f3bd225f0f785b829b7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060workingDirTest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5213646541cf583d22212b980129ef9ab3b4c1922dabbe5e174ff4348cac8a53"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060workingDirTest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"7332bc82539dfc2117ae489ca9a1302eb50f2a4e5d60969cfca78bbc86bba505"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060workingDirTest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f78807790d83e3ba70e6ce0dd8e2c37d0534ae96f3dbb208fa991d0056fae53"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060absPathsCodeTest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef90923944faff6c9aacc0587c2669d089a4cb160b281cf5804cde6ba3c78086"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060absPathsCodeTest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46e176368c5726dace13189a14f30faab0e0bd8a8386b0f030a0677393e5fcf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060absPathsLogTest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"19aca98615dad803748ceda05ff23c35b88d9446d9c7ab3105b4f1e0567811ee"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060absPathsLogTest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"808ed23ace604c125472d4aacd2d8861ba6a65bb4f7801d6218e5b4f0a374c81"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060absPathsMetafileTest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1cc44041304bfa583dd66f2a08a306568242054a06009fd3af02aa6a4942159"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060absPathsMetafileTest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70a071a563886452b2fc37d3d3c1e803c56873229b4affe1a31bad1e833d9e8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060pathResolverEACCS\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"29db618c26e048d260762e6d6076a1bb0496a65fa08be2967a7af3c5f749da47"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060pathResolverEACCS\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"090a6bb78aa9c28601d50360cafa371622b42e798a37983cfeb3c8736d23875f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060pathResolverEACCS\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"2083bdd9fb09a9e7a0d5d5371f1a91a464217295a2e229e6658cc6382cce18f8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060pathResolverEACCS\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"10918b888c47ad227e08d84253ac397c709716e22ac84c627b626c7c0bfbc24c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060pathResolverEACCS\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae5dc1ebc3e0f493afcd30f08684695db3bd0ff9bd82f0c692052fe03e1a1d2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060pathResolverEACCS\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"e400d42ce16c02ade963e55d64133d3a5dc4bf699ff274c08425b093afe04a28"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060pathResolverEACCS\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee23df5e63aace7f4e4ca1128b19aef7e30f8ec8a3de9496eb67ed763d5d14c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060nodePathsTest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"78105aecfc94161ecf52242d38bcfd3da7ce3d2188b861a2ebe363912e8083a5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060nodePathsTest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d096cd2c4cbd4abf4171a236c760a2e0682a233f86c9b0aa46cf747389732092"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060nodePathsTest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8adbd7f08d8b091ae005f0245a39c8036cdad081a3ecf9ed75f992cd202d0c7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060nodePathsTest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"820c15d668b19d813f5014198765cfaba771ae1d66ebd62ad5448aec5b47c388"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060nodePathsLocalPreferredTestIssue1117\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"923b34c7eb6a175a16e144bd1a5426755a4020ab5be0c134d4a262f360a3a53c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060nodePathsLocalPreferredTestIssue1117\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e128dabc8d8c9bb407fa7eecf392ad741c9f2951d157cd0a2c1abf328f21a3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060nodePathsLocalPreferredTestIssue1117\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"b051c914a99715fae33c4b166049372d286c8dffed04162e8d57251c2b650fed"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060nodePathsLocalPreferredTestIssue1117\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed0a939c69ffa2512c8a7416d58ffd8b1f505cdb9da1b7f97dfa3bb4107b005"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060nodePathsLocalPreferredTestIssue1117\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3698975c1bad5321a66aac5a02f1f97374b3ad948becceb75246b19c197878b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060nodePathsLocalPreferredTestIssue1117\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e054706d6db8e90ecacd0e0bc02a315cd278ca08d9d540c87c04bef1ba30fa7a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060fileLoaderWithAssetPath\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"504217c1e7cc20146f938ded7c7eed72613360004303f0ea7f76ff020cdd61af"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060fileLoaderWithAssetPathAndPublicPath\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ce78e43bf8c78be346dd60a69be6dbd59fd4dd82163ebb2129205194c3a035"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060writeFalse\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2109eec88ffe9a51dd0634e2c6ed05ee2881b2a8bb8786532f7b5f03b89724"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64d1f6bb082aaca123c02326f45857ded9d669d7afd198ae6838fed047a3da1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4156}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35e8311cfa22c2871cea90797b72f5d959982977e8aac65957c47df48dae089"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060watchEditSession\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4171}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae590529404f4869f9c8a0741725afd732f72a52701e82454aeb5e64ea1f2ac"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f3cad77e763d4e01e6888dc1cc0f3cd849918886068dc9e8aba4ce719d8dde"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060watchEditSession\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4192}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21c48b64b1ea5fc189a4c0405d1f400a16d9b272a854930ba40539efbaf921a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68d70d00ab1b1638000796e87d52d925a02fc636c4219d8411bf5d477c08d55"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060watchWriteFalse\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2349c10d2fdf51b9927c3d9442c03c78195214a07b9be93f21602449b03f932"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060watchWriteFalse\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4244}}}],"partialFingerprints":{"codehealthFindingId/v1":"f910511fb2345b47adc3b958f6bc7fd79fc0a19ff7d735c6488f19e377406a0e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060watchWriteFalse\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4254}}}],"partialFingerprints":{"codehealthFindingId/v1":"785802426b5dbdc50a76504abde0fad19f4c56b389a7965537ed5fc6296a4621"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4293}}}],"partialFingerprints":{"codehealthFindingId/v1":"6671ee9c2fe41effe00d432e62b7572a5ce1d511af8b081f1166d98cc11305d7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8b5122c2cecefea23423edf553859bf2eeedeb81af785d9c178c1124e94fe6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4422}}}],"partialFingerprints":{"codehealthFindingId/v1":"271fad2be2b91280c94e2d05c22895482d5d89c411ba59343e01ec08e5556d26"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060watchDelay\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4430}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d622b609d3bfb50965ba6c27b14fc3bebcb174bba200b0084f1d9e73e9efc92"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4493}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b99c4d7601831ce40e8453da615605df0fe6860bb39ee6357de564175689a16"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060serveWatch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4496}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2750b197a26743ea476e70fa4284f5232c8bd59b184d399737a870eafbacf79"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060serveBasic\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4532}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d2aa7954c7c5b52ade4e9ffc33920affe717086b38aea5f695eb682b27645c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060serveBasic\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4547}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8564b6a2f70f4e604d73b5d7f9c74bb73cc00cc6db63f0e7278c3788ac1702b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060serveBasicHTTPS\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4606}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bcf45d181c7a5f63c7c710ebf560d96c5a4096423be4ef453d1ce3dcc0486f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060serveWithServedir\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4783}}}],"partialFingerprints":{"codehealthFindingId/v1":"efad393bf623b272850231ef9a857ca80aa69b38fa99d4216ee8d3344986d664"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060serveWatchCopyLoaderWithEntryPoint\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":5048}}}],"partialFingerprints":{"codehealthFindingId/v1":"2449e6bfe7fddd8770ba43006d29ed999a4fe675ed5b26e0f808e8a6841d3b40"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060serveHostCheckIPv4\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":5415}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc34ec4cd22dd5909db863ff219a7b37866f4c9c155cc1bf114208664411695c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060serveHostCheckIPv6\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":5480}}}],"partialFingerprints":{"codehealthFindingId/v1":"178c97ccb4def6a71251e3d35e83d0d02eed788790528d03c2a2744a69999c59"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060serveCORSNoOrigins\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":5541}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1b899907c1fea1a4ec92bdc60677566af1e7c1a69b378ca2b4b32417296c82"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060serveCORSAllOrigins\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":5570}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2bab99f290b28e1224fa0c4b730cc13764cb23fc33d544279c8ba5c7ef5828"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060serveCORSSpecificOrigins\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":5618}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae35fd52c11ad14e8bfbb4d15dd533b56710b43b55e989d1e6805c515f342f3a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060serveCORSSpecificOrigins\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":5626}}}],"partialFingerprints":{"codehealthFindingId/v1":"9feb9fbfe610ea9547eceb2b4f222f025a1c4c4a4331dc81cf25d8c008430799"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060version\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":5713}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43adbafe1dd0bb9aa72e4a647aa3c21d5423f42fcfd946fe872d755cafe5dfe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":8127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3524f4ea0d21f5598d73464d5f8f0e9130b677a42fba64c136421e4091b2a81c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/plugin-tests.js"},"region":{"startLine":2823}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc0e2c5ad8586a02c4fb2784f66d5983c386da7859e0969442620cdd1b76c79"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/plugin-tests.js"},"region":{"startLine":2885}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b4c19c52404212dc3e25ce99c7fb0be9e9d03c9ec39981636d2f821b71f2e5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/plugin-tests.js"},"region":{"startLine":2944}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3a0eb5bc4044cb7ab7ebe1cc69c6c7c11a95230c3343e347286f6b485c6e8d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/plugin-tests.js"},"region":{"startLine":3255}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3a951a64b3022f2cfbfbc519a89e62942c94229f726c254dcc8bf34094f3ad"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060pluginServeWriteTrueOnEnd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/plugin-tests.js"},"region":{"startLine":3314}}}],"partialFingerprints":{"codehealthFindingId/v1":"227dcbcf229cf1f126552c00182b1ed16e6ffdb34709bb2d88449f1f13b7e9b2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060pluginServeWriteFalseOnEnd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/plugin-tests.js"},"region":{"startLine":3366}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a7f3761e9fc57b5355bea1784a501a10800d29d8fb5fc06c9a8e49a34230ac"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/plugin-tests.js"},"region":{"startLine":3470}}}],"partialFingerprints":{"codehealthFindingId/v1":"9296041e3a74042fca81618a38778db78f86a1fd09999769320f9d88cbc62fcf"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 17 typed \u00B7 20 plain JS \u2014 the untyped files are require/yarnpnp/bar/index.js, require/yarnpnp/foo/index.js, require/yarnpnp/in.mjs, scripts/browser/browser-tests.js, scripts/decorator-tests.js, scripts/destructuring-fuzzer.js (\u002B14 more). 0 production file(s) opt out entirely with @ts-nocheck \u00B7 2 @ts-ignore suppression(s)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (117 matched lines \u00D7 2 locations): scripts/terser-tests.js:22 \u00B7 scripts/uglify-tests.js:22 \u2014 the two spans are one implementation copied and then locally edited \u2014 786 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":"scripts/terser-tests.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc11243763cd6f4e2bb303259d63f028e484a0ec0c0efd4498b92a4de259ada"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (58 lines \u00D7 2 locations): scripts/end-to-end-tests.js:9882 \u00B7 scripts/js-api-tests.js:8024 \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":"scripts/end-to-end-tests.js"},"region":{"startLine":9882}}}],"partialFingerprints":{"codehealthFindingId/v1":"c655a5325294fd6adaaf168470f525955c19c3b7e610f6de47901f7aea2ddb06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 4 locations): scripts/decorator-tests.ts:3104 \u00B7 scripts/decorator-tests.ts:3333 \u00B7 scripts/decorator-tests.ts:3562 \u00B7 scripts/decorator-tests.ts:3791 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.ts"},"region":{"startLine":3104}}}],"partialFingerprints":{"codehealthFindingId/v1":"93eb8f395937d8e3f0ac04ecaf32284766b063334bf1a183360df50bc7acd54a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2 locations): scripts/js-api-tests.js:5404 \u00B7 scripts/js-api-tests.js:5469 \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":"scripts/js-api-tests.js"},"region":{"startLine":5404}}}],"partialFingerprints":{"codehealthFindingId/v1":"18baf1a7c28dcea2086c5043701779ff759e8c77f416004805680420b80ec7ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (43 matched lines \u00D7 2 locations): scripts/terser-tests.js:293 \u00B7 scripts/uglify-tests.js:400 \u2014 the two spans are one implementation copied and then locally edited \u2014 302 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":"scripts/terser-tests.js"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9521285fbddd62d0f3721c4a9cbb3fa619d6051f89abf81238c4401fdce7c47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2 locations): scripts/plugin-tests.js:3265 \u00B7 scripts/plugin-tests.js:3314 \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":"scripts/plugin-tests.js"},"region":{"startLine":3265}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfd79ce815c942ceb90f2129ace48413039a5aa92f2970520689e50be9dd2b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): scripts/js-api-tests.js:7668 \u00B7 scripts/js-api-tests.js:7898 \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":"scripts/js-api-tests.js"},"region":{"startLine":7668}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dda8dc59dc9d6210ea9794aa978cab4cd91e43d2f0656c40f8ca39e89fb96e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 3 locations): scripts/js-api-tests.js:173 \u00B7 scripts/js-api-tests.js:207 \u00B7 scripts/js-api-tests.js:241 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1dfe6955c9144dc4d74d855590e644cae9ca43574c87767b69f58b36051301"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): scripts/decorator-tests.ts:671 \u00B7 scripts/decorator-tests.ts:703 \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":"scripts/decorator-tests.ts"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c840cd952d2147e869846beb849eb5a5143f6566fb7790c21a2736d6b63313"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): scripts/decorator-tests.ts:1494 \u00B7 scripts/decorator-tests.ts:1526 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f44da22f43b88975fd7157e9834f61af3d1519828addef6905d5a3297d17dae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): scripts/decorator-tests.ts:1931 \u00B7 scripts/decorator-tests.ts:1963 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1931}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ea90b3b63541b83f8809d6a557b1c930643dc85edfe5583a4f15df35450e63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): scripts/decorator-tests.ts:2268 \u00B7 scripts/decorator-tests.ts:2300 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2268}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af66e8838606353903b416cc4acfbc01c82c1d3470eb94a04228111c85f8c93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): scripts/plugin-tests.js:245 \u00B7 scripts/plugin-tests.js:303 \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":"scripts/plugin-tests.js"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f2e2d6c155d91d8e701a7b7b0c6036ab4b52047df276578900dd1b6d5a43e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): scripts/plugin-tests.js:1502 \u00B7 scripts/plugin-tests.js:1652 \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":"scripts/plugin-tests.js"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b68ec20ea94144e7b428c08925a5a650d11993bc248d89938ef3d68e571b57d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (31 matched lines \u00D7 2 locations): scripts/decorator-tests.ts:2136 \u00B7 scripts/decorator-tests.ts:2183 \u2014 the two spans are one implementation copied and then locally edited \u2014 309 tokens are still identical, in the same order in both spans, 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":"scripts/decorator-tests.ts"},"region":{"startLine":2136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6c24380bc50990e170fa971594f4c088abbc1455a6fdc2ef823492c64aeba5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): scripts/plugin-tests.js:1103 \u00B7 scripts/plugin-tests.js:1134 \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":"scripts/plugin-tests.js"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ae1ba367987d4f1f645964be8f28d66d0e117a28d30c60fa6e658b15de9902"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): scripts/decorator-tests.js:3670 \u00B7 scripts/decorator-tests.js:3743 \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":"scripts/decorator-tests.js"},"region":{"startLine":3670}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edca3ab64bd07f78cc8f6a218790f8ddbe1ebe6a3094797246a0ae290b38592"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): scripts/plugin-tests.js:2258 \u00B7 scripts/plugin-tests.js:2307 \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":"scripts/plugin-tests.js"},"region":{"startLine":2258}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7b78fbd696eaa801ebeba9151cf374f9b3e08ce7c426d688dcaf3694bb74ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): scripts/js-api-tests.js:888 \u00B7 scripts/js-api-tests.js:922 \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":"scripts/js-api-tests.js"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d744c772bcfb59a07fb26f65246cb8da5e796288899d8468cd8a78783d2ee1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): scripts/js-api-tests.js:5891 \u00B7 scripts/js-api-tests.js:5959 \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":"scripts/js-api-tests.js"},"region":{"startLine":5891}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aaed499b1c3595f1c0ff6d2fee471ed192b8419ec8bec85ef9d66c6f5366456"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): scripts/plugin-tests.js:1535 \u00B7 scripts/plugin-tests.js:1685 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/plugin-tests.js"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2009267f711bff49d68688ce86eb678678fbb28c901c61d7dc510efc27c4d35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): scripts/decorator-tests.js:609 \u00B7 scripts/decorator-tests.js:1900 \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":"scripts/decorator-tests.js"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"f333b591b8054326d8839e9f2af7ab585e44929012392155f6d527a8c14614c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): scripts/js-api-tests.js:1261 \u00B7 scripts/js-api-tests.js:1337 \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":"scripts/js-api-tests.js"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bd6c13bf9be7d5f8c3f63185e42f1e4e54edbef1ba8d183f525321cb0fc5af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): scripts/js-api-tests.js:2918 \u00B7 scripts/js-api-tests.js:2954 \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":"scripts/js-api-tests.js"},"region":{"startLine":2918}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba6b097957b767a6ce782ca7b28d028f3b9b9176239194d11308bcafa4e4ee5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): scripts/plugin-tests.js:534 \u00B7 scripts/plugin-tests.js:589 \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":"scripts/plugin-tests.js"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c06fcc1d65e0f27cd4e099719d3f290982e9b0508d9a5b1c0f0df3b39c0875c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 3 locations): scripts/plugin-tests.js:1978 \u00B7 scripts/plugin-tests.js:2004 \u00B7 scripts/plugin-tests.js:2030 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/plugin-tests.js"},"region":{"startLine":1978}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0b454c802f1120cd6b6f05ecb3ce89fac7aabc0dd787d6220c87431ae7d9ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): scripts/plugin-tests.js:2976 \u00B7 scripts/plugin-tests.js:3084 \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":"scripts/plugin-tests.js"},"region":{"startLine":2976}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1aa1b4238a89bbed2c3191ed74e1ac3ece2f6c73a76c64ed0f1ed02835895a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): scripts/decorator-tests.js:4678 \u00B7 scripts/decorator-tests.js:4887 \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":"scripts/decorator-tests.js"},"region":{"startLine":4678}}}],"partialFingerprints":{"codehealthFindingId/v1":"8762f3ad4fd022ac9bfbde546af3d5d66b99c6e503a07a7a6c37e99d1a59498d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 4 locations): scripts/decorator-tests.ts:512 \u00B7 scripts/decorator-tests.ts:574 \u00B7 scripts/decorator-tests.ts:1337 \u00B7 scripts/decorator-tests.ts:1398 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"9345af40f7e19a462d8cf16c44121abbf53fc78ba38c84554f38c9e371169359"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): scripts/decorator-tests.ts:1774 \u00B7 scripts/decorator-tests.ts:1835 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efe69dc5310581805eef1e1a69e52edac65497af01af4a9df95df17df038a1d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): scripts/plugin-tests.js:1317 \u00B7 scripts/plugin-tests.js:1371 \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":"scripts/plugin-tests.js"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd10553e3ba614c5ee1ad81d9fb406278d67e1ce7dd25df260038436d5dd7726"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): scripts/plugin-tests.js:1433 \u00B7 scripts/plugin-tests.js:1460 \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":"scripts/plugin-tests.js"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"e000ed4372a960e551cc426ebd6ee3d0deaf3008f6df336daa6361c73a7ee24d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): scripts/decorator-tests.js:634 \u00B7 scripts/decorator-tests.js:1925 \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":"scripts/decorator-tests.js"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae1d01f150f64e9557e9e58f7b192e7814c0207a802e92cef94b3f89a18982d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 4 locations): scripts/decorator-tests.js:3813 \u00B7 scripts/decorator-tests.js:3901 \u00B7 scripts/decorator-tests.js:3989 \u00B7 scripts/decorator-tests.js:4685 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":3813}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d918704e6a768a15cc01926e26fd828eb9a4cc7f54d9a391d8e820a890eaa7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): scripts/js-api-tests.js:8120 \u00B7 scripts/plugin-tests.js:3463 \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":"scripts/js-api-tests.js"},"region":{"startLine":8120}}}],"partialFingerprints":{"codehealthFindingId/v1":"76429a7f87220217053d4c948b09fa3612c3d15c48ace1373375ef50aa081321"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): scripts/decorator-tests.js:729 \u00B7 scripts/decorator-tests.js:2018 \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":"scripts/decorator-tests.js"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd73c4ce5cbdcf9449e7890affbe4cfabb2b9a964884bb108a25276742b70ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): scripts/decorator-tests.js:2204 \u00B7 scripts/decorator-tests.js:2284 \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":"scripts/decorator-tests.js"},"region":{"startLine":2204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d314481743e4699eff0e84e3bd4ecb7b3a584e1b4a95ee68166653b2af2c6c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4 locations): scripts/decorator-tests.ts:483 \u00B7 scripts/decorator-tests.ts:543 \u00B7 scripts/decorator-tests.ts:1308 \u00B7 scripts/decorator-tests.ts:1368 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.ts"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"432fd52979459f054ca245cd7d4240563d76b10c21f9d4da11c6744e8286d520"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): scripts/js-api-tests.js:3243 \u00B7 scripts/js-api-tests.js:3266 \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":"scripts/js-api-tests.js"},"region":{"startLine":3243}}}],"partialFingerprints":{"codehealthFindingId/v1":"184571056a92326441451f57d3c29eb2a5d69328d0664660174dfa2ce4eb56a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): scripts/plugin-tests.js:766 \u00B7 scripts/plugin-tests.js:875 \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":"scripts/plugin-tests.js"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7178fe3a360f63b5f546cacf9d811f7c27468fea86c1f5a6323c44a814c7f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): scripts/decorator-tests.js:1841 \u00B7 scripts/decorator-tests.js:1955 \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":"scripts/decorator-tests.js"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"c449bd916c18bb6718763748f48bf4b1693f57a17f96443aaf3c00f87d111630"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): scripts/decorator-tests.js:2553 \u00B7 scripts/decorator-tests.js:2678 \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":"scripts/decorator-tests.js"},"region":{"startLine":2553}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d5ddb8f889316137d42a98aaba8d5b8f1fb69facb625425e64dad7760d8e9a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 4 locations): scripts/decorator-tests.js:2733 \u00B7 scripts/decorator-tests.js:2773 \u00B7 scripts/decorator-tests.js:2811 \u00B7 scripts/decorator-tests.js:2856 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":2733}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a27cfb15cfe0fab80885101d42992327c6ddaaa41cbd76719262e9c42893b22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): scripts/decorator-tests.js:2934 \u00B7 scripts/decorator-tests.js:3010 \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":"scripts/decorator-tests.js"},"region":{"startLine":2934}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6b3583dafef7b0248c743022501d6c8d7c1a530f1b87118e644107d1ff240b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): scripts/decorator-tests.js:4082 \u00B7 scripts/decorator-tests.js:4188 \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":"scripts/decorator-tests.js"},"region":{"startLine":4082}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d1769e5999d311eb7dd4a115fe9f5b33b398329b6d05b6ae95b34ca3e0c587"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): scripts/js-api-tests.js:1086 \u00B7 scripts/js-api-tests.js:1108 \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":"scripts/js-api-tests.js"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c71592c79a0af56b4aea2aa92c5b84aa61ace5c731c45633143615a6a81d614"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): scripts/js-api-tests.js:4075 \u00B7 scripts/plugin-tests.js:2755 \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":"scripts/js-api-tests.js"},"region":{"startLine":4075}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10102cda557e925df6c3def75f6613419083a652336ce1435722a483fd1dad8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3 locations): scripts/decorator-tests.js:913 \u00B7 scripts/decorator-tests.js:2200 \u00B7 scripts/decorator-tests.js:2930 \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":"scripts/decorator-tests.js"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9ee6bbbfbc82f1ceeffbb0e394486e6b0ee6809a8c1825d66c486279e69f12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3 locations): scripts/decorator-tests.js:989 \u00B7 scripts/decorator-tests.js:2280 \u00B7 scripts/decorator-tests.js:3006 \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":"scripts/decorator-tests.js"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d42c3d21eddc8e204e202ebe9df47ce4bd11b3611af18550a63697a47a33128"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): scripts/decorator-tests.js:2166 \u00B7 scripts/decorator-tests.js:2246 \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":"scripts/decorator-tests.js"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ede6be4d51c4dea3a6c0dec503306f9558d6e3a67456b91d8a70205a56cbbd7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): scripts/decorator-tests.js:2597 \u00B7 scripts/decorator-tests.js:2710 \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":"scripts/decorator-tests.js"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b30f33deb8825955ab4f95a21758481a354ad369836da9a95395fbfecb9e5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): scripts/decorator-tests.js:3273 \u00B7 scripts/decorator-tests.js:3423 \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":"scripts/decorator-tests.js"},"region":{"startLine":3273}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5e507646aa94cd65e55756c68fc8fbede38e07526b5aeec7e7af2144b096bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): scripts/decorator-tests.js:3700 \u00B7 scripts/decorator-tests.js:3772 \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":"scripts/decorator-tests.js"},"region":{"startLine":3700}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4f5a950af6f582811a1ef3660874868b9453f543ee9456d453926b936cfef1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): scripts/js-api-tests.js:1843 \u00B7 scripts/js-api-tests.js:1900 \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":"scripts/js-api-tests.js"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5994f5702d55e0e963641fe373fb6bd88952aa102843d960ecd775bbe01ad6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): scripts/js-api-tests.js:3160 \u00B7 scripts/js-api-tests.js:3181 \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":"scripts/js-api-tests.js"},"region":{"startLine":3160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87e14bd5ec6b7b05b3908ce9763af212d55883845ee20eaa83ea5e2a5337d01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): scripts/js-api-tests.js:7040 \u00B7 scripts/js-api-tests.js:7061 \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":"scripts/js-api-tests.js"},"region":{"startLine":7040}}}],"partialFingerprints":{"codehealthFindingId/v1":"f250b957301c71eea3048949ca80efe75ba62dbf0542ef019b351999293e3ff1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): scripts/terser-tests.js:268 \u00B7 scripts/uglify-tests.js:379 \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":"scripts/terser-tests.js"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"45171c9aff540991c7df7c68c8a500f981f3a1dc90d11c005afac859ca42c31a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): scripts/decorator-tests.js:769 \u00B7 scripts/decorator-tests.js:2058 \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":"scripts/decorator-tests.js"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"9514236d4bbf6278177b3285bf620b156f3c568e27c36e04343e85790c64a80d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): scripts/decorator-tests.js:1879 \u00B7 scripts/decorator-tests.js:1984 \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":"scripts/decorator-tests.js"},"region":{"startLine":1879}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af467abf0714dca200179512371818f0fbab877290224bd44bdbf77a7f599ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): scripts/decorator-tests.js:2898 \u00B7 scripts/decorator-tests.js:2974 \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":"scripts/decorator-tests.js"},"region":{"startLine":2898}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5286053af6a302889b96c830ed12a693477fa291bf4b88d3e4b827b464d4de9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): scripts/decorator-tests.ts:1745 \u00B7 scripts/decorator-tests.ts:1805 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e51885016ea6ee155d73b06d039f4819609bc0eeecd310d0ea0154ffd927082"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): scripts/js-api-tests.js:1882 \u00B7 scripts/js-api-tests.js:1939 \u00B7 scripts/js-api-tests.js:1997 \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":"scripts/js-api-tests.js"},"region":{"startLine":1882}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f2601f4052a43680dd8deb2054f2026a1ecad8e33438f0d4a235f826793cb7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): scripts/js-api-tests.js:4745 \u00B7 scripts/js-api-tests.js:4843 \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":"scripts/js-api-tests.js"},"region":{"startLine":4745}}}],"partialFingerprints":{"codehealthFindingId/v1":"975d37ad4c0fef55394fc65d231e98e7cd719363f9099a1f207bc31871d2189d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): scripts/plugin-tests.js:469 \u00B7 scripts/plugin-tests.js:502 \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":"scripts/plugin-tests.js"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"462551d51052e75c7c0a7eb8c719fef969e9ec1aab9b84b2cb5e8fababc3e499"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): scripts/plugin-tests.js:2230 \u00B7 scripts/plugin-tests.js:2285 \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":"scripts/plugin-tests.js"},"region":{"startLine":2230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eaa800adec54584db863885c1582ba60c00f7d436dc0b42cd69a7c3c2572257"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): scripts/plugin-tests.js:2440 \u00B7 scripts/plugin-tests.js:2463 \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":"scripts/plugin-tests.js"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"2371d21ba41b880fe436e747c81abd78cffcc9453b4051d3f710e3ed48cd95a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): scripts/decorator-tests.js:1454 \u00B7 scripts/decorator-tests.js:1484 \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":"scripts/decorator-tests.js"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69b24ee8a3663c53e7908944a8f9dbe9b4629c0cf3f4120035ded4835268559"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): scripts/decorator-tests.js:2186 \u00B7 scripts/decorator-tests.js:2266 \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":"scripts/decorator-tests.js"},"region":{"startLine":2186}}}],"partialFingerprints":{"codehealthFindingId/v1":"40428bf7305701358539d85207e387319651e55075dba26123085794058b5ffd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): scripts/decorator-tests.js:4281 \u00B7 scripts/decorator-tests.js:4431 \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":"scripts/decorator-tests.js"},"region":{"startLine":4281}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f114c8835d96a542746405df8f9400558bb7d5c7a17777f7b6d5ebf185c8f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): scripts/decorator-tests.ts:2332 \u00B7 scripts/decorator-tests.ts:2376 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2332}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c0c51d3a64bbd7abaed67da3a57fda2d98f000a0df1f7aafd709b4a46f4941"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): scripts/plugin-tests.js:2801 \u00B7 scripts/plugin-tests.js:2863 \u00B7 scripts/plugin-tests.js:2923 \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":"scripts/plugin-tests.js"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e142d51d433555c70d724edf2ac6e9378dcb339f61a39663455eaf97584473d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4 locations): scripts/decorator-tests.js:1052 \u00B7 scripts/decorator-tests.js:1662 \u00B7 scripts/decorator-tests.js:2346 \u00B7 scripts/decorator-tests.js:3069 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7622a179ee8c5a8f107c6dfd702cc22dd68129b9e9e97a4e502b7ac217aed78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): scripts/decorator-tests.js:1404 \u00B7 scripts/decorator-tests.js:1431 \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":"scripts/decorator-tests.js"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"4977aed51f84559f5579cd47281e3c7fe6696585a31889175773a7492f672133"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): scripts/decorator-tests.js:1513 \u00B7 scripts/decorator-tests.js:1579 \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":"scripts/decorator-tests.js"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"384326eddd003408776103256413c703a4745cb29d3fe6e90b9aabf3446e09c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): scripts/decorator-tests.js:2917 \u00B7 scripts/decorator-tests.js:2993 \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":"scripts/decorator-tests.js"},"region":{"startLine":2917}}}],"partialFingerprints":{"codehealthFindingId/v1":"2015882590ca70a0fd8e4dd8300a14d49fb1d9461711a3c6f141aa28e9590058"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 6 locations): scripts/decorator-tests.js:3868 \u00B7 scripts/decorator-tests.js:3951 \u00B7 scripts/decorator-tests.js:4044 \u00B7 scripts/decorator-tests.js:4151 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":3868}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d3a642b219e5eb49b27f38add1fb0011a8b18ba46ab05858b40b78773d114f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): scripts/decorator-tests.js:4377 \u00B7 scripts/decorator-tests.js:4478 \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":"scripts/decorator-tests.js"},"region":{"startLine":4377}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f0f71b6c5f3ceae2265e8a6a1db6c15f95294d389c7e12d9d3c2bbc3c1fe5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): scripts/js-api-tests.js:4098 \u00B7 scripts/js-api-tests.js:4445 \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":"scripts/js-api-tests.js"},"region":{"startLine":4098}}}],"partialFingerprints":{"codehealthFindingId/v1":"164d33b562ca3e59e48bc691ad753487f121b21a9486d2c313a15cd740cbece5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): scripts/js-api-tests.js:5514 \u00B7 scripts/js-api-tests.js:5543 \u00B7 scripts/js-api-tests.js:5572 \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":"scripts/js-api-tests.js"},"region":{"startLine":5514}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce96aa653fba565c62122525c868f1ae12e634eac3bf4016f8458759a7787cd2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4 locations): scripts/plugin-tests.js:1885 \u00B7 scripts/plugin-tests.js:1911 \u00B7 scripts/plugin-tests.js:1937 \u00B7 scripts/plugin-tests.js:1964 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/plugin-tests.js"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c786ef5bab01e37e968d4ce708743718c02a0dd7eb1604663a08ba6e8bf3741"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): scripts/decorator-tests.js:2099 \u00B7 scripts/decorator-tests.js:2827 \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":"scripts/decorator-tests.js"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2e77e8c3462cca7f1324b688590ee7f83885bccab3d28d9fbc421052895d12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): scripts/decorator-tests.js:2230 \u00B7 scripts/decorator-tests.js:2310 \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":"scripts/decorator-tests.js"},"region":{"startLine":2230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb537f4157c56361a43935c06d4098e7cf4d8042605483f4f05798b32ab1098"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): scripts/decorator-tests.ts:607 \u00B7 scripts/decorator-tests.ts:623 \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":"scripts/decorator-tests.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"001024e2e4e3bf02627f61017c581d841170c01abeb29881b2f4e59c42608056"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): scripts/decorator-tests.ts:1022 \u00B7 scripts/decorator-tests.ts:1038 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"59313e733155118bb466a89c5feaf1bd2761a4ce0d6ab302ddd09249e4c7122c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): scripts/decorator-tests.ts:1052 \u00B7 scripts/decorator-tests.ts:1068 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab985a04ee5ce2fc180f0f29bd60d2b07d78f7d9b57193aede23e0b2ca08e064"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): scripts/decorator-tests.ts:1430 \u00B7 scripts/decorator-tests.ts:1446 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"6125625036309c7bdf34eef2a8a99273911dea175eebe6a8d56e3bf358a0f099"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): scripts/decorator-tests.ts:1867 \u00B7 scripts/decorator-tests.ts:1883 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1867}}}],"partialFingerprints":{"codehealthFindingId/v1":"01041b6d0eb014ae3fb12b601c6460f9f38a5ae8c2171a49991d02d7502ab8ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): scripts/decorator-tests.ts:1898 \u00B7 scripts/decorator-tests.ts:1914 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"25267ee58fb504f76f666a929497fd231e2612ccf2b65a45bb357fa2a46263d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): scripts/decorator-tests.ts:2236 \u00B7 scripts/decorator-tests.ts:2252 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d56ea37caa11f4cd350683f1f6f0616be08e1891a7bd8296db1202a8c52c11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 6 locations): scripts/js-api-tests.js:1479 \u00B7 scripts/js-api-tests.js:1497 \u00B7 scripts/js-api-tests.js:1516 \u00B7 scripts/js-api-tests.js:1534 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"caac2b07f84b992586ba17dbce0380e7729473e250b1f4f75d2561486d625422"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4 locations): scripts/js-api-tests.js:3409 \u00B7 scripts/js-api-tests.js:3476 \u00B7 scripts/js-api-tests.js:3543 \u00B7 scripts/js-api-tests.js:3612 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":3409}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0bafd19b2a99a738cd1f0e97f548a7b483a99b8d7851d9fd9a75a237b17719"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4 locations): scripts/js-api-tests.js:5109 \u00B7 scripts/js-api-tests.js:5181 \u00B7 scripts/js-api-tests.js:5253 \u00B7 scripts/js-api-tests.js:5326 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":5109}}}],"partialFingerprints":{"codehealthFindingId/v1":"626aa5c8f342962fd03d9479e11b7f6addb2fde886c8945392c21f38d2b86bac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): compat-table/src/css_table.ts:7 \u00B7 compat-table/src/js_table.ts:7 \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":"compat-table/src/css_table.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e512f87d8649411ed6092cd29a20eb276dd762358c9d81f5166aaf40bf859f08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): scripts/decorator-tests.js:1530 \u00B7 scripts/decorator-tests.js:1596 \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":"scripts/decorator-tests.js"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1a9a018ad88cc8b761de0cfa2666a7d56c976d8f5867d97ba47258a0e4330e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): scripts/decorator-tests.js:2668 \u00B7 scripts/decorator-tests.js:2700 \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":"scripts/decorator-tests.js"},"region":{"startLine":2668}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf3c68db0699e354eba3488a2cd7bd484f6c4e1eed1bb09d3c56ef33d85faf8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): scripts/decorator-tests.js:3375 \u00B7 scripts/decorator-tests.js:3449 \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":"scripts/decorator-tests.js"},"region":{"startLine":3375}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e3dcdee30bc0d463d41ff58ee9033e920d8e6695bf7d5c9f4620705dd16cf2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): scripts/decorator-tests.js:3973 \u00B7 scripts/decorator-tests.js:4029 \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":"scripts/decorator-tests.js"},"region":{"startLine":3973}}}],"partialFingerprints":{"codehealthFindingId/v1":"031ea2fdc51d80874c564b65fa237ffc2a2ebce0f3ef6c49ee180fd25837cb91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): scripts/decorator-tests.ts:2828 \u00B7 scripts/decorator-tests.ts:2887 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2828}}}],"partialFingerprints":{"codehealthFindingId/v1":"c211047ded01784ec1ef9e0883a44c5e48bdf62b72919c870ce3fa0155b6fa10"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): scripts/js-api-tests.js:3961 \u00B7 scripts/js-api-tests.js:3987 \u00B7 scripts/plugin-tests.js:18 \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":"scripts/js-api-tests.js"},"region":{"startLine":3961}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe538a0ca842a4a506d3660c6d0b63c755880dd81e80a1de975da1608e5282a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): scripts/plugin-tests.js:113 \u00B7 scripts/plugin-tests.js:130 \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":"scripts/plugin-tests.js"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf094153ad1c483d59ca48e598ffce23b77b4a253e43d2ed2a2ad2526c92b39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 7 locations): scripts/plugin-tests.js:1864 \u00B7 scripts/plugin-tests.js:1890 \u00B7 scripts/plugin-tests.js:1916 \u00B7 scripts/plugin-tests.js:1942 \u00B7 \u002B3 more site(s) not listed \u2014 all 7 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":"scripts/plugin-tests.js"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a22e9ef61c491b58f91bc7ba3504a75c5659c03399d11fa07997a374e4999f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 21 locations): scripts/decorator-tests.js:439 \u00B7 scripts/decorator-tests.js:1034 \u00B7 scripts/decorator-tests.js:1063 \u00B7 scripts/decorator-tests.js:1088 \u00B7 \u002B17 more site(s) not listed \u2014 all 21 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c51ffeb81dcdde344a4d6fe952097269c49ac60d6ad5759c9fcce0297c66370"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/decorator-tests.js:655 \u00B7 scripts/decorator-tests.js:685 \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":"scripts/decorator-tests.js"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae444436eb99ecdb5b125db91bcfd92db0c5c72d57d19fe697fb965de3a6a56"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): scripts/decorator-tests.js:1096 \u00B7 scripts/decorator-tests.js:2391 \u00B7 scripts/decorator-tests.js:3113 \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":"scripts/decorator-tests.js"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f30c2c07d9fa3fbdafb79d32878f7a9092d625ba5861ec5167e691761b3c99"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/decorator-tests.js:1946 \u00B7 scripts/decorator-tests.js:1975 \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":"scripts/decorator-tests.js"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec850465890c09774debc10b7ff93710a3c9fe615c754f9edc86982afff0274"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/decorator-tests.js:2959 \u00B7 scripts/decorator-tests.js:3035 \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":"scripts/decorator-tests.js"},"region":{"startLine":2959}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6dea059f2e0a5be06dc74a9b127ee47f2e50a6a702d2948455cff41f671fc5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/decorator-tests.js:3341 \u00B7 scripts/decorator-tests.js:3409 \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":"scripts/decorator-tests.js"},"region":{"startLine":3341}}}],"partialFingerprints":{"codehealthFindingId/v1":"323ed836db278ce2de8703c8131ee7b1112c394e0289e2aaf9a00f129e0558b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/decorator-tests.ts:638 \u00B7 scripts/decorator-tests.ts:654 \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":"scripts/decorator-tests.ts"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"d303d81482fbd2890ebef47d2115e7c528e85882c510b03927dea4ebd1190384"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4 locations): scripts/decorator-tests.ts:941 \u00B7 scripts/decorator-tests.ts:961 \u00B7 scripts/decorator-tests.ts:979 \u00B7 scripts/decorator-tests.ts:1001 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.ts"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"f719e6bfac079b25f8c10b1a959d422c92c6fe4b2eb4cd0c1e9d511be6e8f3e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/decorator-tests.ts:1461 \u00B7 scripts/decorator-tests.ts:1477 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a75ffcdfd5e5e2d6ef7c9e09ae3c93e2ff61b2fdf9c02a1f3b8a428ce36e6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4 locations): scripts/decorator-tests.ts:2927 \u00B7 scripts/decorator-tests.ts:3158 \u00B7 scripts/decorator-tests.ts:3387 \u00B7 scripts/decorator-tests.ts:3616 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.ts"},"region":{"startLine":2927}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0fb769be5015e5792065d9eedfe929575c8a3bf862cdcc586f29041cc85408"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/js-api-tests.js:408 \u00B7 scripts/js-api-tests.js:829 \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":"scripts/js-api-tests.js"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3021d1b55938581a33077c237092a03e5180a076821802036eecb8bc4358df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/js-api-tests.js:647 \u00B7 scripts/js-api-tests.js:697 \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":"scripts/js-api-tests.js"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae6d626103831564146c943af6a9d64a078240a61373ee0d0744eb4edc51f62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): scripts/js-api-tests.js:4504 \u00B7 scripts/js-api-tests.js:5387 \u00B7 scripts/js-api-tests.js:5451 \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":"scripts/js-api-tests.js"},"region":{"startLine":4504}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd4b71d5983fe8bc0dbf2a887d862fb399d25914292f10f668e332749f04798"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/js-api-tests.js:5201 \u00B7 scripts/js-api-tests.js:5273 \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":"scripts/js-api-tests.js"},"region":{"startLine":5201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af374363d6c7f018acea04f8b49691c068bb2432e768c09b9f6c3230f76a3ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): scripts/js-api-tests.js:8175 \u00B7 scripts/plugin-tests.js:3496 \u00B7 scripts/register-test.js:99 \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":"scripts/js-api-tests.js"},"region":{"startLine":8175}}}],"partialFingerprints":{"codehealthFindingId/v1":"98140ecbb2e8bde31a80c981c9b1570055968bc75865f519ad8b049056187078"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/plugin-tests.js:80 \u00B7 scripts/plugin-tests.js:95 \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":"scripts/plugin-tests.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ce2aa936c1a0c4cfea70c03ab89f4f02c820f36a2b24c2337033956d5cd86f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/plugin-tests.js:681 \u00B7 scripts/plugin-tests.js:706 \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":"scripts/plugin-tests.js"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c20ea2820c80d63b7da7b5b396d72f7fb279b506ab30cd7ad1d74d370c15b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 7 locations): scripts/plugin-tests.js:1848 \u00B7 scripts/plugin-tests.js:1870 \u00B7 scripts/plugin-tests.js:1896 \u00B7 scripts/plugin-tests.js:1922 \u00B7 \u002B3 more site(s) not listed \u2014 all 7 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":"scripts/plugin-tests.js"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"8573be2c6be3e7b82e1e316c48573fbb53f1574b465cd39cd34730112be42f65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/plugin-tests.js:2848 \u00B7 scripts/plugin-tests.js:2908 \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":"scripts/plugin-tests.js"},"region":{"startLine":2848}}}],"partialFingerprints":{"codehealthFindingId/v1":"6636534646982fd7aa60d3668790153f8e444ddfbd4806c87fddb64bb24625bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): lib/npm/node-install.ts:252 \u00B7 lib/npm/node-platform.ts:116 \u2014 the two spans are one implementation copied and then locally edited \u2014 77 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":"lib/npm/node-install.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29a19b5504567168b601e53ad670d0c7079cecb1cc7b504c61cc76ec3a2f455"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 6 locations): scripts/decorator-tests.js:1083 \u00B7 scripts/decorator-tests.js:1114 \u00B7 scripts/decorator-tests.js:2378 \u00B7 scripts/decorator-tests.js:2410 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63441ed32107b0abccf3e6fe1dc28f803588696e84b6cab0c04ef3367fab960"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/decorator-tests.js:3250 \u00B7 scripts/decorator-tests.js:3296 \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":"scripts/decorator-tests.js"},"region":{"startLine":3250}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e7e654e960990ff49510eb9ff7ac8a2bc3a6b618de06a514777dee6240c27e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/decorator-tests.js:3608 \u00B7 scripts/decorator-tests.js:3638 \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":"scripts/decorator-tests.js"},"region":{"startLine":3608}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9853aee1bd94327b4a18b095c320f26ecb78ac21f05988cbfed9d76627f4834"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): scripts/decorator-tests.ts:747 \u00B7 scripts/decorator-tests.ts:775 \u00B7 scripts/decorator-tests.ts:2010 \u00B7 scripts/decorator-tests.ts:2045 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.ts"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7c54b3655689f7cea515c56bffa1d321ae7a79b59576b9603ebc293ae15ec3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): scripts/js-api-tests.js:487 \u00B7 scripts/js-api-tests.js:509 \u00B7 scripts/js-api-tests.js:531 \u00B7 scripts/js-api-tests.js:551 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fe27a61778fd14c481223662e360879cc6d7a5c05312ae5fa5c11743674e4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/js-api-tests.js:2156 \u00B7 scripts/js-api-tests.js:2198 \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":"scripts/js-api-tests.js"},"region":{"startLine":2156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85adf07171eb161adb8a09f120d5d4f978be1dbfb14317b201c2566ca126b9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/js-api-tests.js:2351 \u00B7 scripts/js-api-tests.js:2380 \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":"scripts/js-api-tests.js"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0993af2bd24e907dc8d01a76fdc07e7ffaadcb0e1965ab91ae2ec4892f72618"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/js-api-tests.js:2437 \u00B7 scripts/js-api-tests.js:2461 \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":"scripts/js-api-tests.js"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aaae2e23749926c5a5972a5449a8abcff6134039d27d2aa1d319dfd3041a581"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/js-api-tests.js:2697 \u00B7 scripts/js-api-tests.js:2825 \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":"scripts/js-api-tests.js"},"region":{"startLine":2697}}}],"partialFingerprints":{"codehealthFindingId/v1":"0319d08d1a2b80fe95162df7d9344f0d8b0ad352e0227e9847e42be7d661eaa0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): scripts/js-api-tests.js:4769 \u00B7 scripts/js-api-tests.js:4866 \u00B7 scripts/js-api-tests.js:4933 \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":"scripts/js-api-tests.js"},"region":{"startLine":4769}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c8724e0757e3aa174f74bd268daa0d548950a9ccdcaf43e94fddaf6ab9db7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/js-api-tests.js:5058 \u00B7 scripts/js-api-tests.js:5129 \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":"scripts/js-api-tests.js"},"region":{"startLine":5058}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe11ff143b139b8056e5dbbc7d9e787a46a1c90a073b9c64ea46e59d91756117"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/plugin-tests.js:196 \u00B7 scripts/plugin-tests.js:236 \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":"scripts/plugin-tests.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"932cd5eaf921123ff5cd76c440af512b877f5953415ea2aeac09674dcab6c17b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/plugin-tests.js:1789 \u00B7 scripts/plugin-tests.js:1818 \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":"scripts/plugin-tests.js"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf343cf47d0ef9247f267f89aaf14eb70a7fefa113334701e46e8eeb02ed49c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/plugin-tests.js:2548 \u00B7 scripts/plugin-tests.js:2587 \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":"scripts/plugin-tests.js"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f72284c59d0ee6330422af905f730810e8f6e8dd6b8f0f49e34b97ef7f635a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): compat-table/src/caniuse.ts:55 \u00B7 compat-table/src/mdn.ts:119 \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":"compat-table/src/caniuse.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"59246ea4a644ed57510f6c2b2a2110449a5eae3d9c5b19d4ceb35df8f143a582"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): lib/shared/common.ts:1305 \u00B7 lib/shared/common.ts:1318 \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":"lib/shared/common.ts"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f6deb2dcc81198061ea0c9c8a7132e875a62f47500a0260819d2bf5cc99bdf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): lib/shared/common.ts:1423 \u00B7 lib/shared/common.ts:1471 \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":"lib/shared/common.ts"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f115386e1faffecea44c87d2c89a20a7846648317a7509a1749b094452cdfc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): lib/shared/uint8array_json_parser.ts:138 \u00B7 lib/shared/uint8array_json_parser.ts:158 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shared/uint8array_json_parser.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"812a0d5ad02eefd528d804c757f1f8eb729b3f8c3fdecafb1348c90660e7d1e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 13 locations): scripts/decorator-tests.js:59 \u00B7 scripts/decorator-tests.js:80 \u00B7 scripts/decorator-tests.js:100 \u00B7 scripts/decorator-tests.js:124 \u00B7 \u002B9 more site(s) not listed \u2014 all 13 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ec80c47c953f27b0e826d6707942bb44aad57f9daeb457390bacc10411e80b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5 locations): scripts/decorator-tests.js:371 \u00B7 scripts/decorator-tests.js:713 \u00B7 scripts/decorator-tests.js:753 \u00B7 scripts/decorator-tests.js:2002 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"468f2fc7cff75263da770ca292ffce37066f5ae20f1aedabec7d561a93f309dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/decorator-tests.js:806 \u00B7 scripts/decorator-tests.js:851 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1db5a9b305590844d7aecdb869d055963be1d3b0aa0e750f4e55b8e260715e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): scripts/decorator-tests.js:1027 \u00B7 scripts/decorator-tests.js:2320 \u00B7 scripts/decorator-tests.js:3044 \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":"scripts/decorator-tests.js"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"92128aaf9f397ff5535084ef45abd7c1f137c96a5200b4aa2b4dacf514e7cfb5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): scripts/decorator-tests.js:1110 \u00B7 scripts/decorator-tests.js:2406 \u00B7 scripts/decorator-tests.js:3127 \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":"scripts/decorator-tests.js"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c070bd761b6984a4d59c44a6e3b8245f9902eb8887cb10072a515b09bed9cce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/decorator-tests.js:1704 \u00B7 scripts/decorator-tests.js:3569 \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":"scripts/decorator-tests.js"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"25995862997b7833b3c78a53038d1b9bb281f3cd7caa53055624db4382d6cff1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/decorator-tests.js:2452 \u00B7 scripts/decorator-tests.js:2499 \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":"scripts/decorator-tests.js"},"region":{"startLine":2452}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81251df7b3b595b706d5a84dab2ee817929de37d4de43411cba9dc99604b33f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/decorator-tests.js:2823 \u00B7 scripts/decorator-tests.js:2868 \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":"scripts/decorator-tests.js"},"region":{"startLine":2823}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8837009362ca58202776671019a45ea52dacacd350d5cff7a64e3b9a681c047"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/decorator-tests.js:3160 \u00B7 scripts/decorator-tests.js:3207 \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":"scripts/decorator-tests.js"},"region":{"startLine":3160}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9241978b0b0c4353eb79398d31417e80f330336b0792650ee52c2162ba2bc4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 13 locations): scripts/decorator-tests.ts:11 \u00B7 scripts/decorator-tests.ts:26 \u00B7 scripts/decorator-tests.ts:43 \u00B7 scripts/decorator-tests.ts:64 \u00B7 \u002B9 more site(s) not listed \u2014 all 13 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":"scripts/decorator-tests.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c20345f935c876d380cfdce7263ea4bd3d63f2e4a85a17f8486b36c9bbf819b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/decorator-tests.ts:426 \u00B7 scripts/decorator-tests.ts:1253 \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":"scripts/decorator-tests.ts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"8653ab3db07252bdfcefefd18a8a927b57d7840eb2d0e854d8c002b4f2e26357"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/decorator-tests.ts:1571 \u00B7 scripts/decorator-tests.ts:1604 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dde07ddd43c11700c1d66ea0fe4650b4b5b0dbbde671ccdf15411c4448557d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/decorator-tests.ts:2416 \u00B7 scripts/decorator-tests.ts:2450 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2416}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0df3a5a41526c79d5cd45a71751dd41c7e0a3265439de1d706b64c9a502ee41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/js-api-tests.js:2290 \u00B7 scripts/js-api-tests.js:2323 \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":"scripts/js-api-tests.js"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8685c88906a85c478ae3dd3ce3ff66e59e3636960aad9ee446ee30513e69a7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/js-api-tests.js:3993 \u00B7 scripts/plugin-tests.js:24 \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":"scripts/js-api-tests.js"},"region":{"startLine":3993}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5d10d2ed02cac993d37461fba4f7ec37cde45d436c6f5351c4b3c867db674e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/js-api-tests.js:5137 \u00B7 scripts/js-api-tests.js:5282 \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":"scripts/js-api-tests.js"},"region":{"startLine":5137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d886a4f2a18588f54c7ae652a16c6d695a2d4d835602949141e36df85351c9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): scripts/js-api-tests.js:5351 \u00B7 scripts/js-api-tests.js:5520 \u00B7 scripts/js-api-tests.js:5549 \u00B7 scripts/js-api-tests.js:5578 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":5351}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6db85f3aa3f6261ede95b7b19389e9a8aed6b94a95c7396e1f7b07a02658c8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/plugin-tests.js:413 \u00B7 scripts/plugin-tests.js:441 \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":"scripts/plugin-tests.js"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bef2aa64e500705c95b2d78c02f788eb795e671b6decf3ca4a605704d2341aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/plugin-tests.js:579 \u00B7 scripts/plugin-tests.js:634 \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":"scripts/plugin-tests.js"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fd6239fc342157d2e148254cc3d527386550ef186a99ba6fd37bc1776e7657"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/plugin-tests.js:3015 \u00B7 scripts/plugin-tests.js:3107 \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":"scripts/plugin-tests.js"},"region":{"startLine":3015}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e22c782fdf31344bb0af2dc47c3810866608abc4450b376ef4ad7fb59ecab4f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): lib/shared/common.ts:211 \u00B7 lib/shared/common.ts:313 \u00B7 lib/shared/common.ts:332 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shared/common.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae2f5a832c503ca06ebaa4aafaaf4e34f43d5b024995006f9972f43a2aba2b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): lib/shared/common.ts:746 \u00B7 lib/shared/common.ts:759 \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":"lib/shared/common.ts"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c483607db6a1ad2b3c112c1112c3196cde2ef922db9c7c0d52af237205219d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/decorator-tests.js:313 \u00B7 scripts/decorator-tests.js:325 \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":"scripts/decorator-tests.js"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"924efb7752ef14a1ad43d82c4486c41485d6cf6518dabb3cef8a89ea09e64414"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): scripts/decorator-tests.js:752 \u00B7 scripts/decorator-tests.js:2041 \u00B7 scripts/decorator-tests.js:2769 \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":"scripts/decorator-tests.js"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd11bf55cfcc169f7a58a75ca46859fff14eb9daac281338d497e5e202a81f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6 locations): scripts/decorator-tests.js:790 \u00B7 scripts/decorator-tests.js:835 \u00B7 scripts/decorator-tests.js:2079 \u00B7 scripts/decorator-tests.js:2122 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c33cf545a19cf556aaaa5d23ec873f6f70e80dd46b9425fef69553db63250e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): scripts/decorator-tests.js:972 \u00B7 scripts/decorator-tests.js:1592 \u00B7 scripts/decorator-tests.js:2262 \u00B7 scripts/decorator-tests.js:2989 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"728513ee76c2e0fa629d2407f4220221e7d7ce8ea267cfbf15bf4d71629bf0d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): scripts/decorator-tests.js:1155 \u00B7 scripts/decorator-tests.js:1191 \u00B7 scripts/decorator-tests.js:3175 \u00B7 scripts/decorator-tests.js:3221 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f12ae67609cd643b43c413b0e0fa9f62243810f20af2dee67881bbf51d3cf7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/decorator-tests.js:1174 \u00B7 scripts/decorator-tests.js:1780 \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":"scripts/decorator-tests.js"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd239478d77b4301fb65a38a1fc1015fed679a7241cc860e67e9da9834d02488"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/decorator-tests.js:1355 \u00B7 scripts/decorator-tests.js:1389 \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":"scripts/decorator-tests.js"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bece62dffebab0ee162daba9a1e8fa6cd4642348042fe658ac100d19f689c86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/decorator-tests.js:1608 \u00B7 scripts/decorator-tests.js:1626 \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":"scripts/decorator-tests.js"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8d8f7850a7a3bfbc23b2d4f55ab2c4100727ebf3a2d29dd4cd219f80640570"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): scripts/decorator-tests.js:1693 \u00B7 scripts/decorator-tests.js:1721 \u00B7 scripts/decorator-tests.js:3558 \u00B7 scripts/decorator-tests.js:3586 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ad160cadc31cf8921f6d0657b7c4675f6c01c69ac256cc858a3e85192fce64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/decorator-tests.js:2247 \u00B7 scripts/decorator-tests.js:2975 \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":"scripts/decorator-tests.js"},"region":{"startLine":2247}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3565b442cc50365dfa2026e0a371063d64597d4df14023c08c182b0817494bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/decorator-tests.js:3417 \u00B7 scripts/decorator-tests.js:3458 \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":"scripts/decorator-tests.js"},"region":{"startLine":3417}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed9ce725298685cf1479586b569ead0856cc15ada385b5d5f754e2241d5590c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/decorator-tests.js:4718 \u00B7 scripts/decorator-tests.js:5123 \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":"scripts/decorator-tests.js"},"region":{"startLine":4718}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab98de341d1e195a17b8e32e21f7214ac06fc691a79e4f303ff91ed489054b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/decorator-tests.js:5077 \u00B7 scripts/decorator-tests.js:5292 \u2014 all 2 copies are in the same file, and each CITED SPAN is a SPECIALISATION DECLARATION \u2014 a type whose \u0060extends\u0060 clause names a base and whose body hands that base its own values through \u0060super(\u2026)\u0060. The shared module this dimension usually asks you to extract already exists: it is that base, every one of these sites already reaches it, and the \u0060super(\u2026)\u0060 call this row matched on is where each site passes its differences in. So do not read this as an extract-a-helper row \u2014 there is no missing helper, and what is left at each site is the declaration of one distinct specialisation, which cannot be deleted without deleting the thing it declares. Read what actually differs between the spans, because two different answers follow. Where the sites differ only in the values they hand the base \u2014 a type argument, a service, an alias, a cache \u2014 the repetition is a TEMPLATE, and the only moves that collapse it are to generate these declarations from the set they enumerate or to replace the repeated construction with one factory each site calls with its own values; where that set is the point, each site pinning one distinct thing, the repetition IS the enumeration and there is nothing to remove. Where instead a span carries logic OUTSIDE the delegation that is the same at every site, that logic is the part to move, and its home is the base type rather than a new module. Reported because the copies still drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":5077}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2677d0cd5232556b93ab64483bfdf6010f3b19e1faefe88a98f4088775c912a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/decorator-tests.ts:804 \u00B7 scripts/decorator-tests.ts:2080 \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":"scripts/decorator-tests.ts"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5605897b6a412637083856a821cc0529f75bf21f4cdc95b3c2250e689a6e099"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/decorator-tests.ts:1095 \u00B7 scripts/decorator-tests.ts:1127 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b6ab0a00244563b0c6a7c0afd2d9c8d3f0b9c2b9698f179993fa66884ca1ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/decorator-tests.ts:2088 \u00B7 scripts/decorator-tests.ts:2195 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d2dbe11b53cb5ead882f41dda3b9966e04f5e0ac892a6569a0ef03774ac0ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/decorator-tests.ts:2540 \u00B7 scripts/decorator-tests.ts:2574 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2540}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e35d1ebcfd2e67ceedcc6ca5db7716da1676d53d1f3f605808d85c27dceec6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): scripts/decorator-tests.ts:2815 \u00B7 scripts/decorator-tests.ts:2828 \u00B7 scripts/decorator-tests.ts:2875 \u00B7 scripts/decorator-tests.ts:2887 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.ts"},"region":{"startLine":2815}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee66539e0d79463e8e6b6c67b8d50a355f3ad6e45b10daf64ab92571ffbbade3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/decorator-tests.ts:2845 \u00B7 scripts/decorator-tests.ts:2904 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2845}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ea3f7567104595aaa3e5d4aea3a42be21e6dabfa150999e4326efa010063b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/js-api-tests.js:363 \u00B7 scripts/js-api-tests.js:391 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"df73f6dd0d2e3dc0141d992fdc36e3b13554e98c23a1632bbb1ba0e466b9de5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 8 locations): scripts/js-api-tests.js:461 \u00B7 scripts/js-api-tests.js:483 \u00B7 scripts/js-api-tests.js:505 \u00B7 scripts/js-api-tests.js:527 \u00B7 \u002B4 more site(s) not listed \u2014 all 8 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":"scripts/js-api-tests.js"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2c7cfaa924bbda89c4260005e446f09836d9529c0cfadf17dc632a9fb3b2be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/js-api-tests.js:1968 \u00B7 scripts/js-api-tests.js:2027 \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":"scripts/js-api-tests.js"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d353d69a6445a4c672d0df769ad29c885743cd3d54d288ae755a8aa4f412612"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/js-api-tests.js:2128 \u00B7 scripts/js-api-tests.js:2170 \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":"scripts/js-api-tests.js"},"region":{"startLine":2128}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fe115293f70db5456cba08fdfd51a7421f545104f331a2d3dc69c730633706"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): scripts/js-api-tests.js:2316 \u00B7 scripts/js-api-tests.js:2354 \u00B7 scripts/js-api-tests.js:2383 \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":"scripts/js-api-tests.js"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a70d3989e7eb74b88bd4177a91e93397916637570510eb95d65ec6539d36419"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/js-api-tests.js:2603 \u00B7 scripts/js-api-tests.js:2615 \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":"scripts/js-api-tests.js"},"region":{"startLine":2603}}}],"partialFingerprints":{"codehealthFindingId/v1":"01191f24d1024352a60ddb56030f776f4300b1d3acaa81bb6070dac45f814d60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/js-api-tests.js:4578 \u00B7 scripts/js-api-tests.js:4699 \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":"scripts/js-api-tests.js"},"region":{"startLine":4578}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa33492f656e3667022a10069455670818aa8d4ef531a18968b2be2e96fa5b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): scripts/js-api-tests.js:4609 \u00B7 scripts/js-api-tests.js:4795 \u00B7 scripts/js-api-tests.js:4906 \u00B7 scripts/js-api-tests.js:4961 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4609}}}],"partialFingerprints":{"codehealthFindingId/v1":"341904eb323082bb961549555ac75f2bbc954202faf0232cae97935fbb42c8d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/js-api-tests.js:5661 \u00B7 scripts/js-api-tests.js:5674 \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":"scripts/js-api-tests.js"},"region":{"startLine":5661}}}],"partialFingerprints":{"codehealthFindingId/v1":"506289eda3e8ac05f3d15bbd5536a2b90b1bcbc8dcad8350db77a1c220cfcc59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/js-api-tests.js:6386 \u00B7 scripts/js-api-tests.js:6415 \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":"scripts/js-api-tests.js"},"region":{"startLine":6386}}}],"partialFingerprints":{"codehealthFindingId/v1":"062160234abf42c7ad71a385ad6f79b6526894af16f53622f4bf18ba36ff3f9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/js-api-tests.js:7235 \u00B7 scripts/js-api-tests.js:7264 \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":"scripts/js-api-tests.js"},"region":{"startLine":7235}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc88696f03503e129f13f53dd44ca66c218f3f026cba91d1f6f205910741e22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/plugin-tests.js:329 \u00B7 scripts/plugin-tests.js:350 \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":"scripts/plugin-tests.js"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4ee728f1cc7a347d4a8c276b1109e65d1db6cf174fac1bdf1c534f95eda4b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/plugin-tests.js:372 \u00B7 scripts/plugin-tests.js:392 \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":"scripts/plugin-tests.js"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3095baa2d7e2bf4453e442b04912494da9d2b2feeb776d9ecf4ca75217b87f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/plugin-tests.js:490 \u00B7 scripts/plugin-tests.js:523 \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":"scripts/plugin-tests.js"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"a794de9069ae69f69725b9705681ab50a01f3301546545965e99375ebeeade4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/plugin-tests.js:1169 \u00B7 scripts/plugin-tests.js:1199 \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":"scripts/plugin-tests.js"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90a220133f3ddcf5e371a4b94f65e415fe29f8ff677d3df2b4c6e1c140ba221"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/plugin-tests.js:1277 \u00B7 scripts/plugin-tests.js:1304 \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":"scripts/plugin-tests.js"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a55dd7d975e6a3325a980b8bc0f6924e69e622065a17013ce30a38c32700ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/plugin-tests.js:1771 \u00B7 scripts/plugin-tests.js:1823 \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":"scripts/plugin-tests.js"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"de551586b1e692bef5144c925059c6d9b7359882a84154491d36af790f417c1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): lib/npm/browser.ts:157 \u00B7 lib/npm/browser.ts:170 \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":"lib/npm/browser.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4d252f3adf525a30111a131df2b649837c939d7ad0a6377bc03337c0a91c03"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): lib/shared/uint8array_json_parser.ts:304 \u00B7 lib/shared/uint8array_json_parser.ts:320 \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":"lib/shared/uint8array_json_parser.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b42c336256f967ce62793d964957e3dab307f86f06a2199966469c61d5dc6b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/decorator-tests.js:351 \u00B7 scripts/decorator-tests.js:362 \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":"scripts/decorator-tests.js"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c9f01258448ec56e46a8e06ae78dcda2452afe03c8f32d1d90a6d0ea44f807"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/decorator-tests.js:533 \u00B7 scripts/decorator-tests.js:571 \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":"scripts/decorator-tests.js"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62af5a060ad6bd356edcd32ec509a7c897fd01a2726bbf8a62f5a017ad93c2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/decorator-tests.js:555 \u00B7 scripts/decorator-tests.js:816 \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":"scripts/decorator-tests.js"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a688c587d674d289209c5f6bf660fc431526f31b09201fd8c17b82fee3950f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): scripts/decorator-tests.js:1042 \u00B7 scripts/decorator-tests.js:2335 \u00B7 scripts/decorator-tests.js:3059 \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":"scripts/decorator-tests.js"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"0056fc81046871baeb09f5b417f40978ac0c6f4d7d03cbdbda379ae13bbcab9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): scripts/decorator-tests.js:1127 \u00B7 scripts/decorator-tests.js:1732 \u00B7 scripts/decorator-tests.js:2423 \u00B7 scripts/decorator-tests.js:3144 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d7c4011e1914873cc0e1fa0a0a2ee1b8371ef1cfbf5ae0e5c89652c6d017a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/decorator-tests.js:1214 \u00B7 scripts/decorator-tests.js:1249 \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":"scripts/decorator-tests.js"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb0d51efad110d0da55cd4dc9ab74b2ad33cfcca161220fcc0a050f72f7b12d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/decorator-tests.js:1261 \u00B7 scripts/decorator-tests.js:3311 \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":"scripts/decorator-tests.js"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"10274fe949b0845f7a4e6b522d899fce9d40efffc7a517aaf88ac8e60394a439"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/decorator-tests.js:1760 \u00B7 scripts/decorator-tests.js:2458 \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":"scripts/decorator-tests.js"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4a419627bbeabd04d304101c4bba488ada0d2235cb7068908b3f5745e7f2c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/decorator-tests.js:2482 \u00B7 scripts/decorator-tests.js:2526 \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":"scripts/decorator-tests.js"},"region":{"startLine":2482}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d4f80cce72d74da96d5f51e35750f5d1534c36f90f723071be73384c5473ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/decorator-tests.js:2531 \u00B7 scripts/decorator-tests.js:2576 \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":"scripts/decorator-tests.js"},"region":{"startLine":2531}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4bbe38d9e8e88a57d91ec51198a77f6096fe7e40a59a4d9994a942b7f78cd9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/decorator-tests.js:3201 \u00B7 scripts/decorator-tests.js:3244 \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":"scripts/decorator-tests.js"},"region":{"startLine":3201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9202aac5f182cdf629f4a790d18840f59d10b5df8e0d699d61b6890cd6a09665"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): scripts/decorator-tests.js:3322 \u00B7 scripts/decorator-tests.js:3548 \u00B7 scripts/decorator-tests.js:3655 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":3322}}}],"partialFingerprints":{"codehealthFindingId/v1":"39906d628ee6061479e9fbdcba072ebbcdd0c3de3eaa7523261d5dbf66c916fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): scripts/decorator-tests.ts:589 \u00B7 scripts/decorator-tests.ts:1382 \u00B7 scripts/decorator-tests.ts:1413 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eef81e263290f34e9848a077b975290ea89f29d3404eaa2f9c1091a0daedf1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/decorator-tests.ts:831 \u00B7 scripts/decorator-tests.ts:2116 \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":"scripts/decorator-tests.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f1f2decb328b22eaac71fd44637d18b29637d65ef6d52cd58dcb4835b037bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/decorator-tests.ts:863 \u00B7 scripts/decorator-tests.ts:912 \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":"scripts/decorator-tests.ts"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31d36dc5131adeab23abf1e46f9a6170a946106737ce169e93ba722402f416b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/decorator-tests.ts:1819 \u00B7 scripts/decorator-tests.ts:1850 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"346a99054a23c0f49b421b8051763dcbb93c4f711c21423a92fd465857a8a443"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/decorator-tests.ts:2608 \u00B7 scripts/decorator-tests.ts:2660 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2608}}}],"partialFingerprints":{"codehealthFindingId/v1":"02591b95f12bb4fb9e620deaeb82da3d030a1c8a6e790b3d75db7f954cc0b1cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8 locations): scripts/decorator-tests.ts:2981 \u00B7 scripts/decorator-tests.ts:3210 \u00B7 scripts/decorator-tests.ts:3220 \u00B7 scripts/decorator-tests.ts:3230 \u00B7 \u002B4 more site(s) not listed \u2014 all 8 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":"scripts/decorator-tests.ts"},"region":{"startLine":2981}}}],"partialFingerprints":{"codehealthFindingId/v1":"a478c6f24e4c094d5c273d2afd7cf500891bb2ff2af58fe4dcd79ff82d4cdf3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): scripts/decorator-tests.ts:2991 \u00B7 scripts/decorator-tests.ts:3001 \u00B7 scripts/decorator-tests.ts:3449 \u00B7 scripts/decorator-tests.ts:3459 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.ts"},"region":{"startLine":2991}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8dced6e624c7b17a1f0b3d1110ac45946f26452811a7902ae6a2117129e362"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8 locations): scripts/decorator-tests.ts:3075 \u00B7 scripts/decorator-tests.ts:3304 \u00B7 scripts/decorator-tests.ts:3314 \u00B7 scripts/decorator-tests.ts:3324 \u00B7 \u002B4 more site(s) not listed \u2014 all 8 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":"scripts/decorator-tests.ts"},"region":{"startLine":3075}}}],"partialFingerprints":{"codehealthFindingId/v1":"738954efe341f431d4ad54a0aea3eeaef7e76e47bacbd838607c4d7f845bd1f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): scripts/decorator-tests.ts:3085 \u00B7 scripts/decorator-tests.ts:3095 \u00B7 scripts/decorator-tests.ts:3543 \u00B7 scripts/decorator-tests.ts:3553 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.ts"},"region":{"startLine":3085}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff2d3e0ab4ee6d5db81106c352def3bf038330f8b8e5c99c37c350e5e45f7b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): scripts/destructuring-fuzzer.js:155 \u00B7 scripts/destructuring-fuzzer.js:167 \u00B7 scripts/destructuring-fuzzer.js:213 \u00B7 scripts/destructuring-fuzzer.js:225 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/destructuring-fuzzer.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5c3056a1f6e88c08420f6541fc033542b98fb5e6234a408e875036fce4fae3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): scripts/destructuring-fuzzer.js:177 \u00B7 scripts/destructuring-fuzzer.js:189 \u00B7 scripts/destructuring-fuzzer.js:201 \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":"scripts/destructuring-fuzzer.js"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b9f943c913b2b52725a93f4a73dcbccb37018bc9765c8d058152e0c2c1a73d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/end-to-end-tests.js:9564 \u00B7 scripts/end-to-end-tests.js:9587 \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":"scripts/end-to-end-tests.js"},"region":{"startLine":9564}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9a0396c02d72ee9ed12a216cd61246322cb43ae21f581ecccb271bb71d5e73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/gen-unicode-table.js:90 \u00B7 scripts/gen-unicode-table.js:106 \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":"scripts/gen-unicode-table.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4456404951e050b095d551ad9d5f4b3f854c3a96ae831f3e8904a87d95e889"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/js-api-tests.js:963 \u00B7 scripts/js-api-tests.js:2136 \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":"scripts/js-api-tests.js"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3dc6c408b9f17a1767b1492ffc5a7661139fde9485a12e0a7c245eac1a1433"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/js-api-tests.js:3217 \u00B7 scripts/js-api-tests.js:3263 \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":"scripts/js-api-tests.js"},"region":{"startLine":3217}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c98815ffe9835af1ff0077c98d32ee90283af82bf9ef65483e9aeb206e612b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/js-api-tests.js:4170 \u00B7 scripts/js-api-tests.js:4191 \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":"scripts/js-api-tests.js"},"region":{"startLine":4170}}}],"partialFingerprints":{"codehealthFindingId/v1":"33956946cc504ac17211bd2bb0c5a5579dec9e49f9a0c77aa0bbefa4a83c0bc4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/js-api-tests.js:4224 \u00B7 scripts/js-api-tests.js:4318 \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":"scripts/js-api-tests.js"},"region":{"startLine":4224}}}],"partialFingerprints":{"codehealthFindingId/v1":"37416f18829a5df91fce887604e87e59d125139c3d8b3fe24e9e6ba49c62e869"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): scripts/js-api-tests.js:4552 \u00B7 scripts/js-api-tests.js:5445 \u00B7 scripts/js-api-tests.js:5510 \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":"scripts/js-api-tests.js"},"region":{"startLine":4552}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bdf0bfa587ce3a217fc3da184dc9ab9f3b7d16e345207ba8177fff76e19e7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): scripts/js-api-tests.js:4657 \u00B7 scripts/js-api-tests.js:4669 \u00B7 scripts/js-api-tests.js:4681 \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":"scripts/js-api-tests.js"},"region":{"startLine":4657}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34c038b159eef48e9a0c874b00519df69bab4e1416b49c77d2c204907293487"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/js-api-tests.js:6347 \u00B7 scripts/js-api-tests.js:6358 \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":"scripts/js-api-tests.js"},"region":{"startLine":6347}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60b576369bba7d77681845a9405dad1163a0214a4fc18902edde25ebab41a3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/js-api-tests.js:6508 \u00B7 scripts/js-api-tests.js:6530 \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":"scripts/js-api-tests.js"},"region":{"startLine":6508}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec8ee3dc3840501ebb37def1d083696c4b9c06b3ca6cf9fb45d99dd8cf2adda"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): scripts/plugin-tests.js:792 \u00B7 scripts/plugin-tests.js:1095 \u00B7 scripts/plugin-tests.js:1126 \u00B7 scripts/plugin-tests.js:1157 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/plugin-tests.js"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cc4552b6fcd0ae0b540efb6ab6d829ce958ceecff460975cd6cdf7d637c59d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 12 locations): scripts/decorator-tests.js:77 \u00B7 scripts/decorator-tests.js:97 \u00B7 scripts/decorator-tests.js:121 \u00B7 scripts/decorator-tests.js:141 \u00B7 \u002B8 more site(s) not listed \u2014 all 12 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":"scripts/decorator-tests.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ce90d2a3506631c1ca59e80181c5c4a028c9a41afa806f679daa837157a66c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/decorator-tests.js:256 \u00B7 scripts/decorator-tests.js:306 \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":"scripts/decorator-tests.js"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f33f39e09bf69f58026c70ab77661555cb8214a557921476cf0c4451ca5cc5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/decorator-tests.js:282 \u00B7 scripts/decorator-tests.js:344 \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":"scripts/decorator-tests.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"246af1aae85424321920c9f640f1cc00a3863d4e9fc328f865f69a47ab9aae39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/decorator-tests.js:458 \u00B7 scripts/decorator-tests.js:497 \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":"scripts/decorator-tests.js"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f97616c33c9d8e4003fa46626fee97786cd589e0bb9d07330e52c2f0c744a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): scripts/decorator-tests.js:579 \u00B7 scripts/decorator-tests.js:1255 \u00B7 scripts/decorator-tests.js:1869 \u00B7 scripts/decorator-tests.js:2584 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac6a09912bbc00b8c9d53937dec0a8cd3b95ff530096e9c395e195712d70eb5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/decorator-tests.js:674 \u00B7 scripts/decorator-tests.js:699 \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":"scripts/decorator-tests.js"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"165eaeca6d9add4c2f5317ca769bd90446869c8c79d941b2181f5611739e23ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/decorator-tests.js:1143 \u00B7 scripts/decorator-tests.js:1180 \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":"scripts/decorator-tests.js"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e4425b2b92af5a439bd8b4357f01933a1847f6dccfc92f77feeb4ca80f6f30"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): scripts/decorator-tests.js:1237 \u00B7 scripts/decorator-tests.js:1470 \u00B7 scripts/decorator-tests.js:3357 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b603020f1b7d044f25c917691cb5c9879d5d4b4e2d06daed09f2bb2a8eef3734"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/decorator-tests.js:1272 \u00B7 scripts/decorator-tests.js:1501 \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":"scripts/decorator-tests.js"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9e67b471efc3e1a10fed3ffbf8fcda01957a84e788e730a7b11ad9d28c8e8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/decorator-tests.js:1499 \u00B7 scripts/decorator-tests.js:1735 \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":"scripts/decorator-tests.js"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69d75a91fef54efa8b97fa901db9f66bb89a0c192dd0aa9d82962ada301d78e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): scripts/decorator-tests.js:1653 \u00B7 scripts/decorator-tests.js:1703 \u00B7 scripts/decorator-tests.js:3568 \u00B7 scripts/decorator-tests.js:3620 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"949cd990fb93566c4537e8356b0ff9dbaeef0e8c8a3ec85341a32231b7e195d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/decorator-tests.js:1718 \u00B7 scripts/decorator-tests.js:3583 \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":"scripts/decorator-tests.js"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"867f32996fa76fd711843e76371bab095de7a42c867ec5eb82da760055f589fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/decorator-tests.js:1824 \u00B7 scripts/decorator-tests.js:1862 \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":"scripts/decorator-tests.js"},"region":{"startLine":1824}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18ebd7ffcf853a7dc1d33df2ef475dce1b9a18f7f6ac0660b0d6b6e20b36e53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/decorator-tests.js:2839 \u00B7 scripts/decorator-tests.js:2880 \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":"scripts/decorator-tests.js"},"region":{"startLine":2839}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c73bb31cf2ce010b955d6e2181d061b6c1155b59e4d40c3bbd0e2141e326f67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/decorator-tests.js:3886 \u00B7 scripts/decorator-tests.js:3937 \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":"scripts/decorator-tests.js"},"region":{"startLine":3886}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8fc39b9ff8e72b784975278288b1b2d475c51718884369e1c90095963da01d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/decorator-tests.js:4066 \u00B7 scripts/decorator-tests.js:4136 \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":"scripts/decorator-tests.js"},"region":{"startLine":4066}}}],"partialFingerprints":{"codehealthFindingId/v1":"435f872810a1f44536280591ee3e80d7e1496afbf1c6b4afa649eb95b5bcc4aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 16 locations): scripts/decorator-tests.js:4558 \u00B7 scripts/decorator-tests.js:4567 \u00B7 scripts/decorator-tests.js:4576 \u00B7 scripts/decorator-tests.js:4585 \u00B7 \u002B12 more site(s) not listed \u2014 all 16 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":4558}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cf376af1346046d5d85adcbd23f82e832711ceee0d5a8f05b80458be53404c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 12 locations): scripts/decorator-tests.js:4642 \u00B7 scripts/decorator-tests.js:4651 \u00B7 scripts/decorator-tests.js:4660 \u00B7 scripts/decorator-tests.js:4852 \u00B7 \u002B8 more site(s) not listed \u2014 all 12 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":4642}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8790cd40564d1efe87e13dbc72193e8eed77452747a9162c4d9271c0676fa0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): scripts/decorator-tests.ts:177 \u00B7 scripts/decorator-tests.ts:200 \u00B7 scripts/decorator-tests.ts:221 \u00B7 scripts/decorator-tests.ts:244 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"66484f52078a6bd473bbe3644594493916a2c48276dab5ad76e9336d728d8fe0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/decorator-tests.ts:334 \u00B7 scripts/decorator-tests.ts:361 \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":"scripts/decorator-tests.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee8306461eaebd997530a0381bb5ca480117c9766aba2e34ea022ae28c294c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): scripts/decorator-tests.ts:382 \u00B7 scripts/decorator-tests.ts:798 \u00B7 scripts/decorator-tests.ts:1210 \u00B7 scripts/decorator-tests.ts:1631 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"68eec8fc1c4b042c8261e0c9acb919500835b3b6080b755a4a1850c04cc04cdd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): scripts/decorator-tests.ts:408 \u00B7 scripts/decorator-tests.ts:825 \u00B7 scripts/decorator-tests.ts:1235 \u00B7 scripts/decorator-tests.ts:1662 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf45b87e84aeaf68accee863caf27e51ff65138446e72761f44f1b638311c36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/decorator-tests.ts:453 \u00B7 scripts/decorator-tests.ts:1280 \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":"scripts/decorator-tests.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f42a1b998285154957e19b12ecb884fe9662577b2fec5ed82ddd129d3ed93d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/decorator-tests.ts:735 \u00B7 scripts/decorator-tests.ts:765 \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":"scripts/decorator-tests.ts"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ee9885ad70595a002a4233616230b21c6a0bde28fac75cd83bb5d2be2d7c35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/decorator-tests.ts:793 \u00B7 scripts/decorator-tests.ts:820 \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":"scripts/decorator-tests.ts"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"4522a22dcb58ce211f8e995f65527bd9594361b2a62060d49a5488dcab65c561"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/decorator-tests.ts:1112 \u00B7 scripts/decorator-tests.ts:1144 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"151060e43a322be8ff18521195812010e0c11907cfd090f57afda0f96d2a8a56"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): scripts/decorator-tests.ts:3010 \u00B7 scripts/decorator-tests.ts:3239 \u00B7 scripts/decorator-tests.ts:3468 \u00B7 scripts/decorator-tests.ts:3697 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.ts"},"region":{"startLine":3010}}}],"partialFingerprints":{"codehealthFindingId/v1":"979b2e854e0947a3c8ffb0999065d48c8c2ae246ce5f48344c204e72c1323b9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/end-to-end-tests.js:9581 \u00B7 scripts/end-to-end-tests.js:9591 \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":"scripts/end-to-end-tests.js"},"region":{"startLine":9581}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ee313c50d7dd87b34971e1d390e5c5ca9b98f961a76297295e04afc81626a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/js-api-tests.js:25 \u00B7 scripts/js-api-tests.js:5725 \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":"scripts/js-api-tests.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bbed1e1dec1b4521b758443007a6b5f8059d115c58c4fcbcf990e111c60c15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/js-api-tests.js:538 \u00B7 scripts/js-api-tests.js:558 \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":"scripts/js-api-tests.js"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aad3aa43cc68f5af16fc72b3831a5f858c2fd1bd5c28b788bf8419c76ed8cc7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8 locations): scripts/js-api-tests.js:826 \u00B7 scripts/js-api-tests.js:866 \u00B7 scripts/js-api-tests.js:885 \u00B7 scripts/js-api-tests.js:919 \u00B7 \u002B4 more site(s) not listed \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45d509ebf416173a7d4e0efbe1b35b2c4c4576ac109ab4c16f25e6a0bc0cfd6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/js-api-tests.js:2671 \u00B7 scripts/js-api-tests.js:2836 \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":"scripts/js-api-tests.js"},"region":{"startLine":2671}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0640b6da16b55d4cde0a99feb9b5882de1e0b24b8134669a46c6635a69d6ef9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/js-api-tests.js:3085 \u00B7 scripts/js-api-tests.js:3118 \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":"scripts/js-api-tests.js"},"region":{"startLine":3085}}}],"partialFingerprints":{"codehealthFindingId/v1":"1886a24e64a4efe5df4393f6e5c582db50aa00f54e6f4d232b644beb3656b1be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): scripts/js-api-tests.js:3123 \u00B7 scripts/js-api-tests.js:3139 \u00B7 scripts/js-api-tests.js:3199 \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":"scripts/js-api-tests.js"},"region":{"startLine":3123}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4b6780a9e9361b9e1c123c90783f872a6710ce20d1ecaab7ce4a9ac7bf2ab3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): scripts/js-api-tests.js:3375 \u00B7 scripts/js-api-tests.js:3430 \u00B7 scripts/js-api-tests.js:3497 \u00B7 scripts/js-api-tests.js:3564 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":3375}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc297e2b71ea08bb0cdb3ed7ae1834f3592e0053aa6db92c0b93625c4d20925"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): scripts/js-api-tests.js:4142 \u00B7 scripts/js-api-tests.js:4153 \u00B7 scripts/js-api-tests.js:4175 \u00B7 scripts/js-api-tests.js:4196 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4142}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e7b113dc4e10bc04eab0e845dab3b8ba8353668cdd76628dcb071bcb0c8415"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/js-api-tests.js:4266 \u00B7 scripts/js-api-tests.js:4308 \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":"scripts/js-api-tests.js"},"region":{"startLine":4266}}}],"partialFingerprints":{"codehealthFindingId/v1":"19112ef0b015a5dd83455ed1d3c6c13aa227d181ebe4c82e10e3bdffe14e842c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/js-api-tests.js:4636 \u00B7 scripts/js-api-tests.js:4648 \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":"scripts/js-api-tests.js"},"region":{"startLine":4636}}}],"partialFingerprints":{"codehealthFindingId/v1":"67210aca5d9f0e9c85cfeb929e1269866822e994f72af0ceb92a45fc56a9d818"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): scripts/js-api-tests.js:4789 \u00B7 scripts/js-api-tests.js:4875 \u00B7 scripts/js-api-tests.js:4885 \u00B7 scripts/js-api-tests.js:4942 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4789}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac07ef67313394baa6a61afad563a3b4fe7c5bf901758424993d4ec801dd2bf7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): scripts/plugin-tests.js:152 \u00B7 scripts/plugin-tests.js:2450 \u00B7 scripts/plugin-tests.js:2473 \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":"scripts/plugin-tests.js"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e67ddf2eb248ebffd468d5c7c3000e92155492a571b6bddc7c7fcd734ffda9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 9 locations): scripts/plugin-tests.js:384 \u00B7 scripts/plugin-tests.js:405 \u00B7 scripts/plugin-tests.js:433 \u00B7 scripts/plugin-tests.js:461 \u00B7 \u002B5 more site(s) not listed \u2014 all 9 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":"scripts/plugin-tests.js"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"4410a64272086c86534dbd5d693b0ac17959ef3a1c97f771025fbeb82432f32b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/plugin-tests.js:1181 \u00B7 scripts/plugin-tests.js:1211 \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":"scripts/plugin-tests.js"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3521b24c62f6e0a653a588f9822ffc38f58ef3b5e0498f8a4364cea794305a7f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/plugin-tests.js:1259 \u00B7 scripts/plugin-tests.js:1286 \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":"scripts/plugin-tests.js"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9f0302a987b9716ec5542fc3b6076fefbc5a9a280188ba48a8d3fe29cdfac6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): lib/shared/common.ts:1408 \u00B7 lib/shared/common.ts:1457 \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":"lib/shared/common.ts"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7ac22614e000a8ea2df7fe9d42e0d598e7642e8fdb6211d03359564c3e8da0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/decorator-tests.js:139 \u00B7 scripts/decorator-tests.js:201 \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":"scripts/decorator-tests.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3b6296d8ab8aac6270b471cc7d39239cdd62bb9ffecb7632f31b4460ea68b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/decorator-tests.js:271 \u00B7 scripts/decorator-tests.js:333 \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":"scripts/decorator-tests.js"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4351c6d4581283408a9d193987b377780808de55cbbbd1230be1e0eb605b0415"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): scripts/decorator-tests.js:703 \u00B7 scripts/decorator-tests.js:2606 \u00B7 scripts/decorator-tests.js:2719 \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":"scripts/decorator-tests.js"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54dbaae2b958429fd0719ccb4b8b90bea10b9292f33374591c6246d3a4812e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): scripts/decorator-tests.js:823 \u00B7 scripts/decorator-tests.js:864 \u00B7 scripts/decorator-tests.js:2112 \u00B7 scripts/decorator-tests.js:2151 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd4c7878972d24e840a849542f5ca63ac706d21fb71a439c66bc7f0eefe3d68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/decorator-tests.js:1445 \u00B7 scripts/decorator-tests.js:1684 \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":"scripts/decorator-tests.js"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd79de8536c00d6ae5988414dddcfb9e5d370d3f6bde30a62a82b7db666e232f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/decorator-tests.js:1775 \u00B7 scripts/decorator-tests.js:1811 \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":"scripts/decorator-tests.js"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7f501049d72b7b6f0d99649a66f7ef94b09afa1f703273eaff0e71da05f6ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): scripts/decorator-tests.js:3189 \u00B7 scripts/decorator-tests.js:3280 \u00B7 scripts/decorator-tests.js:3430 \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":"scripts/decorator-tests.js"},"region":{"startLine":3189}}}],"partialFingerprints":{"codehealthFindingId/v1":"a876f4a784147339bcff80e57ee55f80f208211758ac107e59b264911149c45f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/decorator-tests.js:3360 \u00B7 scripts/decorator-tests.js:3576 \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":"scripts/decorator-tests.js"},"region":{"startLine":3360}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd6719f411616eda04b300d0dd05487668022a9e5cf9d67a2fe16d6208c386c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/decorator-tests.js:4880 \u00B7 scripts/decorator-tests.js:5285 \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":"scripts/decorator-tests.js"},"region":{"startLine":4880}}}],"partialFingerprints":{"codehealthFindingId/v1":"2998b0303cd7ed2731880450c5d1901ddf62b0c85798cf0ed27d576e126066ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/decorator-tests.ts:190 \u00B7 scripts/decorator-tests.ts:234 \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":"scripts/decorator-tests.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7483a30ba9ca0f3a19ee9de0da13cde847ad4627b169bdca058317e19402284"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 21 locations): scripts/decorator-tests.ts:309 \u00B7 scripts/decorator-tests.ts:676 \u00B7 scripts/decorator-tests.ts:693 \u00B7 scripts/decorator-tests.ts:708 \u00B7 \u002B17 more site(s) not listed \u2014 all 21 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4fb82101483c40040f7b1e3d43618ab6763a21285dfb9fd5ac41eea27ff251"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): scripts/decorator-tests.ts:440 \u00B7 scripts/decorator-tests.ts:468 \u00B7 scripts/decorator-tests.ts:1267 \u00B7 scripts/decorator-tests.ts:1294 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8a5a04d1d8f21a1f10cca8148bd903d3f9806732c1caf890273876c67d860a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/decorator-tests.ts:846 \u00B7 scripts/decorator-tests.ts:885 \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":"scripts/decorator-tests.ts"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ea1e176e4e1bff4e5fc9e19875dd2acc22a58116a86dcc95a2987d5d0e9f9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/decorator-tests.ts:1164 \u00B7 scripts/decorator-tests.ts:1190 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b867bc301e19577370ab8fb5ae33307be5d535616ec86787ecd45ba1ec3c77d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/decorator-tests.ts:1246 \u00B7 scripts/decorator-tests.ts:1301 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0f88978e6976e6d06756bcbd8eca463684be559184e40c645dc71ead007d0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/decorator-tests.ts:1588 \u00B7 scripts/decorator-tests.ts:1620 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1b87a4fe7552ea70052ab665868bdb5415d8994ae9096780095e5a04f17361"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/decorator-tests.ts:1676 \u00B7 scripts/decorator-tests.ts:1737 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05c34acaa36b0d057de64f2fdd3905e8bfbc35dc899faa307f402dcd9a0a64d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/decorator-tests.ts:1685 \u00B7 scripts/decorator-tests.ts:1714 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1685}}}],"partialFingerprints":{"codehealthFindingId/v1":"368bf8eb46298f3ef83c43966f9a9a6d1220ee13c6924384028eb45d3afc0bce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/decorator-tests.ts:1700 \u00B7 scripts/decorator-tests.ts:1730 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"36901d83c7386871a3545143a40ac477a70939f0804b263b994534c9d48b3de0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/decorator-tests.ts:2001 \u00B7 scripts/decorator-tests.ts:2036 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76003aa913d5e6d00b07f5b728cfdcc74096d228586ca081f82ccd85463f6eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/decorator-tests.ts:2027 \u00B7 scripts/decorator-tests.ts:2061 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2027}}}],"partialFingerprints":{"codehealthFindingId/v1":"7060bdbbb142eb21d0945b115181cc144c138a0cc3157d8d11445563c29a03f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/decorator-tests.ts:2070 \u00B7 scripts/decorator-tests.ts:2106 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2070}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70e9075b19d8c857e0446181deec7f651e9396a6c984c9505f1788566203135"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/decorator-tests.ts:2358 \u00B7 scripts/decorator-tests.ts:2400 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3aa15c9796a8e447b4205f58f917d7df22f9863755d498a0f5037a5be80e80"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/decorator-tests.ts:2554 \u00B7 scripts/decorator-tests.ts:2588 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2554}}}],"partialFingerprints":{"codehealthFindingId/v1":"500dedb4bbc0d4dcc9d4ed10073227061e04932d12bf654c2d76b8c9a6a08ad5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/destructuring-fuzzer.js:230 \u00B7 scripts/destructuring-fuzzer.js:254 \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":"scripts/destructuring-fuzzer.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfd30b6eacebd428b47d6c11393b975ccf25d84e78bec122032ddce08d961ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): scripts/end-to-end-tests.js:3859 \u00B7 scripts/end-to-end-tests.js:3868 \u00B7 scripts/end-to-end-tests.js:3883 \u00B7 scripts/end-to-end-tests.js:3892 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/end-to-end-tests.js"},"region":{"startLine":3859}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13c00b67a8ef8ea88f4b666b807f8789c4a93a5d20446fb807d89c7c30f79b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/esbuild.js:54 \u00B7 scripts/esbuild.js:208 \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":"scripts/esbuild.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"61066a200360fcb456a1c21286c5366da1a121a6880ebe52e5b9430f536875f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/js-api-tests.js:777 \u00B7 scripts/js-api-tests.js:795 \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":"scripts/js-api-tests.js"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"972f110209536b6f8f01c6d81bc07da28d284d2e7436407d049a81f43f03764c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 9 locations): scripts/js-api-tests.js:2769 \u00B7 scripts/js-api-tests.js:4111 \u00B7 scripts/js-api-tests.js:4205 \u00B7 scripts/js-api-tests.js:4256 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 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":"scripts/js-api-tests.js"},"region":{"startLine":2769}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92fb1518125806cf895b0148f216bc927e18ea434d65fe823aa31f09e35cf61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): scripts/js-api-tests.js:2802 \u00B7 scripts/js-api-tests.js:2852 \u00B7 scripts/js-api-tests.js:2862 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":2802}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5df8b7f0e9e4894ff4cf1625f6d076a5fd3175651dd22344738313f3f68c48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/js-api-tests.js:2896 \u00B7 scripts/js-api-tests.js:3014 \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":"scripts/js-api-tests.js"},"region":{"startLine":2896}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ae6404c4380834f6540a0fac5b1f7ef0d968006acd63dd9fa59b71f1c37ec4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): scripts/js-api-tests.js:3639 \u00B7 scripts/js-api-tests.js:3770 \u00B7 scripts/js-api-tests.js:3826 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":3639}}}],"partialFingerprints":{"codehealthFindingId/v1":"5612405576a47c769f696e9ef0c1460a1c78f4fd991f70e14925e0f7a5a3d144"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/js-api-tests.js:4238 \u00B7 scripts/js-api-tests.js:4248 \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":"scripts/js-api-tests.js"},"region":{"startLine":4238}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcc293e6b7c65ac3458802309fb14ffbfe73178ce223da67cd9986598485813"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): scripts/js-api-tests.js:4530 \u00B7 scripts/js-api-tests.js:4545 \u00B7 scripts/js-api-tests.js:4604 \u00B7 scripts/js-api-tests.js:5413 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":4530}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e32c813637e83fc4dedec856e2a7094991c99f92dfacb5e7023551971c07dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/js-api-tests.js:5703 \u00B7 scripts/js-api-tests.js:7839 \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":"scripts/js-api-tests.js"},"region":{"startLine":5703}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf609c0ad7e234caca1831fd8af1fe242fb254bcd851b282c249e3865abb4c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 12 locations): scripts/js-api-tests.js:6276 \u00B7 scripts/js-api-tests.js:6286 \u00B7 scripts/js-api-tests.js:6450 \u00B7 scripts/js-api-tests.js:6460 \u00B7 \u002B8 more site(s) not listed \u2014 all 12 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":"scripts/js-api-tests.js"},"region":{"startLine":6276}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de02cec3e2579b5ccad8f7b33cb7985085cf346997aac15e748f851fcd2d993"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): scripts/js-api-tests.js:6291 \u00B7 scripts/js-api-tests.js:6560 \u00B7 scripts/js-api-tests.js:6570 \u00B7 scripts/js-api-tests.js:6813 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":6291}}}],"partialFingerprints":{"codehealthFindingId/v1":"551aaacce82efdba36aac95011215ee8fd140aae4c0983363c283fa30ee8011e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/js-api-tests.js:7640 \u00B7 scripts/js-api-tests.js:7657 \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":"scripts/js-api-tests.js"},"region":{"startLine":7640}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f557c314a9589cd1c218dcc97c2ee7d728948efe49a1848d2bbdea59667e75"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/plugin-tests.js:3473 \u00B7 scripts/register-test.js:77 \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":"scripts/plugin-tests.js"},"region":{"startLine":3473}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab212a8f802a0ed55d6bb8472cdb0458449a03fc06ddab74a985f883c32ca0f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7 locations): scripts/decorator-tests.js:488 \u00B7 scripts/decorator-tests.js:523 \u00B7 scripts/decorator-tests.js:1171 \u00B7 scripts/decorator-tests.js:1777 \u00B7 \u002B3 more site(s) not listed \u2014 all 7 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":"scripts/decorator-tests.js"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbdb0a01e83c93e494e45bfb71692fd7ca990a32a997d423076ce04680c4816"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): scripts/decorator-tests.js:504 \u00B7 scripts/decorator-tests.js:1185 \u00B7 scripts/decorator-tests.js:1792 \u00B7 scripts/decorator-tests.js:2494 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"382f23f940c5d76d3bd64b68e37f71ac38b46a5bdddf526535c614531e6878ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/decorator-tests.js:565 \u00B7 scripts/decorator-tests.js:679 \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":"scripts/decorator-tests.js"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"d108d780b646ea92a0f35829efeb6937cb1e39a127dc933aaf585f7289693d83"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/decorator-tests.js:1304 \u00B7 scripts/decorator-tests.js:1330 \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":"scripts/decorator-tests.js"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c0840a5e178ae296e36065031f93e57a65eab5a022c015d4bebcb49dbec8fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/decorator-tests.js:1366 \u00B7 scripts/decorator-tests.js:1402 \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":"scripts/decorator-tests.js"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bebad6f07b66ad8586fcd59597b94e79cb608d01c226c62f2e1fd72d9260852"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/decorator-tests.js:1816 \u00B7 scripts/decorator-tests.js:2521 \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":"scripts/decorator-tests.js"},"region":{"startLine":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"005c605de9904b2694d63abd788a795123db58aa550213967faf84102c298c9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/decorator-tests.js:1916 \u00B7 scripts/decorator-tests.js:2636 \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":"scripts/decorator-tests.js"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb2b61e01bee4d45caf8ecff9d7aaa659d6e6e0433da3fde6534a5aa443058f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/decorator-tests.js:2154 \u00B7 scripts/decorator-tests.js:2884 \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":"scripts/decorator-tests.js"},"region":{"startLine":2154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34f1be988e73cf3fbfd6a3408cefca799608eb1330d89752caae20eba98deb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/decorator-tests.js:3497 \u00B7 scripts/decorator-tests.js:3576 \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":"scripts/decorator-tests.js"},"region":{"startLine":3497}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c0b40154dae6f371c3a0efb38862f5c625f3a08eeada9190810313486d0d85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/decorator-tests.js:4006 \u00B7 scripts/decorator-tests.js:4100 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":4006}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb231a9206a2fd3c6bca2ef1b009cfb199d64c1714a1a390add9102382b5b7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/decorator-tests.js:4318 \u00B7 scripts/decorator-tests.js:4448 \u2014 all 2 copies are in the same file, and each CITED SPAN is a SPECIALISATION DECLARATION \u2014 a type whose \u0060extends\u0060 clause names a base and whose body hands that base its own values through \u0060super(\u2026)\u0060. The shared module this dimension usually asks you to extract already exists: it is that base, every one of these sites already reaches it, and the \u0060super(\u2026)\u0060 call this row matched on is where each site passes its differences in. So do not read this as an extract-a-helper row \u2014 there is no missing helper, and what is left at each site is the declaration of one distinct specialisation, which cannot be deleted without deleting the thing it declares. Read what actually differs between the spans, because two different answers follow. Where the sites differ only in the values they hand the base \u2014 a type argument, a service, an alias, a cache \u2014 the repetition is a TEMPLATE, and the only moves that collapse it are to generate these declarations from the set they enumerate or to replace the repeated construction with one factory each site calls with its own values; where that set is the point, each site pinning one distinct thing, the repetition IS the enumeration and there is nothing to remove. Where instead a span carries logic OUTSIDE the delegation that is the same at every site, that logic is the part to move, and its home is the base type rather than a new module. Reported because the copies still drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":4318}}}],"partialFingerprints":{"codehealthFindingId/v1":"458a30b55bc521980c936c131490b37cb5e97b382bac5818a59999447fb1c34c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/decorator-tests.js:4355 \u00B7 scripts/decorator-tests.js:5116 \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":"scripts/decorator-tests.js"},"region":{"startLine":4355}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8523653129a077af7bd329fbd8e255736e71e03d5450cf9d8dc6c6fb9e2710"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): scripts/decorator-tests.ts:355 \u00B7 scripts/decorator-tests.ts:770 \u00B7 scripts/decorator-tests.ts:1184 \u00B7 scripts/decorator-tests.ts:1599 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fb6b7d63c7d9c3d0071ca99e7e1a62ae5878110907615a1bd01400db46c719"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/decorator-tests.ts:762 \u00B7 scripts/decorator-tests.ts:1175 \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":"scripts/decorator-tests.ts"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8f6397081adf92c7d4824c956b73cdd2ed92a1c206e25a8a315cd210876f09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/decorator-tests.ts:1148 \u00B7 scripts/decorator-tests.ts:1556 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9aefaee09b9b187b7843bb7c3c55190818106ee20c30770a65a7f75778b64a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/decorator-tests.ts:1336 \u00B7 scripts/decorator-tests.ts:1773 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba41a1e1973c515166461e8753111b6c2996cd594be86b61c7342afb9f2701e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/decorator-tests.ts:1366 \u00B7 scripts/decorator-tests.ts:1803 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5dc40353e8f3695396b0d808b50c076c5cf8bd439b826d94588883e523f5225"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/decorator-tests.ts:1646 \u00B7 scripts/decorator-tests.ts:1721 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a06d2440af0027fe05ce312f7c42147fd129610b1d116a6ac30ee4d4641e2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/decorator-tests.ts:2191 \u00B7 scripts/decorator-tests.ts:2218 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2191}}}],"partialFingerprints":{"codehealthFindingId/v1":"781616364de574a8805d5a2bb3057c965cded01469be19eb7c42179b66325f27"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/decorator-tests.ts:2726 \u00B7 scripts/decorator-tests.ts:2776 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2726}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81720e519415b3dff897e130d9c8c75f6fd15325c3bcda3695029d789cb0242"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/end-to-end-tests.js:9086 \u00B7 scripts/end-to-end-tests.js:9094 \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":"scripts/end-to-end-tests.js"},"region":{"startLine":9086}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9707855c28c2c465d3d5d2da37514aea8a35e5f3c726986098ca9334aefb46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): scripts/js-api-tests.js:986 \u00B7 scripts/js-api-tests.js:3759 \u00B7 scripts/js-api-tests.js:3812 \u00B7 scripts/plugin-tests.js:869 \u2014 the 4 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":"scripts/js-api-tests.js"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a0c98d9961662c154aca7c59a11b9b58304245896499af2336de3d82fbf30b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): scripts/js-api-tests.js:2262 \u00B7 scripts/plugin-tests.js:767 \u00B7 scripts/plugin-tests.js:876 \u00B7 scripts/plugin-tests.js:910 \u00B7 \u002B1 more site(s) not listed \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":"scripts/js-api-tests.js"},"region":{"startLine":2262}}}],"partialFingerprints":{"codehealthFindingId/v1":"5679be15c015e87a8619cad0c4e8343e94ab3beefd24d85efe18d13f70c7a1ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): scripts/js-api-tests.js:2628 \u00B7 scripts/plugin-tests.js:413 \u00B7 scripts/plugin-tests.js:441 \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":"scripts/js-api-tests.js"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"d897d45c2d3fd149ed7c5a52bd2d85bf327e2f38b4e095245086575453a06b48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): scripts/js-api-tests.js:3135 \u00B7 scripts/js-api-tests.js:3153 \u00B7 scripts/js-api-tests.js:3213 \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":"scripts/js-api-tests.js"},"region":{"startLine":3135}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdc2ea887dbf09bea4c90c2f6a94bfd0941f586f910da79137ee63d095eb0ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): scripts/js-api-tests.js:6470 \u00B7 scripts/js-api-tests.js:6478 \u00B7 scripts/js-api-tests.js:6486 \u00B7 scripts/js-api-tests.js:6494 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":6470}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b9586f9eb256e0e5ba5f1c986238861a74091b423ed636c9f823ef3261064b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/js-api-tests.js:6874 \u00B7 scripts/js-api-tests.js:6882 \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":"scripts/js-api-tests.js"},"region":{"startLine":6874}}}],"partialFingerprints":{"codehealthFindingId/v1":"905c5b43bbc9802b1aa8062fbe6889da6c83a1459f921d816e3869e1559aa4f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): scripts/js-api-tests.js:7123 \u00B7 scripts/js-api-tests.js:7131 \u00B7 scripts/js-api-tests.js:7139 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":7123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c685231c4832a6efaaea1661fa160e04c7cf4d6be19ebbd0b632468c6d64720"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/js-api-tests.js:7629 \u00B7 scripts/js-api-tests.js:7646 \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":"scripts/js-api-tests.js"},"region":{"startLine":7629}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3da78dac227013894dfd85f5ce8d06a90ccb1ed927dd90075fab7f16fa691c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/js-api-tests.js:7781 \u00B7 scripts/plugin-tests.js:93 \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":"scripts/js-api-tests.js"},"region":{"startLine":7781}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e72dea9c1b28d664223e1517c1bf987804886476288ede9035e43173826634"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/plugin-tests.js:925 \u00B7 scripts/plugin-tests.js:959 \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":"scripts/plugin-tests.js"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb51c0709a95e23bd6bdbf53a775702f65aba47e020c7a9108cc9e8a135ba38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/plugin-tests.js:1632 \u00B7 scripts/plugin-tests.js:1708 \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":"scripts/plugin-tests.js"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8ea1b5617ad65673381ddafe0c4711a3d44f0fef608687cb6ff83191ee0dce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/plugin-tests.js:2061 \u00B7 scripts/plugin-tests.js:2342 \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":"scripts/plugin-tests.js"},"region":{"startLine":2061}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb76da68d0fd6e985f6cee8b8ff2361a8628bff7e1e717516fc01525e34e885"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): lib/npm/browser.ts:15 \u00B7 lib/npm/node.ts:133 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/npm/browser.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d62b98091af984f5372d0e5b192a885771b27b8473fe5b8d6ec2cba46256ca7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): lib/shared/common.ts:807 \u00B7 lib/shared/common.ts:825 \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":"lib/shared/common.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a1b923b112ec0ce7c9e0b0a4f964010be075782691e673ed4fe9de8283ce60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): lib/shared/common.ts:1364 \u00B7 lib/shared/common.ts:1396 \u00B7 lib/shared/common.ts:1447 \u00B7 lib/shared/common.ts:1497 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shared/common.ts"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d2048f9448fb7b924f4f5dca3b65b1e1dbf6cd46db25a77b369a17e24a239a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): scripts/decorator-tests.js:525 \u00B7 scripts/decorator-tests.js:1204 \u00B7 scripts/decorator-tests.js:1815 \u00B7 scripts/decorator-tests.js:2520 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"3170240b55beafeeeafb7d44e0d9b1c4d08389a45e4a32b95b027b1485926b08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/decorator-tests.js:4131 \u00B7 scripts/decorator-tests.js:4170 \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":"scripts/decorator-tests.js"},"region":{"startLine":4131}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ea9ae666a7ee3c6fd892a9042281ab79bfda7fa26baf077ba4d338463aa593"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 88 locations): scripts/decorator-tests.js:4519 \u00B7 scripts/decorator-tests.js:4525 \u00B7 scripts/decorator-tests.js:4531 \u00B7 scripts/decorator-tests.js:4537 \u00B7 \u002B84 more site(s) not listed \u2014 all 88 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":"scripts/decorator-tests.js"},"region":{"startLine":4519}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53e6de5651be110f73e7d05999c4601b53088abcd0a9567d8368f9ef94ed086"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/decorator-tests.js:4910 \u00B7 scripts/decorator-tests.js:5310 \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":"scripts/decorator-tests.js"},"region":{"startLine":4910}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb167b7796a0950ae0e4ea9edde00a27525c20d5ff27be5d17c9508a4a5a162a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 12 locations): scripts/decorator-tests.ts:24 \u00B7 scripts/decorator-tests.ts:41 \u00B7 scripts/decorator-tests.ts:62 \u00B7 scripts/decorator-tests.ts:79 \u00B7 \u002B8 more site(s) not listed \u2014 all 12 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":"scripts/decorator-tests.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"78073cac83491dcb611c8a38f8ebcf76b37e9e62555aa548cb41006f76d1e480"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/decorator-tests.ts:2621 \u00B7 scripts/decorator-tests.ts:2673 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2621}}}],"partialFingerprints":{"codehealthFindingId/v1":"070e176459de645a51c68f83fd0477e370a35a807c5c15698b7985f85f229aa0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/decorator-tests.ts:2658 \u00B7 scripts/decorator-tests.ts:2702 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2658}}}],"partialFingerprints":{"codehealthFindingId/v1":"491a5565c1061f942a968b7f47caedb79f262d5686044dd29a67332eb96ab479"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 16 locations): scripts/decorator-tests.ts:3038 \u00B7 scripts/decorator-tests.ts:3046 \u00B7 scripts/decorator-tests.ts:3052 \u00B7 scripts/decorator-tests.ts:3058 \u00B7 \u002B12 more site(s) not listed \u2014 all 16 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":"scripts/decorator-tests.ts"},"region":{"startLine":3038}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c745628f55446b64332606d2eb03fd1034063199cd3c5c35e26416e746da3be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): scripts/js-api-tests.js:1158 \u00B7 scripts/js-api-tests.js:1377 \u00B7 scripts/js-api-tests.js:1588 \u00B7 scripts/plugin-tests.js:765 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 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":"scripts/js-api-tests.js"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbef60c40c8f7a19337b1b2477e5ad4c013200ba267570972fb0df155b1edee4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/js-api-tests.js:1512 \u00B7 scripts/js-api-tests.js:1631 \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":"scripts/js-api-tests.js"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cda925d2115baccbb235c419d8324e92e22acb3a6096b96b4f4da17521838d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): scripts/js-api-tests.js:6427 \u00B7 scripts/js-api-tests.js:6434 \u00B7 scripts/js-api-tests.js:6441 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":6427}}}],"partialFingerprints":{"codehealthFindingId/v1":"e786b81587a32d49fa56f115a3f20499ecea46fa273d33f353767fb0f4412c9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): scripts/js-api-tests.js:6498 \u00B7 scripts/js-api-tests.js:6508 \u00B7 scripts/js-api-tests.js:6518 \u00B7 scripts/js-api-tests.js:6530 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/js-api-tests.js"},"region":{"startLine":6498}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f6dcc01eac7efcca103e1d0b9bac84665c85e264cb11070b6abc7d9cf18e0f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/js-api-tests.js:6546 \u00B7 scripts/js-api-tests.js:6553 \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":"scripts/js-api-tests.js"},"region":{"startLine":6546}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f2e18a879e802217f848a9752205dc2cc3b5f674a1056cc3ebe2371a38c9f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/plugin-tests.js:907 \u00B7 scripts/plugin-tests.js:938 \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":"scripts/plugin-tests.js"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23c3f2fc82f8425b3016a7a67d25c4e72d04a18fdb77ed94da0a63ab73cfb17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/register-test.js:37 \u00B7 scripts/register-test.js:67 \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":"scripts/register-test.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"885383bef3eca7437578266c2f207b15eab573958b7b1d9401c404d3140b0e6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/ts-type-tests.js:400 \u00B7 scripts/ts-type-tests.js:415 \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":"scripts/ts-type-tests.js"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7132edb64b405dab1aea5358f60bdde995b7651359c811ae145d332c1fc6aa2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 20 locations): lib/shared/common.ts:148 \u00B7 lib/shared/common.ts:153 \u00B7 lib/shared/common.ts:158 \u00B7 lib/shared/common.ts:163 \u00B7 \u002B16 more site(s) not listed \u2014 all 20 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shared/common.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a228fd0d233f0a2adc215fc3ea1452e00e029404329ea0b07bdf2af3179a9a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/decorator-tests.js:291 \u00B7 scripts/decorator-tests.js:359 \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":"scripts/decorator-tests.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b91c6e2cc182ec24fb3711b351bbf93e1d877bd1bd36773c860225a53229ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/decorator-tests.js:3444 \u00B7 scripts/decorator-tests.js:3484 \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":"scripts/decorator-tests.js"},"region":{"startLine":3444}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbda9f8e916cf0b99586b6b752b9e4445def7a49c530237432791e20e2a6e640"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/decorator-tests.js:3896 \u00B7 scripts/decorator-tests.js:3946 \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":"scripts/decorator-tests.js"},"region":{"startLine":3896}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f3421cdf4b41e381499aad3eb49760c8e759ff2680afaee17995574ea74b3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/decorator-tests.js:4017 \u00B7 scripts/decorator-tests.js:4111 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":4017}}}],"partialFingerprints":{"codehealthFindingId/v1":"34dc2be6455111688a30616c9a20a450e0c580c9bcba7dcc698dc8668eb811c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): scripts/decorator-tests.js:4184 \u00B7 scripts/decorator-tests.js:4243 \u00B7 scripts/decorator-tests.js:4278 \u00B7 scripts/decorator-tests.js:4428 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":4184}}}],"partialFingerprints":{"codehealthFindingId/v1":"882a3e0a3ded59a62a5a0b1d2807374a40f6673731b377ba5d271cff793c6e86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/decorator-tests.js:4272 \u00B7 scripts/decorator-tests.js:4423 \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":"scripts/decorator-tests.js"},"region":{"startLine":4272}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed131531a3266ca817109772b494194ee396b86d9c1addd332da31b73e34da2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/decorator-tests.js:4419 \u00B7 scripts/decorator-tests.js:4513 \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":"scripts/decorator-tests.js"},"region":{"startLine":4419}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b535bee15ff7e34865099428a51602723286f0309023edeeca1ae2af2b2db1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/decorator-tests.ts:1208 \u00B7 scripts/decorator-tests.ts:1233 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"896b500a3e50aab2ca468f65f47d9a219c6bf5882329a682a66b023c9e5730c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/decorator-tests.ts:1564 \u00B7 scripts/decorator-tests.ts:1597 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c8ccf0877081ba43c022c6befcba809e28a3662de7fc19cfc5326707af90ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/decorator-tests.ts:1629 \u00B7 scripts/decorator-tests.ts:1660 \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":"scripts/decorator-tests.ts"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ac0b752da5e7fb9d043c3688db750714d629e01ab2b8b414f3bca69f982cc9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/decorator-tests.ts:2207 \u00B7 scripts/decorator-tests.ts:2234 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fcf4486ca3652602510e2e1dafad2b3760f474443058a019d266fbc9fbe430"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/decorator-tests.ts:2369 \u00B7 scripts/decorator-tests.ts:2411 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.ts"},"region":{"startLine":2369}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef5d70737ed989d4a98b957f78102378a5d0c7c8bb66bfb1ff4f0611c965881"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/decorator-tests.ts:2492 \u00B7 scripts/decorator-tests.ts:2520 \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":"scripts/decorator-tests.ts"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbce3c1473261c244374baf7ffeed8ee16605d4521eff3bc585e79b5a921cfb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/decorator-tests.ts:2565 \u00B7 scripts/decorator-tests.ts:2599 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.ts"},"region":{"startLine":2565}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43a6366ca1e3ba782d82f134b2136df4f5e8f53fb41d754d9df94a6ff20b098"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/js-api-tests.js:199 \u00B7 scripts/js-api-tests.js:233 \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":"scripts/js-api-tests.js"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"12490ac95b4a22163a590194aa3d9b07221ef3c283b172c409854be62ff5806b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/js-api-tests.js:225 \u00B7 scripts/js-api-tests.js:259 \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":"scripts/js-api-tests.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d9b9dd362fd24f22e14afb9a5cc3ac58c5c28489cf09909ca649d0f2e8777f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/js-api-tests.js:611 \u00B7 scripts/js-api-tests.js:634 \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":"scripts/js-api-tests.js"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a152f89deb922c33dad32dc0fd507a9c0458641bd59c110e01472623cf1b01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/js-api-tests.js:6535 \u00B7 scripts/js-api-tests.js:6548 \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":"scripts/js-api-tests.js"},"region":{"startLine":6535}}}],"partialFingerprints":{"codehealthFindingId/v1":"6feb2edd91305a8125d7b3d7eaeacee8bf525a5b394cd562539d4c3402e2347f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/js-api-tests.js:7290 \u00B7 scripts/js-api-tests.js:7296 \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":"scripts/js-api-tests.js"},"region":{"startLine":7290}}}],"partialFingerprints":{"codehealthFindingId/v1":"223a784df5a3f5865362f699cf5222653ef5935ce7157b048ac1812d9f4596a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): scripts/plugin-tests.js:220 \u00B7 scripts/plugin-tests.js:1441 \u00B7 scripts/plugin-tests.js:1468 \u00B7 scripts/plugin-tests.js:3009 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/plugin-tests.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e3a00a42ce0ac138b720412cfef76a8d970a732cda7633a83ff01de77bb5a8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/test262-async.js:7 reaches into another package with a relative path (./node_modules/typescript) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test262-async.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbe72bde54683e6555d9915420ab7ca5dcb7236daa9aa84fbe31212b556c094"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function JSON_parse (cyclomatic 93, cognitive 112): JSON_parse has cyclomatic complexity 93 and cognitive complexity 112; 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":"lib/shared/uint8array_json_parser.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1567f9e391722482cba4f3a28615f1fbcc5f7fc52fc295e0892686a7bb264102"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flagsForBuildOptions (cyclomatic 56, cognitive 96): flagsForBuildOptions has cyclomatic complexity 56 and cognitive complexity 96; 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":"lib/shared/common.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7705023c4ebf68e1771e51dba9680873846b7da7a30078fb3d7c37f3354034"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pushCommonFlags (cyclomatic 45, cognitive 59): pushCommonFlags has cyclomatic complexity 45 and cognitive complexity 59; 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":"lib/shared/common.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec5ae1fa4caa58830608eecc1af95f704ffd3549f67525cf461c9ca935ff9ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __decorateElement (cyclomatic 44, cognitive 65): __decorateElement has cyclomatic complexity 44 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/decorator-tests.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4a2bb5fbfb150cfc65ce8407195f67311c78e8be5ee4e5915161b9c9d6b412"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 66): (anonymous) 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":"scripts/end-to-end-tests.js"},"region":{"startLine":9648}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fddac859d4a10bdaf92ac3576c86fc7450613aba6beb26ad4bf71217217148"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkBuildAPI (cyclomatic 32, cognitive 41): checkBuildAPI has cyclomatic complexity 32 and cognitive complexity 41; 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/test262.js"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec8f51d085dd16789695fde59d0ba4baec9bf9f6195b94624acbfd74e9c8d98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function test_case (cyclomatic 24, cognitive 36): test_case has cyclomatic complexity 24 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":"scripts/uglify-tests.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"61598986135139e51a7d06578208196596579b88a4865cd1a5c8ca8f85ec1619"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 57): (anonymous) has cyclomatic complexity 21 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 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":"compat-table/src/index.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbf38927fb21450a463af3d44cd30ae20e94ec900436fcc9877fd4853b3e697"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function test_case (cyclomatic 19, cognitive 27): test_case has cyclomatic complexity 19 and cognitive complexity 27; 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/terser-tests.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8c8c1613a44ad882b6203af4f82f1dcf843e68af05301d9da661a0d2b4c37e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitizeLocation (cyclomatic 18, cognitive 21): sanitizeLocation has cyclomatic complexity 18 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":"lib/shared/common.ts"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12c1b260b4d799c2f8e702a0aff9a30cfeb13c9d722364f0a2b07bdab8a8033"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 45): (anonymous) has cyclomatic complexity 17 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compat-table/src/mdn.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"71872b217162f3a6f56ef1bbf4cc1a0beabcc8bdfbe5a1dff87ae13323442a59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 42): (anonymous) has cyclomatic complexity 17 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shared/common.ts"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4bced89516d3c700b6bc4c8371a60809feaddbddd8546cba090ccda4235bd3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 37): (anonymous) has cyclomatic complexity 16 and cognitive complexity 37; 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":"lib/shared/common.ts"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca0e391ad86738b0b0100b3bab8982b98c961be34deac1c4e34de8a63801117"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateBinPath (cyclomatic 15, cognitive 30): generateBinPath has cyclomatic complexity 15 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":"lib/npm/node-platform.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee64b6bd2a0355c7bca0b18fadda76b01f3f942cfe30c39afb3aa4995851666"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkTransformAPI (cyclomatic 15, cognitive 17): checkTransformAPI has cyclomatic complexity 15 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":"scripts/test262.js"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a001aa053f278b2fb8787a1919da074e31f87056b2a741ff0d75e6ecc0badee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseStackLinesV8 (cyclomatic 13, cognitive 33): parseStackLinesV8 has cyclomatic complexity 13 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":"lib/shared/common.ts"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bd570a5ec08f801dbcc4cc39e3033046a6fb202fcb401caf532638ebdeca8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 18): (anonymous) has cyclomatic complexity 13 and cognitive complexity 18; 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/terser-tests.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"488a5ae0413ec8404ca1162f31ebd1e59b5024542d124f3a256f2774240a65f4"}},{"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":"lib/shared/common.ts"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb98d041a21ae476a450a57cf6a934a3ca08c2b03c7f0a0db82b4c041a6e736"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 11, cognitive 29): main has cyclomatic complexity 11 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ts-type-tests.js"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"e278814869dbb0ca0a008b4391b190ea8934e46817ddca53867f028872186ddd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 17): (anonymous) has cyclomatic complexity 11 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":"scripts/browser/browser-tests.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ae9486aa218224adc046d781c8052d9d4890674b08f858d7bf621daf7b5530"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; 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":"lib/shared/common.ts"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d28d0c5c8e4fa7cbf0d2b0f46525d238271e7cb9c53ed55cbb761387a45399a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateRangeTable (cyclomatic 11, cognitive 11): generateRangeTable has cyclomatic complexity 11 and cognitive complexity 11; 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/gen-unicode-table.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"005cc770c412812ba3c2eacebf311c8559928003321d8a00119854f2a5d27351"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/decorator-tests.ts: 3741 lines of code: scripts/decorator-tests.ts has 3741 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":"scripts/decorator-tests.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e738b9a758938af195883e4e640dc2154e0a4b7b0840a00b067206fa3910f9"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/shared/common.ts: 1704 lines of code: lib/shared/common.ts has 1704 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":"lib/shared/common.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9386a2986db6bfd3fb793b4a7853a585525408825620a0019ae272a1513eb2"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/shared/types.ts: 631 lines of code: lib/shared/types.ts has 631 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":"lib/shared/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e51ef46f542167497417ce0a1b9079d77f220ce322065e6b29f3b703da9c544"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/npm/node.ts: 559 lines of code: lib/npm/node.ts has 559 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":"lib/npm/node.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ee98a0fb33fa8f09b7dad3e12f9566ea6f5029d30ccad794fdaa73a0bb2d6f"}},{"ruleId":"R3","level":"warning","message":{"text":"compat-table/src/index.ts: 505 lines of code: compat-table/src/index.ts has 505 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":"compat-table/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc358c5acb6450df54f0ee70995eca0f9ec5d8bc64d81295fd30a1f322e3747c"}},{"ruleId":"R4","level":"warning","message":{"text":"Test Coverage: 0% of 18 production file(s) reachable from 0 test file(s) via the import graph \u2014 \u0027production\u0027 here is the RESIDUE: every source file left once tests, tooling, generated output, config, declarations and declaration-only modules, fixture corpora, type fixtures, behaviour-free data modules, re-export barrels, registration/constant data modules and service workers are set aside, so the percentage is taken over a smaller denominator than the workspace\u0027s file count"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"64e0e3511eb969fb4720b196e7d3799e1714077217351c3c56a27b50e3e21220"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (13 application, 18 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"require/yarnpnp/in.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc7c4a51c30409bf2a5cec7a11c33949aee6f80f1f8a562f8db474e99f26c91"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027fuse.js\u0027: Declared in scripts/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":"c9039a379773544face22bfbfba8c4180f42acf11fb4e173ccfec4fee33b8351"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027source-map\u0027: Declared in scripts/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":"8bfd6367482c0eb692c832bc24549fc509181dc55fd415c487ac3b7997d0a7fd"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): compat-table/src/index.ts \u2192 compat-table/src/js_table.ts \u2192 compat-table/src/index.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compat-table/src/index.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58f0b929d967db2da958e24076f40757d3bb7a546c06efc1b977067796fdec6"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: npm/esbuild/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/esbuild/package.json"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4c8c4ca2408560ddb5cc46e409a9798d292eb82763a0acb6ccccf4cd2c30c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arg == \u0022--serve\u0022 || strings.HasPrefix(arg, \u0022--serve=\u0022) || strings.HasPrefix(arg, \u0022--servedir=\u0022) || strings.HasPrefix(arg, \u0022--serve-fallback=\u2026\u0060 appears character-identically in 2 files \u2014 cmd/esbuild/main.go, pkg/cli/cli_impl.go. 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":"cmd/esbuild/main.go"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f5756fdf21a0c228fe4f6df08249edf48a233bbb126a5c2fc97541968bafca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lexer.codePoint == \u0027\u002B\u0027 || lexer.codePoint == \u0027-\u0027\u0060 appears character-identically in 2 files \u2014 internal/css_lexer/css_lexer.go, internal/js_lexer/js_lexer.go. 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":"internal/css_lexer/css_lexer.go"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d46b3feb2cbb6092df24a3f93143317d72b82cd5587692a6f5943192bb5fae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lexer.codePoint == \u0027e\u0027 || lexer.codePoint == \u0027E\u0027\u0060 appears character-identically in 2 files \u2014 internal/css_lexer/css_lexer.go, internal/js_lexer/js_lexer.go. 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":"internal/css_lexer/css_lexer.go"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b2e8320f6ea6b929a396f4dacd986c3541646d85d11670914d9e2e7cdc3de7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lexer.codePoint \u003E= \u00270\u0027 \u0026\u0026 lexer.codePoint \u003C= \u00279\u0027\u0060 appears character-identically in 2 files \u2014 internal/css_lexer/css_lexer.go, internal/js_lexer/js_lexer.go. 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":"internal/css_lexer/css_lexer.go"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cfad534a0fdb53f41e1728b13317db98b582c2df002b8eebb70c98b32ab5e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.options.ts.Parse \u0026\u0026 p.options.ts.Config.ExperimentalDecorators == config.True\u0060 appears character-identically in 2 files \u2014 internal/js_parser/js_parser.go, internal/js_parser/js_parser_lower_class.go. 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":"internal/js_parser/js_parser.go"},"region":{"startLine":6925}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3ddb0dfda85c1039e29eebec48bba7ba3b50277fe1b5970f9fea523533e5f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.suppressWarningsAboutWeirdCode || p.fnOrArrowDataVisit.tryBodyCount \u003E 0\u0060 appears character-identically in 2 files \u2014 internal/js_parser/js_parser.go, internal/js_parser/js_parser_lower.go. 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":"internal/js_parser/js_parser.go"},"region":{"startLine":13686}}}],"partialFingerprints":{"codehealthFindingId/v1":"91503270bb97bea54de5f4904eb0d67a8e01f0616e7ae2aadd73b59c67d52710"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r == \u0027\\n\u0027 || r == \u0027\\r\u0027 || r == \u0027\\u2028\u0027 || r == \u0027\\u2029\u0027\u0060 appears character-identically in 2 files \u2014 internal/js_parser/js_parser.go, internal/logger/logger.go. 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":"internal/js_parser/js_parser.go"},"region":{"startLine":13816}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae820352a4cab9e88189603d280ccbeeed22cccaf714798d724a0d20b7f4302"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.debugLogs != nil \u0026\u0026 originalError != nil\u0060 appears character-identically in 3 files \u2014 internal/resolver/package_json.go, internal/resolver/resolver.go, internal/resolver/yarnpnp.go. 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":"internal/resolver/package_json.go"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"358dacb35f590a3758a076b064f163f149b3eb9f0dfc0362baa7af78d08fade6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status == pjStatusExact || status == pjStatusExactEndsWithStar\u0060 appears character-identically in 2 files \u2014 internal/resolver/package_json.go, internal/resolver/resolver.go. 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":"internal/resolver/package_json.go"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ef46b0f3b5952e7d4de7ea9b7c4178746d6e3146106554e929d924b131a2b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060wrapLongLines \u0026\u0026 startLineLength\u002Bi \u003E= p.options.LineLimit\u0060 appears character-identically in 2 files \u2014 internal/css_printer/css_printer.go, internal/js_printer/js_printer.go. 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":"internal/css_printer/css_printer.go"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af565256e37cf6cd78df6189e85ac54275a73aefebefb5c024876384a648938"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!expectedStdout.length \u0026\u0026 !expectedStderr.length\u0060 appears character-identically in 2 files \u2014 scripts/end-to-end-tests.js, scripts/js-api-tests.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":"scripts/end-to-end-tests.js"},"region":{"startLine":9934}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a06d0646d19b72f37eb1e1ee543916533376765d09eeae0642c5749c3208a02"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctor === Error || ctor.prototype instanceof Error\u0060 appears character-identically in 2 files \u2014 scripts/terser-tests.js, scripts/uglify-tests.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":"scripts/terser-tests.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09964518f2bd77583a007e3898f143a66accd9d29a7b54d138e66994a7b26e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060label.name == \u0022expect_exact\u0022 || label.name == \u0022node_version\u0022\u0060 appears character-identically in 2 files \u2014 scripts/terser-tests.js, scripts/uglify-tests.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":"scripts/terser-tests.js"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"5459700514eb329adf439c9ac867273918044fcd0579473883870600ba713c2a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node instanceof U.AST_LabeledStatement \u0026\u0026 tw.parent() instanceof U.AST_Toplevel\u0060 appears character-identically in 2 files \u2014 scripts/terser-tests.js, scripts/uglify-tests.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":"scripts/terser-tests.js"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ece6b13a23567cd178a8cfddcabd1828bbaa716d92c5060289b5688bac4eb8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060res.statusCode \u003C 200 || res.statusCode \u003E 299\u0060 appears character-identically in 2 files \u2014 scripts/js-api-tests.js, scripts/plugin-tests.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":"scripts/js-api-tests.js"},"region":{"startLine":3966}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d5f335c8adbe24e53179563b0f2aef4df0989a6dfefea6568a4107f2f1c556"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027object\u0027 \u0026\u0026 value !== null\u0060 appears character-identically in 2 files \u2014 compat-table/src/compat-table.ts, lib/shared/common.ts. 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":"compat-table/src/compat-table.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f648f421a977e229236555e13e1e1343edbb4e643b1345bb6fdabc26ed66fc5"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/2 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: tryToInstantiateModule: \u0060tryToInstantiateModule\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shared/worker.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b8a294af7531158a54474b08332fa3093f7fcb40d5509fb84b7e27bf019933"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: downloadDirectlyFromNPM: \u0060downloadDirectlyFromNPM\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/npm/node-install.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68b6ba19ea9525f75c2956e8987fbab9d91cc99bc3e5ad26fb17e1370a3fde3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if ctxErr != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/cli/cli_impl.go"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"048644fb05d9cdec73ead06d938e0581678df60cb1ef2845c17e804297343387"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := res.Write(msg); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/api/serve_other.go"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dad352b80e2178b2a681a82ca9130b919a4511f5d65c2e26d92bf589b9e7a5"}},{"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":"lib/shared/common.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"1152ad7fbb4cd345342a856074a852da8640d198747e34c7304532b5d823d859"}},{"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":"lib/shared/common.ts"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"52371f3b87a1b3d4fb94ad6f492ccaa5c35bd54dc105ac3d777d9f8a953a21eb"}},{"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":"lib/shared/common.ts"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"e878364010f37a2f3536654f0947e34db81809483cb83bb1ac25e754c43d6187"}},{"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":"lib/shared/common.ts"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd877bbae775dfb5bb7426c09302217f9ca286124309ce4f037c80bc62e93f1"}},{"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":"lib/shared/common.ts"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"7945c3317b84ec5354c69c5f37a200a028dba6fbbbdb030b8c049f16fc9994e0"}},{"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":"lib/shared/common.ts"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"94924cfb0655b0157ebf6328d312abea69662e06d87ce4637018e6e7903b745e"}},{"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":"lib/shared/common.ts"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafc8b221a69fa933a8191aa4aed6206190358308ca9b3d48eaf5f5c18182501"}},{"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":"lib/shared/common.ts"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5588302dc6063f5027978a167bf435db651aafcbc74084cb3b684f473fde15"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/shared/common.ts"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb28f2162a8ef9d2bdb1419d94f34acc16c1f37c18ba9c4d11f4358e53ad1c7"}},{"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":"lib/npm/node-install.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4361dda471a5bac43dd60afc88cfc9762fb4994376d3efdbcd8ccb6f3c4b614c"}},{"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":"lib/npm/node-install.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b24d86ae15b6ba78acf88b6206fe243d7c1419a501a4cf489ddc2eba2c6c13"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/npm/node-install.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2b416a2fe3a2f70602a2c362bfa856fc0dd37a47d9d9ce52b58091e5f1f8f9"}},{"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":"lib/npm/node-install.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf17f55d6409da6ad0d97e0ce1180b62cb948e3efb16f788071733db3e27977"}},{"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":"lib/npm/node-platform.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"518d4398437b17d840842dea943d3f7daffb4fc5e52ecfd11d8fa3e57c543e2f"}},{"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":"lib/npm/node-platform.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b427ee0f682ceb27e3369c400174e4f9e1c6bc684dd2e39dbcd22357764f5364"}},{"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":"lib/npm/node-platform.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b572f1f0454117218ee3b21979bb47b39cbb638bca1c8c468618ef8916c4aa87"}},{"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":"lib/npm/node.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"38aceab2aa0f81056bee4bfeeb3e6cebded66d4475bae966605bb97bf7228ad7"}},{"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":"lib/npm/node.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"155c8bc039d67202d2d29fef7062a8eab060692eb429db589ca97ff2d7b8459d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fs/fs_real.go"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"2274ce17ed64dc4baa72e10700ce4aff86d94340f5d9bae8c7be93d2f884898d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fs/fs_real.go"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"245bd3ee2e41b4bda7389e0eccc1e674bb6a1fa539ca3a4e446d69982cd09917"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/config/config.go"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"325053a5a2b52c7eeefebccdf4841045b4ceef9862b6afdf7bee44aa67a48b43"}},{"ruleId":"X5","level":"note","message":{"text":"Strict null checking is not enabled everywhere the repository type-checks: 4/5 of this repository\u0027s type-checking configuration(s) turn on strict null checking (\u0060\u0022strict\u0022: true\u0060, or \u0060\u0022strictNullChecks\u0022: true\u0060). A configuration that states neither is counted as OFF, because off is tsc\u0027s own default; a solution-style one whose \u0060\u0022files\u0022\u0060 is empty and whose \u0060\u0022references\u0022\u0060 point at other projects is in neither number, because it checks no source itself. Where it is off, \u0060string\u0060 admits \u0060null\u0060 and \u0060undefined\u0060: passing a value that is null compiles silently and throws on the first property access."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8870f9ff7b17c2e14c5ba3bc13137b94673aad0b9498438c572dabb049852943"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~12.7 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 84 assertion(s) across the 6602 source line(s) of the 16 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: lib/shared/common.ts (49), lib/npm/node.ts (17), compat-table/src/css_table.ts (4). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}}],"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-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-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-242","guid":"5c147e5c-be37-b051-9928-764ef5a8f3d3","name":"CWE-242","shortDescription":{"text":"CWE-242"},"helpUri":"https://cwe.mitre.org/data/definitions/242.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-252","guid":"78915dc5-e486-f858-bc3c-aa570ad9010d","name":"Unchecked Return Value","shortDescription":{"text":"Unchecked Return Value"},"helpUri":"https://cwe.mitre.org/data/definitions/252.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-338","guid":"e89b7604-c3f7-8b53-bc8c-4d4718c28617","name":"Use of Cryptographically Weak Pseudo-Random Number Generator(PRNG)","shortDescription":{"text":"Use of Cryptographically Weak Pseudo-Random Number Generator(PRNG)"},"helpUri":"https://cwe.mitre.org/data/definitions/338.html"},{"id":"CWE-391","guid":"d9ef5687-8d79-9b51-b509-b83411fbcdc3","name":"Unchecked Error Condition","shortDescription":{"text":"Unchecked Error Condition"},"helpUri":"https://cwe.mitre.org/data/definitions/391.html"},{"id":"CWE-400","guid":"ca529a89-676d-8857-aac1-84359c77bb6c","name":"CWE-400","shortDescription":{"text":"CWE-400"},"helpUri":"https://cwe.mitre.org/data/definitions/400.html"},{"id":"CWE-476","guid":"df404eaf-4a12-445c-9306-241412f65220","name":"NULL Pointer Dereference","shortDescription":{"text":"NULL Pointer Dereference"},"helpUri":"https://cwe.mitre.org/data/definitions/476.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-665","guid":"fe279ff9-a979-f952-9df9-3f7d05af85d8","name":"CWE-665","shortDescription":{"text":"CWE-665"},"helpUri":"https://cwe.mitre.org/data/definitions/665.html"},{"id":"CWE-704","guid":"50bd74b4-a921-5159-8671-99fd7e78c810","name":"CWE-704","shortDescription":{"text":"CWE-704"},"helpUri":"https://cwe.mitre.org/data/definitions/704.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-908","guid":"ca1da1d1-5eaf-e95b-adbb-4eb2bc10b9fc","name":"CWE-908","shortDescription":{"text":"CWE-908"},"helpUri":"https://cwe.mitre.org/data/definitions/908.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":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_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":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"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/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"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-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-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"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":119,"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."]}]}