{"$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":"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":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"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":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"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":"Execution.constructor (cyclomatic 2972): Execution.constructor has cyclomatic complexity 2972 (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":"source/python.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7ee5986e639b6062be6233abadd05399dfa65d6f6bdb72546646d8620f118b"}},{"ruleId":"D1","level":"warning","message":{"text":"Dialect.parseDirective (cyclomatic 313): Dialect.parseDirective has cyclomatic complexity 313 (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":"source/mlir.js"},"region":{"startLine":9649}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3cb97f4c2ca6901d4a499f98ea6364e75ff836a3f197af8cdc896c21607572"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 309): Node.constructor has cyclomatic complexity 309 (threshold 15). Of this number, 259 points are the body\u0027s own statements and 50 belong to 15 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.js"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"755a3cb3b8f141e7ab7b27f67db48e7a2f3792b779be0ebe7b5c5da608b87e95"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 276): Node.constructor has cyclomatic complexity 276 (threshold 15). Of this number, 269 points are the body\u0027s own statements and 7 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/ncnn.js"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2810f6b5c9d3333337b75b7a7cc21dbc415b7aa4a23e977db74fead51c97b9"}},{"ruleId":"D1","level":"warning","message":{"text":"SPIRVDialect.parseOperation (cyclomatic 195): SPIRVDialect.parseOperation has cyclomatic complexity 195 (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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":17902}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6800b01a0e6e2ce5d7d6c257270913f764f5ce5093cb18a6d0f35777c059592"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 164): Graph.constructor has cyclomatic complexity 164 (threshold 15). Of this number, 136 points are the body\u0027s own statements and 28 belong to 8 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/gguf.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea760fdfe5c4fa577054eb45a1cd1aaf3a8302e340f265d6a163ad722e31f99"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.open (cyclomatic 148): ModelFactory.open has cyclomatic complexity 148 (threshold 15). Of this number, 92 points are the body\u0027s own statements and 56 belong to 17 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/keras.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b135e98cb977ec39e65b4710a0c16a518d353587e515c3da6e74f6f66da527d"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 136): Graph.constructor has cyclomatic complexity 136 (threshold 15). Of this number, 121 points are the body\u0027s own statements and 15 belong to 8 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/darknet.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cef11eb2df3e5a90c497ef7d90602861342632c995334e3c458ef287367237"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 128): Node.constructor has cyclomatic complexity 128 (threshold 15). Of this number, 108 points are the body\u0027s own statements and 20 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/keras.js"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"46491edc65495adce2d88f49118b874636d802dbe7130aa4b0216a963bb5500a"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 124): Graph.constructor has cyclomatic complexity 124 (threshold 15). Of this number, 119 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde944c7feab8425f327696cbdd4550d43e9eea63d486c82673c69c73e0e187b"}},{"ruleId":"D1","level":"warning","message":{"text":"next (cyclomatic 124): next has cyclomatic complexity 124 (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":"source/protobuf.js"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a677d41486b33c8d782bb3eec640e471f58058507d2f732200d47ce7abb06f13"}},{"ruleId":"D1","level":"warning","message":{"text":"LinalgDialect.parseOperation (cyclomatic 121): LinalgDialect.parseOperation has cyclomatic complexity 121 (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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":15989}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a8fd1000e8d3df769041ecf63fd66c7d88f4138c750a52026a0568e8e47ac6"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 118): Node.constructor has cyclomatic complexity 118 (threshold 15). Of this number, 114 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/openvino.js"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7615f50b17ab45e113d8af9b3e29666c57a1e70d5437db9af802b89b86299f1"}},{"ruleId":"D1","level":"warning","message":{"text":"SdfgDialect.parseOperation (cyclomatic 114): SdfgDialect.parseOperation has cyclomatic complexity 114 (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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":24920}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e4235d35a735a719c24a586808570c4c650ba01b749315b353a03b748b0cfb"}},{"ruleId":"D1","level":"warning","message":{"text":"Dialect.inferResultTypes (cyclomatic 111): Dialect.inferResultTypes has cyclomatic complexity 111 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":9360}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5ff3a8947808ca8d0d21950015e35ee8e056a52c656a6b77d72043fe563845"}},{"ruleId":"D1","level":"warning","message":{"text":"HALDialect.parseOperation (cyclomatic 107): HALDialect.parseOperation has cyclomatic complexity 107 (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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":13672}}}],"partialFingerprints":{"codehealthFindingId/v1":"79277300a20ee2c18ea191b63d99c04de7ee6ea5a0832949ce68107c21524eb2"}},{"ruleId":"D1","level":"warning","message":{"text":"Node._add (cyclomatic 100): Node._add has cyclomatic complexity 100 (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":"source/view.js"},"region":{"startLine":2825}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc449faf402e4880889df8ded66cc8f63635bfa9e9c1a091325304fc31f008f"}},{"ruleId":"D1","level":"warning","message":{"text":"TextReader.read (cyclomatic 99): TextReader.read has cyclomatic complexity 99 (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":"source/xml.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"321a84f7f8b8179afa5546e587988b898bae512418a6d209df4b5c0da400f753"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 99): Graph.constructor has cyclomatic complexity 99 (threshold 15). Of this number, 84 points are the body\u0027s own statements and 15 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"930410ffd4c9ddfce57de7e37b707188a0b3c3465033b267a22291ef53b5235c"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.match (cyclomatic 98): ModelFactory.match has cyclomatic complexity 98 (threshold 15). Of this number, 83 points are the body\u0027s own statements and 15 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5f2656f64b16523989e4b1bd92b9f8a8affcfae886db0fbf2abea989dbd652"}},{"ruleId":"D1","level":"warning","message":{"text":"Inference.infer (cyclomatic 96): Inference.infer has cyclomatic complexity 96 (threshold 15). Most of this is not in the body itself: 6 of the 96 points are its own statements and the rest belongs to 24 function items inside it that branch (a function literal at line 482, infer, a function literal at line 585, \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":"source/acuity.js"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1d5ca5f62adfc5fe684d7eeffe7a696c11c37916a3ffb7bff9d079c5438b3a"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 86): Node.constructor has cyclomatic complexity 86 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 37 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":"source/tf.js"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e62ef8b4105e4c25b86dd06b9eec3f1fd0cf60caf128bc98c5f98901ed53dad"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.peek (cyclomatic 83): Context.peek has cyclomatic complexity 83 (threshold 15). Of this number, 74 points are the body\u0027s own statements and 9 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":6783}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfa6fc85fd96d01323842cf1204d8565a363971c3daff5372c2f9dd63c24aa8"}},{"ruleId":"D1","level":"warning","message":{"text":"Tensor._decodeData (cyclomatic 81): Tensor._decodeData has cyclomatic complexity 81 (threshold 15). 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":"source/base.js"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ffff2ba19923c2411ae202663e77cf6e56747f222754b7f0eeaa0426722a10"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.graph::updateTorchScript (cyclomatic 81): Context.graph::updateTorchScript 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. This shape REPEATS in the file: 2 other methods here (Context.graph, Context.graph::updateTorchScript::match) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf.js"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"976f96735eb142a0d86d18b315b993393b133e44a882a390a359746782713a4a"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader.read (cyclomatic 80): Reader.read has cyclomatic complexity 80 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 18 belong to 10 function items inside it that branch. 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":"source/kmodel.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"6422e8918868b70ae9972b01be028a06741be7b235fe394df6b4b1222cfb7417"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 80): Graph.constructor has cyclomatic complexity 80 (threshold 15). Of this number, 68 points are the body\u0027s own statements and 12 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mxnet.js"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"8379c7bfef18acc2dbf4da5ac7317f365ab93314c3713246ff3540c5d6b6e507"}},{"ruleId":"D1","level":"warning","message":{"text":"Formatter._format (cyclomatic 79): Formatter._format has cyclomatic complexity 79 (threshold 15). Of this number, 69 points are the body\u0027s own statements and 10 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":"source/view.js"},"region":{"startLine":5526}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd5133ca5d22a3d026bc807296b948b2e9132d3fe130fdc76c5764f10adb312"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 79): Graph.constructor 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. This shape REPEATS in the file: one other method here (Graph.constructor::process_node) 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":"source/keras.js"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b9a223b7010bf5d1917d3b134a9fb0e4b9674cb710aa627c45b6a1b2d68221"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 76): Node.constructor has cyclomatic complexity 76 (threshold 15). Of this number, 72 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tnn.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3e4e2f734ed3e26a34be707ce9dd79950a979a5631b4fcdac9bb6fed36304f"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 74): Node.constructor 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. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70895ca16f8a5269763725084f610c915253f01301d371198f97c3092f0fb98"}},{"ruleId":"D1","level":"warning","message":{"text":"_tokenizeInline (cyclomatic 70): _tokenizeInline has cyclomatic complexity 70 (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":"source/view.js"},"region":{"startLine":5955}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe3a769fcd7bfe1ecdd7e128b830ffa9b98e764e94f1c255fa318685071ee55"}},{"ruleId":"D1","level":"warning","message":{"text":"ComputationNetwork.constructor (cyclomatic 69): ComputationNetwork.constructor has cyclomatic complexity 69 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 44 belong to 15 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/cntk.js"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50936d3452638620271d7996d68ea9f781a01e5c6691ab3748171ae572f07d1"}},{"ruleId":"D1","level":"warning","message":{"text":"ProtoReader.open (cyclomatic 69): ProtoReader.open has cyclomatic complexity 69 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 14 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx.js"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c2d8997a37552dc883fd06f3749965d373fc637f00dc7c476252c320337e69"}},{"ruleId":"D1","level":"warning","message":{"text":"dagre.dagre.layout::order (cyclomatic 66): dagre.dagre.layout::order has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 4 other methods here (dagre.dagre.layout, dagre.dagre.layout::order::buildLayerGraph, dagre.dagre.layout::position, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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":"source/dagre.js"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"46faf4c237d18f3930f93b5cbfaa3c2004ec99e8d7daf88ea3c7453166f88e37"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 66): Node.constructor has cyclomatic complexity 66 (threshold 15). Of this number, 64 points are the body\u0027s own statements and 2 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":"source/mxnet.js"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d51226bbf704bee7770d8e05d38b22af59e3f942f80d640256b3c4506b37dd2"}},{"ruleId":"D1","level":"warning","message":{"text":"Utility.weights (cyclomatic 65): Utility.weights has cyclomatic complexity 65 (threshold 15). Of this number, 62 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":"source/pickle.js"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fcea77b7a5a5ec5915596422f0881407edbc9adf58cd689622981fee32e1474"}},{"ruleId":"D1","level":"warning","message":{"text":"Tensor.constructor (cyclomatic 63): Tensor.constructor has cyclomatic complexity 63 (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":"source/onnx.js"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"387d930efd85157b85f33afdcbf6ddfe7f5e6717c7a277ea330a2609d5457bd5"}},{"ruleId":"D1","level":"warning","message":{"text":"Application._updateMenu (cyclomatic 62): Application._updateMenu has cyclomatic complexity 62 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 46 belong to 21 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":"source/app.js"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb096827cc94d7f29f96f16259502d53287c030a3bdc75860b7218bc6388b7f"}},{"ruleId":"D1","level":"warning","message":{"text":"Documentation.open (cyclomatic 62): Documentation.open has cyclomatic complexity 62 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 34 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":5327}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b5aa0dff85d6d206d9ca7167cd6ee7615eb1563f8c6ed80faf8c19b0e20ca0"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactoryService._unsupported (cyclomatic 61): ModelFactoryService._unsupported has cyclomatic complexity 61 (threshold 15). Most of this is not in the body itself: 4 of the 61 points are its own statements and the rest belongs to 13 function items inside it that branch (flatbuffers, pb::match, pb, \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":"source/view.js"},"region":{"startLine":7402}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d093ea1708a55c638b6e9c1a70fd45e0d039198c8346ae7e31b370ff01c389"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator._tokenize (cyclomatic 60): Generator._tokenize has cyclomatic complexity 60 (threshold 15). Of this number, 59 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":"source/view.js"},"region":{"startLine":5749}}}],"partialFingerprints":{"codehealthFindingId/v1":"5893b7bd9e1002e466a64928b342eb01e5912cc422ac4b2e929c5eb37757545b"}},{"ruleId":"D1","level":"warning","message":{"text":"Utility.weights (cyclomatic 60): Utility.weights has cyclomatic complexity 60 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 5 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":"source/pytorch.js"},"region":{"startLine":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb34d2fd2e2993ef7f35dd755d8d325aee0715a27a17eee3fbaa29fd60575b20"}},{"ruleId":"D1","level":"warning","message":{"text":"RewriterConfig.decodeJson (cyclomatic 60): RewriterConfig.decodeJson has cyclomatic complexity 60 (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":"source/tf-proto.js"},"region":{"startLine":12220}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3efedf37bc4871b81a936ccefc21669f909946ed451487cf425473edd20568"}},{"ruleId":"D1","level":"warning","message":{"text":"ProtoReader.read (cyclomatic 59): ProtoReader.read has cyclomatic complexity 59 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. 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":"source/onnx.js"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2223f09e3613d6d8bf5885db435adfe862140095e49a4588a4f58966e72cb58"}},{"ruleId":"D1","level":"warning","message":{"text":"Decoder.open (cyclomatic 58): Decoder.open has cyclomatic complexity 58 (threshold 15). Of this number, 56 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"source/text.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb852a66b9206b25ee43bbcc937a825d0c782a8bd96d8bc10501f2fea37e1675"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 58): Node.constructor has cyclomatic complexity 58 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 16 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/megengine.js"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d2e7e68faf79cbf1ce728292473ca0c0bd8667aa917976b9c50ea94260f16b"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 56): Graph.constructor has cyclomatic complexity 56 (threshold 15). Of this number, 51 points are the body\u0027s own statements and 5 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":"source/dot.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"191f5712c9e3819f1df85365fe9a109182547e1f5a19b2b8533c0b36ef48323b"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 56): Node.constructor 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":"source/om.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fb8e8f46fb9a6e1f2d506ba9f5dd42d080308c7566d9256ead5c242e0d0c17"}},{"ruleId":"D1","level":"warning","message":{"text":"AssemblyFormatParser.parseDirective (cyclomatic 55): AssemblyFormatParser.parseDirective 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. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":8473}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ff8bbfc3f28122a93096c9785f49c0f57802d5031177c8fe3a0c41e53ee4f9"}},{"ruleId":"D1","level":"warning","message":{"text":"TestDialect.parseOperation (cyclomatic 55): TestDialect.parseOperation has cyclomatic complexity 55 (threshold 15). Of this number, 48 points are the body\u0027s own statements and 7 belong to one function item 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":25944}}}],"partialFingerprints":{"codehealthFindingId/v1":"d518004b7a3290084b7bde255158a87b1dcade4f1c7bf6337ef5a23f043b4bb9"}},{"ruleId":"D1","level":"warning","message":{"text":"Execution.expression (cyclomatic 54): Execution.expression has cyclomatic complexity 54 (threshold 15). Of this number, 50 points are the body\u0027s own statements and 4 belong to one function item 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":"source/python.js"},"region":{"startLine":22217}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec82124286bbf7a274cb47956ee22d42a8e7d852d11436df4fef148c2f74743"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 54): Node.constructor has cyclomatic complexity 54 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 15 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":"source/cntk.js"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"48748b85176aead88c8a081e44db9c2fc3fbfde46f29de3f4e36e18354910a07"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 53): Node.constructor has cyclomatic complexity 53 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 12 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce76e728a822c71530ea4e5fd40bd6f4b72e30eaef620aecaeab1aab0c6885b7"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 53): Node.constructor has cyclomatic complexity 53 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 10 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":"source/circle.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c150f43cad127f69f8b1fa21b12191964e701279af0f92c7489c3df66faa974"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 53): Node.constructor has cyclomatic complexity 53 (threshold 15). Of this number, 47 points are the body\u0027s own statements and 6 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/rknn.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d67afb7a310d9e1557cca142dac5eaf4b328d856eaebec7b2b01f8f5903ac8"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.graph (cyclomatic 53): Context.graph 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 shape REPEATS in the file: 2 other methods here (Context.graph::updateTorchScript, Context.graph::updateTorchScript::match) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf.js"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"e922d2bd55243fe922cd83572665aba9b2a9b9deb639caef8c15055132bcfb17"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 53): Node.constructor has cyclomatic complexity 53 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 10 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":"source/tflite.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"20caec7458eb658c8a9b2d25e8cefeeca6d1d77a2a998abb8832b939ed915ab8"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 52): Graph.constructor has cyclomatic complexity 52 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 32 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":"source/executorch.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e847a573b188f0c26239bca2a1cf098084f437b1c88cca0b29a87b198d9c77f1"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 51): Graph.constructor has cyclomatic complexity 51 (threshold 15). Of this number, 47 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe.js"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c32c2e3e7ff60bf5a8b5c01c2ab94ff995c72759a1bd530288c4f36bb8f7b3"}},{"ruleId":"D1","level":"warning","message":{"text":"Tensor._context (cyclomatic 50): Tensor._context has cyclomatic complexity 50 (threshold 15). Of this number, 48 points are the body\u0027s own statements and 2 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":"source/base.js"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"9500c20cc5b39086e737a52425ac01d4a1eb5a0f1d71f4df72b812864e631680"}},{"ruleId":"D1","level":"warning","message":{"text":"VhloDialect.readType (cyclomatic 50): VhloDialect.readType has cyclomatic complexity 50 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":11839}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e0ff0e9723e453c0347a37eb600b99e883974d6480bca02d4fbece7b5f0781"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 50): Graph.constructor has cyclomatic complexity 50 (threshold 15). Of this number, 48 points are the body\u0027s own statements and 2 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":"source/paddle.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa7a0448eb4626093d823aaa19a8a2b25bebb51c9ac557f25d4f276335c14d7"}},{"ruleId":"D1","level":"warning","message":{"text":"BuiltinDialect.readAttribute (cyclomatic 49): BuiltinDialect.readAttribute has cyclomatic complexity 49 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":19653}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d77a7baaa6105cac0814c28df9cd3abac1e836aefe0ffc563c2e6082fd2395"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 49): Graph.constructor has cyclomatic complexity 49 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tvm.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeee5bb792e812da2888f9170754eb9b91fc1d65546ff0c59f5c093f925c151d"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 48): Node.constructor has cyclomatic complexity 48 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 31 belong to one function literal inside it that branches. 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":"source/paddle.js"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff88d2b24f06e5bbe1623bb7c7c45c029a1331ba4b0b234467cdc073fd2eb173"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 48): Node.constructor has cyclomatic complexity 48 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/sklearn.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"590beec6c7f2bce9c6f4fabca759e9ee61ee818ac83c73a844427029f14777d9"}},{"ruleId":"D1","level":"warning","message":{"text":"Execution.statement (cyclomatic 47): Execution.statement 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":"source/python.js"},"region":{"startLine":22083}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5012fdb50ec15ed325abc9d7afc4cfe9441af63f7cfc7e6935325b05edfb41f"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.model (cyclomatic 47): Graph.model has cyclomatic complexity 47 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d4185a603d4225cdfeceda1b7cfaeea7e5e5bcd73c20fa9c28c3fb87711714"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.parseAttribute (cyclomatic 47): Parser.parseAttribute has cyclomatic complexity 47 (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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":3735}}}],"partialFingerprints":{"codehealthFindingId/v1":"10db9fe773c9d7624cd163d11f7afa22acc4bc4c8c7ee72b24a0c0803d48978b"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.match (cyclomatic 47): ModelFactory.match has cyclomatic complexity 47 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 23 belong to 6 function items inside it that branch. 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":"source/openvino.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e27a10b5795f3183c32f0de8617c9250fd8382c72379b40a97af8d5a988d7fa"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 45): Graph.constructor has cyclomatic complexity 45 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. 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":"source/kmodel.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f913c7ff4240f47079d0891f804b5eb76f7cea426f6b0e51665cb89fdb3a16"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 45): Graph.constructor has cyclomatic complexity 45 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 20 belong to 6 function items inside it that branch. 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":"source/rknn.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"19161deedd1697e7190ea04dd59f559b3200c9033f7cfd1414ab75c42e10ed1a"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 45): Node.constructor has cyclomatic complexity 45 (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":"source/tosa.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff7d6fffaf644e1e0d4f855d3f1e191c3ee0d61fee6c13428a0c70ea6306d09"}},{"ruleId":"D1","level":"warning","message":{"text":"Tensor.constructor (cyclomatic 44): Tensor.constructor has cyclomatic complexity 44 (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":"source/tf.js"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cda481e6a01e11c1ab76adda11dd885ebdbe7125815fb1f3b8062151ff4fd5"}},{"ruleId":"D1","level":"warning","message":{"text":"Archive.open (cyclomatic 43): Archive.open has cyclomatic complexity 43 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 14 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/zip.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9576c6ac7fb3bae159f2d847497c12fb09b642da4e30fbbd7cc606cbaf50c8"}},{"ruleId":"D1","level":"warning","message":{"text":"TextReader._internalSubset (cyclomatic 43): TextReader._internalSubset 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":"source/xml.js"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cce9f1d91ccb86c95a77491658fe7c9ebb5052342cb230cde015b60751576c8"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 42): Graph.constructor has cyclomatic complexity 42 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 4 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":"source/caffe2.js"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"3526425177e4b02c945424cb21b4795a51cad1d49f1cbe28faa72640f83e4321"}},{"ruleId":"D1","level":"warning","message":{"text":"VMDialect.parseOperation (cyclomatic 42): VMDialect.parseOperation 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. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":23610}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3217f965e1e48c6ffaaa15658525f21f5f0d0341badd4a6b0a169ae041f120"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 42): Node.constructor has cyclomatic complexity 42 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 2 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":"source/onednn.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed4ba13c448e57b0f4676fa8038c146a97c525ff25b9331596ed9242c10b88a"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor::constant (cyclomatic 42): Graph.constructor::constant 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. This shape REPEATS in the file: one other method here (Graph.constructor) 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":"source/openvino.js"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"67add229ef63c22a786a392118ac069c4ac773a88ba15d97f382cac00718a765"}},{"ruleId":"D1","level":"warning","message":{"text":"View.refresh (cyclomatic 41): View.refresh 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. This shape REPEATS in the file: 2 other methods here (View.refresh::animateTransition, View.refresh::animateTransition::tick) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1402ab16e84ca8356f0e319119e534d0a3aa1f9c58ee5a56beff043d99c71f"}},{"ruleId":"D1","level":"warning","message":{"text":"FindSidebar._node (cyclomatic 41): FindSidebar._node has cyclomatic complexity 41 (threshold 15). Of this number, 40 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":"source/view.js"},"region":{"startLine":4962}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d0657734b2ac650f7af9d196d7e22c248074edec5c5e2e77a4838533daaf6f"}},{"ruleId":"D1","level":"warning","message":{"text":"Quantization.toString (cyclomatic 41): Quantization.toString 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":"source/view.js"},"region":{"startLine":5275}}}],"partialFingerprints":{"codehealthFindingId/v1":"8284201dbd4a07683a0c67542d8bc15873fb1fd0ed7f9bd99cfa0e985bc73d4e"}},{"ruleId":"D1","level":"warning","message":{"text":"BuiltinDialect.readType (cyclomatic 41): BuiltinDialect.readType has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":19534}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe219c582874f950b12fc848e2694389dbd78465300f5b94741eaa8a6a670d4"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.constructor (cyclomatic 41): Model.constructor 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":"source/onnx.js"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04919a481c154426d4eb906c20a99d3768091e9d36d48ca59fcd8836d79f3d1"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.lexToken (cyclomatic 40): Lexer.lexToken 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. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":2504}}}],"partialFingerprints":{"codehealthFindingId/v1":"616fce361c3c08105817245ad4bd18b5c1946e8d676a273aa2f5cdd73f51d2a2"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 40): Node.constructor has cyclomatic complexity 40 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. 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":"source/onnx.js"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f4bb93df8da88c7efe291cfd407e13b2f166719e44ee4daff531b7abc0a924"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 40): Graph.constructor 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. This shape REPEATS in the file: one other method here (Graph.constructor::constant) 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":"source/openvino.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1c4729de8d75d56912f0ddd33032d2afd9b9bfdfc1c9e12dc2e79122b6d930"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 40): Node.constructor has cyclomatic complexity 40 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"source/pickle.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd413696ef198e106b34bd4b7b8274a50309ba37be4d311293f26e248d99f81"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.add (cyclomatic 39): Graph.add has cyclomatic complexity 39 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 2 belong to one function item 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":"source/view.js"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"625c2ed6b498037f8963dcbcf84e0e2bd0b6014d4e50d457632196413d278ef5"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator._render (cyclomatic 39): Generator._render has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":6198}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7c3db5f2ac3517eb36f75fdd3acd85b95059667596984421b50b79f1cf4e21"}},{"ruleId":"D1","level":"warning","message":{"text":"Utility.dataType (cyclomatic 39): Utility.dataType has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"477b48655cc316cf3b23b806e3111866a149f46b7de82ca84f0a2fb1d580e1a7"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.match (cyclomatic 39): ModelFactory.match has cyclomatic complexity 39 (threshold 15). Of this number, 37 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/ncnn.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5901c469c749ebab8aec144c9b38e8ae2d1d2988f7f8a7f3dc0f42980ae94615"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.open (cyclomatic 38): ModelFactory.open has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 9 of the 38 points are its own statements and the rest belongs to 5 function items inside it that branch (openBinary::walkModel, openBinary, openBinary::walkProgram, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"03be76763ff6d0553dd47bf65b4aee7ad7896ab7a03daf40c66426acd0018b7b"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.open::requestManifest::parse (cyclomatic 38): ModelFactory.open::requestManifest::parse 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":"source/mxnet.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5b3ce982c3e136460168ae007326b09d374d79769e39777ed822ca457d39f1"}},{"ruleId":"D1","level":"warning","message":{"text":"Container.read (cyclomatic 38): Container.read has cyclomatic complexity 38 (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":"source/om.js"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5952582e9b1c63eded3f8831d61a6f8057cae9471348bd79a17ecebbb04363"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryReader.value (cyclomatic 37): BinaryReader.value has cyclomatic complexity 37 (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":"source/python.js"},"region":{"startLine":5262}}}],"partialFingerprints":{"codehealthFindingId/v1":"97605df9c594395e2bd919a97a168db7adcd64e613e1c1c2ab8fadf0ffd23731"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 37): Node.constructor 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":"source/dl4j.js"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"651f3b6546da3b239fca6445816f10987def8f43ca837b1edca212aafbe8cba8"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader.read (cyclomatic 37): Reader.read 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":"source/espresso.js"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c9dec33d8b2f31e84e02dbd8894814a28026e3cb8b3da4368decc1273e6aeb"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 37): Node.constructor has cyclomatic complexity 37 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 10 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mindir.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8a8505733dcad8b50e84b90366b1989286dece4e751682a36ddae754723178"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 36): Node.constructor has cyclomatic complexity 36 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 14 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe2.js"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48e82de4481553c630b27164c37538fe4262676c9c75437c94c5db6c172bbc8"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.constructor (cyclomatic 36): Model.constructor has cyclomatic complexity 36 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 6 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":"source/circle.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4158223206d327516459a4b45e9cc15f3e59b8c69a8d0f30885a15134f2600"}},{"ruleId":"D1","level":"warning","message":{"text":"View.start (cyclomatic 36): View.start has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 15 of the 36 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 69, 64, 59, \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":"source/view.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"18eaec131563fe1b452f4567813d4e20c1d697ab808950c323e459f4de07c4d7"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeSidebar.render (cyclomatic 36): NodeSidebar.render 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":3679}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fff2e86133dbb1cbbccbcdde57e4753b236efb0ae46aa55ce1b9e5ae53cdfa"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.parseNonFunctionType (cyclomatic 36): Parser.parseNonFunctionType has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":3492}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca4df8fe0e403d458f699856046a1c9e845f3ec3f53d31f9e1c6c86fdbdc1d4"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.constructor (cyclomatic 36): Model.constructor has cyclomatic complexity 36 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 6 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":"source/tflite.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b382f7b2754d7a026f602f97e99000f743d10719a51de955b014bf3b9013c75b"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.match (cyclomatic 36): ModelFactory.match has cyclomatic complexity 36 (threshold 15). Of this number, 34 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/transformers.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e87d65eb059589dfb196e54b14489216a0f274da4617290b8a87f1f2446a110"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 35): Node.constructor has cyclomatic complexity 35 (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":"source/bigdl.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba54a83c44ae28f11c40f3c356ac99fa5a9f091f4d5d1a61cf526fdc7f3ebba8"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 35): Graph.constructor has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 12 of the 35 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 187, 230, 237, \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":"source/circle.js"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba596184274a0adb98a2438d21059d57d0d79018509b8fc991827729ca9dacb"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 35): Node.constructor has cyclomatic complexity 35 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 2 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":"source/espdl.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ae06ab70f99d62f2c0fbc20eff5cb35d78fa3edb130d2131776ad59d31a542"}},{"ruleId":"D1","level":"warning","message":{"text":"VhloDialect.readAttribute (cyclomatic 35): VhloDialect.readAttribute has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":11956}}}],"partialFingerprints":{"codehealthFindingId/v1":"626239ef937e3845cd145a97b9bed08aec1cc966855f3e72bc55970d7fa6ba63"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 35): Graph.constructor has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 12 of the 35 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 195, 238, 245, \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":"source/tflite.js"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cb5eeb8998ec59431c11f2cbe450ab25792b13b4f7899fb803bc269d590e58"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentView.constructor (cyclomatic 34): ArgumentView.constructor has cyclomatic complexity 34 (threshold 15). Of this number, 32 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":3878}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bb231160aa3a3e633dd20fb57560b183669dbfd7a301c86b374ef77c45139d"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentationSidebar.render (cyclomatic 34): DocumentationSidebar.render has cyclomatic complexity 34 (threshold 15). Of this number, 30 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":"source/view.js"},"region":{"startLine":4752}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0ee60d643bd8d11c0855a85e1f5c93b3709f7e177685d484f21cdc80cf8b3d"}},{"ruleId":"D1","level":"warning","message":{"text":"BytecodeReader.parseAttributeDict (cyclomatic 34): BytecodeReader.parseAttributeDict has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":7966}}}],"partialFingerprints":{"codehealthFindingId/v1":"592d83439b6ae76b560285b28af277775817ef07dfaa91369a12563acdf8b5dd"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 34): Node.constructor 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":"source/mnn.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"df13ed84225793b4a5310b18b4353a461ccff39098e3ef43c7e94345a620e3e7"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonReader._attribute (cyclomatic 34): JsonReader._attribute has cyclomatic complexity 34 (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":"source/onnx.js"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"98df6ad580338d4fa2f9bc425a761a95da1817c2a822e91daa8f68b92985c973"}},{"ruleId":"D1","level":"warning","message":{"text":"IR.op (cyclomatic 34): IR.op has cyclomatic complexity 34 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 15 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d62b26df7d0fa508827684f0f1144a01dd724fbfabc6cce89cafc8d7dda8c49"}},{"ruleId":"D1","level":"warning","message":{"text":"Experimental.decodeJson (cyclomatic 34): Experimental.decodeJson has cyclomatic complexity 34 (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. This is NOT this file\u0027s highest cyclomatic complexity: RewriterConfig.decode (cyclomatic 40) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":9091}}}],"partialFingerprints":{"codehealthFindingId/v1":"209209ca7ceaa996e17f403da8e5805d8cec8c8255307db1d5e3fce1ab23e2c2"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 33): Graph.constructor has cyclomatic complexity 33 (threshold 15). Of this number, 27 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":"source/cntk.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"7379b273a43e8578408ac8fb4ce08d605a4ec4279725da7d8b5da66df5606861"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.match (cyclomatic 33): ModelFactory.match has cyclomatic complexity 33 (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":"source/coreml.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"80053546d629f59ddc965a0e2d6b760794bc1aafce05ae693ced217c232793bd"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.layout (cyclomatic 33): Graph.layout 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":"source/grapher.js"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"019d2e76a4e8323fdce7a6bf30a2b7b1d142b2d325e298fa044e0d467fb58177"}},{"ruleId":"D1","level":"warning","message":{"text":"Datatype.type (cyclomatic 33): Datatype.type has cyclomatic complexity 33 (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":"source/hdf5.js"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdabe265205e2a0222a46fcab589c11accb4d0588f3421dc0bbbaa02de2bda99"}},{"ruleId":"D1","level":"warning","message":{"text":"KrnlDialect.parseOperation (cyclomatic 33): KrnlDialect.parseOperation has cyclomatic complexity 33 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 7 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":16526}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f19f87acaf613b80468745a23ca936611089a636ba4428cb2eae9f212557286"}},{"ruleId":"D1","level":"warning","message":{"text":"TFRTDialect.parseOperation (cyclomatic 33): TFRTDialect.parseOperation 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":24415}}}],"partialFingerprints":{"codehealthFindingId/v1":"428ec34fd0788556cae1df9204c8895bbe5574555ceee88dc285a3a93c758e89"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.open (cyclomatic 32): ModelFactory.open has cyclomatic complexity 32 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. 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":"source/caffe2.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd48664b92b15cb584790a89c6ca6955c5c071aeb2230319e1f0a8186ce3f71f"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.node::weights (cyclomatic 32): Graph.node::weights 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 shape REPEATS in the file: one other method here (Graph.node) 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":"source/coreml.js"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a31a40f9a68820e76795fcb65dde5f704c6acb183a31a8dde1e68f5a66aef27"}},{"ruleId":"D1","level":"warning","message":{"text":"View.refresh::animateTransition (cyclomatic 32): View.refresh::animateTransition 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 shape REPEATS in the file: 2 other methods here (View.refresh, View.refresh::animateTransition::tick) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"773f45c164e5f7d0171cf188ced502f15b2b53aa1acb0cdd94eb654b87e17fae"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 32): Node.constructor has cyclomatic complexity 32 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/executorch.js"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a6c0736cd06a82856f392c7276b86f58b6523efa9a806fe62ae6353c8a1e05"}},{"ruleId":"D1","level":"warning","message":{"text":"Tensor.constructor (cyclomatic 32): Tensor.constructor has cyclomatic complexity 32 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 2 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. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4bc57028e1f1afca0a79484b285ee70a3e9d0192cfb5649a7043f6567521a1"}},{"ruleId":"D1","level":"warning","message":{"text":"PXADialect.parseOperation (cyclomatic 32): PXADialect.parseOperation has cyclomatic complexity 32 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":24733}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4766bd3cc42f358d8b9e7188938c9afb1f31f602b68da0aace161a3ab2a6f67"}},{"ruleId":"D1","level":"warning","message":{"text":"XlaDialect.parseOperation (cyclomatic 32): XlaDialect.parseOperation 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":28680}}}],"partialFingerprints":{"codehealthFindingId/v1":"661f119706b9b39964f7808a1f8f0f894e02e951c87cdfca6a1f8360b36944d6"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.match (cyclomatic 32): ModelFactory.match 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":"source/keras.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ca7977eeafc16cd7703d1d189b96c652518441e3e8c6c2eca230bf10b6bbf1"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 32): Node.constructor has cyclomatic complexity 32 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 3 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":"source/tengine.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e512c91794124a95708165534c09eb57d89bdbdab4a491bb50a5708552785227"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 31): Node.constructor has cyclomatic complexity 31 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"source/barracuda.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1d683825d098e9660c90cadfedbde9db29b843b34fff38230765d78e9018bc"}},{"ruleId":"D1","level":"warning","message":{"text":"Host.start (cyclomatic 31): Host.start has cyclomatic complexity 31 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 8 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":"source/browser.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f88eee9fded5d68ee38d1965b505bc1128699df15460c9f88c76b74b4ebd09"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 31): Node.constructor 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":"source/darknet.js"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0fdcafa207f61bc4e9455b047d8384c226153de4d8c6fe9a65b8c31dd8941c"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryReader._readBson (cyclomatic 31): BinaryReader._readBson has cyclomatic complexity 31 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/json.js"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f93700e26f339ca001570397f999d0e668f2dc3dbb9790c885c41ab2fea3a80"}},{"ruleId":"D1","level":"warning","message":{"text":"Container.read (cyclomatic 31): Container.read has cyclomatic complexity 31 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dlc.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f33dbd6b01fc5aa8437e29563767e674c77716c5ef103942bb619b58db3088a"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenMPDialect.parseBlockArgRegion (cyclomatic 31): OpenMPDialect.parseBlockArgRegion has cyclomatic complexity 31 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":21908}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c21ad55dc1138ba2afe498f6e3186544b173d1b986758e3f05e3e4c21500b48"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 31): Graph.constructor has cyclomatic complexity 31 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 7 belong to one function item 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":"source/tf.js"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2e9cd7d6342e3b345bb7bd1f600e47d4f554b7eb84f02a0c6d8b12f0f684c1"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.graph::updateTorchScript::match (cyclomatic 31): Context.graph::updateTorchScript::match 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 shape REPEATS in the file: 2 other methods here (Context.graph, Context.graph::updateTorchScript) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf.js"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"646c7d7935c8c819116f606dba1d3a0d6b1bf6d1d62603b2299183360341ef45"}},{"ruleId":"D1","level":"warning","message":{"text":"package.update (cyclomatic 30): package.update has cyclomatic complexity 30 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 13 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.js"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a98d32e5612a949c8ec5d3fec11f22895bb3fec01183a9cecd1df1a7b52326"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.program (cyclomatic 30): Graph.program 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. This shape REPEATS in the file: one other method here (Graph.program::convertValue) 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":"source/coreml.js"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07e8aa5fa7b37a06cbd45dd44e0922447b71ced893967cc2e252689958f4da5"}},{"ruleId":"D1","level":"warning","message":{"text":"Utf8.decode (cyclomatic 30): Utf8.decode 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":"source/text.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"168be6830c087a47c019423ebc82200718432e80bb4c0c0d9079128f5a27e8ad"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 30): Node.constructor has cyclomatic complexity 30 (threshold 15). Of this number, 26 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":"source/view.js"},"region":{"startLine":2779}}}],"partialFingerprints":{"codehealthFindingId/v1":"b658741ebb8afd82d5f3c023231ff384873f3cc22a86646db0f7d5386c46913e"}},{"ruleId":"D1","level":"warning","message":{"text":"TensorSidebar.render (cyclomatic 30): TensorSidebar.render has cyclomatic complexity 30 (threshold 15). Of this number, 25 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":"source/view.js"},"region":{"startLine":4508}}}],"partialFingerprints":{"codehealthFindingId/v1":"57426f15f5296b043301881bc05d7dd08546950f277c5bd5b3d1c28869c07a7e"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 30): Graph.constructor has cyclomatic complexity 30 (threshold 15). Of this number, 29 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":"source/mindir.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d4a20a0e474c61b5b2afd17c1b572fd24ceea6ea1c002a20388f39ae69ca21"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.program::convertValue (cyclomatic 29): Graph.program::convertValue 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. This shape REPEATS in the file: one other method here (Graph.program) 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":"source/coreml.js"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee68b3d745640ec29e39126a4b924eab428db89df1a118d2855ce22b98487f94"}},{"ruleId":"D1","level":"warning","message":{"text":"TextReader.read (cyclomatic 29): TextReader.read 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":"source/json.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e739362db258ed83de8356b0060de7af964ed17720a0d7a904a73b96f7afc3"}},{"ruleId":"D1","level":"warning","message":{"text":"Menu.constructor (cyclomatic 29): Menu.constructor has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 10 of the 29 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 1274, 1294, 1316, \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":"source/view.js"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc9adb1acfa46cd76f4dfc867fd708d603494c73c7f016dc16ada3f8cc48033"}},{"ruleId":"D1","level":"warning","message":{"text":"SerializedModel.constructor (cyclomatic 29): SerializedModel.constructor has cyclomatic complexity 29 (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":"source/pytorch.js"},"region":{"startLine":2286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bd7747dbf05406b9dd8192f586c228852e55fe2bbba3e6afe90727b9d7904b"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 29): Node.constructor has cyclomatic complexity 29 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 8 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":"source/hailo.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19c64203739bdf8a0628a50373c512c29441bf7fa94a4eb6c52fd00a15df506"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.constructor (cyclomatic 29): Model.constructor has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 13 of the 29 points are its own statements and the rest belongs to 3 function items inside it that branch (collectModules, formatPrefix, isFunc). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b63ad54f1c1c5efa1136ae6a70e37689d6bfeddfea35526361fc64dd223ca0"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.lexBareIdentifierOrKeyword (cyclomatic 29): Lexer.lexBareIdentifierOrKeyword 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. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":2749}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16e47c8c4612f15930559ee5d017dcb8f16b36bdf2c5be23d2f9d19dcad2c62"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader.read (cyclomatic 29): Reader.read has cyclomatic complexity 29 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tengine.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"2511d8db90c34b5101e934584d08a22e8fcff006cbec94dcee355835bf535b37"}},{"ruleId":"D1","level":"warning","message":{"text":"LayerResourceReader.constructor (cyclomatic 29): LayerResourceReader.constructor 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":"source/tnn.js"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61b55d3f7f56900abdae23f7a38654d4a406e647783e45019532eb3fb37e72a"}},{"ruleId":"D1","level":"warning","message":{"text":"ValueView.constructor (cyclomatic 28): ValueView.constructor 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":4059}}}],"partialFingerprints":{"codehealthFindingId/v1":"f848dea36070dccb77b63fdb74c10c761b5e320c74fddbadfc8d5e0917d47da9"}},{"ruleId":"D1","level":"warning","message":{"text":"Tensor.metrics (cyclomatic 28): Tensor.metrics 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":"source/view.js"},"region":{"startLine":6655}}}],"partialFingerprints":{"codehealthFindingId/v1":"5227d3176940188bc92bb2271a8d195be07f7fd9e2bf1f1253e68be30de82b36"}},{"ruleId":"D1","level":"warning","message":{"text":"ExportedProgram.read (cyclomatic 28): ExportedProgram.read 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":"source/pytorch.js"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"718f94a4b0c7baca3f5169334e4494163c334e277a086dbb2d147793e96721f9"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationParser.parseRegion (cyclomatic 28): OperationParser.parseRegion 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. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":5363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9590296753a6cd0c7ac49d255f06c66176ed6fe5eefa36633b503d3432421e0"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowDialect.parseShapedFunctionType (cyclomatic 28): FlowDialect.parseShapedFunctionType 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. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":14972}}}],"partialFingerprints":{"codehealthFindingId/v1":"802c1593ce9c78739ac1162675eba5b3c3ed40359721071a710835812ba6d2d8"}},{"ruleId":"D1","level":"warning","message":{"text":"TFLDialect.parseOperation (cyclomatic 28): TFLDialect.parseOperation 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. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":25391}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae2a52e86a85909366ed69ce7542024ea403099570145f2a82e15f5402a80f8"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 28): Node.constructor has cyclomatic complexity 28 (threshold 15). 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, 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":"source/mlnet.js"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c57302f56b2ae3c9de05c03617db3848b6c5b80b09f7e8990cee0c805be3f6b"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 28): Graph.constructor has cyclomatic complexity 28 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. 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":"source/ncnn.js"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba04294eed55ceb7af70cc348c0fc375873b4bb775874a035eaf37b319a3c64"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.constructor (cyclomatic 28): Model.constructor 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":"source/onnx.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0711e6e63b327207686bf4cbe3968172faccd5e6278f6b8174a875faa38a2933"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 28): Node.constructor has cyclomatic complexity 28 (threshold 15). Of this number, 27 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":"source/torch.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3108b97e69b1a689f2cc005f935215d927478a2a062f795cbc31e463c3071fd1"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.open (cyclomatic 27): ModelFactory.open has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 11 of the 27 points are its own statements and the rest belongs to 5 function items inside it that branch (openNetParameterText, a function literal at line 37, a function literal at line 55, \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":"source/caffe.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d4ac839acce8dd57074ec99e0a360a5754c4df11989a3ea069168039219ae3"}},{"ruleId":"D1","level":"warning","message":{"text":"DialectReader.readAPFloatWithKnownSemantics (cyclomatic 27): DialectReader.readAPFloatWithKnownSemantics has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":6882}}}],"partialFingerprints":{"codehealthFindingId/v1":"7083a130905084c7410a6ab670a6ebcf99f75368cf092c5d97c17873c7c1304d"}},{"ruleId":"D1","level":"warning","message":{"text":"BytecodeReader.parseOpWithoutRegions (cyclomatic 27): BytecodeReader.parseOpWithoutRegions has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":7857}}}],"partialFingerprints":{"codehealthFindingId/v1":"570ba28e988d3b6246f4b2f193de5faaeaea55410734437e3b690c6a969a919c"}},{"ruleId":"D1","level":"warning","message":{"text":"TextReader.open (cyclomatic 26): TextReader.open 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":"source/json.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"51373fbc4ddefbe027aea9ca35cfac11ad43cd7da082000c6732754515cfa1a9"}},{"ruleId":"D1","level":"warning","message":{"text":"Menu.register (cyclomatic 26): Menu.register has cyclomatic complexity 26 (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":"source/view.js"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbee9370f7076bddac69909abe5da007d3568373d88f9fcd8752a4b8da95f0d"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 26): Node.constructor 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":"source/dlc.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c1b5c76699f8a55b9c39eceb657e95a3bad8dedeade55dbe8d840dacaec5e3"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.graph (cyclomatic 26): Context.graph 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":"source/pytorch.js"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1f4bda192e5f0c102f3bc972f42fca477dcb989158c2b7f6f8083c56a54918"}},{"ruleId":"D1","level":"warning","message":{"text":"TorchDialect.parseOperation (cyclomatic 26): TorchDialect.parseOperation 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. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":13314}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8807137e44a9e9fbfda7aed672f5cc48578bd0e0b7e3f56e96340c88b3faeb"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor::loadGraph (cyclomatic 26): Graph.constructor::loadGraph 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":"source/megengine.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8e850de23a888b700b7c215a196492aee1f2484238ea36f86fd21305c76027"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.createAttribute (cyclomatic 26): Context.createAttribute 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":"source/onnx.js"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ab57984a5e7bb51b71d2acff6e1233e7f515842d9811e72e159948abcbf99c"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 26): Graph.constructor 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":"source/onnx.js"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1f66da26037104f2f052171b3c6edcfedc98bd61f4fe74621a8fd891c416f1"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.open (cyclomatic 26): ModelFactory.open has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 12 of the 26 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 181, child, edges, \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. This is NOT this file\u0027s highest cyclomatic complexity: TensorType.constructor (cyclomatic 35) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/openvino.js"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bac2f837fbab69390ea0beb4776b3252350190564b5df7d2295654f0901bad"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 26): Node.constructor has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"source/uff.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbf8645b4abb554baaf1db441e9a1f239692be8e980bfef260ace6ec87d7b9c"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 26): Node.constructor 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":"source/xmodel.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2947d3bfd418964158bd31b27026105ad4376319af3143ee0f0114fa5d064004"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.match (cyclomatic 25): ModelFactory.match 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":"source/caffe2.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"46acae1c473c4a83aa88140268750bab41cdd76b706347c7780123ded6eb524f"}},{"ruleId":"D1","level":"warning","message":{"text":"Datatype.read (cyclomatic 25): Datatype.read 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":"source/hdf5.js"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc857713c08df323339c06063e9c03f291b62e5d9675893bdb4e2762e7f1089b"}},{"ruleId":"D1","level":"warning","message":{"text":"ValueView.expand (cyclomatic 25): ValueView.expand 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":"source/view.js"},"region":{"startLine":4122}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd2412aca1c6cc8708bd34037e6bf539ff83843f69757666cd06e172a04ca3c"}},{"ruleId":"D1","level":"warning","message":{"text":"TargetSidebar.render (cyclomatic 25): TargetSidebar.render has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":4669}}}],"partialFingerprints":{"codehealthFindingId/v1":"c358b69dfd8c96cb8f865402e8eeb4d2848b4de115b98585231c9df57bd7b345"}},{"ruleId":"D1","level":"warning","message":{"text":"FindSidebar.render (cyclomatic 25): FindSidebar.render has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 3 of the 25 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 5158, 5129, 5206, \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":"source/view.js"},"region":{"startLine":5108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf4789ac04999e3caf3d00c28991d05c274ed72888fbe47fe1ed3749dfcf30b"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 25): Graph.constructor has cyclomatic complexity 25 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"source/dl4j.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa3b530eb5e644983b72237f3d050c04c3767421d29ef6656da57f01bfc7abd"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 25): Node.constructor has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 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":"source/dnn.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"27efcb07d2726d3f2489f2a8ee9fb8693857dc89d19781ec4b194caea52445c2"}},{"ruleId":"D1","level":"warning","message":{"text":"Tensor.constructor (cyclomatic 25): Tensor.constructor 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":"source/pytorch.js"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ef1413b771b9199f8baf2355bbdc3516d5089f260b471912c7f76cc1e95393"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.lexPrefixedIdentifier (cyclomatic 25): Lexer.lexPrefixedIdentifier 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":2785}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d8769c075898472eedc69e52c2892a6f3ea35ea2c062f7eff72f7316109c9a"}},{"ruleId":"D1","level":"warning","message":{"text":"TensorLiteralParser.getAttr::convertElement (cyclomatic 25): TensorLiteralParser.getAttr::convertElement 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 shape REPEATS in the file: one other method here (TensorLiteralParser.getAttr) 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. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":6510}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de8c2eecc839daf9a60764aea9747324123b5438e85508937a325bfa2a3e8da"}},{"ruleId":"D1","level":"warning","message":{"text":"Dialect.parseOperation (cyclomatic 25): Dialect.parseOperation 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":10563}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5929c86000db90dc5df0a83277f098e59b1935eecd2917533a52f4165ca6aa6"}},{"ruleId":"D1","level":"warning","message":{"text":"TestDialect.inferResultTypes (cyclomatic 25): TestDialect.inferResultTypes 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":26483}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf166501c52807518039415e5b5da2db9b17b629e9c87766cef3d8142cbd4298"}},{"ruleId":"D1","level":"warning","message":{"text":"Pickle.constructor (cyclomatic 25): Pickle.constructor 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 2 function items inside it that branch (filter, entries). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"711da3e73b316d527a393f175e65d927721ea5993e53cbab36ee4e2932c3ef7b"}},{"ruleId":"D1","level":"warning","message":{"text":"_parseAttribute (cyclomatic 25): _parseAttribute has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx.js"},"region":{"startLine":2269}}}],"partialFingerprints":{"codehealthFindingId/v1":"59cf08c659d7c034d0b120618d1af9214abbf035e3e290d5fc50dbf8c3483ee0"}},{"ruleId":"D1","level":"warning","message":{"text":"Telemetry.start (cyclomatic 24): Telemetry.start has cyclomatic complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 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":"source/base.js"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bf2482c6d346900a2351ce3bff1109934b1895b5260b547fc140b78902d731"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.updateTunnels::findTarget (cyclomatic 24): Graph.updateTunnels::findTarget 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 is NOT this file\u0027s highest cyclomatic complexity: TensorView.export (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":2205}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e71f33eaef1c35df9d34f030f15f86554fa0f5bdcb1da3bb27df0157462f731"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactoryService.open (cyclomatic 24): ModelFactoryService.open has cyclomatic complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: TensorView.export (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":7335}}}],"partialFingerprints":{"codehealthFindingId/v1":"667b895f65909c79e769858842d1c8fa572f92665dc378bcb89e0cc7c2a09545"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.match (cyclomatic 24): ModelFactory.match has cyclomatic complexity 24 (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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a081a97825bafbaa55fad303a7f05da1cd7af372146e264fdafe2cfe02fce021"}},{"ruleId":"D1","level":"warning","message":{"text":"Dialect.getOperation (cyclomatic 24): Dialect.getOperation 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":9096}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1200e0e45b93b0825529cf3e310b7ae9cadf2679c48a205d34a0a81878e7da"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenMPDialect.parseLoopNestOp (cyclomatic 24): OpenMPDialect.parseLoopNestOp 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":21487}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c98647ec2045fc3190ab97a22e58d135bb1d98fa8b61a4ba43f473db6745860"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenMPDialect.parseBlockArgClause (cyclomatic 24): OpenMPDialect.parseBlockArgClause 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":21804}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ee0d4cebb1ffe02005f81afc17e9776cff169dab8bccd47adcdf0fb3027808"}},{"ruleId":"D1","level":"warning","message":{"text":"LLVMDialect.parseLLVMInvokeOp (cyclomatic 24): LLVMDialect.parseLLVMInvokeOp 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":23181}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b75957da8e99b493a7301afcbd81df693f9c47692162c7783a2b89aad7fe1e"}},{"ruleId":"D1","level":"warning","message":{"text":"Object.constructor (cyclomatic 24): Object.constructor 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":"source/mediapipe.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebddaaadfe818ef6e622f1066132a2447a4dac14b7596d89e0e384a77153b64"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 24): Graph.constructor has cyclomatic complexity 24 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. 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":"source/onednn.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"28456e98928466cba9e2cd77b0eda085e2dac152bea4ba9ccdcf732a5fc80930"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.push (cyclomatic 24): Graph.push has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 10 of the 24 points are its own statements and the rest belongs to one function literal inside it that branches (line 1297). 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":"source/onnx.js"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35416b69f5a7ee4187241f0f7ec0f84b95d1ff767d6e0074664d32b58f8e9ef"}},{"ruleId":"D1","level":"warning","message":{"text":"Tensor.constructor (cyclomatic 24): Tensor.constructor 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":"source/pickle.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e4c98c87d7c4243fc117b13fafddf48e33e64fb371ae65c4a1471610f9354b"}},{"ruleId":"D1","level":"warning","message":{"text":"open (cyclomatic 24): open 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":"source/protobuf.js"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f29777ce8922c9dca26c700a34deb5deea6ee6b1b3c99bfebef7326c137902"}},{"ruleId":"D1","level":"warning","message":{"text":"TextReader._number (cyclomatic 23): TextReader._number 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":"source/json.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd84f49f3882e842d4978ecc835f4c85fa9d051269f6a71f53948c00fe5f7e4c"}},{"ruleId":"D1","level":"warning","message":{"text":"View.export (cyclomatic 23): View.export has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 7 of the 23 points are its own statements and the rest belongs to 3 function items inside it that branch (applyStyleSheet, a function literal at line 1017, a function literal at line 1013). 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. This is NOT this file\u0027s highest cyclomatic complexity: TensorView.export (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0bb49a9d865dbf82113185bfe0bc2e4fa688cbfb6d89993e978e474f2853fe"}},{"ruleId":"D1","level":"warning","message":{"text":"Value.build (cyclomatic 23): Value.build has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 5 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. This is NOT this file\u0027s highest cyclomatic complexity: TensorView.export (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":3199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9440719aa8b9462c5f7cb7a6edde3a7ba885fa4e7bf244d71c177772fbb8311"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.tags (cyclomatic 23): Context.tags 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 is NOT this file\u0027s highest cyclomatic complexity: TensorView.export (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":7106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b380ea235f2e57f043b3789d32d7633482268bbefa3587babecf19b95788a071"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 23): Graph.constructor has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function item 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":"source/dlc.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"040a5ba1a6ad580ba9a4a4f9d8c321abf54080bf53a157a014d75e1fdde70889"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.constructor (cyclomatic 23): Context.constructor 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":"source/espdl.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27bd0bb815d96842e1a3e349c83dfa2c00550ccbbaa972dd0d3fed8819575ab"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 23): Graph.constructor has cyclomatic complexity 23 (threshold 15). Of this number, 19 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":"source/hailo.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b595fdd2793baf31afed59501bfd39e89532e252e74471865e82e5251b9452b5"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.lexNumber (cyclomatic 23): Lexer.lexNumber has cyclomatic complexity 23 (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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":2660}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc094b3c874975bac2afab806806d45b73c6e1e44a87752afa8be5fb90f5d80"}},{"ruleId":"D1","level":"warning","message":{"text":"Constraint._parseEnum (cyclomatic 23): Constraint._parseEnum 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":8222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11d4ccd0451db3bc09fa230937fe7f5734e340dd5c18cbf762e59260c695de2"}},{"ruleId":"D1","level":"warning","message":{"text":"PCFDialect.parseParallelExecutionBody (cyclomatic 23): PCFDialect.parseParallelExecutionBody 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":15866}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c591f5e3cfc1408c4904659d695ecc60a7a9a92d5d6dcbec33f8caf2984d155"}},{"ruleId":"D1","level":"warning","message":{"text":"SparseTensorDialect.parseCoIterateOp (cyclomatic 23): SparseTensorDialect.parseCoIterateOp 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":20406}}}],"partialFingerprints":{"codehealthFindingId/v1":"8685c5a06c063b0d4b543642819050318887b2272649a435aedb1f16d843e9d7"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 23): Node.constructor 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":"source/mediapipe.js"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"6477693b4e77b91f903c93bdaf013a76b2a17749d85176efc8d40efe36e579e5"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelDef.constructor (cyclomatic 23): ModelDef.constructor 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 is NOT this file\u0027s highest cyclomatic complexity: OpDef.constructor (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/om.js"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bb7556ce7f4fe45503f2aad967cecf34662cf351f94dcadc1b0bf6a790168f"}},{"ruleId":"D1","level":"warning","message":{"text":"TensorProto.decodeJson (cyclomatic 23): TensorProto.decodeJson has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: RewriterConfig.decode (cyclomatic 40) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"d321a5d5ae4309f25badc3ef8d085427f5d34c43c3475fd35372d56f604f7d34"}},{"ruleId":"D1","level":"warning","message":{"text":"TensorBundle.constructor (cyclomatic 23): TensorBundle.constructor has cyclomatic complexity 23 (threshold 15). Of this number, 21 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf.js"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ee398fd53e0c82e111e0aeb1f3e228bbd9be7f337e31bdab1ff5011811592a"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.open (cyclomatic 23): ModelFactory.open has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 belong to one function item 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":"source/tosa.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f5d57dd69906fd5a9cde2a501363aa8f3e0b5b53e970a8469f9ef2559f46ee"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 22): Node.constructor 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":"source/armnn.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c9799baafb760d0c5f1e458de17503b27a22a8a726a4255547d1352eeac95d"}},{"ruleId":"D1","level":"warning","message":{"text":"Host.view (cyclomatic 22): Host.view has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 5 function items inside it that branch (consent, telemetry, a function literal at line 95, \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":"source/browser.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdaaa2705d82409adf4f5882c275b7dbf515e5c259842d3df1c17bd2daa179c"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 22): Node.constructor has cyclomatic complexity 22 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 10 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"505ad6cd42b1bc8e7fa30b8a4fac39d2731109872e50bdf42cffd996d079914d"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.node (cyclomatic 22): Graph.node 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 shape REPEATS in the file: one other method here (Graph.node::weights) 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":"source/coreml.js"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"377eda0dc4efe0db7e3bb4c32a4a799109a0c128e9a4bf43a46e1cd1361af4fc"}},{"ruleId":"D1","level":"warning","message":{"text":"dagre.dagre.layout::position (cyclomatic 22): dagre.dagre.layout::position 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 shape REPEATS in the file: 4 other methods here (dagre.dagre.layout, dagre.dagre.layout::order, dagre.dagre.layout::order::buildLayerGraph, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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":"source/dagre.js"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f347eb7241f6c9cad4c27d4698ad80677286ce64ce1e35548e74ab6022d4942"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.addTunnels::subgraphOuterRefs (cyclomatic 22): Graph.addTunnels::subgraphOuterRefs 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 is NOT this file\u0027s highest cyclomatic complexity: TensorView.export (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":2076}}}],"partialFingerprints":{"codehealthFindingId/v1":"2868f98d42a83592d96f7352d72c0a4e3149d0b0438545b425c742ee8eea3b2c"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.scrollTo (cyclomatic 22): Graph.scrollTo 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 is NOT this file\u0027s highest cyclomatic complexity: TensorView.export (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":2701}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a014d72c1a79c84217498b5188d8be29590f40edc6881b98b450a3a24fa75e"}},{"ruleId":"D1","level":"warning","message":{"text":"TargetSelector.update (cyclomatic 22): TargetSelector.update has cyclomatic complexity 22 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. 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 is NOT this file\u0027s highest cyclomatic complexity: TensorView.export (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":3556}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d1175154f12f8a5f5dc007f3d16d1231726199d40939ea30340485687542ed"}},{"ruleId":"D1","level":"warning","message":{"text":"Target.metrics (cyclomatic 22): Target.metrics 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 is NOT this file\u0027s highest cyclomatic complexity: TensorView.export (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":6606}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedd9b893eb947beb5bf22fe3099479b26b09514b8b9adadda3fafb895c3f36f"}},{"ruleId":"D1","level":"warning","message":{"text":"Container._params4 (cyclomatic 22): Container._params4 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":"source/dlc.js"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8bd565316f8d94fd79a99df69d1c57aaa3753547026ba54385ce0268c4bd82"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.build (cyclomatic 22): Context.build 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 shape REPEATS in the file: one other method here (Context.build::resolveBlock) 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":"source/gguf.js"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab9529b0a3949eb43cd31661af24905f75dcad749aa4ce36d7f2419454ceff7"}},{"ruleId":"D1","level":"warning","message":{"text":"AffineBinaryOpExpr.printAffineExprInternal (cyclomatic 22): AffineBinaryOpExpr.printAffineExprInternal 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"112eab68114283170e51425a1d83bf5c63606f700ef0791cabef5ffb0831317f"}},{"ruleId":"D1","level":"warning","message":{"text":"TensorLiteralParser.getAttr (cyclomatic 22): TensorLiteralParser.getAttr 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 shape REPEATS in the file: one other method here (TensorLiteralParser.getAttr::convertElement) 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. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":6485}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9576b2c8caf333dda3fff11754470ea420799bca8cc0ea829f9c752cff19bc"}},{"ruleId":"D1","level":"warning","message":{"text":"BytecodeReader.parseRegions (cyclomatic 22): BytecodeReader.parseRegions 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":7684}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e725e285c0e88a0ef5e8af038d7824cc0e5c87146249b8ee6c9319ac0ad87f2"}},{"ruleId":"D1","level":"warning","message":{"text":"Constraint._parseGeneric (cyclomatic 22): Constraint._parseGeneric 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":8277}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5b6883d2ed1d95e8ff442e6b106beeccd36d350d24d36e7a6c52c719d63131"}},{"ruleId":"D1","level":"warning","message":{"text":"GpuDialect.parseOperation (cyclomatic 22): GpuDialect.parseOperation 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":20608}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b2b5c33bce010c9613a034a82d4ead3eade083155d743817bd80ba8c47bd0c"}},{"ruleId":"D1","level":"warning","message":{"text":"NVVMDialect.parseMmaProperties (cyclomatic 22): NVVMDialect.parseMmaProperties 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":21211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78c72f40b787002abefd403f5d5faae9a4941eb5c5a76c6fb4a10d45ba87598"}},{"ruleId":"D1","level":"warning","message":{"text":"Module.constructor (cyclomatic 22): Module.constructor has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"source/message.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df49ec5082283fde145eb20635f9e34ad5d5e6823ad3023ffc2fb16562aaaf8"}},{"ruleId":"D1","level":"warning","message":{"text":"Module.constructor (cyclomatic 22): Module.constructor has cyclomatic complexity 22 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 11 belong to 4 function items inside it that branch. 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":"source/mlnet.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d4f624bb6152cd1f4121a8fecc96a6d26b7c7edd7c12e0a366d063cb76e49b"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 22): Graph.constructor has cyclomatic complexity 22 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 11 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: Utility.dataType (cyclomatic 23) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mnn.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"56888f2522c447a1832a3a5b765d8efbd16aefdff619148c5d9ed31115bf4907"}},{"ruleId":"D1","level":"warning","message":{"text":"Utility.weights::dict (cyclomatic 22): Utility.weights::dict 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":"source/numpy.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6b3059d7c02126c11dc41ef888f94df190ac1c4d278b64f79716d0c4ec2a6c"}},{"ruleId":"D1","level":"warning","message":{"text":"AttributeProto.decodeJson (cyclomatic 22): AttributeProto.decodeJson has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx-proto.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f4ef7f50e2ff85182ca6a4c14cc7709aaff10d90239bc18e228a1d6e900ee0"}},{"ruleId":"D1","level":"warning","message":{"text":"TextReader._parseAttributeValue (cyclomatic 22): TextReader._parseAttributeValue 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":"source/onnx.js"},"region":{"startLine":2340}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab64794a712f2bbff77e1df02f8f8ba5e8795b04392a47e17783e0310506ea06"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.open::openJson (cyclomatic 22): ModelFactory.open::openJson has cyclomatic complexity 22 (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 shape REPEATS in the file: one other method here (ModelFactory.open::openJson::openShards) 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":"source/tf.js"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ec03bd4687f3ebcde183b94546461f8b411b0148a462d38f18ce41ff60c752"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 22): Graph.constructor has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 4 belong to one function item 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":"source/tosa.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ef9aea1a76700a5d08e4deaca9e5ac1017598b363a65a8bc1ed87457887499"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 22): Graph.constructor 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":"source/uff.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c51c2b2418b3704305614ced6ca91454a74420cb9f726741e6f3d58a22ac2f6"}},{"ruleId":"D1","level":"warning","message":{"text":"inflateRaw (cyclomatic 22): inflateRaw 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":"source/zip.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c64992d4c534de2a690084d71014b7690993316948f8798e6bcdfa70421830f"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 21): Node.constructor 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":"source/acuity.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb789de36a9c7bdceff5b740880b9172286af744b878487f54ddd30d376d52c"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 21): Graph.constructor has cyclomatic complexity 21 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/armnn.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"500e75f95a6e5b00ba0db165dd47bf530d2ab64e87b3d5c03d8131ab134c39ae"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryReader.open (cyclomatic 21): BinaryReader.open 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":"source/flatbuffers.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70f014915e3f483ba5698eab515f07959527e8f839bcbbcc803e8a48a47badc"}},{"ruleId":"D1","level":"warning","message":{"text":"Configuration.read (cyclomatic 21): Configuration.read 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":"source/darknet.js"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0636b3544edf9a25a126f9be622ae59b8ec1bf4d493217356bca51acdd09f90"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.constructor (cyclomatic 21): Context.constructor has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 9 of the 21 points are its own statements and the rest belongs to 2 function items inside it that branch (registerSection, a function literal at line 1112). 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":"source/gguf.js"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec460893f30b8ff1fbf1eda0bc4e0538f7dcb5152439b9beb4284e87b8270eab"}},{"ruleId":"D1","level":"warning","message":{"text":"DenseArrayAttr.value (cyclomatic 21): DenseArrayAttr.value 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. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":1730}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3572687d6fe24fc49e74682591ddcc319f5a4c2ce9bf91c9300db8779d89ffe"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.parseDialectSymbolBody (cyclomatic 21): Parser.parseDialectSymbolBody 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. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":4275}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c875b0ea91c43eae5227c80e64f5de59c0f4b997035985eeda409ba05da7759"}},{"ruleId":"D1","level":"warning","message":{"text":"HLODialect.parseReduceOp (cyclomatic 21): HLODialect.parseReduceOp has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 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. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":11499}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b278e8995e67a36f6bb303f6a49bf4b0e35a834032284969fcb0e3a6b7f767"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 21): Node.constructor 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. This is NOT this file\u0027s highest cyclomatic complexity: Node.constructor::extractData (cyclomatic 31) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/kann.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9222382cdcee4e141c67cc9fcb19887eca613b4c8a345b37bb29eac1bd7e99f"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.open (cyclomatic 21): ModelFactory.open 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":"source/ncnn.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6fd3f5bac6aadf3960cc8d7db41b3045fce2e79a76d9561d0759ec84b25c5d"}},{"ruleId":"D1","level":"warning","message":{"text":"TextReader._parseLiteral (cyclomatic 21): TextReader._parseLiteral 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":"source/onnx.js"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27b6e96b49c3a952659845910d41ce06ec162a712e4dd1d7238e9cbdf434ceb"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.open::openProgram (cyclomatic 21): ModelFactory.open::openProgram has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This shape REPEATS in the file: one other method here (ModelFactory.open) 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. This is NOT this file\u0027s highest cyclomatic complexity: IR.getType (cyclomatic 22) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee6f880fd64f91a0d5902d9d3d262df68c0bde51954df93e4d996ad8d1be7d4"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.open (cyclomatic 21): ModelFactory.open has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This shape REPEATS in the file: one other method here (ModelFactory.open::openProgram) 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. This is NOT this file\u0027s highest cyclomatic complexity: IR.getType (cyclomatic 22) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5320b2788828aab982b348e867609a4bb632e8c873ee3f1439193f97e52d1d5"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 21): Node.constructor 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. This is NOT this file\u0027s highest cyclomatic complexity: Utility.dataType (cyclomatic 22) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/qnn.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"972dea440bdfd2186b75b1ab0cbb8fcc7f79de3aa4e03c06a2bf4dde2d094e3e"}},{"ruleId":"D1","level":"warning","message":{"text":"_parseTensor (cyclomatic 21): _parseTensor 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":"source/onnx.js"},"region":{"startLine":2465}}}],"partialFingerprints":{"codehealthFindingId/v1":"3268d6435877f1d24be0efa56f7e4ad1d097501f90516ddda3c374502a1c776e"}},{"ruleId":"D1","level":"warning","message":{"text":"Utility.featureType (cyclomatic 20): Utility.featureType has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c5f40ec36ccf1e0ef67576c87ed4c76bc61da2dc5f4a78405dfef394e5c677"}},{"ruleId":"D1","level":"warning","message":{"text":"dagre.dagre.layout::order::buildLayerGraph (cyclomatic 20): dagre.dagre.layout::order::buildLayerGraph has cyclomatic complexity 20 (threshold 15). 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. This shape REPEATS in the file: 4 other methods here (dagre.dagre.layout, dagre.dagre.layout::order, dagre.dagre.layout::position, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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":"source/dagre.js"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d297fe7fb97c6ea82336e1e349cd1e1b9b281490748795f4d08dd1f9173c611"}},{"ruleId":"D1","level":"warning","message":{"text":"TextReader._processingInstruction (cyclomatic 20): TextReader._processingInstruction 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":"source/xml.js"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea574ab8579aa2c39277bcaf313ac9b2e7062673969d59e62135b7733555b9bc"}},{"ruleId":"D1","level":"warning","message":{"text":"TextReader._next (cyclomatic 20): TextReader._next 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":"source/xml.js"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"d742380e41b074bc7d6a65275ab12ba55f8bfe75cb0a6cbabc095c97ef86bc1b"}},{"ruleId":"D1","level":"warning","message":{"text":"Datatype.constructor (cyclomatic 20): Datatype.constructor has cyclomatic complexity 20 (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":"source/hdf5.js"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d84096266108caf41bbfa2014c3097428d256290049653a25638d4b7a9026aa"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryReader.decode::decodeMessage (cyclomatic 20): BinaryReader.decode::decodeMessage 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 shape REPEATS in the file: one other method here (BinaryReader.decode) 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":"source/protobuf.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9cf6b377541c83c4cfa45cea7eeb56bae59601eb4934c541e54bef7621e53d"}},{"ruleId":"D1","level":"warning","message":{"text":"Menu._update (cyclomatic 20): Menu._update 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 is NOT this file\u0027s highest cyclomatic complexity: TensorView.export (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bc89cbee743d207ded969a5ffa73dbfbfaa7144b94bbd103d342226d875968"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.lexString (cyclomatic 20): Lexer.lexString 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":2702}}}],"partialFingerprints":{"codehealthFindingId/v1":"98872bec80e8350ebe565ce4347c6dc48d05b443f6dec2aa310cabddf9c69801"}},{"ruleId":"D1","level":"warning","message":{"text":"Constraint.parseListArgument (cyclomatic 20): Constraint.parseListArgument 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":8368}}}],"partialFingerprints":{"codehealthFindingId/v1":"e773e6981b5a3a2791843ea71de2b69e320efc9c985be90aedbe61a7237663c0"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 20): Node.constructor 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":"source/lasagne.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c519181e184f9ad44cf94432dd85aeb284353b333df1b186cbc565dbd87646cd"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.constructor (cyclomatic 20): Model.constructor has cyclomatic complexity 20 (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 is NOT this file\u0027s highest cyclomatic complexity: Tensor.constructor (cyclomatic 21) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/rknn.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e993bae9ee2c176de8a61360814dfdcb10ba95b19051b07ceb3c2428dd0275b9"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigProto.decodeJson (cyclomatic 20): ConfigProto.decodeJson has cyclomatic complexity 20 (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. This is NOT this file\u0027s highest cyclomatic complexity: RewriterConfig.decode (cyclomatic 40) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":8791}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda553fe4c3a651cd8a601f7539fdeb8d343de34f8425daa50a00761bf4c2fc6"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.match (cyclomatic 20): ModelFactory.match 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":"source/uff.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84854e5f076844027370b40f43e80c2d68f53eafb18457e029acd4ebb8fef97"}},{"ruleId":"D1","level":"warning","message":{"text":"_Graph.to_json (cyclomatic 20): _Graph.to_json 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":"source/pytorch.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"164ced1398aac0eab1e8e82e1d35febcd3f60486b998167364961172bd428a59"}},{"ruleId":"D1","level":"warning","message":{"text":"_Graph._argument_type (cyclomatic 20): _Graph._argument_type has cyclomatic complexity 20 (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":"source/pytorch.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75cd12ac8cd239838b92a5d5c89115bc8774205c7749658a77480c5d689dcb4"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor::map (cyclomatic 20): constructor::map 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":"source/circle.js"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b5caace4d210c76fe3f4d6a4b05e8589dac3501ac2dd12821d3e68ea50e227"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor::map (cyclomatic 20): constructor::map has cyclomatic complexity 20 (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. This is NOT this file\u0027s highest cyclomatic complexity: constructor (cyclomatic 32) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/executorch.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9306e966af61196f4746b3748417d42ea11d0993050d5c9ab14f22a4f86ab15a"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor::map (cyclomatic 20): constructor::map 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":"source/tflite.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b0ad4aa0c57dd515671e5f4165a926b55b3b5a0a83739564ffb585e5f04c66"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 19): Graph.constructor has cyclomatic complexity 19 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 7 belong to 2 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":"source/acuity.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ae09f6a8b39c8c16f183c97b78fe8da1afa4b6745c2f875bf6914d8c74e114"}},{"ruleId":"D1","level":"warning","message":{"text":"Execution.import (cyclomatic 19): Execution.import 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 is NOT this file\u0027s highest cyclomatic complexity: Execution.constructor::arg_type (cyclomatic 27) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":21843}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ff1b39e605d45c319e7662d4cc1a60dcab46978960f8bcf6a89d4c6b8aa7fc"}},{"ruleId":"D1","level":"warning","message":{"text":"Archive.constructor (cyclomatic 19): Archive.constructor 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":"source/zip.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80c04087071fc307a9b476992c3aa4c53a33700037a11db63e950886e200510"}},{"ruleId":"D1","level":"warning","message":{"text":"View.open (cyclomatic 19): View.open has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: TensorView.export (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"5274a305ff74962bc1050b4622ce45e20ee1ab1a69a2fb724368c93c80637be5"}},{"ruleId":"D1","level":"warning","message":{"text":"Container._model3 (cyclomatic 19): Container._model3 has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to one function item inside it that branches (updateAttribute). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: Container._model4::dataType (cyclomatic 22) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dlc.js"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a05d47ff99ba3c85cb2f2be42805035efad1fbdd1a1bfa4844cdbe2fd1ed45b"}},{"ruleId":"D1","level":"warning","message":{"text":"data_pkl.open (cyclomatic 19): data_pkl.open 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 is NOT this file\u0027s highest cyclomatic complexity: Utility.toType (cyclomatic 24) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.js"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce88442d8e729444571a30f6d7707e19c604db2fb348aaf69ddfd41a0b6fcc9"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 19): Graph.constructor has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to one function item inside it that branches (deserialize). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/hickle.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35d8e09180e303ea6836749da4f7e97ab219b86b868cea542aad0f7e66c866a"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationParser.parseOperation (cyclomatic 19): OperationParser.parseOperation has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to one function item 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":5023}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c777452a3d182f651416f89c63a8a438bab34c779cf1701816334a2dc428109"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationParser.parseBlock (cyclomatic 19): OperationParser.parseBlock 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":5319}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba999301044139bc28173f22da879c839108e2b1077cd7fc14c761fd930be30a"}},{"ruleId":"D1","level":"warning","message":{"text":"Dialect.parsePropertiesFromKeyValueList (cyclomatic 19): Dialect.parsePropertiesFromKeyValueList 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":9602}}}],"partialFingerprints":{"codehealthFindingId/v1":"74428c75337fdcccd78a691969541c2784b25a5880205812c285ee157bea1be5"}},{"ruleId":"D1","level":"warning","message":{"text":"Dialect.parseDynamicIndexList (cyclomatic 19): Dialect.parseDynamicIndexList has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":10740}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd005209828f6a67241d827d90a02f055bb1ee50259104888a8e2cbc2b3e648"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorDialect.parseOperation (cyclomatic 19): VectorDialect.parseOperation 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":12708}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9e1dfe09cdc876507f17019d380b5ac185412468769ac0996d1b9f309ce070"}},{"ruleId":"D1","level":"warning","message":{"text":"LinalgDialect.parseCommonStructuredOpParts (cyclomatic 19): LinalgDialect.parseCommonStructuredOpParts 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":16164}}}],"partialFingerprints":{"codehealthFindingId/v1":"16287477af1dc829f446ea4850229d6246f8047f73d0f93d20257abfadeba152"}},{"ruleId":"D1","level":"warning","message":{"text":"LLVMDialect.getInsertExtractValueElementType (cyclomatic 19): LLVMDialect.getInsertExtractValueElementType 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":22500}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a4cad1ec3425cd862f0f00aa7a0a4bf06a1b73a74c8deac8fe4ae274bd8d21"}},{"ruleId":"D1","level":"warning","message":{"text":"LLVMDialect.parseLLVMLoadOp (cyclomatic 19): LLVMDialect.parseLLVMLoadOp 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":22757}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9f5e4fb88c080e2480fe9fd7161b75a68c2e19179207e35c5f49f7934cc730"}},{"ruleId":"D1","level":"warning","message":{"text":"XlaGpuDialect.parseOperation (cyclomatic 19): XlaGpuDialect.parseOperation 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":28814}}}],"partialFingerprints":{"codehealthFindingId/v1":"b742c5ef4f62f23c3884f6a2b624abe0b0e480827a1fad89fdd3cdd797502dab"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 19): Graph.constructor has cyclomatic complexity 19 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 6 belong to 2 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":"source/mediapipe.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fed9a06c197fd1f734a28b978df7f81537cbd04f5d0ff89ede275486b1b9b9d"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 19): Node.constructor has cyclomatic complexity 19 (threshold 15). Of this number, 16 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. This is NOT this file\u0027s highest cyclomatic complexity: TensorType.constructor (cyclomatic 45) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mslite.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"053bd7b5be8ad0ea5acd8a3172fd1ccd566436bca8be615e589cbb3459ff5143"}},{"ruleId":"D1","level":"warning","message":{"text":"TensorProto.decodeJson (cyclomatic 19): TensorProto.decodeJson has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: AttributeProto.decode (cyclomatic 21) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx-proto.js"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ebd3e1f5fa7d9f55711dbe11835bdb134b90ca84113e7695782bce30542263"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.match (cyclomatic 19): ModelFactory.match has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: IR.getType (cyclomatic 22) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7ae139f1c28fcad5f68dc6470e6ad637ffcd20aa7a3c3931d499fbc221aab1"}},{"ruleId":"D1","level":"warning","message":{"text":"IR.getAttr (cyclomatic 19): IR.getAttr has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: IR.getType (cyclomatic 22) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7a0ed9a5eb4404bce6f255da4b24ca8d09c815be8501fb0c140d997bbc6f23"}},{"ruleId":"D1","level":"warning","message":{"text":"Experimental.decodeJson (cyclomatic 19): Experimental.decodeJson has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: RewriterConfig.decode (cyclomatic 40) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":8073}}}],"partialFingerprints":{"codehealthFindingId/v1":"932e964b6ba8fd6aaf9d540db0ef5f4a463d394ab2b14a41947ce3bbe07e5518"}},{"ruleId":"D1","level":"warning","message":{"text":"content (cyclomatic 19): content has cyclomatic complexity 19 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 5 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":"source/view.js"},"region":{"startLine":4252}}}],"partialFingerprints":{"codehealthFindingId/v1":"78980b468ab0b444d1b6a014ad2a79cedd8ca5b520fd1966f7f95571318dd3aa"}},{"ruleId":"D1","level":"warning","message":{"text":"Execution.call (cyclomatic 18): Execution.call 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 is NOT this file\u0027s highest cyclomatic complexity: Execution.constructor::arg_type (cyclomatic 27) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":22010}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f7bfc8a641a9de70ecea6ff839bca3e4d2e540b3463165e89ecf23cbe95a1d"}},{"ruleId":"D1","level":"warning","message":{"text":"dagre.dagre.layout::position::buildBlockGraph (cyclomatic 18): dagre.dagre.layout::position::buildBlockGraph 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 shape REPEATS in the file: 4 other methods here (dagre.dagre.layout, dagre.dagre.layout::order, dagre.dagre.layout::order::buildLayerGraph, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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":"source/dagre.js"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e1a4ae2db81c802d1a34fd57bcc70ab7a78133676c90f38ef7f0f618779fb8"}},{"ruleId":"D1","level":"warning","message":{"text":"Variable.data (cyclomatic 18): Variable.data 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 is NOT this file\u0027s highest cyclomatic complexity: DataObjectHeader._readMessage (cyclomatic 20) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/hdf5.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1907bb418a5ac625f68245519607e69d8c2d1df0f794fec587241b9518a8c91a"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryReader.decode (cyclomatic 18): BinaryReader.decode 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 shape REPEATS in the file: one other method here (BinaryReader.decode::decodeMessage) 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":"source/protobuf.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"808838458ab951534be584ce721da02af52ace3a4119420c92bc0f1dd477244a"}},{"ruleId":"D1","level":"warning","message":{"text":"View.refresh::animateTransition::tick (cyclomatic 18): View.refresh::animateTransition::tick 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 shape REPEATS in the file: 2 other methods here (View.refresh, View.refresh::animateTransition) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file\u0027s highest cyclomatic complexity: TensorView.export (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e64270f5dee9e9edb37c02996c729b9aee0b4f58238e22e1ee12b007bd2d54c"}},{"ruleId":"D1","level":"warning","message":{"text":"PrimitiveView.constructor (cyclomatic 18): PrimitiveView.constructor 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 is NOT this file\u0027s highest cyclomatic complexity: TensorView.export (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":3951}}}],"partialFingerprints":{"codehealthFindingId/v1":"6617db1866aaf1b4a57ce5e707d86b7d43e9149dd223d92bce966ef2d1c328ac"}},{"ruleId":"D1","level":"warning","message":{"text":"FindSidebar._value (cyclomatic 18): FindSidebar._value has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: TensorView.export (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":4920}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87e4a09b23656a56df4d37a3e51502e9af20a29aaba79f820f12949142df9f5"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.read (cyclomatic 18): Context.read 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 is NOT this file\u0027s highest cyclomatic complexity: TensorView.export (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":7028}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb1b6c74fa8eb43eb6761ea0242f3055996963015063428560bec7b8d26e21d"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactoryService._openEntries (cyclomatic 18): ModelFactoryService._openEntries has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 4 function items inside it that branch (filter, a function literal at line 7764, rootFolder::rotate, \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. This is NOT this file\u0027s highest cyclomatic complexity: TensorView.export (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":7754}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef6d5b59ad29baed85aa1257ce99d8becc9e91577297d7bbb8369e667408503"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 18): Graph.constructor has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. 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":"source/dnn.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7d6a526a73a26483831164d505d2ee738df15eebb18ddca9bac984ea10f9c3"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parseBlock (cyclomatic 18): Parser._parseBlock 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":"source/dot.js"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"388b3afb361c70a630e6e2d34a4ab228e0c891b15c21ae82cc254ca9110c0f41"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader.read (cyclomatic 18): Reader.read has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: TensorType.constructor (cyclomatic 32) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/executorch.js"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fbb2e5e0f790f89bb6ac54f38eac610adbd9cb31c2ec9e154ad2cf5de59d12"}},{"ruleId":"D1","level":"warning","message":{"text":"Constraint.tokenize (cyclomatic 18): Constraint.tokenize 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":8104}}}],"partialFingerprints":{"codehealthFindingId/v1":"17135ee1f032f3e22e948abc7c63555ec7a36b930c44094d18ce59def67599ba"}},{"ruleId":"D1","level":"warning","message":{"text":"Constraint.parseTokens (cyclomatic 18): Constraint.parseTokens 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":8161}}}],"partialFingerprints":{"codehealthFindingId/v1":"616363c1394c518588a3a7e6f484512d8ef8c68543a2216a65b4e4815818416c"}},{"ruleId":"D1","level":"warning","message":{"text":"AffineDialect.parseOperation (cyclomatic 18): AffineDialect.parseOperation has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":12092}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef2237f93333bcfc11e3d976619dd17cbf610d85fbe2338b99f21bbea336cd5"}},{"ruleId":"D1","level":"warning","message":{"text":"SPIRVDialect.parseSwitchOpCases (cyclomatic 18): SPIRVDialect.parseSwitchOpCases 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 shape REPEATS in the file: one other method here (CFDialect.parseSwitchOpCases) 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. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":17828}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec5de0f1d3415fda5fefaf1cc2dd96633089609c6bc10e331ac40f9d5746f5b"}},{"ruleId":"D1","level":"warning","message":{"text":"CFDialect.parseSwitchOpCases (cyclomatic 18): CFDialect.parseSwitchOpCases 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 shape REPEATS in the file: one other method here (SPIRVDialect.parseSwitchOpCases) 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. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":18765}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c34421b985dd8b28fd8ab29784c434c5bc8e2a177b230092e36336dce32b06"}},{"ruleId":"D1","level":"warning","message":{"text":"BufferizationDialect.parseOperation (cyclomatic 18): BufferizationDialect.parseOperation 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":19856}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f71c8504530508b4b1ece36b741e6f9aba311492ba19850abbf395de6a4ce7a"}},{"ruleId":"D1","level":"warning","message":{"text":"NVVMDialect.parseOperation (cyclomatic 18): NVVMDialect.parseOperation 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":21100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec7615c9a4c9b1b4433d4cade1c98008614c9c7af92a846d38d53e9b3bbf2b2"}},{"ruleId":"D1","level":"warning","message":{"text":"TFRTTestDialect.parseOperation (cyclomatic 18): TFRTTestDialect.parseOperation 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":27458}}}],"partialFingerprints":{"codehealthFindingId/v1":"6671b31ffb4305213f05c539a2cc31b24230b16d30ad58eae1b444f79f16d750"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor::process_node (cyclomatic 18): Graph.constructor::process_node 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 shape REPEATS in the file: one other method here (Graph.constructor) 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":"source/keras.js"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"29317f1f3b34128001048a5ae1c3cc7d1ffb2dab0519a8f4b7fe37bb075b1229"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 18): Graph.constructor has cyclomatic complexity 18 (threshold 15). Of this number, 15 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":"source/lasagne.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5a94ad349f9bcf5986e7120f9ec58eee38102d1eab572ece1b01d7156217a0"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 18): Graph.constructor has cyclomatic complexity 18 (threshold 15). Of this number, 16 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 is NOT this file\u0027s highest cyclomatic complexity: OpDef.constructor (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/om.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a4637e1ec45733c9150e2edcccb999c380dfeffffc8675eb22c307e722ec86"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.createType (cyclomatic 18): Context.createType has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 4 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":"source/onnx.js"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2672e82c01df7a3a33f1a8015b0e6c4ccdeb122dd0b3489a2687d1069ba95f9"}},{"ruleId":"D1","level":"warning","message":{"text":"TensorProto.decodeJson (cyclomatic 18): TensorProto.decodeJson has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"source/pytorch-proto.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"426bccd93761a8d9c25d7c16e1ddd735e08e57c5599f7d7857a8ba105f1e6e52"}},{"ruleId":"D1","level":"warning","message":{"text":"StructuredValue.decodeJson (cyclomatic 18): StructuredValue.decodeJson has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: RewriterConfig.decode (cyclomatic 40) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":4884}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c43ed702d6b8eb7a30b22236906c8becc8b0bf639cba5e726046d3fe35ff53"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeExecStats.decodeJson (cyclomatic 18): NodeExecStats.decodeJson has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: RewriterConfig.decode (cyclomatic 40) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":11090}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1debc9b8b6c569d9dc5b23582385689be5747679a6e1e1aebc7efc00532a001"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor::map (cyclomatic 18): constructor::map has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: constructor (cyclomatic 35) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/openvino.js"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe3e03729c1712999fbf12b8a8d257962ba00c160da437bb83fd8c18559e00e"}},{"ruleId":"D1","level":"warning","message":{"text":"Tensor._stringify (cyclomatic 17): Tensor._stringify 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":"source/base.js"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"749d5f16bb98844802b6c53f8d3fc1d7fbd8f6eb0e6ec63816ffccabb7389c8d"}},{"ruleId":"D1","level":"warning","message":{"text":"Host.constructor (cyclomatic 17): Host.constructor has cyclomatic complexity 17 (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":"source/browser.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c356b935b5ffb66fefa97469076e3ee2c11f9459e761c2b56b34398521d4ac7"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.constructor (cyclomatic 17): Context.constructor 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":"source/coreml.js"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd1fb1237317550528a6a67b27f688c18155f69fe8d49713f71df8d80bc2c5e"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.updateClassifierOutput (cyclomatic 17): Graph.updateClassifierOutput 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":"source/coreml.js"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1352b964f2d7b1f56d191594c192ddb23efee0ced7633528d126ea504f4e11"}},{"ruleId":"D1","level":"warning","message":{"text":"Formatter.tensor (cyclomatic 17): Formatter.tensor has cyclomatic complexity 17 (threshold 15). Of this number, 15 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 is NOT this file\u0027s highest cyclomatic complexity: TensorView.export (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":5651}}}],"partialFingerprints":{"codehealthFindingId/v1":"1017bb336898ab21922b5805a76dcafca3a8299c677ec725e8d0b62e0da5864b"}},{"ruleId":"D1","level":"warning","message":{"text":"Container._model4 (cyclomatic 17): Container._model4 has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Container._model4::dataType (cyclomatic 22) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dlc.js"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dcbbe2928f2bda880817c2ff1e4e5762d776d6fd447be404fcbb6ed1a17a20"}},{"ruleId":"D1","level":"warning","message":{"text":"TensorType.constructor (cyclomatic 17): TensorType.constructor has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/espdl.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"7169c8cf78bf2f1209e8c2514a1034a29f72258629d432453ae69e194775849f"}},{"ruleId":"D1","level":"warning","message":{"text":"Utility.unpack (cyclomatic 17): Utility.unpack has cyclomatic complexity 17 (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. This is NOT this file\u0027s highest cyclomatic complexity: Utility.toType (cyclomatic 24) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.js"},"region":{"startLine":2061}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0f40c6907a68703226f3f790ccfb27349ae998cf4c49950534ca448dacb813"}},{"ruleId":"D1","level":"warning","message":{"text":"Constraint.parseArgumentTokens (cyclomatic 17): Constraint.parseArgumentTokens 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":8335}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1b6981fc039610fe8b5c1700adddc5dc6003a40f42600ce1bd666f01406c6b"}},{"ruleId":"D1","level":"warning","message":{"text":"UtilDialect.parseUtilFuncOp (cyclomatic 17): UtilDialect.parseUtilFuncOp has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":14585}}}],"partialFingerprints":{"codehealthFindingId/v1":"709c98a5f5db5fa4d914f93e33e56ee20712429894f040e6dd9a11a2f85c2903"}},{"ruleId":"D1","level":"warning","message":{"text":"SparseTensorDialect.parseIterateOp (cyclomatic 17): SparseTensorDialect.parseIterateOp 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":20338}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5fe8d83d218ad9ba04cf9de1e8f74b7c49c2d6ca74b9a4451cf1e6e7e4ed40"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformDialect.parsePackedOrDynamicIndexList (cyclomatic 17): TransformDialect.parsePackedOrDynamicIndexList 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":25748}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d9b69cd187bf9ec3ec247cb39f61f8c6eb3149c91bfaea4d3b0e00a6ead4ff"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.constructor (cyclomatic 17): Node.constructor has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. 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":"source/nnabla.js"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f3a1ce7e224070eddbe7103e4a6a6c9a8564b38b35a0afbd74d75b923eeb49"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.constructor (cyclomatic 17): Graph.constructor 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":"source/onnx.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc936ad908e3ccc38bbf4888f892e37e4ada925f49b29fc1586800a4c4aafa7c"}},{"ruleId":"D1","level":"warning","message":{"text":"Container.signature (cyclomatic 17): Container.signature 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 is NOT this file\u0027s highest cyclomatic complexity: Tensor.constructor (cyclomatic 21) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/rknn.js"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7779c22d2c0273cf092c47fefb4fe113c9c39723cc94d270157dc258031c5f7"}},{"ruleId":"D1","level":"warning","message":{"text":"SavedObject.decodeJson (cyclomatic 17): SavedObject.decodeJson has cyclomatic complexity 17 (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. This is NOT this file\u0027s highest cyclomatic complexity: RewriterConfig.decode (cyclomatic 40) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":3740}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a8346da8d01b9f6f694297bfabf6fc5b0a31e0c9bb5830fbd96eb6330f4d49"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.decodeJson (cyclomatic 17): Node.decodeJson has cyclomatic complexity 17 (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. This is NOT this file\u0027s highest cyclomatic complexity: RewriterConfig.decode (cyclomatic 40) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":10379}}}],"partialFingerprints":{"codehealthFindingId/v1":"5013efe96c884fc102f7e99747ab4c363d90588efc1660437c488a709da0b4c4"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.open::openJson::openShards (cyclomatic 17): ModelFactory.open::openJson::openShards 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 shape REPEATS in the file: one other method here (ModelFactory.open::openJson) 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":"source/tf.js"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b3d964e0c8df9f444f742a315d4a808d25ce5612be3ccacd228b033e3aa68c"}},{"ruleId":"D1","level":"warning","message":{"text":"TextProtoReader.read (cyclomatic 17): TextProtoReader.read has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 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":"source/tnn.js"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"56498d9b0e7a2e621ea4b34f03f5495b86b791484c5d63dcae5eed048c409f0c"}},{"ruleId":"D1","level":"warning","message":{"text":"_parseModel (cyclomatic 17): _parseModel has cyclomatic complexity 17 (threshold 15). 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":"source/onnx.js"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6c4739999ce495ab5e3c5b3045da63c20645dd83db3cbfc3eb0b8aeca24398"}},{"ruleId":"D1","level":"warning","message":{"text":"_skipType (cyclomatic 17): _skipType 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":"source/protobuf.js"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0755999785db2448cca6c96746ae08dcfbd2027bc6b5127c4a793345f7547a"}},{"ruleId":"D1","level":"warning","message":{"text":"_add::isObject (cyclomatic 17): _add::isObject has cyclomatic complexity 17 (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":"source/view.js"},"region":{"startLine":2908}}}],"partialFingerprints":{"codehealthFindingId/v1":"1689bd064d14b60a1db6bcaeeb8f25814dfd9918fd8a3a3bfa43b5f6d5bfa39e"}},{"ruleId":"D1","level":"warning","message":{"text":"dagre.dagre.layout (cyclomatic 16): dagre.dagre.layout 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 shape REPEATS in the file: 4 other methods here (dagre.dagre.layout::order, dagre.dagre.layout::order::buildLayerGraph, dagre.dagre.layout::position, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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":"source/dagre.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"042c4846a772a6904f113277d49c4842539f838f338ae1d9df8774f15eea36cc"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.build (cyclomatic 16): Graph.build has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 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":"source/grapher.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"47bfb4ad10582579f71093212a1d32e7a5201744009889be8171887fc994cc09"}},{"ruleId":"D1","level":"warning","message":{"text":"DataObjectHeader.constructor (cyclomatic 16): DataObjectHeader.constructor 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 is NOT this file\u0027s highest cyclomatic complexity: DataObjectHeader._readMessage (cyclomatic 20) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/hdf5.js"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f72d9067e7174a1a6b62769588d2175da34184cce342353780da361ca3c43d9"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryReader._uint32 (cyclomatic 16): BinaryReader._uint32 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":"source/protobuf.js"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"af21b7f168de30fdbed8c58d05807ef2e8a832bd2222060a81363f18e13473a0"}},{"ruleId":"D1","level":"warning","message":{"text":"View._updatePath (cyclomatic 16): View._updatePath has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: TensorView.export (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a42806e4c9826b4d6510a18d26585995620cfff4daa562d7ce86a1f5d9bc8a"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelSidebar.render (cyclomatic 16): ModelSidebar.render 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. This is NOT this file\u0027s highest cyclomatic complexity: TensorView.export (cyclomatic 25) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":4610}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9f9ff46721ac3b8dbf0c633620782fd3946c905d903f8c0c8969b56273bb6b"}},{"ruleId":"D1","level":"warning","message":{"text":"Host.start (cyclomatic 16): Host.start has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 229, 187, 260). 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":"source/desktop.mjs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"467876abfb8a61862624e4a4dc94005e1a61a262ee6b78344334da8fb74a2981"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.build::resolveBlock (cyclomatic 16): Context.build::resolveBlock 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 shape REPEATS in the file: one other method here (Context.build) 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":"source/gguf.js"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8cf917021842afa085cee584acd1f21bc6989e18f0404a55b691fb08613c89"}},{"ruleId":"D1","level":"warning","message":{"text":"index.window.addEventListener(\u0022load\u0022) (cyclomatic 16): index.window.addEventListener(\u0022load\u0022) has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"source/index.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4e532705618ce9718c3a1b5992d93468e1c87da5b83aa11442b05c03bbed7a"}},{"ruleId":"D1","level":"warning","message":{"text":"Utility.valueType (cyclomatic 16): Utility.valueType has cyclomatic complexity 16 (threshold 15). Of this number, 12 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a9054eaef6d9ad660c9e659267a29cec0e7ec5b5b03c2e8e4fd5c30f702d92"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.parseNameOrFileLineColRange (cyclomatic 16): Parser.parseNameOrFileLineColRange 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":3156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edcb1cf1b64a4bb860ca3750417fd1ce4061b36545b165d40fa9bb03acbc2de"}},{"ruleId":"D1","level":"warning","message":{"text":"PropertiesSectionReader.read (cyclomatic 16): PropertiesSectionReader.read 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":7190}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1a5bc58fbb757ea8a43d847cd9bc2b8a37f37a1e1fcb9e077877c93d26b8b7"}},{"ruleId":"D1","level":"warning","message":{"text":"AssemblyFormatParser.parseParenList (cyclomatic 16): AssemblyFormatParser.parseParenList has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (parseElement). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":8705}}}],"partialFingerprints":{"codehealthFindingId/v1":"3701435ff8f42b616b9ca368d7fb81aecd1dc7e7c9bf69132bbfbc644c770df4"}},{"ruleId":"D1","level":"warning","message":{"text":"HLODialect.parseWindowAttributes (cyclomatic 16): HLODialect.parseWindowAttributes has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":11282}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e57c27507c830df9f316b6bcc219e026f35de13278ec43834cb4fe526c5c2df"}},{"ruleId":"D1","level":"warning","message":{"text":"MemRefDialect.parseOperation (cyclomatic 16): MemRefDialect.parseOperation 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":12507}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35f5a34516cf2c237cb29c722874c58294b5f674df49c60aff4b03eae6c76eb"}},{"ruleId":"D1","level":"warning","message":{"text":"IREEDialect.parseDispatchEntryPoints (cyclomatic 16): IREEDialect.parseDispatchEntryPoints 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":13474}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12b53f8e071bf628902c6ba25e4831080923b837cb60df9bbaba8cbb4ec57c7"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamDialect.parseResourceRegion (cyclomatic 16): StreamDialect.parseResourceRegion has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 belong to one function item 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":15343}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc3d002e9677d30e0a13abada15b242b73634a2b4ce7358cb7713bbb296ea84"}},{"ruleId":"D1","level":"warning","message":{"text":"LLVMDialect.parseLLVMCallOp (cyclomatic 16): LLVMDialect.parseLLVMCallOp 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":23056}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0c7bbee201727e9dc75a7b5ba6a0ec9bce81eed4cdc9f009e98c78a7def63a"}},{"ruleId":"D1","level":"warning","message":{"text":"TFRTFallbackAsyncDialect.parseExecuteOpCommon (cyclomatic 16): TFRTFallbackAsyncDialect.parseExecuteOpCommon 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. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":24634}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af9915b89db87dda9c3a3f7a1578513da5ad10a04fbc02117ca8866c696acda"}},{"ruleId":"D1","level":"warning","message":{"text":"ACCDialect.parseGangClause (cyclomatic 16): ACCDialect.parseGangClause 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. This is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":27868}}}],"partialFingerprints":{"codehealthFindingId/v1":"6723ccbff2e33aab783d8029114a56d64f560cf38bd4c5980502d95d49843ac2"}},{"ruleId":"D1","level":"warning","message":{"text":"ACCDialect.parseOperation (cyclomatic 16): ACCDialect.parseOperation 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 is NOT this file\u0027s highest cyclomatic complexity: Dialect.createBuildableType (cyclomatic 199) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":28075}}}],"partialFingerprints":{"codehealthFindingId/v1":"b002e21c43b93c6678a3dbbecbb2094d9235f13b387beee240ba262f623b34d3"}},{"ruleId":"D1","level":"warning","message":{"text":"Model.constructor (cyclomatic 16): Model.constructor 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":"source/sklearn.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ad46b8c7e33a577efdac5e716eb6879fe3f7923a7ec8bd4a813e3e1e50ebb6"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFactory.match (cyclomatic 16): ModelFactory.match 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":"source/tnn.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbfc1de22c6b81dbd8d9c21694c347987b2310e7d5295b0d6fe5aa7ad8a87a1"}},{"ruleId":"D1","level":"warning","message":{"text":"match::match (cyclomatic 16): match::match has cyclomatic complexity 16 (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":"source/coreml.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0f66c63d337fcdc432c13aa118be1300a70e287f2822fbcd091ae7872e37b5"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor (cyclomatic 16): constructor has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to 7 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":"source/espresso.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"949a565d92293d8f474f7df05807fb0d3d44fb441212fedc6dfd6f0e63fd6bcd"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 16): (anonymous) has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"source/index.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ce4a1ceb48122ffa70ef4159cac30f5d48c87bd4304baac0a484ab5ca59d73"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor (cyclomatic 16): constructor has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 9 function items inside it that branch (a function literal at line 140, a function literal at line 142, get_parameters, \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":"source/nnabla.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce5c33cffec4956618337abcdcf01cb6ff8d9f375e656037337e78b26fe35a5"}},{"ruleId":"D1","level":"warning","message":{"text":"read (cyclomatic 16): read has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to 6 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: toType (cyclomatic 24) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.js"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65a4a84d719c527a9620dc8c6b75844eacac32ff410552f819fe581deeb69c3"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor::map (cyclomatic 16): constructor::map has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: toType (cyclomatic 24) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.js"},"region":{"startLine":2426}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8a4e813c581f3ad48c0700023ad7d56c99980b5a220c51570b87bc400ef65d"}},{"ruleId":"D2","level":"warning","message":{"text":"Execution.constructor (cognitive 3595): Execution.constructor has cognitive complexity 3595 (threshold 15). Drivers by points: if/else 2213 (3282 pts), boolean chains 758, loops 412 (704 pts), ternaries 142 (226 pts), match/switch 71 (125 pts), error handling 5 (7 pts) (nesting depth added 1501). To reduce it, split the body into named stages: move each independent 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 (Execution.constructor::convertObject) 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":"source/python.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c61d9eded6469624eaa8c0307d312dc6f5c031bf50c9665ee0ac6cdef3d6e86"}},{"ruleId":"D2","level":"warning","message":{"text":"Dialect.parseDirective (cognitive 788): Dialect.parseDirective has cognitive complexity 788 (threshold 15). Drivers by points: if/else 194 (562 pts), loops 28 (100 pts), boolean chains 72, ternaries 17 (50 pts), match/switch 3 (4 pts) (nesting depth added 474). Of this number, 723 points are the body\u0027s own statements and 65 belong to 9 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":9649}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb609ea02c06634a48afa41ac21625858ffe695a424b51b139c5308d0f0658e"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 598): constructor has cognitive complexity 598 (threshold 15). Drivers by points: if/else 117 (280 pts), ternaries 40 (161 pts), boolean chains 110, loops 14 (45 pts), match/switch 1 (2 pts) (nesting depth added 316). Of this number, 454 points are the body\u0027s own statements and 144 belong to 45 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.js"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c97724757a32c4a8ac5ff10ddaca5af490a451684996f8e49ab6109a2fbf68"}},{"ruleId":"D2","level":"warning","message":{"text":"SPIRVDialect.parseOperation (cognitive 407): SPIRVDialect.parseOperation has cognitive complexity 407 (threshold 15). Drivers by points: if/else 138 (301 pts), loops 25 (81 pts), boolean chains 25 (nesting depth added 219). 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":"source/mlir.js"},"region":{"startLine":17902}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c6b03627b567c923bb0ccbde4ad6da5cd3acc239a5ea1cc40b92b6f52b88cb"}},{"ruleId":"D2","level":"warning","message":{"text":"Dialect.inferResultTypes (cognitive 385): Dialect.inferResultTypes has cognitive complexity 385 (threshold 15). Drivers by points: if/else 59 (278 pts), loops 10 (54 pts), boolean chains 36, ternaries 2 (17 pts) (nesting depth added 278). 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":"source/mlir.js"},"region":{"startLine":9360}}}],"partialFingerprints":{"codehealthFindingId/v1":"497d4fa31d47da412b239ae57adb2845c655692f8e56259d71e85670b5ca7a29"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 359): constructor has cognitive complexity 359 (threshold 15). Drivers by points: if/else 67 (143 pts), boolean chains 134, ternaries 27 (64 pts), loops 5 (10 pts), match/switch 3 (8 pts) (nesting depth added 123). Of this number, 348 points are the body\u0027s own statements and 11 belong to 10 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/ncnn.js"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af205fe0d1912ef876e5818be2ee7eb2a84200a97b34d89c40beb80be34ed00"}},{"ruleId":"D2","level":"warning","message":{"text":"read (cognitive 281): read has cognitive complexity 281 (threshold 15). Drivers by points: if/else 41 (176 pts), ternaries 8 (35 pts), boolean chains 34, loops 8 (31 pts), match/switch 2 (5 pts) (nesting depth added 188). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/xml.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5354f682ef6ff6bf83069ec26f66af87644931c1bcce5db8a5bb349e2d904f"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 262): constructor has cognitive complexity 262 (threshold 15). Drivers by points: if/else 50 (144 pts), ternaries 20 (70 pts), boolean chains 22, loops 8 (20 pts), match/switch 3 (6 pts) (nesting depth added 159). Of this number, 242 points are the body\u0027s own statements and 20 belong to 12 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":"source/darknet.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f4f82011f2dff03a9ab0b1978a7afb77d3409190fd9ec49bc5a1d8303065d2"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.constructor (cognitive 256): Graph.constructor has cognitive complexity 256 (threshold 15). Drivers by points: if/else 67 (195 pts), ternaries 20 (83 pts), boolean chains 46, loops 9 (23 pts) (nesting depth added 205). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (Graph.constructor::buildFfn) 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":"source/gguf.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"2119f8666f30f86624286546f52343eb5fd0cb67f3d3ef8cf5be59f764ebafe2"}},{"ruleId":"D2","level":"warning","message":{"text":"peek (cognitive 250): peek has cognitive complexity 250 (threshold 15). Drivers by points: if/else 27 (140 pts), error handling 10 (53 pts), boolean chains 21, loops 2 (13 pts), ternaries 2 (12 pts), match/switch 2 (11 pts) (nesting depth added 186). Of this number, 224 points are the body\u0027s own statements and 26 belong to 10 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":6783}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c9c9906c2c6f6c12c7b835dcaaeb932dd10d3eff1c881e71c3ab7757d0613a"}},{"ruleId":"D2","level":"warning","message":{"text":"HALDialect.parseOperation (cognitive 243): HALDialect.parseOperation has cognitive complexity 243 (threshold 15). Drivers by points: if/else 76 (168 pts), loops 11 (37 pts), ternaries 9 (28 pts), boolean chains 10 (nesting depth added 137). 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":"source/mlir.js"},"region":{"startLine":13672}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf79c060a852c6529ba56e866af506ca15a164734f4e1d9feb3a9ee5cb176ada"}},{"ruleId":"D2","level":"warning","message":{"text":"SdfgDialect.parseOperation (cognitive 230): SdfgDialect.parseOperation has cognitive complexity 230 (threshold 15). Drivers by points: if/else 88 (180 pts), loops 8 (29 pts), boolean chains 19, ternaries 1 (2 pts) (nesting depth added 114). 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":"source/mlir.js"},"region":{"startLine":24920}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc797fdf9ef0a5bd0e2e750a36a6da011755ad99857aca4646995beebb49ad77"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.constructor (cognitive 222): Graph.constructor has cognitive complexity 222 (threshold 15). Drivers by points: if/else 44 (124 pts), loops 20 (45 pts), boolean chains 37, ternaries 6 (16 pts) (nesting depth added 115). Of this number, 217 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce97dee2dbbc1133f481a168e825c56f5783039b75716af9402ffb5b5ff17561"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 212): constructor has cognitive complexity 212 (threshold 15). Drivers by points: if/else 49 (117 pts), boolean chains 46, ternaries 12 (25 pts), loops 9 (19 pts), match/switch 3 (5 pts) (nesting depth added 93). Of this number, 174 points are the body\u0027s own statements and 38 belong to 9 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/keras.js"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9518dd750ddd96c0211e138c1abc8a109205b6396b875f0f564f9d9c2b2beeb"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 212): constructor has cognitive complexity 212 (threshold 15). Drivers by points: if/else 40 (104 pts), loops 16 (45 pts), ternaries 10 (33 pts), boolean chains 30 (nesting depth added 116). Of this number, 166 points are the body\u0027s own statements and 46 belong to 12 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b6b70b0472a148758b9dc6bca8738583d2491868bb3f9071775ed27be3244f"}},{"ruleId":"D2","level":"warning","message":{"text":"open (cognitive 208): open has cognitive complexity 208 (threshold 15). Drivers by points: if/else 53 (154 pts), loops 20 (67 pts), ternaries 22 (63 pts), boolean chains 39, error handling 2 (3 pts), match/switch 1 (nesting depth added 190). 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":"source/keras.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12a534eea9c39d15f8f60c3e79e01590b7594b8b2e1c2f013ec87543ec0cb00"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 205): constructor has cognitive complexity 205 (threshold 15). Drivers by points: if/else 51 (185 pts), loops 19 (103 pts), boolean chains 35, ternaries 7 (23 pts), match/switch 3 (11 pts) (nesting depth added 242). 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":"source/keras.js"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf7919ddb38d98058ba59226af9d356c4f3fc0396e18f1a626771268810f5b0"}},{"ruleId":"D2","level":"warning","message":{"text":"layout::order (cognitive 194): layout::order has cognitive complexity 194 (threshold 15). Drivers by points: if/else 25 (123 pts), loops 18 (52 pts), boolean chains 17, ternaries 1 (2 pts) (nesting depth added 133). 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":"source/dagre.js"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"260004848873b1fae1de73cd759c7f6e272e4bd97715e423493f76789dde749b"}},{"ruleId":"D2","level":"warning","message":{"text":"read (cognitive 179): read has cognitive complexity 179 (threshold 15). Drivers by points: loops 31 (79 pts), if/else 19 (53 pts), ternaries 8 (28 pts), match/switch 4 (12 pts), boolean chains 7 (nesting depth added 110). Of this number, 143 points are the body\u0027s own statements and 36 belong to 50 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":"source/kmodel.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7661af55bc4d2eabeb3dcf84401875c1947a4c20da0c58f2319f9c2e9ab0201"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 171): constructor has cognitive complexity 171 (threshold 15). Drivers by points: if/else 24 (81 pts), ternaries 6 (37 pts), loops 7 (27 pts), boolean chains 15, match/switch 2 (11 pts) (nesting depth added 117). Of this number, 155 points are the body\u0027s own statements and 16 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":"source/mxnet.js"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d46706c2c15dec777d86c7b00621aaacfc1779c389a9eaf2bde101629a859e"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 170): constructor has cognitive complexity 170 (threshold 15). Drivers by points: if/else 24 (72 pts), loops 14 (34 pts), ternaries 8 (32 pts), boolean chains 23, error handling 1 (9 pts) (nesting depth added 100). Of this number, 147 points are the body\u0027s own statements and 23 belong to 9 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mxnet.js"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a152fd0f3071e183565a01ae35625568d93e884db2da17afddc45cd11c8494"}},{"ruleId":"D2","level":"warning","message":{"text":"next (cognitive 167): next has cognitive complexity 167 (threshold 15). Drivers by points: if/else 31 (103 pts), boolean chains 36, loops 8 (21 pts), match/switch 3 (7 pts) (nesting depth added 89). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/protobuf.js"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5b4c8f701795590054b7f7e537b180f21b37fbeb4f21cf8ffaeaa302f09d00"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 162): constructor has cognitive complexity 162 (threshold 15). Drivers by points: if/else 36 (99 pts), boolean chains 24, ternaries 7 (22 pts), match/switch 2 (9 pts), loops 3 (8 pts) (nesting depth added 90). Of this number, 77 points are the body\u0027s own statements and 85 belong to 13 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf.js"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"818a1b702115584e7f8f43b7af0b98091db631de465c128bc36115c945ee3b37"}},{"ruleId":"D2","level":"warning","message":{"text":"_tokenize (cognitive 162): _tokenize has cognitive complexity 162 (threshold 15). Drivers by points: if/else 40 (104 pts), ternaries 9 (35 pts), loops 5 (15 pts), boolean chains 8 (nesting depth added 100). Of this number, 157 points are the body\u0027s own statements and 5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":5749}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bae0688b7990dd475c21a468288cd850270de218ff84b19a7abe63595a9223"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.constructor (cognitive 161): Model.constructor has cognitive complexity 161 (threshold 15). Drivers by points: if/else 15 (80 pts), loops 13 (55 pts), ternaries 4 (19 pts), boolean chains 7 (nesting depth added 122). 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":"source/onnx.js"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"031dacd4db9c51d5a792ea80b9d9e1ec7f996cf30c707c7cb4aa2bbb496de424"}},{"ruleId":"D2","level":"warning","message":{"text":"_tokenizeInline (cognitive 158): _tokenizeInline has cognitive complexity 158 (threshold 15). Drivers by points: if/else 36 (94 pts), loops 8 (24 pts), ternaries 6 (19 pts), boolean chains 16, match/switch 1 (5 pts) (nesting depth added 91). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":5955}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f4ae9a7afaeca41c4d2b41b2856076403e6bb5836682f9d6b9d43292876082"}},{"ruleId":"D2","level":"warning","message":{"text":"open (cognitive 155): open has cognitive complexity 155 (threshold 15). Drivers by points: if/else 55 (140 pts), ternaries 3 (12 pts), boolean chains 3 (nesting depth added 94). Of this number, 47 points are the body\u0027s own statements and 108 belong to 4 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":"source/view.js"},"region":{"startLine":5327}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ed0cef8492901c22d7b1d5d1c75f165dedba8887df65e1469bde6d3e9cc370"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 152): constructor has cognitive complexity 152 (threshold 15). Drivers by points: if/else 28 (70 pts), ternaries 10 (33 pts), boolean chains 27, loops 6 (14 pts), match/switch 3 (8 pts) (nesting depth added 78). Of this number, 141 points are the body\u0027s own statements and 11 belong to 4 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/openvino.js"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"8513660adf316564ee686d600a118dc24194c6c68cbc06649bb53a0a6492b601"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.match (cognitive 148): ModelFactory.match has cognitive complexity 148 (threshold 15). Drivers by points: if/else 50 (155 pts), boolean chains 25, loops 3 (10 pts), ternaries 2 (7 pts), error handling 1 (4 pts) (nesting depth added 120). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (ModelFactory.match::match) 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":"source/tf.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fda80cabcb5f045338a96a79ea23ba7602b21bded5645f47517fada0dd9a79"}},{"ruleId":"D2","level":"warning","message":{"text":"TextReader._internalSubset (cognitive 133): TextReader._internalSubset has cognitive complexity 133 (threshold 15). Drivers by points: if/else 32 (104 pts), loops 3 (14 pts), boolean chains 10, match/switch 2 (5 pts) (nesting depth added 86). 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":"source/xml.js"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f72d9ce4994dd7f04e9742cfda79fc830091715d57dadc0acde0171f2e64a2"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.constructor (cognitive 132): Node.constructor has cognitive complexity 132 (threshold 15). Drivers by points: if/else 39 (84 pts), boolean chains 24, loops 10 (24 pts) (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bdc2ad73ee8ac64e649d3b048a941612df97fa0846d61642d8d38742242e08e"}},{"ruleId":"D2","level":"warning","message":{"text":"read (cognitive 126): read has cognitive complexity 126 (threshold 15). Drivers by points: loops 11 (40 pts), if/else 16 (33 pts), ternaries 9 (26 pts), error handling 5 (13 pts), boolean chains 11, match/switch 2 (3 pts) (nesting depth added 72). Of this number, 117 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx.js"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"395493e484b692d99324087ecb5bd795d134fd5c8954f432f24690de95c27e79"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 123): constructor has cognitive complexity 123 (threshold 15). Drivers by points: ternaries 17 (52 pts), if/else 20 (44 pts), loops 6 (14 pts), boolean chains 13 (nesting depth added 67). Of this number, 99 points are the body\u0027s own statements and 24 belong to 3 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/megengine.js"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3387c8f4082a3ddcaa7ca131b8790d906ae08b6fd01f9aa81c0ac74b4fc3117"}},{"ruleId":"D2","level":"warning","message":{"text":"_add (cognitive 121): _add has cognitive complexity 121 (threshold 15). Drivers by points: boolean chains 58, if/else 31 (43 pts), ternaries 8 (11 pts), loops 5 (9 pts) (nesting depth added 19). Of this number, 100 points are the body\u0027s own statements and 21 belong to 14 function items inside it that branch. 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":"source/view.js"},"region":{"startLine":2825}}}],"partialFingerprints":{"codehealthFindingId/v1":"c719b47a8cd9eeaddb844bd09619bcc561029e1953d3e511ebb27da612a0bdfb"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 120): constructor has cognitive complexity 120 (threshold 15). Drivers by points: if/else 23 (66 pts), loops 13 (35 pts), ternaries 4 (13 pts), boolean chains 6 (nesting depth added 74). Of this number, 112 points are the body\u0027s own statements and 8 belong to 6 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":"source/paddle.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cac405af65968b88d676178ea2f351085d6d00b192344398ac3d6760b926652"}},{"ruleId":"D2","level":"warning","message":{"text":"VMDialect.parseOperation (cognitive 119): VMDialect.parseOperation has cognitive complexity 119 (threshold 15). Drivers by points: if/else 37 (86 pts), loops 9 (27 pts), ternaries 2 (6 pts) (nesting depth added 71). 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":"source/mlir.js"},"region":{"startLine":23610}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5266346c754e24bae9d8983550c1d26a5305da0f8c70c68215d49145d68e25"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 119): constructor has cognitive complexity 119 (threshold 15). Drivers by points: if/else 28 (87 pts), loops 8 (16 pts), boolean chains 12, ternaries 1 (4 pts) (nesting depth added 70). Of this number, 110 points are the body\u0027s own statements and 9 belong to 7 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dot.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"973573fad1b11899816c38c53c731d71f471b0cd19be8505aaee60acb741765c"}},{"ruleId":"D2","level":"warning","message":{"text":"weights (cognitive 118): weights has cognitive complexity 118 (threshold 15). Drivers by points: if/else 25 (75 pts), boolean chains 19, loops 4 (12 pts), ternaries 4 (12 pts) (nesting depth added 66). Of this number, 115 points are the body\u0027s own statements and 3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pickle.js"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bb377896a13914cc352c69b470cf865677313dd914957a8188e234a28e9171"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 115): constructor has cognitive complexity 115 (threshold 15). Drivers by points: if/else 23 (68 pts), loops 5 (16 pts), boolean chains 11, ternaries 5 (11 pts), match/switch 1 (5 pts), error handling 1 (4 pts) (nesting depth added 69). Of this number, 88 points are the body\u0027s own statements and 27 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":"source/circle.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"2034fc8fb1458acd7f39f3e74a9b3cbbe48175ccfa06426177b2bfb83b5529d9"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 115): constructor has cognitive complexity 115 (threshold 15). Drivers by points: if/else 23 (68 pts), loops 5 (16 pts), boolean chains 11, ternaries 5 (11 pts), match/switch 1 (5 pts), error handling 1 (4 pts) (nesting depth added 69). Of this number, 88 points are the body\u0027s own statements and 27 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":"source/tflite.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"12111d4a7cb34f88a5dc2ee72511d1bf267ed28f60c3a1dd5748f727b3fde227"}},{"ruleId":"D2","level":"warning","message":{"text":"TestDialect.parseOperation (cognitive 114): TestDialect.parseOperation has cognitive complexity 114 (threshold 15). Drivers by points: if/else 42 (81 pts), loops 8 (22 pts), boolean chains 7, ternaries 2 (4 pts) (nesting depth added 55). Of this number, 93 points are the body\u0027s own statements and 21 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":25944}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b4d9125ec607778960b4d7f1157c46c8ac7d64527bfbb4788ba9caab1f2411"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor._decodeData (cognitive 111): Tensor._decodeData has cognitive complexity 111 (threshold 15). Drivers by points: loops 33 (98 pts), if/else 5 (8 pts), ternaries 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 70). 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":"source/base.js"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"f696d9b1ddeeb7e56d1e25e32fc407e3aabca9952532f16b875b6bee8774e606"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowDialect.parseShapedFunctionType (cognitive 108): FlowDialect.parseShapedFunctionType has cognitive complexity 108 (threshold 15). Drivers by points: if/else 24 (88 pts), loops 4 (16 pts), boolean chains 4 (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":"source/mlir.js"},"region":{"startLine":14972}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e89281cec7ee70a8e9ecd9b56c029d9e14c348c5f5af743dd2ccd0a4c28fa4"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 106): constructor has cognitive complexity 106 (threshold 15). Drivers by points: if/else 26 (55 pts), ternaries 8 (23 pts), boolean chains 19, loops 3 (5 pts), match/switch 2 (4 pts) (nesting depth added 48). Of this number, 100 points are the body\u0027s own statements and 6 belong to 8 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":"source/tnn.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"334d82bdc5c31ba91ab5cf7fdc17532c36d69568f48acfc229105ab108291e57"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 103): constructor has cognitive complexity 103 (threshold 15). Drivers by points: ternaries 12 (39 pts), if/else 15 (33 pts), loops 6 (16 pts), boolean chains 14, match/switch 1 (nesting depth added 55). Of this number, 83 points are the body\u0027s own statements and 20 belong to 6 function literals inside it that branch. 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":"source/rknn.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"683ac2a73b398ab72ec70bb1350ffccad9e83c16018271aad40b0a270f65a12b"}},{"ruleId":"D2","level":"warning","message":{"text":"weights (cognitive 102): weights has cognitive complexity 102 (threshold 15). Drivers by points: if/else 20 (61 pts), boolean chains 18, loops 4 (12 pts), ternaries 4 (11 pts) (nesting depth added 56). Of this number, 96 points are the body\u0027s own statements and 6 belong to 6 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":"source/pytorch.js"},"region":{"startLine":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"3269fa56c9a413afd49f259bda1a8fc3d470d5fe953d2ec9ecf323f531abfdd0"}},{"ruleId":"D2","level":"warning","message":{"text":"add (cognitive 102): add has cognitive complexity 102 (threshold 15). Drivers by points: if/else 22 (65 pts), loops 10 (30 pts), boolean chains 4, ternaries 3 (nesting depth added 63). Of this number, 97 points are the body\u0027s own statements and 5 belong to one function item 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":"source/view.js"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8ac93ec9ebbb9eb8142e627abde73e535e971ccdaad785c605d2cee147c8b5"}},{"ruleId":"D2","level":"warning","message":{"text":"graph::updateTorchScript (cognitive 100): graph::updateTorchScript has cognitive complexity 100 (threshold 15). Drivers by points: if/else 20 (54 pts), boolean chains 17, loops 7 (13 pts), ternaries 3 (11 pts), match/switch 1 (5 pts) (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf.js"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb38e4b51d6dd548506327e468cc5ae93d95659002c5917deb9e1d49ccbeda3"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 99): constructor has cognitive complexity 99 (threshold 15). Drivers by points: if/else 24 (51 pts), loops 7 (19 pts), boolean chains 15, ternaries 3 (13 pts), match/switch 1 (nesting depth added 49). Of this number, 58 points are the body\u0027s own statements and 41 belong to 7 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":"source/cntk.js"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9178d3f66daa2a33bd09165fe909621c0ae4bd6bd703c7455e193b43c62541"}},{"ruleId":"D2","level":"warning","message":{"text":"_node (cognitive 97): _node has cognitive complexity 97 (threshold 15). Drivers by points: if/else 16 (47 pts), loops 5 (21 pts), ternaries 2 (16 pts), boolean chains 13 (nesting depth added 61). Of this number, 88 points are the body\u0027s own statements and 9 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":"source/view.js"},"region":{"startLine":4962}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d95d44318377b4e05f7cd6412a32122fb57af9ec99f839467c65f6d784567d"}},{"ruleId":"D2","level":"warning","message":{"text":"Execution.statement (cognitive 93): Execution.statement has cognitive complexity 93 (threshold 15). Drivers by points: if/else 33 (58 pts), loops 7 (17 pts), ternaries 6 (14 pts), boolean chains 4 (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":"source/python.js"},"region":{"startLine":22083}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cbe40a4dbd0007f770fdfd19547531381d28286449755ab74315c4162983fa"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 93): constructor has cognitive complexity 93 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 4 (19 pts), ternaries 3 (16 pts), boolean chains 12, match/switch 2 (5 pts) (nesting depth added 60). 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":"source/onnx.js"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"6880794126ac7e806c9348ced3fa8da17aa481dd38888f463a2c3aa4757730e5"}},{"ruleId":"D2","level":"warning","message":{"text":"AssemblyFormatParser.parseDirective (cognitive 91): AssemblyFormatParser.parseDirective has cognitive complexity 91 (threshold 15). Drivers by points: if/else 42 (72 pts), loops 4 (10 pts), boolean chains 9 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":8473}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d84c8e36d8f58b02c76969bcdf18c2f3e79c80e258e64ff8577d3f10badb24"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 91): constructor has cognitive complexity 91 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 12 (27 pts), ternaries 6 (17 pts), boolean chains 14 (nesting depth added 46). Of this number, 80 points are the body\u0027s own statements and 11 belong to 6 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tvm.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c464127d346d6a5023ef4c35af3d8aeaa44c70e245fd1c1e3ec03ed16af5b28a"}},{"ruleId":"D2","level":"warning","message":{"text":"_updateMenu (cognitive 90): _updateMenu has cognitive complexity 90 (threshold 15). Drivers by points: ternaries 23 (47 pts), boolean chains 24, if/else 9 (15 pts), loops 2 (4 pts) (nesting depth added 32). Of this number, 26 points are the body\u0027s own statements and 64 belong to 43 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":"source/app.js"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80dd6ba05e08faffa0c2ec58f1d44df20db49d088a0181e637ca48f27682002"}},{"ruleId":"D2","level":"warning","message":{"text":"_render (cognitive 90): _render has cognitive complexity 90 (threshold 15). Drivers by points: ternaries 12 (42 pts), if/else 6 (24 pts), loops 6 (17 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 60). 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":"source/view.js"},"region":{"startLine":6198}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab5e0a255e25cf485562f71e65d50c3dd2574fed6fc6a8ecc831d61534d9e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"Archive.open (cognitive 89): Archive.open has cognitive complexity 89 (threshold 15). Drivers by points: if/else 21 (66 pts), boolean chains 12, loops 2 (7 pts), ternaries 2 (4 pts) (nesting depth added 52). Of this number, 60 points are the body\u0027s own statements and 29 belong to 3 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/zip.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"428031c201202c8157c12ec1f7405f35bb8208eccb9ef53e9f640b8c8d157ec2"}},{"ruleId":"D2","level":"warning","message":{"text":"XlaDialect.parseOperation (cognitive 89): XlaDialect.parseOperation has cognitive complexity 89 (threshold 15). Drivers by points: if/else 20 (57 pts), loops 10 (30 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":28680}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d01d331d26b9e117433fba38bb33ef55d2e027996b1998e63e7f61987eed41a"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 89): constructor has cognitive complexity 89 (threshold 15). Drivers by points: if/else 11 (37 pts), ternaries 6 (22 pts), loops 5 (14 pts), boolean chains 9, match/switch 2 (7 pts) (nesting depth added 56). Of this number, 79 points are the body\u0027s own statements and 10 belong to 4 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":"source/onednn.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"086c7588faa5c75d1a62ce0b13609f69ca622ab635d2d86fe582fd7da417904c"}},{"ruleId":"D2","level":"warning","message":{"text":"KrnlDialect.parseOperation (cognitive 88): KrnlDialect.parseOperation has cognitive complexity 88 (threshold 15). Drivers by points: if/else 22 (54 pts), loops 8 (24 pts), ternaries 2 (8 pts), boolean chains 2 (nesting depth added 54). Of this number, 65 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":"source/mlir.js"},"region":{"startLine":16526}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c17edfd68131ae815e162fa71573ea5e1ace5fc0a3ce3b19ba3323d462c9fb"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 87): constructor has cognitive complexity 87 (threshold 15). Drivers by points: if/else 16 (37 pts), loops 12 (20 pts), ternaries 5 (19 pts), boolean chains 10, match/switch 1 (nesting depth added 43). Of this number, 81 points are the body\u0027s own statements and 6 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":"source/caffe.js"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe0243c64b8874a1cd80e76d9a230df8bffe2dafdc2fc61cb7e9766f0ca1492"}},{"ruleId":"D2","level":"warning","message":{"text":"Execution.expression (cognitive 86): Execution.expression has cognitive complexity 86 (threshold 15). Drivers by points: if/else 23 (57 pts), ternaries 4 (12 pts), boolean chains 8, loops 2 (6 pts), match/switch 2 (3 pts) (nesting depth added 47). Of this number, 84 points are the body\u0027s own statements and 2 belong to one function item 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":"source/python.js"},"region":{"startLine":22217}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfe68053de288ce9e4462c77928964346fbf65e6e6ec659fe99c9f69da3b690"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.match (cognitive 85): ModelFactory.match has cognitive complexity 85 (threshold 15). Drivers by points: if/else 23 (63 pts), loops 3 (12 pts), boolean chains 7, error handling 1 (3 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":"source/ncnn.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16853a16537e75cf65f233b9accaa4faf146d0edea7168d67073fe77240223a"}},{"ruleId":"D2","level":"warning","message":{"text":"_format (cognitive 84): _format has cognitive complexity 84 (threshold 15). Drivers by points: if/else 25 (35 pts), ternaries 16 (32 pts), boolean chains 15, match/switch 2 (nesting depth added 26). Of this number, 74 points are the body\u0027s own statements and 10 belong to 7 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":"source/view.js"},"region":{"startLine":5526}}}],"partialFingerprints":{"codehealthFindingId/v1":"c179c24e5a5b348cf51809f086e2f58096d40f77a6269bc30617b6ea92563c99"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtoReader.open (cognitive 82): ProtoReader.open has cognitive complexity 82 (threshold 15). Drivers by points: if/else 29 (89 pts), boolean chains 22, ternaries 2 (9 pts), loops 2 (8 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 shape REPEATS in the file: one other method here (ProtoReader.open::match) 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":"source/onnx.js"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b14b66aa5c71c380adfac0fc955bc2ee9045ebfdd1d42153bb9153c35ef1a8c"}},{"ruleId":"D2","level":"warning","message":{"text":"read (cognitive 82): read has cognitive complexity 82 (threshold 15). Drivers by points: if/else 19 (57 pts), match/switch 4 (14 pts), ternaries 2 (9 pts), boolean chains 1, loops 1 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/json.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"827e67f3093e5684c335889409628073002930d18e9338673e85308f65f83e1c"}},{"ruleId":"D2","level":"warning","message":{"text":"decodeJson (cognitive 81): decodeJson has cognitive complexity 81 (threshold 15). Drivers by points: ternaries 22 (44 pts), if/else 37 (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":"source/tf-proto.js"},"region":{"startLine":12220}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3e01c27b4dd73dc9234a8423374cc74328d733b546ba630d7779c2d9abafcd"}},{"ruleId":"D2","level":"warning","message":{"text":"open::requestManifest::parse (cognitive 79): open::requestManifest::parse has cognitive complexity 79 (threshold 15). Drivers by points: if/else 24 (58 pts), ternaries 3 (9 pts), boolean chains 8, error handling 2 (4 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mxnet.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc03d1e0170411320543c6ffdc994ea7f58ee2e48acdf692bce603f3630a45bc"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.constructor (cognitive 78): Node.constructor has cognitive complexity 78 (threshold 15). Drivers by points: if/else 23 (55 pts), boolean chains 20, loops 1 (2 pts), ternaries 1 (nesting depth added 33). Of this number, 75 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/sklearn.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f473d4cfea23e2a4f3ccd3d7214460c279358c467dd6326b73c62095c924ac8"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 78): constructor has cognitive complexity 78 (threshold 15). Drivers by points: if/else 18 (35 pts), boolean chains 15, ternaries 5 (14 pts), loops 5 (12 pts), match/switch 2 (nesting depth added 33). Of this number, 55 points are the body\u0027s own statements and 23 belong to 10 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":"source/caffe.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"07dbcf8f7342cdd632a9e35743659a945a6a624b4220569b30f1b1eefc75b95d"}},{"ruleId":"D2","level":"warning","message":{"text":"render (cognitive 78): render has cognitive complexity 78 (threshold 15). Drivers by points: if/else 12 (26 pts), ternaries 7 (26 pts), loops 6 (18 pts), boolean chains 8 (nesting depth added 45). Of this number, 69 points are the body\u0027s own statements and 9 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":"source/view.js"},"region":{"startLine":4752}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ceb0f54172bb9279d865884dfccc00d7e687b454e2efd7a7d39b45eb671a1c"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.constructor (cognitive 77): Node.constructor has cognitive complexity 77 (threshold 15). Drivers by points: if/else 18 (35 pts), ternaries 5 (17 pts), boolean chains 15, loops 4 (8 pts), match/switch 1 (2 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":"source/om.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"767fce2ab6963a1e6f66d5481cf0f2f0c67762374e1b3ac8b6cabe4f620a4228"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 77): constructor has cognitive complexity 77 (threshold 15). Drivers by points: if/else 10 (37 pts), loops 8 (23 pts), match/switch 3 (6 pts), ternaries 2 (6 pts), boolean chains 5 (nesting depth added 49). Of this number, 66 points are the body\u0027s own statements and 11 belong to 3 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/cntk.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bd50cbc1f11608c9a42d3b66ec9a9b25d951a4d3025e666a16a2652965dbe5"}},{"ruleId":"D2","level":"warning","message":{"text":"TFRTDialect.parseOperation (cognitive 76): TFRTDialect.parseOperation has cognitive complexity 76 (threshold 15). Drivers by points: if/else 28 (56 pts), loops 6 (20 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":24415}}}],"partialFingerprints":{"codehealthFindingId/v1":"1106fddf8d840511f9cb36350cdfb9663ccfd5d85edab36d7182e4334b0aaeab"}},{"ruleId":"D2","level":"warning","message":{"text":"read (cognitive 76): read has cognitive complexity 76 (threshold 15). Drivers by points: if/else 13 (35 pts), loops 8 (23 pts), ternaries 3 (13 pts), boolean chains 5 (nesting depth added 47). 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":"source/pytorch.js"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"337257daf4861418b3484c7b231dce611a7147d9a32763f482e4c1a4ad78a2d3"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 75): constructor has cognitive complexity 75 (threshold 15). Drivers by points: if/else 10 (40 pts), loops 6 (23 pts), ternaries 2 (7 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/om.js"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17da3e3e8791b51d3fd22d6de595f1ee9c00f674fdb8eca7c0a3c85726d0ede"}},{"ruleId":"D2","level":"warning","message":{"text":"LinalgDialect.parseOperation (cognitive 72): LinalgDialect.parseOperation has cognitive complexity 72 (threshold 15). Drivers by points: if/else 34 (60 pts), loops 2 (9 pts), boolean chains 3 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":15989}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03788fb9941ba6aca79f054faa784cfdd4784a5775d0e5b3b0fc6984c6a9d64"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 72): constructor has cognitive complexity 72 (threshold 15). Drivers by points: if/else 11 (35 pts), ternaries 8 (19 pts), boolean chains 10, loops 3 (4 pts), match/switch 1 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tosa.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dc970559c4d313412cecceee2ff9d65e7f2208e9be53a303ff0bf0b419e522"}},{"ruleId":"D2","level":"warning","message":{"text":"refresh (cognitive 72): refresh has cognitive complexity 72 (threshold 15). Drivers by points: if/else 52 (139 pts), boolean chains 27, loops 8 (19 pts), ternaries 7 (16 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":"source/view.js"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"f667d835aa267017bb5087793243ceccf3be0fbcbb0a08137114276118400241"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 71): constructor has cognitive complexity 71 (threshold 15). Drivers by points: loops 14 (30 pts), if/else 6 (15 pts), boolean chains 13, ternaries 4 (11 pts), match/switch 1 (2 pts) (nesting depth added 33). Of this number, 61 points are the body\u0027s own statements and 10 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/kmodel.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47f79c6c29b246dfd20bf965a3b70145541c4a704321dab8e9dbdf226367d79"}},{"ruleId":"D2","level":"warning","message":{"text":"metrics (cognitive 69): metrics has cognitive complexity 69 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 4 (18 pts), ternaries 3 (14 pts), boolean chains 8 (nesting depth added 43). 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":"source/view.js"},"region":{"startLine":6655}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffe22cd7493c026e8f96e297d234e2c758d96a057418391d9bb140b9b073e05"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 67): constructor has cognitive complexity 67 (threshold 15). Drivers by points: if/else 11 (31 pts), ternaries 9 (22 pts), boolean chains 8, loops 3, match/switch 1 (3 pts) (nesting depth added 35). Of this number, 57 points are the body\u0027s own statements and 10 belong to 4 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":"source/circle.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f66d5d7e300b6552bb9bc00ea340cf0a99923bbc6e2a5a598ef41f02847a844"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 67): constructor has cognitive complexity 67 (threshold 15). Drivers by points: if/else 11 (31 pts), ternaries 9 (22 pts), boolean chains 8, loops 3, match/switch 1 (3 pts) (nesting depth added 35). Of this number, 57 points are the body\u0027s own statements and 10 belong to 4 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":"source/tflite.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2cfa924959f2eae6427c7fd42a951c7944f526313e8ff226c241f36edf676e"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 66): constructor has cognitive complexity 66 (threshold 15). Drivers by points: ternaries 11 (40 pts), if/else 7 (11 pts), boolean chains 6, loops 3 (6 pts), match/switch 1 (3 pts) (nesting depth added 38). Of this number, 60 points are the body\u0027s own statements and 6 belong to 6 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":"source/espdl.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18cfba3da8703680cbffc9b75aba9efe0486e66f37b8b1a891d0b6914b95eab"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor::loadGraph (cognitive 66): constructor::loadGraph has cognitive complexity 66 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 7 (19 pts), ternaries 4 (16 pts), match/switch 1 (2 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/megengine.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc3d22ccfb48db41ea550e002f2c54c746d6b86a05d73c27bee0c33d2fd1da3"}},{"ruleId":"D2","level":"warning","message":{"text":"_context (cognitive 65): _context has cognitive complexity 65 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 16, ternaries 4 (11 pts), loops 3 (7 pts), match/switch 2 (3 pts) (nesting depth added 25). Of this number, 59 points are the body\u0027s own statements and 6 belong to 7 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":"source/base.js"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c08e4a9bc85120dbbfc0e88a056426d9ab78030c5fe54f2fb174a86f9c90de"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 65): constructor has cognitive complexity 65 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 11 (17 pts), boolean chains 11, ternaries 2 (3 pts) (nesting depth added 27). Of this number, 56 points are the body\u0027s own statements and 9 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe2.js"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b85510364b5990bc3f42a3c81d3f30e8baea7eaec125f11edc535f184ad2e7e"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 64): constructor has cognitive complexity 64 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 8 (16 pts), ternaries 5 (11 pts), match/switch 4 (9 pts), boolean chains 7 (nesting depth added 31). Of this number, 43 points are the body\u0027s own statements and 21 belong to 10 function items inside it that branch. 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":"source/rknn.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1ebca339842cf820ca4d62ac3b6ac09fc6ebbcee9266c3c9af54fcf050479e"}},{"ruleId":"D2","level":"warning","message":{"text":"register (cognitive 64): register has cognitive complexity 64 (threshold 15). Drivers by points: ternaries 14 (50 pts), if/else 4 (7 pts), match/switch 1 (3 pts), boolean chains 2, loops 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":"source/view.js"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"6518fa2449bbaba4ec39ebba362b0207ee54d5d6ebf763da61037c4aa3f1beaf"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader.read (cognitive 63): Reader.read has cognitive complexity 63 (threshold 15). Drivers by points: if/else 16 (37 pts), loops 5 (12 pts), boolean chains 5, error handling 2 (4 pts), match/switch 1 (3 pts), ternaries 1 (2 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/espresso.js"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"116ed876d9e8c87bf7d651bacaec98d07299786f486aaf5867402a44968fab37"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenMPDialect.parseLoopNestOp (cognitive 63): OpenMPDialect.parseLoopNestOp has cognitive complexity 63 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 8 (31 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":21487}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa6d9b42b5cea16b6161953d5f463eea7f3302a88058f043b9b379e9ead5dc1"}},{"ruleId":"D2","level":"warning","message":{"text":"PXADialect.parseOperation (cognitive 63): PXADialect.parseOperation has cognitive complexity 63 (threshold 15). Drivers by points: if/else 21 (44 pts), loops 3 (11 pts), boolean chains 8 (nesting depth added 31). Of this number, 61 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":24733}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e3a4177351dd16d9a1e244723aa526fb5242bd1cd2b6b116272c8537f246f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.constructor (cognitive 63): Node.constructor has cognitive complexity 63 (threshold 15). Drivers by points: if/else 13 (22 pts), ternaries 7 (22 pts), boolean chains 9, loops 2 (5 pts), match/switch 1 (5 pts) (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":"source/mnn.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec919e38fe123a8b2265f8a39285fa911838a8927e50dd079f75842bad41223d"}},{"ruleId":"D2","level":"warning","message":{"text":"TensorSidebar.render (cognitive 61): TensorSidebar.render has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (34 pts), ternaries 4 (11 pts), loops 3 (10 pts), boolean chains 6 (nesting depth added 32). Of this number, 44 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":"source/view.js"},"region":{"startLine":4508}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0499ddfa2860f366c858834d9d62436d476d59186bb7bfc7dfcee0b9f4a9e27"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeReader.parseRegions (cognitive 61): BytecodeReader.parseRegions has cognitive complexity 61 (threshold 15). Drivers by points: if/else 11 (41 pts), loops 4 (10 pts), ternaries 2 (6 pts), boolean chains 4 (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":"source/mlir.js"},"region":{"startLine":7684}}}],"partialFingerprints":{"codehealthFindingId/v1":"1835641c29aa01d26077b614f9f6222ea087ed0e5e6dc7ca9df7b25aa30fe5e3"}},{"ruleId":"D2","level":"warning","message":{"text":"read (cognitive 61): read has cognitive complexity 61 (threshold 15). Drivers by points: ternaries 5 (22 pts), loops 4 (15 pts), if/else 4 (13 pts), match/switch 2 (6 pts), error handling 1 (3 pts), boolean chains 2 (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":"source/om.js"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5320fc804131d3189056ab8049fe57d1dc007f4d06cddba268ec0c39152ffed"}},{"ruleId":"D2","level":"warning","message":{"text":"View.refresh::animateTransition (cognitive 60): View.refresh::animateTransition has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (42 pts), boolean chains 10, ternaries 1 (5 pts), loops 3 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (View.refresh::animateTransition::tick) 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":"source/view.js"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"393eb42505b83c9f115f9292700ebf2042caf7bc56ab64c62d87690f515aeec5"}},{"ruleId":"D2","level":"warning","message":{"text":"PCFDialect.parseParallelExecutionBody (cognitive 60): PCFDialect.parseParallelExecutionBody has cognitive complexity 60 (threshold 15). Drivers by points: if/else 17 (39 pts), loops 6 (21 pts) (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":"source/mlir.js"},"region":{"startLine":15866}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d41e4b8b126c4e183089d5a8746f593c18c649cb3f3c261528cb180b8dd2fb"}},{"ruleId":"D2","level":"warning","message":{"text":"View.start (cognitive 59): View.start has cognitive complexity 59 (threshold 15). Drivers by points: ternaries 10 (23 pts), if/else 12 (21 pts), boolean chains 10, loops 2 (4 pts), error handling 1 (nesting depth added 24). Of this number, 26 points are the body\u0027s own statements and 33 belong to 11 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":"source/view.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dee97f7d6f8798f85ad0e35064d16950ccbeb474793f5f64d6c668ae6b3eda6"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.constructor (cognitive 59): Node.constructor has cognitive complexity 59 (threshold 15). Drivers by points: if/else 11 (35 pts), boolean chains 11, ternaries 4 (6 pts), loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 29). Of this number, 40 points are the body\u0027s own statements and 19 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mindir.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d02f83aba933fe9123a0c7de3dea8675caedabf7b80f9bf04e5cf0a61e9d15"}},{"ruleId":"D2","level":"warning","message":{"text":"TensorBundle.constructor (cognitive 59): TensorBundle.constructor has cognitive complexity 59 (threshold 15). Drivers by points: if/else 11 (35 pts), ternaries 3 (13 pts), loops 3 (6 pts), boolean chains 4, match/switch 1 (nesting depth added 37). Of this number, 58 points are the body\u0027s own statements and 1 belongs 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":"source/tf.js"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"853d71adaf7dd0e018b00e4893c59eac34eecdf37623ba494583a5d2baddb6a3"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 59): constructor has cognitive complexity 59 (threshold 15). Drivers by points: if/else 16 (24 pts), ternaries 6 (17 pts), boolean chains 14, loops 2 (4 pts) (nesting depth added 21). Of this number, 28 points are the body\u0027s own statements and 31 belong to 7 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":"source/caffe2.js"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc372d97462860a8ce36561893ab398f9149fbdd1c689b9822f648718fe0734"}},{"ruleId":"D2","level":"warning","message":{"text":"layout::position::buildBlockGraph (cognitive 59): layout::position::buildBlockGraph has cognitive complexity 59 (threshold 15). Drivers by points: if/else 7 (24 pts), ternaries 5 (22 pts), match/switch 2 (10 pts), loops 2 (3 pts) (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":"source/dagre.js"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d81af004d6d53d37931d639149ba75f89fbc16cc5000e24eba7ad651e955096"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 59): constructor has cognitive complexity 59 (threshold 15). Drivers by points: ternaries 8 (22 pts), if/else 10 (20 pts), boolean chains 12, loops 3 (5 pts) (nesting depth added 26). Of this number, 54 points are the body\u0027s own statements and 5 belong to 5 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":"source/tengine.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2992d634dc39040713d5ab274cdecb3f1707409260654da8499a9e3a1a34db"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.constructor (cognitive 58): Graph.constructor has cognitive complexity 58 (threshold 15). Drivers by points: if/else 29 (66 pts), loops 21 (34 pts), boolean chains 30, ternaries 4 (8 pts), match/switch 1 (3 pts) (nesting depth added 56). To reduce it, split the body into named stages: move each independent 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 (Graph.constructor::constant) 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":"source/openvino.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"39adc71c6b4fe1c0368000b464adc3e6ee2ad24940157d5bcd23013b14ce5626"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.graph (cognitive 58): Context.graph has cognitive complexity 58 (threshold 15). Drivers by points: if/else 54 (148 pts), boolean chains 36, loops 20 (32 pts), ternaries 4 (10 pts), match/switch 2 (9 pts) (nesting depth added 119). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf.js"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"718705b20eb958760392f537fa3abee2ad5fd0419b09986530141ebcd7557a63"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 58): constructor has cognitive complexity 58 (threshold 15). Drivers by points: ternaries 11 (29 pts), if/else 6 (10 pts), loops 5 (10 pts), boolean chains 9 (nesting depth added 27). Of this number, 54 points are the body\u0027s own statements and 4 belong to 4 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":"source/executorch.js"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad04e8f02971bf47dcadfe9314a9aac34be51b0dcc610641db2938e595550a51"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 58): constructor has cognitive complexity 58 (threshold 15). Drivers by points: if/else 10 (44 pts), loops 3 (5 pts), match/switch 1 (4 pts), boolean chains 3, ternaries 1 (2 pts) (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":"source/zip.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"389c90dfc6f5f6579ec82d6e03d09a23c41c145a56459de393c30017f6287b12"}},{"ruleId":"D2","level":"warning","message":{"text":"Variable.data (cognitive 57): Variable.data has cognitive complexity 57 (threshold 15). Drivers by points: if/else 8 (31 pts), loops 7 (24 pts), boolean chains 1, match/switch 1 (nesting depth added 40). 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":"source/hdf5.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cab73b8e57c205fd581341095635b9f5325c235b56b795990930e2c8beb94c"}},{"ruleId":"D2","level":"warning","message":{"text":"Target.metrics (cognitive 57): Target.metrics has cognitive complexity 57 (threshold 15). Drivers by points: if/else 7 (27 pts), loops 4 (19 pts), boolean chains 7, ternaries 1 (4 pts) (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":"source/view.js"},"region":{"startLine":6606}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a596c215009eb44d2d28bc22e9fb021822529152d856a76d39d525b59847095"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 57): constructor has cognitive complexity 57 (threshold 15). Drivers by points: if/else 12 (29 pts), ternaries 4 (12 pts), loops 4 (7 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 30). Of this number, 25 points are the body\u0027s own statements and 32 belong to 4 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":"source/paddle.js"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff53969795a6a00019a725edddc228e738dc45f7ce82136bfbab0adfa373658"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryReader.decode (cognitive 56): BinaryReader.decode has cognitive complexity 56 (threshold 15). Drivers by points: if/else 26 (77 pts), loops 4 (16 pts), boolean chains 5, error handling 2 (nesting depth added 63). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (BinaryReader.decode::decodeMessage) 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":"source/protobuf.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44493a716fdb0dc95b61c44b029259c8ca8ab3f2a990aadabcebaeddf1da6c9"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.match (cognitive 56): ModelFactory.match has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 15, loops 4 (12 pts) (nesting depth added 24). Of this number, 39 points are the body\u0027s own statements and 17 belong to 6 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":"source/openvino.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1a9200095bd062208c78c5778a1710fb1d4d1e54e3449c6ebfbe054c7bda0b"}},{"ruleId":"D2","level":"warning","message":{"text":"match (cognitive 56): match has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 24, error handling 1 (2 pts), loops 1 (2 pts), ternaries 1 (nesting depth added 13). Of this number, 42 points are the body\u0027s own statements and 14 belong to 5 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":"source/coreml.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a23dc4878411d40081f8aee2c81be4d5eb600f47d3cc9cb3cd3009895f31297"}},{"ruleId":"D2","level":"warning","message":{"text":"open (cognitive 55): open has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (34 pts), loops 3 (12 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 34). 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":"source/protobuf.js"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfa59010bb7e9a2d6db7386627e06dcccf7667765dc10e7c2c723822df7a22a"}},{"ruleId":"D2","level":"warning","message":{"text":"toString (cognitive 55): toString has cognitive complexity 55 (threshold 15). Drivers by points: if/else 9 (19 pts), ternaries 5 (19 pts), boolean chains 15, loops 1 (2 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":"source/view.js"},"region":{"startLine":5275}}}],"partialFingerprints":{"codehealthFindingId/v1":"da579e3cbbebf934fb145ba4bb80fb0e407987a1ef8ff22b7e37170bbbbe54d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.program (cognitive 54): Graph.program has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 13 (29 pts), boolean chains 15, match/switch 3 (7 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. This shape REPEATS in the file: one other method here (Graph.program::convertValue) 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":"source/coreml.js"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e03293ccb108a2fb2f957f86ea8e82f267e5a90b5c269293ead622d4c58d18c"}},{"ruleId":"D2","level":"warning","message":{"text":"XlaGpuDialect.parseOperation (cognitive 54): XlaGpuDialect.parseOperation has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 6 (20 pts) (nesting depth added 34). 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":"source/mlir.js"},"region":{"startLine":28814}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9b2cec2445becc8486ebbb03be6176057b6e342bdbffa61bec6b180d915f96"}},{"ruleId":"D2","level":"warning","message":{"text":"read (cognitive 54): read has cognitive complexity 54 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 5 (10 pts), ternaries 3 (10 pts), match/switch 2 (9 pts) (nesting depth added 33). Of this number, 44 points are the body\u0027s own statements and 10 belong to 5 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":"source/tengine.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb158a4a8527f3401b1219a4b453a69514a093b44f3771d117a930e20aba5e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Dialect.getOperation (cognitive 53): Dialect.getOperation has cognitive complexity 53 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 5 (15 pts), boolean chains 7 (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":"source/mlir.js"},"region":{"startLine":9096}}}],"partialFingerprints":{"codehealthFindingId/v1":"646a572e39b6a04841f97f5c6488fd513bb990e5371ed44175ac6c517501faf7"}},{"ruleId":"D2","level":"warning","message":{"text":"LLVMDialect.parseLLVMInvokeOp (cognitive 53): LLVMDialect.parseLLVMInvokeOp has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (31 pts), loops 6 (21 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":"source/mlir.js"},"region":{"startLine":23181}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e278dea22547f5979c434d6226fd795ef8083078d9f7291f831fad3c492cc2"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.constructor::constant (cognitive 52): Graph.constructor::constant has cognitive complexity 52 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 7 (10 pts), boolean chains 7, match/switch 1 (3 pts), ternaries 1 (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. This shape REPEATS in the file: one other method here (Graph.constructor) 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":"source/openvino.js"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"3272ec3e14a553ff696f577b90863a885324341fb9f67821218240a5af43e434"}},{"ruleId":"D2","level":"warning","message":{"text":"IR.op::collectRegions (cognitive 52): IR.op::collectRegions has cognitive complexity 52 (threshold 15). Drivers by points: if/else 5 (24 pts), loops 5 (16 pts), ternaries 2 (10 pts), boolean chains 2 (nesting depth added 38). To reduce it, split the body into named stages: move each independent 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 (IR.op) 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":"source/paddle.js"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"40778ea3a7fa4e6141de2b5da7acddbcc9f356844d2db4dd97d3608384728ccc"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 52): constructor has cognitive complexity 52 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 5 (17 pts), boolean chains 12, ternaries 1 (3 pts) (nesting depth added 24). Of this number, 41 points are the body\u0027s own statements and 11 belong to 6 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":"source/ncnn.js"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcda2b067c35a856c3a6645acb8f4fb48400c9fdae08bce438c91cc756f4cee"}},{"ruleId":"D2","level":"warning","message":{"text":"decode (cognitive 52): decode has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (40 pts), boolean chains 12 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/text.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0967a9f2b1a35e2831e84dc660e1fdbdb2808ea2c2bd8e5ca4e52f628cf4adbb"}},{"ruleId":"D2","level":"warning","message":{"text":"dagre.dagre.layout::position (cognitive 51): dagre.dagre.layout::position has cognitive complexity 51 (threshold 15). Drivers by points: loops 12 (25 pts), if/else 7 (17 pts), ternaries 3 (9 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. This shape REPEATS in the file: 12 other methods here (dagre.dagre.layout, dagre.dagre.layout::rank::longestPath, dagre.dagre.layout::rank::networkSimplex::initLowLimValues::dfs, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 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":"source/dagre.js"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"783e82b015ee9da41ed99650fe99db054cb86f9b4f7285435a9d87cfaae5cc72"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.graph (cognitive 50): Context.graph has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (37 pts), boolean chains 7, loops 3 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.js"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fac5acc5aca53b7311de2b9900456e14b59578f52c3c25e483dfbf026f768b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.open (cognitive 50): ModelFactory.open has cognitive complexity 50 (threshold 15). Drivers by points: if/else 9 (36 pts), error handling 8 (33 pts), loops 8 (26 pts), ternaries 4 (14 pts), boolean chains 7, match/switch 3 (5 pts) (nesting depth added 82). 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 shape REPEATS in the file: one other method here (ModelFactory.open::openProgram) 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":"source/paddle.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"41740e736faadf44bbd75a8e7e1c30a7ff5c77b556f7072c81fa627d9ba1e137"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.constructor (cognitive 50): Graph.constructor has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 4 (10 pts), boolean chains 7 (nesting depth added 25). Of this number, 37 points are the body\u0027s own statements and 13 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf.js"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bf3ab51382f511ee9e2995ded0ae5f9bf8ae38fad036d2e08824813ea9dda1"}},{"ruleId":"D2","level":"warning","message":{"text":"dagre.dagre.layout::position::findType1Conflicts (cognitive 49): dagre.dagre.layout::position::findType1Conflicts has cognitive complexity 49 (threshold 15). Drivers by points: if/else 4 (19 pts), loops 4 (17 pts), ternaries 2 (9 pts), boolean chains 4 (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. This shape REPEATS in the file: 12 other methods here (dagre.dagre.layout, dagre.dagre.layout::rank::longestPath, dagre.dagre.layout::rank::networkSimplex::initLowLimValues::dfs, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 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":"source/dagre.js"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9158a1d3118fb5a87fc4b6736d3d5ce76abc5ce3ee8ef0770fc28867e2c044"}},{"ruleId":"D2","level":"warning","message":{"text":"DenseArrayAttr.value (cognitive 49): DenseArrayAttr.value has cognitive complexity 49 (threshold 15). Drivers by points: ternaries 5 (23 pts), if/else 9 (13 pts), loops 4 (12 pts), boolean chains 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":1730}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd89cd766328b0bdb581a70fa4c76e6b511c2e1a2d0a159d81140945ec0e453"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeReader.parseOpWithoutRegions (cognitive 49): BytecodeReader.parseOpWithoutRegions has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (29 pts), loops 5 (12 pts), boolean chains 5, ternaries 1 (3 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":"source/mlir.js"},"region":{"startLine":7857}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bae1e475b0c844d2bbe8e577ff3784a9b3e3dc356bbf45b3044f966c0041ad"}},{"ruleId":"D2","level":"warning","message":{"text":"layout::order::buildLayerGraph (cognitive 49): layout::order::buildLayerGraph has cognitive complexity 49 (threshold 15). Drivers by points: loops 7 (23 pts), if/else 9 (21 pts), boolean chains 5 (nesting depth added 28). 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":"source/dagre.js"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb74809eb45e29f0cad724ae8ed255aad76e5e9bbfd1d0704a7344e84354fe76"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.updateTunnels::findTarget (cognitive 48): Graph.updateTunnels::findTarget has cognitive complexity 48 (threshold 15). Drivers by points: if/else 7 (29 pts), boolean chains 12, loops 3 (7 pts) (nesting depth added 26). 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":"source/view.js"},"region":{"startLine":2205}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b20c0136b110d46d68e8694664de830e9bf93825b4d2205e4f87be73a673b1"}},{"ruleId":"D2","level":"warning","message":{"text":"Object.constructor (cognitive 48): Object.constructor has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 3 (8 pts), boolean chains 6 (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":"source/mediapipe.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d94e18081205f77042c378f52c88288beb0a56175293c90e915d42976d9f071"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 48): constructor has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 6 (18 pts), boolean chains 13, if/else 7 (13 pts), loops 4 (nesting depth added 18). Of this number, 45 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mindir.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d43ac12cd1b374b190a2fd4d191a07f1f1951fc6697d2d1d6f7125157ec6da"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeReader.parseAttributeDict (cognitive 47): BytecodeReader.parseAttributeDict has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 11, loops 6 (11 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":"source/mlir.js"},"region":{"startLine":7966}}}],"partialFingerprints":{"codehealthFindingId/v1":"0736b51c78236c3369761fb810e967891790064bc07745248e5682bb8b857523"}},{"ruleId":"D2","level":"warning","message":{"text":"BuiltinDialect.readAttribute (cognitive 47): BuiltinDialect.readAttribute has cognitive complexity 47 (threshold 15). Drivers by points: loops 8 (17 pts), ternaries 6 (13 pts), if/else 7 (12 pts), boolean chains 4, match/switch 1 (nesting depth added 21). Of this number, 41 points are the body\u0027s own statements and 6 belong to one function item 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":"source/mlir.js"},"region":{"startLine":19653}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8620e53840eadc78df1564648cc58d508ef8cdcb1bf08a3de62379a4bee402"}},{"ruleId":"D2","level":"warning","message":{"text":"TFDeviceDialect.parseReplicateOp (cognitive 47): TFDeviceDialect.parseReplicateOp has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 5 (20 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":"source/mlir.js"},"region":{"startLine":23973}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebc2a50922d1fe2f6ad13c316babe4c965975040f5ab5a9bf79d0f0aef663d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Utility.weights::dict (cognitive 47): Utility.weights::dict has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 4 (16 pts), boolean chains 3, ternaries 1 (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 shape REPEATS in the file: one other method here (Utility.weights::list) 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":"source/numpy.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd6a80d531fbd403e869a2faf9653552aba25da65cf27dbe5de7f83dd546506"}},{"ruleId":"D2","level":"warning","message":{"text":"open (cognitive 47): open has cognitive complexity 47 (threshold 15). Drivers by points: if/else 8 (25 pts), boolean chains 8, loops 1 (7 pts), ternaries 3 (7 pts) (nesting depth added 27). Of this number, 46 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":"source/flatbuffers.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"123cba9f1fd2caebb819f68a5d91a97863729bee1300d7e36eeee399bb580922"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 47): constructor has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 7, ternaries 2 (5 pts), loops 2 (4 pts), match/switch 1 (4 pts) (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":"source/pytorch.js"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8e61b763a6f92a8cd5f11d94cdcc2d539c6391e04f33ded590e0abbcd82958"}},{"ruleId":"D2","level":"warning","message":{"text":"tags (cognitive 47): tags has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (24 pts), ternaries 2 (11 pts), boolean chains 4, error handling 1 (4 pts), match/switch 1 (4 pts) (nesting depth added 29). Of this number, 45 points are the body\u0027s own statements and 2 belong to 4 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":"source/view.js"},"region":{"startLine":7106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3563b5af86a7fa59eb9eaa661a0a28a27e5de30b1a182328e78c918244049d1e"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.constructor (cognitive 46): Node.constructor has cognitive complexity 46 (threshold 15). Drivers by points: match/switch 5 (17 pts), if/else 10 (16 pts), boolean chains 6, ternaries 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":"source/dl4j.js"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cf2feca4e1e000eb2755f0f2e77f8ed14a07e489164471d5fdc7ccabc78a4a"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.constructor (cognitive 45): Graph.constructor has cognitive complexity 45 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 8 (18 pts), ternaries 2 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 25). Of this number, 44 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dlc.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a418cee4d79c3e072dfb96ad25cd16b4346c76ada2f9a0e4d939dc3ea2863d7"}},{"ruleId":"D2","level":"warning","message":{"text":"Dialect.parseDynamicIndexList (cognitive 45): Dialect.parseDynamicIndexList has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (36 pts), boolean chains 3, loops 1 (3 pts), ternaries 2 (3 pts) (nesting depth added 25). Of this number, 43 points are the body\u0027s own statements and 2 belong to one function item 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":"source/mlir.js"},"region":{"startLine":10740}}}],"partialFingerprints":{"codehealthFindingId/v1":"031b6f7c582f7dd6d3e3cb41eaba94dd9391fc150fcbca1a65eba7a25f524504"}},{"ruleId":"D2","level":"warning","message":{"text":"read (cognitive 45): read has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 12, ternaries 3 (9 pts), loops 1 (2 pts) (nesting depth added 13). Of this number, 39 points are the body\u0027s own statements and 6 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":"source/dlc.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af2f5e446195149110d0ffab6a802a9ca6e61390aef18bc010fea7bdb5a40d1"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 45): constructor has cognitive complexity 45 (threshold 15). Drivers by points: boolean chains 20, if/else 7 (11 pts), ternaries 6 (11 pts), loops 3 (nesting depth added 9). Of this number, 41 points are the body\u0027s own statements and 4 belong to 8 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":"source/onnx.js"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16d83c4bce09e302d3147ded18facfb553f30f5fa18a8abe03bd7ef0a039625"}},{"ruleId":"D2","level":"warning","message":{"text":"_uint32 (cognitive 45): _uint32 has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (41 pts), boolean chains 4 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/protobuf.js"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"77412fde958fad1903a31498b4d8bcdfe02ee949c3fa9871595c2ac461f6e8de"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.open (cognitive 44): ModelFactory.open has cognitive complexity 44 (threshold 15). Drivers by points: error handling 10 (32 pts), if/else 9 (11 pts), ternaries 2 (8 pts), boolean chains 6, loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent 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 (ModelFactory.open::open) 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":"source/caffe2.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e103fb9ec15fdc71e1a9d4743116334c07540add5f137b349f821c99296ceb6a"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryReader.decode::decodeMessage (cognitive 44): BinaryReader.decode::decodeMessage has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (35 pts), loops 2 (6 pts), boolean chains 2, error handling 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 shape REPEATS in the file: one other method here (BinaryReader.decode) 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":"source/protobuf.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3469e4b952740a09195d485d3552142d4ed67f5fda9d588d70b87941520301dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.addTunnels::subgraphOuterRefs (cognitive 44): Graph.addTunnels::subgraphOuterRefs has cognitive complexity 44 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 8 (17 pts), boolean chains 5 (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. This shape REPEATS in the file: one other method here (Graph.addTunnels) 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":"source/view.js"},"region":{"startLine":2076}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a69264178991d2362b7741e0d34e0cc10c1dda19be25cab200d6ecfc4d5f646"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeSidebar.render (cognitive 44): NodeSidebar.render has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (19 pts), loops 6 (12 pts), boolean chains 10, ternaries 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":"source/view.js"},"region":{"startLine":3679}}}],"partialFingerprints":{"codehealthFindingId/v1":"c654d39d42f3b8a18f0be60f6b4b321fa802881424437b34a7ff759695d56701"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 44): constructor has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 9 (23 pts), loops 4 (9 pts), if/else 4 (8 pts), boolean chains 4 (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":"source/armnn.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"738988bc95527b30574951429f84e22e3b817cb009945a93197e91ff1e4e230f"}},{"ruleId":"D2","level":"warning","message":{"text":"exception (cognitive 44): exception has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (34 pts), ternaries 4 (9 pts), boolean chains 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":"source/browser.js"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"2470f2c9269e79f5f737530e972b8fe101894dbb14cb22e50de45b89fcc6a8a8"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 44): constructor has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 8, ternaries 3 (5 pts), loops 2 (4 pts), match/switch 1 (4 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":"source/darknet.js"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ae552a8cc996092d74e4b82e803fa625b98d3b938397399fdb286e4bc305df"}},{"ruleId":"D2","level":"warning","message":{"text":"open (cognitive 44): open has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 7, error handling 2 (5 pts), ternaries 1 (4 pts) (nesting depth added 21). Of this number, 37 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":7335}}}],"partialFingerprints":{"codehealthFindingId/v1":"152dfd1419245f8882e7c3eb6eff6175bf1fb083b30b899e65dad154b66a0f5b"}},{"ruleId":"D2","level":"warning","message":{"text":"package.update (cognitive 43): package.update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 8, loops 4 (6 pts), ternaries 2, error handling 1 (nesting depth added 13). Of this number, 22 points are the body\u0027s own statements and 21 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.js"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"7127915b78068875f1cbab165872f7d48bba709be11abc9c8aa21664473acec7"}},{"ruleId":"D2","level":"warning","message":{"text":"Container._params4 (cognitive 43): Container._params4 has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (8 pts), boolean chains 5, ternaries 2 (5 pts), error handling 2 (3 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":"source/dlc.js"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71f1bd8af4e6b6f2041175e1611c30c61d32b56a7a09d8398f191b056eff399"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.constructor (cognitive 43): Context.constructor has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 3 (12 pts), loops 4 (8 pts), boolean chains 7 (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":"source/espdl.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bae5dba076f824007631a834bc776445a0a2a4bb80222c780e2906e4e836f03"}},{"ruleId":"D2","level":"warning","message":{"text":"StructType.parse (cognitive 43): StructType.parse has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (36 pts), loops 3 (7 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":"source/mlir.js"},"region":{"startLine":17507}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cc23df8d8bfd3877ee5b3fd0931748368f9d638f4535ea63e0383d008519de"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 43): constructor has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (11 pts), boolean chains 8, ternaries 1 (nesting depth added 22). Of this number, 42 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":"source/view.js"},"region":{"startLine":2779}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10d67a826789a1f081b2bc2a3981483b14de36015acd6442af8e15904937a82"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.open::openJson::openShards (cognitive 42): ModelFactory.open::openJson::openShards has cognitive complexity 42 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 4 (11 pts), ternaries 2 (7 pts), boolean chains 3, match/switch 1 (3 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. This shape REPEATS in the file: one other method here (ModelFactory.open::openJson) 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":"source/tf.js"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdb15bd89f9d7f78548b2f161c8770df9c19625b4e1f35651b1fb7785cb0e06"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 42): constructor has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (8 pts), match/switch 2 (7 pts), ternaries 4 (6 pts), boolean chains 5 (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":"source/dlc.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1254915a4a0c910fb0bd473db62a554a5df17a69fd2c98180c269c622e74450"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 42): constructor has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 7 (18 pts), boolean chains 3, ternaries 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":"source/mediapipe.js"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c274a751ad468ca717e3c8bf39c35d597b305bce73d4fce469680fef1f6d66"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 42): constructor has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 7 (13 pts), boolean chains 7, loops 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":"source/onnx.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee73b3b601a1149f63dd780ebb058e85723098f26b819b6dfb1f218708018fa"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parseBlock (cognitive 41): Parser._parseBlock has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 2 (6 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":"source/dot.js"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb72a07fe7cd994ffe700d3377f8aa94313cd70c417fcda07a0aa86a026fb4fd"}},{"ruleId":"D2","level":"warning","message":{"text":"HLODialect.parseReduceOp (cognitive 41): HLODialect.parseReduceOp has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (26 pts), ternaries 2 (7 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 18). Of this number, 38 points are the body\u0027s own statements and 3 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":"source/mlir.js"},"region":{"startLine":11499}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6ae99d233800f192a772a11993280fba621df2f626f450e957b9c0a917b8f6"}},{"ruleId":"D2","level":"warning","message":{"text":"IREEDialect.parseDispatchEntryPoints (cognitive 41): IREEDialect.parseDispatchEntryPoints has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (34 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (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":"source/mlir.js"},"region":{"startLine":13474}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc37146f9db22ba86f8b4e00bd7cf1c3dda322a1ddb5abc8b42888ac7258f0d"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowDialect.parseFlowFuncOp (cognitive 41): FlowDialect.parseFlowFuncOp has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 2 (9 pts), boolean chains 2 (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":"source/mlir.js"},"region":{"startLine":14853}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1da868b8675b9578f6fe5eea4dc01d4f1678bacd31f50d811b9485601dd5ab"}},{"ruleId":"D2","level":"warning","message":{"text":"layout::rank::networkSimplex::initCutValues (cognitive 41): layout::rank::networkSimplex::initCutValues has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (21 pts), ternaries 5 (16 pts), loops 3 (4 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":"source/dagre.js"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e0d9b79789a9d92ea2417d99af9f26f0f6f6b68a811eda800f6d35f3d45b22"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 41): constructor has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 4 (16 pts), boolean chains 8, if/else 5 (8 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 20). Of this number, 32 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/hailo.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7e3437879a2d8306c9a83fd213981671ebeabe3510ae339aaf90f038ee4ed1"}},{"ruleId":"D2","level":"warning","message":{"text":"_parseAttributeValue (cognitive 41): _parseAttributeValue has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 7, match/switch 1 (2 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":"source/onnx.js"},"region":{"startLine":2340}}}],"partialFingerprints":{"codehealthFindingId/v1":"688b9a5c64f152ed350616b62333be74152052837d9e16c198117ff5d46110cb"}},{"ruleId":"D2","level":"warning","message":{"text":"open (cognitive 41): open has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (19 pts), ternaries 5 (14 pts), boolean chains 3, error handling 2 (3 pts), match/switch 2 (nesting depth added 21). Of this number, 32 points are the body\u0027s own statements and 9 belong to one function item 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":"source/tosa.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cad98df917a2af80b7a66c08052b610d5cd07d0ab00c5ba31d3a4c9580dd23"}},{"ruleId":"D2","level":"warning","message":{"text":"Host.start (cognitive 40): Host.start has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 10, ternaries 4 (6 pts) (nesting depth added 13). Of this number, 30 points are the body\u0027s own statements and 10 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":"source/browser.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"209de7fbebb622d02f3ecc52a99a9050241f05d672dd4e8998d10c22963d5f9b"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.layout (cognitive 40): Graph.layout has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 12, loops 6 (8 pts), ternaries 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":"source/grapher.js"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8439d7aa9e5232876a719ba1b7bc29f0d01deaf74d830070d03cc70b32dd0d6f"}},{"ruleId":"D2","level":"warning","message":{"text":"FindSidebar._value (cognitive 40): FindSidebar._value has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (28 pts), boolean chains 5, ternaries 1 (5 pts), loops 1 (2 pts) (nesting depth added 23). Of this number, 35 points are the body\u0027s own statements and 5 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":"source/view.js"},"region":{"startLine":4920}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27e2e4adde5507985a951b084fc0d87354478560e4a6fc384abba5e6e6ee9e9"}},{"ruleId":"D2","level":"warning","message":{"text":"GpuDialect.parseOperation (cognitive 40): GpuDialect.parseOperation has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (30 pts), ternaries 5 (10 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":"source/mlir.js"},"region":{"startLine":20608}}}],"partialFingerprints":{"codehealthFindingId/v1":"a378b7a4cfcf732737a58e05c2d8f01eb3871834019833950384d0b511d05d13"}},{"ruleId":"D2","level":"warning","message":{"text":"ColumnConcatenatingTransformer.constructor (cognitive 40): ColumnConcatenatingTransformer.constructor has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 7 (20 pts) (nesting depth added 26). 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":"source/mlnet.js"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee25e7321e20a8904993592725197c8e77a1e2af1f9a6678757b96e673752f4e"}},{"ruleId":"D2","level":"warning","message":{"text":"match (cognitive 40): match has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 15 (nesting depth added 14). Of this number, 38 points are the body\u0027s own statements and 2 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":"source/transformers.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b4abf471772cc4bd4bfd8d44455b679f540351034615e86c11c628ac136dbd"}},{"ruleId":"D2","level":"warning","message":{"text":"View.refresh::animateTransition::tick (cognitive 39): View.refresh::animateTransition::tick has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (35 pts), loops 2 (3 pts), boolean chains 1 (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 shape REPEATS in the file: one other method here (View.refresh::animateTransition) 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":"source/view.js"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ca0d4ca5ff1305db590aad07e628dddaef94a6550f310d08a41a9c63c0fc11"}},{"ruleId":"D2","level":"warning","message":{"text":"View._updatePath (cognitive 39): View._updatePath has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 19). Of this number, 34 points are the body\u0027s own statements and 5 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":"source/view.js"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf627883ee9c09e00b9bef3302618dc360daf090954e344afc89895d1118d68"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationParser.finalize::walk (cognitive 39): OperationParser.finalize::walk has cognitive complexity 39 (threshold 15). Drivers by points: if/else 6 (25 pts), loops 4 (14 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":"source/mlir.js"},"region":{"startLine":4994}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aefaba47c1129eb3decd2b6b1625bf341d086899868d162b53ea5992c43cf03"}},{"ruleId":"D2","level":"warning","message":{"text":"TensorLiteralParser.getAttr::convertElement (cognitive 39): TensorLiteralParser.getAttr::convertElement has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (24 pts), ternaries 3 (9 pts), boolean chains 6 (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 shape REPEATS in the file: one other method here (TensorLiteralParser.getAttr) 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":"source/mlir.js"},"region":{"startLine":6510}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c513da1c9010ea20523fa7900f364761a64d3ed8605b24866bef67e94662e7"}},{"ruleId":"D2","level":"warning","message":{"text":"BufferizationDialect.parseOperation (cognitive 39): BufferizationDialect.parseOperation has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":19856}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9750ca2d497e1e97b1fb306d047b93fe8971a805c4886fd0340e7d4dc6a5d60"}},{"ruleId":"D2","level":"warning","message":{"text":"TFRTTestDialect.parseOperation (cognitive 39): TFRTTestDialect.parseOperation has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 4 (10 pts), boolean chains 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":"source/mlir.js"},"region":{"startLine":27458}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df0d24b00bf7a5010323c18d8186201b83796cb22705da3a625030552bc9e81"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.open::read_weights_hdf5 (cognitive 39): ModelFactory.open::read_weights_hdf5 has cognitive complexity 39 (threshold 15). Drivers by points: if/else 4 (17 pts), loops 4 (16 pts), ternaries 1 (5 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":"source/keras.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ac14512eaea4b42b0f7f99f53af21d67e192f927b34de590e93d769f747424"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 39): constructor has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 7 (19 pts), if/else 7, boolean chains 6, loops 3 (6 pts), match/switch 1 (nesting depth added 15). Of this number, 34 points are the body\u0027s own statements and 5 belong to 4 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":"source/kann.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b963f0d468070e1fe0f202e14b3a40bbd6d3d0eef85906b2b7e5185c8e4bd69c"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 39): constructor has cognitive complexity 39 (threshold 15). Drivers by points: loops 11 (14 pts), ternaries 3 (10 pts), if/else 4 (8 pts), match/switch 2 (5 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":"source/pytorch.js"},"region":{"startLine":2286}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94e3b6e74260f0113a5b120e2aa2e56e4c9692ed6cffbff7014a88abd01c7d0"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 39): constructor has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 11, ternaries 1 (5 pts), loops 2 (4 pts) (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":"source/xmodel.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ef12381090642fdff7df4f19b9f753c29bbbaecdf56cd11dad56c1fe91e1d2"}},{"ruleId":"D2","level":"warning","message":{"text":"Datatype.constructor (cognitive 38): Datatype.constructor has cognitive complexity 38 (threshold 15). Drivers by points: loops 5 (18 pts), if/else 5 (17 pts), match/switch 2 (3 pts) (nesting depth added 26). 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":"source/hdf5.js"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"572cec39751a6cc8352265ec9d41b5a340d6f3de197c800bf293838235b38f4f"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor.constructor (cognitive 38): Tensor.constructor has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 12, ternaries 3 (7 pts), loops 1 (3 pts) (nesting depth added 14). Of this number, 35 points are the body\u0027s own statements and 3 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":"source/mlir.js"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"db88788d3714f1e80887ffd94202f40565b791a04e253d89fbea8e424f191be0"}},{"ruleId":"D2","level":"warning","message":{"text":"LinalgDialect.parseCommonStructuredOpParts (cognitive 38): LinalgDialect.parseCommonStructuredOpParts has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 4 (12 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":"source/mlir.js"},"region":{"startLine":16164}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5e57f3bf5e3ee12ecfa5672bc58178d7a17e24e31b9256a1e07225ba9ad959"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.constructor (cognitive 38): Graph.constructor has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (23 pts), loops 5 (10 pts), boolean chains 5 (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":"source/onnx.js"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d57d3a940b531275ace5cbd4bca97072fe2c18e5660056d5bc424392cbda681"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor.constructor (cognitive 38): Tensor.constructor has cognitive complexity 38 (threshold 15). Drivers by points: loops 4 (16 pts), boolean chains 14, if/else 4 (5 pts), match/switch 1 (3 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":"source/tf.js"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"62dd2bdcd2b023bb47609ab3d80f0a4dca063cccc8a867ef31bb358ad6cccc9a"}},{"ruleId":"D2","level":"warning","message":{"text":"open (cognitive 38): open has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 3 (8 pts), boolean chains 6, error handling 3 (5 pts), match/switch 1 (nesting depth added 14). Most of this is not in the body itself: 15 of the 38 points are its own statements and the rest belongs to 6 function items inside it that branch (openNetParameterText::field, openNetParameterText, a function literal at line 55, \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":"source/caffe.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de92e02d80ffee7e3d4eb514c1bea605773a2016a3029eec713e33d87e0104e"}},{"ruleId":"D2","level":"warning","message":{"text":"_readBson (cognitive 38): _readBson has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (27 pts), match/switch 2 (5 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 19). Of this number, 35 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/json.js"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"785a6be20b43f11031442db69701597a0a347bcbf6db742954c0945a9a8dbad4"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 38): constructor has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 11, ternaries 5 (10 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pickle.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6feec001af2e9df2a484dd140593c2d50a812fd618c732c56473dce8a42a3c"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.build (cognitive 37): Context.build has cognitive complexity 37 (threshold 15). Drivers by points: if/else 27 (52 pts), loops 19 (29 pts), boolean chains 18, ternaries 5 (11 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (Context.build::resolveBlock, Context.build::buildBlockLayers, Context.build::sectionFlat) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/gguf.js"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58367e37fa8334f63f0cbe1e557e83f73df6c4331fc7eab53fc56fdfceb1392"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationParser.parseRegion (cognitive 37): OperationParser.parseRegion has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 11, loops 4 (8 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":"source/mlir.js"},"region":{"startLine":5363}}}],"partialFingerprints":{"codehealthFindingId/v1":"608b2ccb9fda0eb446c96ee102ef0864aee23253ee052c9a43b1573d6d523682"}},{"ruleId":"D2","level":"warning","message":{"text":"LLVMDialect.parseIndirectBrOpSucessors (cognitive 37): LLVMDialect.parseIndirectBrOpSucessors has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (16 pts), ternaries 1 (4 pts) (nesting depth added 26). 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":"source/mlir.js"},"region":{"startLine":22996}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0b632a65f00d79f6ba64b9bae600cb0a1c1805172527501785c73ab6428113"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 37): constructor has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 16, ternaries 2 (3 pts), loops 1 (nesting depth added 4). Of this number, 35 points are the body\u0027s own statements and 2 belong to 7 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pickle.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"847ef74958022163222879a2896c100129e2b346168f99ecf81fa30ad528df21"}},{"ruleId":"D2","level":"warning","message":{"text":"read (cognitive 37): read has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 3 (8 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 22). Of this number, 32 points are the body\u0027s own statements and 5 belong to 8 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tnn.js"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"d975a113acd64e32c707507c8b96770c4f2ef3e348b46d8b7251eeb62cbc074f"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 37): constructor has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 13, ternaries 3 (5 pts), loops 2 (3 pts) (nesting depth added 7). Of this number, 33 points are the body\u0027s own statements and 4 belong to 5 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":"source/view.js"},"region":{"startLine":3878}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a213cee3456ca1e58937fd371d5e270c8f6169fe8c38e95e8fb3cc07fb64a8"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.constructor (cognitive 36): Node.constructor has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (8 pts), boolean chains 7, ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/bigdl.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d4d84408c40df759ab87a65d29a4f8c6db12726fccb7bd9efbf0c55b08f171"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraint._parseGeneric (cognitive 36): Constraint._parseGeneric has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 7, loops 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":"source/mlir.js"},"region":{"startLine":8277}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf61530f04ffcc1fb1175efe0453ad98b7492a60bab1f692f2cbd09c8c268c9b"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorDialect.parseExtractOp (cognitive 36): VectorDialect.parseExtractOp has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (27 pts), ternaries 1 (5 pts), loops 1 (3 pts), boolean chains 1 (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":"source/mlir.js"},"region":{"startLine":12837}}}],"partialFingerprints":{"codehealthFindingId/v1":"30373be9d80c9038773bf779b433397e337a1f50d59fb3f904b107e78bc81d1f"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenMPDialect.parseBlockArgClause (cognitive 36): OpenMPDialect.parseBlockArgClause has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":21804}}}],"partialFingerprints":{"codehealthFindingId/v1":"705f214c02fe334499c6334b1cc18bd19e711262f5905fbaeb91c0b391dff35a"}},{"ruleId":"D2","level":"warning","message":{"text":"TFLDialect.parseOperation (cognitive 36): TFLDialect.parseOperation has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 2 (7 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":25391}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37dfe91c6b63261371644379b99f16466536231d7ee530130acaa8416b9b2a7"}},{"ruleId":"D2","level":"warning","message":{"text":"ACCDialect.parseOperation (cognitive 36): ACCDialect.parseOperation has cognitive complexity 36 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 7 (16 pts), ternaries 1 (2 pts), boolean chains 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":"source/mlir.js"},"region":{"startLine":28075}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56d1414b060c93f1e2f84e26741ea0eeff0a13db3de08a4dcf8d2e1d6eeabd8"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.open::openProgram (cognitive 36): ModelFactory.open::openProgram has cognitive complexity 36 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 2 (8 pts), ternaries 2 (6 pts), boolean chains 5, error handling 2 (4 pts), 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. This shape REPEATS in the file: one other method here (ModelFactory.open) 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":"source/paddle.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d718dcb98914c25238c0bcc57fd5d0c35a9534ded077e4a5b05e5b79c80678fc"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 36): constructor has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 15, if/else 7 (9 pts), ternaries 3 (7 pts), loops 3 (5 pts) (nesting depth added 8). Of this number, 34 points are the body\u0027s own statements and 2 belong to 5 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":"source/barracuda.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5167d338ab3334713cbc273d55540c5087c0cfdd596233b8c7fb22ba8eff25b"}},{"ruleId":"D2","level":"warning","message":{"text":"node::weights (cognitive 36): node::weights has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (22 pts), ternaries 4 (11 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"0177df8187a889abb45f913971a903842ffe08abd6fd9b4424957d059269de60"}},{"ruleId":"D2","level":"warning","message":{"text":"graph::updateTorchScript::match (cognitive 36): graph::updateTorchScript::match has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 8, match/switch 1 (2 pts), ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf.js"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e90379c109b01d8f9f00af310080e400f19a51fb2dcfb703818d1d8094dc26"}},{"ruleId":"D2","level":"warning","message":{"text":"_update (cognitive 36): _update has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (17 pts), ternaries 3 (7 pts), loops 3 (5 pts), boolean chains 4, match/switch 1 (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":"source/view.js"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa5bcf875ad91ed7667c44cd01d7d77c47eb301af1e9c1973562d3450a572ce"}},{"ruleId":"D2","level":"warning","message":{"text":"dagre.dagre.layout::removeEmptyRanks (cognitive 35): dagre.dagre.layout::removeEmptyRanks has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 4 (13 pts), boolean chains 2 (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 shape REPEATS in the file: 12 other methods here (dagre.dagre.layout, dagre.dagre.layout::rank::longestPath, dagre.dagre.layout::rank::networkSimplex::initLowLimValues::dfs, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 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":"source/dagre.js"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc684feeb6dedb96680286e2bbcadad6e12645ea98dd674be8654f72abd2fc20"}},{"ruleId":"D2","level":"warning","message":{"text":"Decoder.open (cognitive 35): Decoder.open has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 16, if/else 14 (16 pts), loops 1 (2 pts), ternaries 1 (nesting depth added 3). Of this number, 33 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"source/text.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6fcc9a66d638c99ab55513e1d8fc98a06a9de1c536dd7e71e3170deac0cdd8"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.constructor (cognitive 35): Graph.constructor has cognitive complexity 35 (threshold 15). Drivers by points: loops 8 (12 pts), boolean chains 10, if/else 4 (8 pts), ternaries 3 (5 pts) (nesting depth added 10). Of this number, 28 points are the body\u0027s own statements and 7 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":"source/executorch.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0e9c22270c7c41801971644b5b9ab0b84e699848d3928d7c472c2018fea859"}},{"ruleId":"D2","level":"warning","message":{"text":"TextReader._parseLiteral (cognitive 35): TextReader._parseLiteral has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 8, loops 3 (7 pts), ternaries 1 (2 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":"source/onnx.js"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28507b572ca41aa4578359c57ab452805f9904db22465fa9578233c8c289215"}},{"ruleId":"D2","level":"warning","message":{"text":"LayerResourceReader.constructor (cognitive 35): LayerResourceReader.constructor has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (29 pts), match/switch 1 (3 pts), loops 1 (2 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":"source/tnn.js"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e40fb520a07744a0c728cceb6e7732b4dc1307823ce599faf92dbd57ba4d47c"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.constructor (cognitive 35): Graph.constructor has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 6 (11 pts), ternaries 2 (6 pts), boolean chains 5 (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":"source/uff.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ff15bcd5fe5d317a392638154731ae94dfb926f29f14864cea06e404d145a0"}},{"ruleId":"D2","level":"warning","message":{"text":"open (cognitive 35): open has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 6 (9 pts), if/else 5 (7 pts), error handling 3 (5 pts), loops 3 (5 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 12). Most of this is not in the body itself: 15 of the 35 points are its own statements and the rest belongs to 10 function items inside it that branch (a function literal at line 181, child, edges, \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":"source/openvino.js"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded6a79b6036a74749ab1be5cdc34b3f905f2a6bfea164e8aa693eeb52c8f1c9"}},{"ruleId":"D2","level":"warning","message":{"text":"build (cognitive 35): build has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (18 pts), ternaries 2 (8 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 19). Of this number, 28 points are the body\u0027s own statements and 7 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":"source/view.js"},"region":{"startLine":3199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61fe31f1d4cd9a673493b54f9e15881b112cf3a38c0ab8ceed4eb4ad34ad942"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.constructor (cognitive 34): Graph.constructor has cognitive complexity 34 (threshold 15). Drivers by points: loops 7 (13 pts), ternaries 5 (13 pts), if/else 3 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 16). Of this number, 24 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/armnn.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae25618f284b0d2cd8a7eedc3cef0f558af5236c582bff690f8ff642804bb6c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.lexNumber (cognitive 34): Lexer.lexNumber has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 11, loops 4 (9 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":2660}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1ebc0b96f4a7eb0bafa7c555999902df126d653005cbb2eef4187dcb446826"}},{"ruleId":"D2","level":"warning","message":{"text":"HALDialect.parseParamValue (cognitive 34): HALDialect.parseParamValue has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (13 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":14145}}}],"partialFingerprints":{"codehealthFindingId/v1":"986a5f9007fc5f0b85ff8454bdada1f06735e467fff83b1ddc8b98b50f8a9adf"}},{"ruleId":"D2","level":"warning","message":{"text":"UtilDialect.parseUtilFuncOp (cognitive 34): UtilDialect.parseUtilFuncOp has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (9 pts), ternaries 1 (5 pts), boolean chains 2 (nesting depth added 17). Of this number, 22 points are the body\u0027s own statements and 12 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":14585}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b0eb5ce842826dc73ac15615c328741c033c5f02c5c16681a71bf09085739e"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseTensorDialect.parseCoIterateOp (cognitive 34): SparseTensorDialect.parseCoIterateOp has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 8 (11 pts), boolean chains 4 (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":"source/mlir.js"},"region":{"startLine":20406}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5d6565ba6d4fc4a4e9d649b82694bc33c3eacada40dd981cfb3296a1e24125"}},{"ruleId":"D2","level":"warning","message":{"text":"LLVMDialect.parseSwitchOpCases (cognitive 34): LLVMDialect.parseSwitchOpCases has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 4 (10 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":"source/mlir.js"},"region":{"startLine":22630}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a3a5cb1460b8655ddf60a48dcf659c12b93d85b1e970e0c29dc510e6a8f42d"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonReader._attribute (cognitive 34): JsonReader._attribute has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 19, if/else 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":"source/onnx.js"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d9e1d045260479b915cd6f75adeec2526729d1f992786a309e02a37afd13b9"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 34): constructor has cognitive complexity 34 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3 (9 pts), loops 4 (8 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 16). Of this number, 30 points are the body\u0027s own statements and 4 belong to 4 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":"source/dnn.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac59366c3720d9a7d402c65c02bf670c4b613f30d5d86d38df747b28c642b19d"}},{"ruleId":"D2","level":"warning","message":{"text":"decodeJson (cognitive 34): decodeJson has cognitive complexity 34 (threshold 15). Drivers by points: if/else 32, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":9091}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e76e525f02a72f875066aca77915ace0f87908009ac7c92ef38c94851332f8"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 34): constructor has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 10, ternaries 2 (4 pts), loops 2 (nesting depth added 10). Of this number, 32 points are the body\u0027s own statements and 2 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":"source/torch.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"760f20a89838f5b20c2eabaf1b5fd19315fe048641acfdf4b77f48239904599a"}},{"ruleId":"D2","level":"warning","message":{"text":"update (cognitive 34): update has cognitive complexity 34 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 6 (12 pts), boolean chains 5, ternaries 2 (nesting depth added 15). Of this number, 27 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":3556}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5d5761b2558f68b910bcc496348faebc3645d808b88759b89bde4b11141e5b"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.match (cognitive 33): ModelFactory.match has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (20 pts), boolean chains 6, match/switch 2 (6 pts), ternaries 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe2.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf5fb38e00b8c704aead0b08fa7f382e9f3b452e2745f1f9ad18327f4f54164"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.updatePreprocessing (cognitive 33): Graph.updatePreprocessing has cognitive complexity 33 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 5 (14 pts), ternaries 1 (3 pts), boolean chains 2 (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":"source/coreml.js"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa67fe851c2514021a5b5071b35ae96aa7367328a3f29819631734bd5063c2f"}},{"ruleId":"D2","level":"warning","message":{"text":"dagre.dagre.layout::position::horizontalCompaction (cognitive 33): dagre.dagre.layout::position::horizontalCompaction has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 5 (13 pts), boolean chains 1, ternaries 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. This shape REPEATS in the file: 12 other methods here (dagre.dagre.layout, dagre.dagre.layout::rank::longestPath, dagre.dagre.layout::rank::networkSimplex::initLowLimValues::dfs, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 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":"source/dagre.js"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa2a8d957393f1c25f6adeb759ac39762a43083482be752e84fd22e503f662b"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.lexToken (cognitive 33): Lexer.lexToken has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (29 pts), match/switch 1 (2 pts), boolean chains 1, loops 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":"source/mlir.js"},"region":{"startLine":2504}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ea50271098758bef22df5afc4da2793c84f6ed6c60f251f00739d85328b704"}},{"ruleId":"D2","level":"warning","message":{"text":"OpAsmParser.parseFunctionArgumentList (cognitive 33): OpAsmParser.parseFunctionArgumentList has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 1 (2 pts), boolean chains 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":"source/mlir.js"},"region":{"startLine":5936}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b506c9afe327dc0e66b8ceea3720e132263701b4d9e9f7c53de2cc436aa122"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraint.tokenize (cognitive 33): Constraint.tokenize has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (7 pts), boolean chains 5 (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":"source/mlir.js"},"region":{"startLine":8104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a11213d0ca3ee8085e76e4238518a1ad12a2ded6488cce0e6faf3b68103a9a6"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraint.parseListArgument (cognitive 33): Constraint.parseListArgument has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 5, 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":"source/mlir.js"},"region":{"startLine":8368}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fc1c0a1d6692ef5d4c7328f7e6c6393b7381274528edc32d9e3dfec5ad0998"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenMPDialect.parseBlockArgRegion (cognitive 33): OpenMPDialect.parseBlockArgRegion has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 10, loops 4 (6 pts), ternaries 1 (nesting depth added 10). Of this number, 32 points are the body\u0027s own statements and 1 belongs 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":"source/mlir.js"},"region":{"startLine":21908}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f7a23adf8ac6ec8f9a1b417cdbdc70b62ac95e41dafebbacc45d63e291b8a6"}},{"ruleId":"D2","level":"warning","message":{"text":"LLVMDialect.parseLLVMCallOp (cognitive 33): LLVMDialect.parseLLVMCallOp has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 4 (15 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":"source/mlir.js"},"region":{"startLine":23056}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cbda42ccc23eec18c3567e4a33f759f90fa2982e3893631aca194d5bd31e99"}},{"ruleId":"D2","level":"warning","message":{"text":"TFGDialect.parseOperation (cognitive 33): TFGDialect.parseOperation has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 1 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":24051}}}],"partialFingerprints":{"codehealthFindingId/v1":"844a1d3a9df1b778ceb2c1403162d6fc5e90e01299872d9eb60ca6bb3bdd255e"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.match (cognitive 33): ModelFactory.match has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 11, ternaries 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":"source/keras.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b9f73658c4dddf12226fc02aeecd4a9c1cd5c99be26e396d5d15e5f9d0df0e"}},{"ruleId":"D2","level":"warning","message":{"text":"Group.constructor (cognitive 33): Group.constructor has cognitive complexity 33 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 5 (13 pts), ternaries 1 (3 pts), boolean chains 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":"source/onnx.js"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51c75576674416930579ff11b038109cacdd1c5af0459a2936e2f7ffe5b76eb"}},{"ruleId":"D2","level":"warning","message":{"text":"type (cognitive 33): type has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 10, match/switch 3 (9 pts) (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":"source/hdf5.js"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2ff69f21f7c7eb384bb7eb8c84a51b6e9f72795d66b8c7a3e04c09bb6b5c87"}},{"ruleId":"D2","level":"warning","message":{"text":"_lzf (cognitive 33): _lzf has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 4 (8 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":"source/hdf5.js"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e231b366ea3d23a37d3ac10a68f9f3c1a75c5c8bf5455011b19437b632f386f"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamDialect.parseResourceRegion (cognitive 32): StreamDialect.parseResourceRegion has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 5 (9 pts) (nesting depth added 14). Of this number, 24 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":15343}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ebe1688ec0bc1b61f18fcbadfadef5cc61f6887b611da5cbb9b67636cd9bf4"}},{"ruleId":"D2","level":"warning","message":{"text":"SPIRVDialect.parseSwitchOpCases (cognitive 32): SPIRVDialect.parseSwitchOpCases has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 5 (11 pts), boolean chains 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. This shape REPEATS in the file: one other method here (CFDialect.parseSwitchOpCases) 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":"source/mlir.js"},"region":{"startLine":17828}}}],"partialFingerprints":{"codehealthFindingId/v1":"0006ec140d17962522376d8805ae52ec847472c1aedf028f3aacc66d5bbd8818"}},{"ruleId":"D2","level":"warning","message":{"text":"CFDialect.parseSwitchOpCases (cognitive 32): CFDialect.parseSwitchOpCases has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 5 (11 pts), boolean chains 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. This shape REPEATS in the file: one other method here (SPIRVDialect.parseSwitchOpCases) 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":"source/mlir.js"},"region":{"startLine":18765}}}],"partialFingerprints":{"codehealthFindingId/v1":"987eb2b8f6c49ae40422836b646915c0417a69c80fe5487603fc852b86004908"}},{"ruleId":"D2","level":"warning","message":{"text":"_Graph.to_json (cognitive 32): _Graph.to_json has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 7 (10 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":"source/pytorch.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4d1c56ba6d82a09cc51665a635e4044e1ce5f4d07f44b79b912909e1cf69fc"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 32): constructor has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 4 (12 pts), boolean chains 9, loops 4 (7 pts), if/else 3 (4 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":"source/acuity.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89d0354b69f4dd2884694ecaf0041aa11e571bace6474e512b6f0afee436c42"}},{"ruleId":"D2","level":"warning","message":{"text":"TextReader.open (cognitive 31): TextReader.open has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (23 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":"source/json.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5d89c59b7654f59cd23ce30f5d89e5fcb7bd07f31bc773363aaf66f90f6649"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.addTunnels (cognitive 31): Graph.addTunnels has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (43 pts), loops 11 (23 pts), boolean chains 9 (nesting depth added 42). To reduce it, split the body into named stages: move each independent 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 (Graph.addTunnels::subgraphOuterRefs) 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":"source/view.js"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7b45e3ea3c55b1514ff747a3d50727f18b24b9bdb5591dbbb82fb3300a6588"}},{"ruleId":"D2","level":"warning","message":{"text":"TFExecutorDialect.parseGraphOp (cognitive 31): TFExecutorDialect.parseGraphOp has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (16 pts), ternaries 1 (6 pts), loops 1 (5 pts), boolean chains 4 (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":"source/mlir.js"},"region":{"startLine":24275}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcb3d5e39212c72313ad0db064adc6168b70d9cd8c19dc501a3919e230ef378"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformDialect.parsePackedOrDynamicIndexList (cognitive 31): TransformDialect.parsePackedOrDynamicIndexList has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 2 (4 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":25748}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f919fef9907182d7586f3924127879a7a72e3828190b192907bd3031a025a4f"}},{"ruleId":"D2","level":"warning","message":{"text":"TestDialect.inferResultTypes (cognitive 31): TestDialect.inferResultTypes has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 6, loops 2 (5 pts), ternaries 2 (4 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":"source/mlir.js"},"region":{"startLine":26483}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb1c21d955878d238dbee556a5b342ff7b5d25940e7f68b08d0a69989de1d56"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.constructor (cognitive 31): Graph.constructor has cognitive complexity 31 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 6 (9 pts), boolean chains 8, ternaries 2 (nesting depth added 7). Of this number, 22 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onednn.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"db841d82fa25cae0e309ddd78f0c7bef2407d8da4017b34e93319526ce6af7a8"}},{"ruleId":"D2","level":"warning","message":{"text":"IR.op (cognitive 31): IR.op has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (43 pts), loops 11 (32 pts), ternaries 4 (16 pts), boolean chains 5 (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. This shape REPEATS in the file: one other method here (IR.op::collectRegions) 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":"source/paddle.js"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ec2abdcc70fbe6aaf18151b94ce347e6669d65f00cbb26f1bcfd561bd0625b"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphMetadata.visible (cognitive 31): GraphMetadata.visible has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf.js"},"region":{"startLine":1705}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0b8e766adb7e485cdfb22173604f896920aec883585ef86e906508fa2ec741"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor::getAllOprAndTensor (cognitive 31): constructor::getAllOprAndTensor has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 4 (15 pts), if/else 4 (9 pts), loops 2 (4 pts), boolean chains 3 (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":"source/megengine.js"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bd1d8f96e5ec9ad904a45757b9d1b0f812b84acdefca2a589ddb309804b207"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 31): constructor has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 7 (11 pts), boolean chains 7 (nesting depth added 10). Of this number, 30 points are the body\u0027s own statements and 1 belongs to 8 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":"source/message.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d300fe9dca2100ccaa1b192226dd21e7c7e53d38f25cfaad9f1b8ccdf7236ba8"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 31): constructor has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 3 (9 pts), loops 5 (6 pts), boolean chains 4 (nesting depth added 11). Most of this is not in the body itself: 14 of the 31 points are its own statements and the rest belongs to 3 function items inside it that branch (map, a function literal at line 90, a function literal at line 121). 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":"source/mnn.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4440c34d0bdc497baab1c84ff516f3907d280bfc6df50bbddecf32f5646852f"}},{"ruleId":"D2","level":"warning","message":{"text":"open (cognitive 31): open has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (13 pts), error handling 4 (9 pts), ternaries 2 (6 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":"source/ncnn.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edcb73a82cd274597cc75caac51fe5404a8506cb21aeb2ed77f85eb59a1d349"}},{"ruleId":"D2","level":"warning","message":{"text":"exception (cognitive 31): exception has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), ternaries 4 (9 pts), error handling 1 (2 pts), boolean chains 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":"source/desktop.mjs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bba815ea0f0e1f67e75ebc96892f16a4a80fef8973f1f47c55b1fd580f379d"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.node (cognitive 30): Graph.node has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (35 pts), ternaries 11 (24 pts), boolean chains 12, loops 4 (6 pts), match/switch 2 (3 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"771598215095bded4e8ca5400c6d5ccd58506c947919df7683141cfcfe73d566"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.model (cognitive 30): Graph.model has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 6 (16 pts), loops 6 (12 pts), boolean chains 1, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4a138da3ca2f0038407f61d0cdcbd88be365fd1f1c413362eddc1f1fa653ff"}},{"ruleId":"D2","level":"warning","message":{"text":"ValueView.expand (cognitive 30): ValueView.expand has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 8, error handling 1, ternaries 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":"source/view.js"},"region":{"startLine":4122}}}],"partialFingerprints":{"codehealthFindingId/v1":"39dd63600a7f293dc8afe914681459b5685ecfba75c92cd6d53c63a2340a56ad"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetSidebar.render (cognitive 30): TargetSidebar.render has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 5 (10 pts), boolean chains 6, ternaries 3 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":4669}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b4f1b73fdd2e8b5c6b35bcb35651131126908e17409eb2ceb2ed01f84b47f6"}},{"ruleId":"D2","level":"warning","message":{"text":"data_pkl.open (cognitive 30): data_pkl.open has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (2 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":"source/pytorch.js"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f5926aa2f9b34a9b96c108dd4d4e68f3f0134a7428b72539cb2e7c96873937"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.lexPrefixedIdentifier (cognitive 30): Lexer.lexPrefixedIdentifier has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 10, loops 3 (7 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":2785}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e29a0690b6a6a163592e7add4d3ab78af7ce16b38f0c4409724ac4f3f41763"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.parseDialectSymbolBody (cognitive 30): Parser.parseDialectSymbolBody has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":4275}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bd49488bb7a966635b83ddcbebcd26b9274da31cb440b89d5dd237e84036d2"}},{"ruleId":"D2","level":"warning","message":{"text":"start (cognitive 30): start has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 8 (14 pts), boolean chains 10, if/else 5 (6 pts) (nesting depth added 7). Of this number, 28 points are the body\u0027s own statements and 2 belong to 7 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":"source/base.js"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae81d540d81ca6259500ebe1a33792a9e1e7bfc002ea59ba15b8f7b80fe9b885"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 30): constructor has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 7, ternaries 2 (3 pts) (nesting depth added 9). Most of this is not in the body itself: 10 of the 30 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 315, 307, 308, \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":"source/coreml.js"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7d89ba83099bcf35fe7ca6c7342ed8152346b2a74440a8f2aeb117035c9811"}},{"ruleId":"D2","level":"warning","message":{"text":"createAttribute (cognitive 30): createAttribute has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 4 (13 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx.js"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"174240c66f44aa0f799965e2fc4929bb7fc9383d6e1e77269ec704ffa3c92593"}},{"ruleId":"D2","level":"warning","message":{"text":"Inference.infer::infer (cognitive 29): Inference.infer::infer has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 2 (5 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":"source/acuity.js"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e791cadd0d94d268c2b167f952d96469b6d14baabb2bbbc55e9bb0adece58f"}},{"ruleId":"D2","level":"warning","message":{"text":"ComputationNetwork.constructor (cognitive 29): ComputationNetwork.constructor has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 5, loops 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/cntk.js"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"1176cafa938f0e50f30991619257a9b45cf51b304c17ddc090e40df89bc4df72"}},{"ruleId":"D2","level":"warning","message":{"text":"Configuration.read (cognitive 29): Configuration.read has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (19 pts), ternaries 1 (4 pts), match/switch 1 (3 pts), boolean chains 2, loops 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":"source/darknet.js"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdc91c7047bd9975d7aa0dcb1cf012eaab708c51ef460d74ce099beed5f3a2d"}},{"ruleId":"D2","level":"warning","message":{"text":"Datatype.read (cognitive 29): Datatype.read has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 7 (9 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 pts) (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":"source/hdf5.js"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb8dd6f64ceada633cfb29eaa015821bdb090282286bd33ad950e5b4465ed67"}},{"ruleId":"D2","level":"warning","message":{"text":"View.export (cognitive 29): View.export has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (12 pts), boolean chains 4, ternaries 1 (nesting depth added 15). Most of this is not in the body itself: 8 of the 29 points are its own statements and the rest belongs to 3 function items inside it that branch (applyStyleSheet, a function literal at line 1013, a function literal at line 1017). 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":"source/view.js"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"912f89aa7851ae5c59e64c17e25c461dd1efabdb2e29370e5889879df7041833"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader.read (cognitive 29): Reader.read has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (10 pts), loops 3 (6 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/executorch.js"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefc8b141bee291a335dc7b99352360f7cc0ff7759d00279037a09189f387945"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraint.parseTokens (cognitive 29): Constraint.parseTokens has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (24 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":"source/mlir.js"},"region":{"startLine":8161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e1db7e77996ad5f14f4cd56d0c8157fc51eb935951d208cd400457ecce952a"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamDialect.parseDispatchFunctionSignature (cognitive 29): StreamDialect.parseDispatchFunctionSignature has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 2 (6 pts) (nesting depth added 17). Of this number, 26 points are the body\u0027s own statements and 3 belong to one function item 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":"source/mlir.js"},"region":{"startLine":15627}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eddcb0ec479d6ee49d5b2bc166a9f664858b70373142b8cab2c1c9303fe1817"}},{"ruleId":"D2","level":"warning","message":{"text":"getFloat8e4m3 (cognitive 29): getFloat8e4m3 has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (23 pts), ternaries 2 (5 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/base.js"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4750cd7a5721f1f5f3130a49cedaac301c63a58c8eb1e7dd17a0a6654d14fc6"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 29): constructor has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 5 (9 pts), boolean chains 4, ternaries 1 (3 pts), match/switch 1 (nesting depth added 8). Most of this is not in the body itself: 11 of the 29 points are its own statements and the rest belongs to 4 function items inside it that branch (createNode, map, loadChain, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlnet.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"704db2dcdfebf29247e6d134596d04746c462b9d41e303354903cd1f91445a93"}},{"ruleId":"D2","level":"warning","message":{"text":"_processingInstruction (cognitive 29): _processingInstruction has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 11, if/else 5 (11 pts), ternaries 2 (5 pts), loops 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":"source/xml.js"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"809f164581ad31bb48abcd0a1f0c0a74bfd5a6f469f113d43164e3d6242f36e0"}},{"ruleId":"D2","level":"warning","message":{"text":"inflateRaw (cognitive 29): inflateRaw has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, loops 2 (4 pts), match/switch 1 (3 pts), ternaries 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":"source/zip.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8554a90e1f5f9c0571d9b107b4760e9cf173a60f60538238f4c7d79a51c541"}},{"ruleId":"D2","level":"warning","message":{"text":"TextReader._number (cognitive 28): TextReader._number has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 9, loops 3 (5 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":"source/json.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec999d25f633b39903c352b72c99ac0cd93e97513d1cf4c8370c0c0ace7fcbc1"}},{"ruleId":"D2","level":"warning","message":{"text":"DataObjectHeader.constructor (cognitive 28): DataObjectHeader.constructor has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 5, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/hdf5.js"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcad4516ac46b55433cddf5cf52ec81a83ec0a48d8115dfa223f547ef02b2fd"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.constructor::buildFfn (cognitive 28): Graph.constructor::buildFfn has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 6 (15 pts), if/else 6 (11 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. This shape REPEATS in the file: one other method here (Graph.constructor) 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":"source/gguf.js"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f3ff361fefddb475083c4715fec4645d2d850fb7d229fda054f5f23b9b0f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"AffineMap.parse (cognitive 28): AffineMap.parse has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 3, loops 1 (2 pts), ternaries 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":"source/mlir.js"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4319e5978e6530f9c485e990c69bf4437c8b8d7241682104ebce32d6568acf5"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.parseNameOrFileLineColRange (cognitive 28): Parser.parseNameOrFileLineColRange has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":3156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c87f91c12e05c57f36fac0cd483b9654c332dcd4dc23043addf0f06b9427962"}},{"ruleId":"D2","level":"warning","message":{"text":"UtilDialect.parseTiedFunctionResultList (cognitive 28): UtilDialect.parseTiedFunctionResultList has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 3 (7 pts) (nesting depth added 14). Of this number, 18 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":14477}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee6ebfa1419a250c09ffae0735e952dd35042d6d99280b861238c2deda71160"}},{"ruleId":"D2","level":"warning","message":{"text":"THLODialect.parseOperation (cognitive 28): THLODialect.parseOperation has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (9 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":"source/mlir.js"},"region":{"startLine":16768}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e39830151967214c8675b1e019e18ee9a0eda51140133670cab59bef91ddcab"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.constructor::process_node (cognitive 28): Graph.constructor::process_node has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 4 (10 pts), boolean chains 4 (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":"source/keras.js"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e67bbeec6444f76fdd9a7e83c3a7e210f2c51e270fe5c13476f38b68fff00d3"}},{"ruleId":"D2","level":"warning","message":{"text":"IR.getOutputAttr (cognitive 28): IR.getOutputAttr has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 3 (6 pts), match/switch 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":"source/paddle.js"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f2a52f1ae91f8e4ba8d619125032c515e1fc1edcdb6d5b4b040e0e79a6d7b6"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor::map (cognitive 28): constructor::map has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (5 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/circle.js"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b56c3f13f2ca9b256ba7a344b4af213712402240fb3d9d1bdbf6bbfcfd84d1"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 28): constructor has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 4 (8 pts), boolean chains 6, match/switch 1 (3 pts), ternaries 2 (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dl4j.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abe92644adb01ab1ac8be8da4f5c0481036d0739aaaede968f329a5464734f8"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 28): constructor has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 11, ternaries 8 (11 pts), if/else 4 (5 pts), loops 1 (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 10 belong to 5 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":"source/hailo.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9012a257064fedc47087c8fe1f202842e2cd23369965c7a85ad2b1c133653e"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 28): constructor has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 12, if/else 6 (8 pts), loops 3 (5 pts), ternaries 1 (3 pts) (nesting depth added 6). Of this number, 27 points are the body\u0027s own statements and 1 belongs 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":"source/mlnet.js"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"945ddaae3f54d854f5af8d613706ed1acc7951e96cb0fa0a91c318a7689ace45"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 28): constructor has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, loops 4 (6 pts), ternaries 1 (2 pts) (nesting depth added 10). Of this number, 19 points are the body\u0027s own statements and 9 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":"source/mslite.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a61eff5b14744d9ba459e45822c101e1c0e220f925a0b0ec796ad23af373a23"}},{"ruleId":"D2","level":"warning","message":{"text":"_parseAttribute (cognitive 28): _parseAttribute has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (11 pts), loops 2 (6 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":"source/onnx.js"},"region":{"startLine":2269}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd571a55104644f5cbe093cdbcd9a01eb6e778acb1dc9757383b76e50db3c872"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor::map (cognitive 28): constructor::map has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (5 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tflite.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3c61d2d548c111d7a8fbdb820ab0badf648f51c9d98f51f63569a3722b42ae"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 28): constructor has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 4 (8 pts), boolean chains 2, loops 1 (2 pts), error handling 1, 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":"source/view.js"},"region":{"startLine":3951}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfc5e317c06950099c2db92686154dee5cc05679e6ff6a8761b155ad2d8f60a"}},{"ruleId":"D2","level":"warning","message":{"text":"Host.view (cognitive 27): Host.view has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 7 (8 pts), boolean chains 6, loops 2 (3 pts), error handling 1 (nesting depth added 7). None of this is in the body itself: all 27 points belong to 5 function items inside it that branch (telemetry, consent, a function literal at line 95, \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":"source/browser.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe45ed2a8c27319b7dfdbe20811c4162baf27cb1cb4686618f90df48df034da2"}},{"ruleId":"D2","level":"warning","message":{"text":"Container.read (cognitive 27): Container.read has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 1 (3 pts), match/switch 1 (2 pts), boolean chains 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":"source/hailo.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c54a2f6dc0eb8720b6b59dd8f7b471b12400903dc02940d90cb729b85cf91cc"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationParser.parseOperation (cognitive 27): OperationParser.parseOperation has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 9). Of this number, 18 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":5023}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdb7fba673ec2cb87de3239e12aae8122cdb86ac97ecc17433650c1f118df7b"}},{"ruleId":"D2","level":"warning","message":{"text":"TensorLiteralParser.getAttr (cognitive 27): TensorLiteralParser.getAttr has cognitive complexity 27 (threshold 15). Drivers by points: if/else 26 (36 pts), boolean chains 13, ternaries 6 (12 pts), loops 2 (5 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. This shape REPEATS in the file: one other method here (TensorLiteralParser.getAttr::convertElement) 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":"source/mlir.js"},"region":{"startLine":6485}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bccd2e9e6126aec94c750488b6b8a058fc1f9b73fb2f8a0116c979de1fc68b"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraint._parseEnum (cognitive 27): Constraint._parseEnum has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, loops 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":8222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30629800369a1c020012d5f523705b613d12a97b47ca745f08f3b8d8b9a6e5a"}},{"ruleId":"D2","level":"warning","message":{"text":"Dialect.parseOperation (cognitive 27): Dialect.parseOperation has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 10, loops 6 (9 pts), if/else 7 (8 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":10563}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb897734be432522737c676bddbfdc07fe289a42290348169562311604095881"}},{"ruleId":"D2","level":"warning","message":{"text":"AffineDialect.parseParallelOp (cognitive 27): AffineDialect.parseParallelOp has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 4 (9 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":12381}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05d661ffd93ced406a5b8345911a385192efef5383bd3516a9cdae9c7deb787"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowDialect.parseTensorLoadStoreOp (cognitive 27): FlowDialect.parseTensorLoadStoreOp has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 12). Of this number, 16 points are the body\u0027s own statements and 11 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":15061}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f190b13e7b9b700d56cb40700bd2ae71df8cf485b599d3981ea18f53d3b6b1b"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.open::openJson (cognitive 27): ModelFactory.open::openJson has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 5 (7 pts), boolean chains 6, error handling 2 (3 pts), ternaries 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 (ModelFactory.open::openJson::openShards) 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":"source/tf.js"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b39c05464fa1c1a8491ceece6349b84a32c9f6a159cf4bbe727eeafddaa1bb3"}},{"ruleId":"D2","level":"warning","message":{"text":"updateClassifierOutput (cognitive 27): updateClassifierOutput has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (9 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"995721d73ed7c0c2dbc9695bc95b8b3e2956115f4b60ee3de02032aff5535705"}},{"ruleId":"D2","level":"warning","message":{"text":"open (cognitive 27): open has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (8 pts), ternaries 1 (6 pts), error handling 1 (2 pts), match/switch 1 (nesting depth added 17). Of this number, 25 points are the body\u0027s own statements and 2 belong to 5 function literals inside it that branch. 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":"source/nnabla.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe377bd9b89a551e3e4bf4828a35296a05ecbe4af314c1977159c99ca62b8dc"}},{"ruleId":"D2","level":"warning","message":{"text":"_parseGraph (cognitive 27): _parseGraph has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (12 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":"source/onnx.js"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4f938d98423e1f49bc8147e8bd5da7c1dab863d31f13a36c234506c2183b85"}},{"ruleId":"D2","level":"warning","message":{"text":"_skipType (cognitive 27): _skipType has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (6 pts), match/switch 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":"source/protobuf.js"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c0915cb651953d930ddcae0ce2d7bb8ac3288675a5969e2205b99fa7a10639"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 27): constructor has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 10, ternaries 5 (9 pts), if/else 4 (6 pts), loops 2 (nesting depth added 6). Of this number, 23 points are the body\u0027s own statements and 4 belong to 5 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":"source/tosa.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fc7c2f2f16a048a22555a168452166f66edd056f6a7ecdd2a4912e5cdda9da"}},{"ruleId":"D2","level":"warning","message":{"text":"Execution.__import__ (cognitive 26): Execution.__import__ has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). Of this number, 15 points are the body\u0027s own statements and 11 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":21902}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0a1057e405ec44b421919ba1fba9fc2ec7bf78c9de88dcd4898b611c521c7f"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorDialect.parseTransferOp (cognitive 26): VectorDialect.parseTransferOp has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":12897}}}],"partialFingerprints":{"codehealthFindingId/v1":"519203b34cd67f6135459d1a0a1fe3eabdc1f79dc145c3e2765f2069b892372d"}},{"ruleId":"D2","level":"warning","message":{"text":"NVVMDialect.parseOperation (cognitive 26): NVVMDialect.parseOperation has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4 (8 pts), boolean chains 4 (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":"source/mlir.js"},"region":{"startLine":21100}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b2694079ff140f3f4f749c81f1afdf74e0e9d3dd1d770fe55d23da44502c0c"}},{"ruleId":"D2","level":"warning","message":{"text":"LLVMDialect.getInsertExtractValueElementType (cognitive 26): LLVMDialect.getInsertExtractValueElementType has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4, loops 2 (4 pts), ternaries 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":"source/mlir.js"},"region":{"startLine":22500}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc166d2d476efffafceb3f3256d28d683525c07614086f9fda00d3b024d8e9c"}},{"ruleId":"D2","level":"warning","message":{"text":"LLVMDialect.parseLLVMCallIntrinsicOp (cognitive 26): LLVMDialect.parseLLVMCallIntrinsicOp has cognitive complexity 26 (threshold 15). Drivers by points: loops 4 (15 pts), if/else 5 (11 pts) (nesting depth added 17). 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":"source/mlir.js"},"region":{"startLine":23134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a51515d1d0d8a72f7430bfe613bbee2ab93e96aa1a3af3e0c039f847512f15f"}},{"ruleId":"D2","level":"warning","message":{"text":"TextParamReader.constructor (cognitive 26): TextParamReader.constructor has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (11 pts), ternaries 3 (9 pts), loops 3 (5 pts), boolean chains 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":"source/ncnn.js"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"99504317519eed884e14807d756ca15e6fad06fda27d6f388974c08d9ddb201b"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.constructor (cognitive 26): Node.constructor has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, loops 4 (6 pts), ternaries 4 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/qnn.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"1065fd50c66dc154ae5b208d62ae63f8361ca3d5468efc4605352af56c31cf13"}},{"ruleId":"D2","level":"warning","message":{"text":"decodeJson (cognitive 26): decodeJson has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18, ternaries 4 (8 pts) (nesting depth added 4). Of this number, 24 points are the body\u0027s own statements and 2 belong to 15 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb311ec01873ef31ae9bc0981fc623ca4f118399475bc62bad4e062fb47a1613"}},{"ruleId":"D2","level":"warning","message":{"text":"metrics (cognitive 26): metrics has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 2 (8 pts), boolean chains 6, if/else 3 (6 pts), loops 2 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":6575}}}],"partialFingerprints":{"codehealthFindingId/v1":"741848bcda24cd6750573fea359e154a5ebbc0e670eea17946ff5d5aa8bc0eba"}},{"ruleId":"D2","level":"warning","message":{"text":"TextReader._entityReference (cognitive 25): TextReader._entityReference has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (6 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":"source/xml.js"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"576da9a8465f3fc2371fe1d0fcc916014cb16c48f7d0e59a9ca782610337b095"}},{"ruleId":"D2","level":"warning","message":{"text":"FindSidebar.render (cognitive 25): FindSidebar.render has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 5, ternaries 2 (4 pts), loops 1 (nesting depth added 3). Most of this is not in the body itself: 3 of the 25 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 5158, 5129, 5206, \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":"source/view.js"},"region":{"startLine":5108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20fd1a5119dd72435e8b859bf4c8fe549fee7bd83262d2c38cbcc9a21e5a274"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationParser.parseBlock (cognitive 25): OperationParser.parseBlock has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":5319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05f3c9245e7555b4e4da7761e32d6dfc35bcf9deff22ae98c8e18603204b482"}},{"ruleId":"D2","level":"warning","message":{"text":"MemRefDialect.parseOperation (cognitive 25): MemRefDialect.parseOperation has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":12507}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7df47c2d9c077ef956bca2bc3f1dfe7deb1d3acbb8cf23eecdeebb649c0caeb"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorDialect.parseOperation (cognitive 25): VectorDialect.parseOperation has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":12708}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e828e1b6a4616085d44b64c61bbb36fad1d9f4134409690b77d7e6c468bc186"}},{"ruleId":"D2","level":"warning","message":{"text":"TorchDialect.parseOperation (cognitive 25): TorchDialect.parseOperation has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, loops 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":13314}}}],"partialFingerprints":{"codehealthFindingId/v1":"048c2f273a97c9da40e555af87ea9239808787f083d8c3aed1e7988d00fad5fd"}},{"ruleId":"D2","level":"warning","message":{"text":"IREEDialect.parseShapedFunctionType (cognitive 25): IREEDialect.parseShapedFunctionType has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":13434}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7412969e5390539b2e4c02d663f1fe74d7288ba050493471bdb15121de94e31"}},{"ruleId":"D2","level":"warning","message":{"text":"QuantDialect.parseUniformType (cognitive 25): QuantDialect.parseUniformType has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (5 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 9). Of this number, 18 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":16969}}}],"partialFingerprints":{"codehealthFindingId/v1":"84995021e0a4a8416c6bdef42ffccb3e13fcf83a209aa6257a5881219098bee8"}},{"ruleId":"D2","level":"warning","message":{"text":"XeGPUDialect.parseOptionalDynamicIndexList (cognitive 25): XeGPUDialect.parseOptionalDynamicIndexList has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (6 pts), boolean chains 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":"source/mlir.js"},"region":{"startLine":17410}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a2529870bd3b669b2b04c340bed84cf9313b2b33657f5ba19e56582e3178ac"}},{"ruleId":"D2","level":"warning","message":{"text":"EmitCDialect.parseOperation (cognitive 25): EmitCDialect.parseOperation has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 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":"source/mlir.js"},"region":{"startLine":19153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95ff7f06affe6960f3c64feab0cc65b1e20195c4bdb3ec0f80a58b9701097d9"}},{"ruleId":"D2","level":"warning","message":{"text":"TFExecutorDialect.parseOperation (cognitive 25): TFExecutorDialect.parseOperation has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":24175}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ef1a3c249665caee8b1be68d72bd1660e7a74740c51635021c68f7375e9cae"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.match (cognitive 25): ModelFactory.match has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 7, error handling 1 (2 pts), loops 1 (2 pts) (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":"source/tnn.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cca5891121e5bef88e90c82ab78e8eb1c9d4aee3d7c8d21adbad1e80221da51"}},{"ruleId":"D2","level":"warning","message":{"text":"_parseModel (cognitive 25): _parseModel has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 3 (7 pts), match/switch 1 (3 pts) (nesting depth added 16). 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":"source/onnx.js"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9d29d4131ccdd88d8c168d8d8d646bb2d0150a1c55dd540a96f03a0be1db96"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 25): constructor has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (7 pts), ternaries 1 (4 pts), boolean chains 3 (nesting depth added 12). Of this number, 24 points are the body\u0027s own statements and 1 belongs to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/xmodel.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"308ebe41b393abf42afdfeaecefb85497d087efdf36190a22de50628f7786fe5"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor._decodeValues (cognitive 24): Tensor._decodeValues has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (7 pts), loops 2 (4 pts), match/switch 1 (3 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":"source/base.js"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"3933fbc9d5f4a4aa43c0688113cc196cbfdf670828a765bb583adb2795a40cfc"}},{"ruleId":"D2","level":"warning","message":{"text":"dagre.dagre.layout::parentDummyChains (cognitive 24): dagre.dagre.layout::parentDummyChains has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 3 (10 pts), boolean chains 3 (nesting depth added 14). 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. This shape REPEATS in the file: 12 other methods here (dagre.dagre.layout, dagre.dagre.layout::rank::longestPath, dagre.dagre.layout::rank::networkSimplex::initLowLimValues::dfs, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 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":"source/dagre.js"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6a4feea05491304876f324788420e954b767b79ac4c91f78cfdf2dc476d4b6"}},{"ruleId":"D2","level":"warning","message":{"text":"dagre.dagre.layout::order::crossCount (cognitive 24): dagre.dagre.layout::order::crossCount has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 2 (6 pts) (nesting depth added 14). 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. This shape REPEATS in the file: 12 other methods here (dagre.dagre.layout, dagre.dagre.layout::rank::longestPath, dagre.dagre.layout::rank::networkSimplex::initLowLimValues::dfs, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 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":"source/dagre.js"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10a6d488d3414bc595ab81e9e211638619f11a98fe1b3b140e3c7f5ef3455ad"}},{"ruleId":"D2","level":"warning","message":{"text":"dagre.dagre.layout::coordinateSystem_undo (cognitive 24): dagre.dagre.layout::coordinateSystem_undo has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 4 (8 pts), boolean chains 2 (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. This shape REPEATS in the file: 12 other methods here (dagre.dagre.layout, dagre.dagre.layout::rank::longestPath, dagre.dagre.layout::rank::networkSimplex::initLowLimValues::dfs, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 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":"source/dagre.js"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1a1ce0f912e75dbf209704e493775537d002fd9d04fdd0e47e822e8cce4c50"}},{"ruleId":"D2","level":"warning","message":{"text":"Group._decodeGroups (cognitive 24): Group._decodeGroups has cognitive complexity 24 (threshold 15). Drivers by points: loops 3 (12 pts), if/else 5 (11 pts), boolean chains 1 (nesting depth added 15). 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":"source/hdf5.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be8341eb44257230979ea25fcb6b6d4226af72db06e01469e58950d81698975"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.scrollTo (cognitive 24): Graph.scrollTo has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, 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":"source/view.js"},"region":{"startLine":2701}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b56b43c7512b052528f32a8a33d6b160b47419bcf5991688bb264ae2973cc7"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactoryService._openContext (cognitive 24): ModelFactoryService._openContext has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 4, error handling 1 (3 pts), loops 1 (nesting depth added 11). Of this number, 23 points are the body\u0027s own statements and 1 belongs 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":"source/view.js"},"region":{"startLine":7711}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c771baab3dd1aa2dc9e02dcd3cb26d8b4640501edd85ec8ac4897b3ced92475"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.constructor (cognitive 24): Node.constructor has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.js"},"region":{"startLine":2497}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f25e44c53ae3d125b3d13df33f6d29f1ca3cda5fc4529ba1df8e820fc8e2dc2"}},{"ruleId":"D2","level":"warning","message":{"text":"Dialect.parsePropertiesFromKeyValueList (cognitive 24): Dialect.parsePropertiesFromKeyValueList has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 4, 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":"source/mlir.js"},"region":{"startLine":9602}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8c79fe4a220e6c0cd8dd71e011d7be322e56117289ff4502e4ae3f780f2c5c"}},{"ruleId":"D2","level":"warning","message":{"text":"HLODialect.parseSliceRanges (cognitive 24): HLODialect.parseSliceRanges has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 1 (3 pts) (nesting depth added 16). 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":"source/mlir.js"},"region":{"startLine":11430}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cd02744afb6a13c9d2418a1728357d797b8fc4e5b25b452ed6c6a6a1fdd3e9"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamDialect.parseEncodedShapedResultList (cognitive 24): StreamDialect.parseEncodedShapedResultList has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 2, loops 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":"source/mlir.js"},"region":{"startLine":15509}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4773c28aa494dfc2029824d1489af94b166d713217646d03d965bc5701449f"}},{"ruleId":"D2","level":"warning","message":{"text":"MhloDialect.parseOperation (cognitive 24): MhloDialect.parseOperation has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":16685}}}],"partialFingerprints":{"codehealthFindingId/v1":"127bf0acd526a177015aef899319ecba2ac0a2e9f42cbfed094a8507d6eec553"}},{"ruleId":"D2","level":"warning","message":{"text":"TosaDialect.parseOperation (cognitive 24): TosaDialect.parseOperation has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 2 (8 pts), boolean chains 4, loops 1 (4 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":"source/mlir.js"},"region":{"startLine":17125}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c80594298df472405eeeb505e92ef5bd57c396ff575fd7a999361779a09b63"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseTensorDialect.parseIterateOp (cognitive 24): SparseTensorDialect.parseIterateOp has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 4 (6 pts), boolean chains 3 (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":"source/mlir.js"},"region":{"startLine":20338}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35ab31105fe868f2d7aa67d7952988ae97ac59b4e1e3257e2e7d7fed2ddf1ce"}},{"ruleId":"D2","level":"warning","message":{"text":"LLVMDialect.parseLLVMLoadOp (cognitive 24): LLVMDialect.parseLLVMLoadOp has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":22757}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc604ad8b1508d02dd3ff7f67f15046f0af3b056a7fd621e6c22058ab772cda4"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.constructor (cognitive 24): Model.constructor has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 12). Of this number, 12 points are the body\u0027s own statements and 12 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/litertlm.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"134ff164adfee3074976ed25ffd0b1f8049837a65444302970e3c10146c30903"}},{"ruleId":"D2","level":"warning","message":{"text":"TextReader.open (cognitive 24): TextReader.open has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 1 (4 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx.js"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"613c8969cd9bcd2464eed8c3bf6c1bea13ca864712249f3b0ccb73805b288365"}},{"ruleId":"D2","level":"warning","message":{"text":"Entries.read (cognitive 24): Entries.read has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae838938b720fdfc332d69f6ccce6aa971d90a2d316b0c3f09a2d7ddeea81e7e"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.constructor (cognitive 24): Node.constructor has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 2 (7 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 12). Of this number, 22 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/uff.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1e66a00e91127753c9934f6c68bf6beec4f6369e24f94c81e6e901c0209455"}},{"ruleId":"D2","level":"warning","message":{"text":"_stringify (cognitive 24): _stringify has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (6 pts), ternaries 1 (4 pts), boolean chains 3, 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":"source/base.js"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb6b984d8a9b26bc3872e1c88845ffb1bb1aa0a17eaeab154f7f42b9dc66d68"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor::BatchNormalization (cognitive 24): constructor::BatchNormalization has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 1 (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":"source/cntk.js"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea0acc39d377cf3cd7f2d3ad0a93e1a39905a4bb29b6f9dafacacfdcc984531"}},{"ruleId":"D2","level":"warning","message":{"text":"decodeJson (cognitive 24): decodeJson has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18, ternaries 3 (6 pts) (nesting depth added 3). Of this number, 22 points are the body\u0027s own statements and 2 belong to 9 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx-proto.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bbe06b660ad5d611d2767a5bee9f21372f7744b56876af65ab92b8f27be20d"}},{"ruleId":"D2","level":"warning","message":{"text":"Execution.import (cognitive 23): Execution.import has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (4 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":21843}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ec65ccef9e110247d792c419dbb42146ab94521fa029b45552171deca19ae5"}},{"ruleId":"D2","level":"warning","message":{"text":"dagre.dagre.layout::order::sortSubgraph (cognitive 23): dagre.dagre.layout::order::sortSubgraph has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 3, boolean chains 2, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 12 other methods here (dagre.dagre.layout, dagre.dagre.layout::rank::longestPath, dagre.dagre.layout::rank::networkSimplex::initLowLimValues::dfs, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 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":"source/dagre.js"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b39bf8ff606cd4d9b95f0533ccf72e6034928f649440483979ac77b0ecad99"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.build (cognitive 23): Graph.build has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, loops 3 (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 6 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":"source/grapher.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5e9b738dad5434cf31f2e59d6deb0f7bd3118d61c5fb03b228cd79ca6c215c"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader.read (cognitive 23): Reader.read has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/gguf.js"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"058b8a18aa6985f98c7f1b5c3f775c0c107d72ff225e01fb1bbbe7a818498b9f"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.build::resolveBlock (cognitive 23): Context.build::resolveBlock has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 6, loops 1, ternaries 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. This shape REPEATS in the file: 3 other methods here (Context.build, Context.build::buildBlockLayers, Context.build::sectionFlat) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/gguf.js"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42654019a2046c526eccc5119c00d7f5f826a85eaa2a659f9d0c091dffddfca"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.lexString (cognitive 23): Lexer.lexString has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, 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":"source/mlir.js"},"region":{"startLine":2702}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f054eba41daccc380fd328d3163926ae4f2c88327cce6b27fe7fd4b70f944f"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.parseAttribute (cognitive 23): Parser.parseAttribute has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 2, loops 1 (2 pts), 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":"source/mlir.js"},"region":{"startLine":3735}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e775606c7196a5e03e6bf3437305594b7135c963c28632b47bc1f7eb638771"}},{"ruleId":"D2","level":"warning","message":{"text":"HALDialect.parseTargetConditionObjects (cognitive 23): HALDialect.parseTargetConditionObjects has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":14219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9963e6c4a29b7c9f04d1a3d4245eb6b19a5557f072bb5a104992e8407eb7e65"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamDialect.parseShapedTypeList (cognitive 23): StreamDialect.parseShapedTypeList has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 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":"source/mlir.js"},"region":{"startLine":15266}}}],"partialFingerprints":{"codehealthFindingId/v1":"798a44bfb973adb6664893d33347c14ee0354351d20e0f9301321dfadc27416f"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.createType (cognitive 23): Context.createType has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 8, boolean chains 5 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 8 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":"source/onnx.js"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdedbeb50aedfe7942a63ac051010f97f0e2f55be888ad2ce18c8cab399d529"}},{"ruleId":"D2","level":"warning","message":{"text":"Container.open (cognitive 23): Container.open has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (21 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":"source/tensorrt.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7be3f5b6700cc27a625074dc033b38da48970066d7908a529f6203a9f7325a6"}},{"ruleId":"D2","level":"warning","message":{"text":"_HTTPRequestHandler.do_GET (cognitive 23): _HTTPRequestHandler.do_GET has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 1, ternaries 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":"source/server.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29b6b62e5838dd7d8404760beeaa1d5037cde25c35304d57d126901ed8734ef"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 23): constructor has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, loops 3, match/switch 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 8 of the 23 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 49, value, a function literal at line 46). 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":"source/acuity.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6806df05adc43af24c34b63201bc3cacc085bb81ec18c825d1d13bef663d430"}},{"ruleId":"D2","level":"warning","message":{"text":"getFloat8e5m2 (cognitive 23): getFloat8e5m2 has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 4 (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":"source/base.js"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd22263aa70be1c77b6aa74f6ada46c4a21f182ea402bf32b3564952d3e2c30"}},{"ruleId":"D2","level":"warning","message":{"text":"scrollTo (cognitive 23): scrollTo has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3 (9 pts), boolean chains 4 (nesting depth added 11). Of this number, 15 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/browser.js"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"a572b5888d17d0c539d757754fb073122a640d4320629f999a2f5816d4d986d8"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 23): constructor has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 3 (6 pts), boolean chains 4, match/switch 1 (nesting depth added 9). Of this number, 13 points are the body\u0027s own statements and 10 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":"source/espdl.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39570abf8e653cd077717666a85ca1d503b306ca0e753d45e17505931d26923"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 23): constructor has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 8). Most of this is not in the body itself: 8 of the 23 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 164, 156, 157, \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":"source/espresso.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"521829f65e5409a7088fcdbdaab82bc2e7bffc323f11cfc4921b92033a2ec3c9"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 23): constructor has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 6 (8 pts), boolean chains 4, loops 2 (nesting depth added 8). Of this number, 19 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/lasagne.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9490500677123abdfb1f4823cef1635ae05ced02f81672b7ed3d8b6f93c1b9"}},{"ruleId":"D2","level":"warning","message":{"text":"_next (cognitive 23): _next has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 11 (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":"source/xml.js"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"539650828319dd7c99e2efadf1c5c484bd26a01c4481f9095efa72f27b6cd8ad"}},{"ruleId":"D2","level":"warning","message":{"text":"package.test (cognitive 22): package.test has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (7 pts), boolean chains 6, 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":"package.js"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ea0ec80b7efa7fbd0fe8cbb93c53a91eb9d15fbc8f44ac79d49c4eed4706ac"}},{"ruleId":"D2","level":"warning","message":{"text":"Execution.call (cognitive 22): Execution.call has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":22010}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb1fcb239a94107cdce66af66d13864ab960fe66e9f9efb08edda5dee989c88"}},{"ruleId":"D2","level":"warning","message":{"text":"Execution.target (cognitive 22): Execution.target has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (3 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":"source/python.js"},"region":{"startLine":22393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74716e97458d5c3e0b2ac02f445bb54d836cd573b3bc1107fc49a82214ab24b"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.constructor (cognitive 22): Context.constructor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 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":"source/coreml.js"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"b122f311c794c23a2d599f4937cc8f80682e07cd9f8d3e14d0fce943179c92d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Dataspace.constructor (cognitive 22): Dataspace.constructor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (10 pts), boolean chains 1, 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":"source/hdf5.js"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2b5e91a5dfc5a9116faa08f559ee0dfd1822184957e32c70aa1916bf2211e5"}},{"ruleId":"D2","level":"warning","message":{"text":"FindSidebar._update (cognitive 22): FindSidebar._update has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 3 (5 pts), ternaries 2 (3 pts), boolean chains 1, error handling 1 (nesting depth added 10). 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":"source/view.js"},"region":{"startLine":5079}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6007bd27e117869687b49b25754d45b6c13fd55536216d14b7274deadd65bb1"}},{"ruleId":"D2","level":"warning","message":{"text":"Container._model4 (cognitive 22): Container._model4 has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 3 (10 pts), loops 4 (8 pts), ternaries 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 12). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"source/dlc.js"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e0d7aa29277ae69a95d0782d1c02bf6fd1928abe067be52a5335c4b0818872"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.constructor::registerSection (cognitive 22): Context.constructor::registerSection has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (10 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":"source/gguf.js"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fcaec02310554e723f525cffbce70147143810f53f3817af6dc395754fc8c4"}},{"ruleId":"D2","level":"warning","message":{"text":"Utility.valueType (cognitive 22): Utility.valueType has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 8, boolean chains 1 (nesting depth added 7). Of this number, 13 points are the body\u0027s own statements and 9 belong to 4 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":"source/mlir.js"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6b83ae30f69c49851539b2bc20041917ee97c06fff24e17bd456f86c41771a"}},{"ruleId":"D2","level":"warning","message":{"text":"PropertiesSectionReader.read (cognitive 22): PropertiesSectionReader.read has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 2 (6 pts), boolean chains 4, 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":"source/mlir.js"},"region":{"startLine":7190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e492be014e38331b21506c17b1c4171f7ced2ffb3aaa600d698ac9baebba2643"}},{"ruleId":"D2","level":"warning","message":{"text":"AsukaDialect.parseOperation (cognitive 22): AsukaDialect.parseOperation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (5 pts), boolean chains 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":"source/mlir.js"},"region":{"startLine":19273}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c58473fd7f280d86c55b12a3f9837afb04f74ce746d0ca86dd4ed04fc5db473"}},{"ruleId":"D2","level":"warning","message":{"text":"ACCDialect.parseGangClause (cognitive 22): ACCDialect.parseGangClause has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 3 (5 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":27868}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d190a2919ff611c15079b8efd00833a04038ff1f561b86bbd671c626be51b06"}},{"ruleId":"D2","level":"warning","message":{"text":"get (cognitive 22): get has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 11). Of this number, 19 points are the body\u0027s own statements and 3 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":"source/keras.js"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2b17cade60a5c6374edac49c750627014492688fee77136025af3074828261"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 22): constructor has cognitive complexity 22 (threshold 15). Drivers by points: loops 7, if/else 5 (6 pts), ternaries 3 (6 pts), boolean chains 3 (nesting depth added 4). Of this number, 14 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mediapipe.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfbc9a662c555d3e3de3c855a53d066859aac7e7f24a1be06b42977d113beb7"}},{"ruleId":"D2","level":"warning","message":{"text":"open::createModel (cognitive 22): open::createModel has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 4 (6 pts), boolean chains 3, error handling 1 (2 pts), loops 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":"source/mxnet.js"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"de920d1223b338c40c670a58749e620d210d880b4874c1810781724dc2423499"}},{"ruleId":"D2","level":"warning","message":{"text":"open (cognitive 22): open has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 4 (7 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 10). Of this number, 19 points are the body\u0027s own statements and 3 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":"source/pytorch.js"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf597564bc4cfdb7b40d92fe8ed3ed2fafcf9b33b4032b3a69b2f810a419faef"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 22): constructor has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (9 pts), boolean chains 8, if/else 2 (4 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/rknn.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"340ffbb3dc22782111b5d9fb82c92ae7eaacbbbea889bb4bad9f06458ca04300"}},{"ruleId":"D2","level":"warning","message":{"text":"dagre.dagre.layout::order::sweepLayerGraphs (cognitive 21): dagre.dagre.layout::order::sweepLayerGraphs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (8 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. This shape REPEATS in the file: 12 other methods here (dagre.dagre.layout, dagre.dagre.layout::rank::longestPath, dagre.dagre.layout::rank::networkSimplex::initLowLimValues::dfs, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 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":"source/dagre.js"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4991e6e7f0c62600c1c7ce6b9a1e3e473282662929431af0b877ac3cd88d836d"}},{"ruleId":"D2","level":"warning","message":{"text":"TextReader.skip (cognitive 21): TextReader.skip has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, loops 2 (4 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":"source/protobuf.js"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"d414bdbc7733f74fc520441a2714c366bdb92edc432bc74adfe1bc0c12feaa84"}},{"ruleId":"D2","level":"warning","message":{"text":"CustomOpAsmParser.resolveOperands (cognitive 21): CustomOpAsmParser.resolveOperands has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 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":"source/mlir.js"},"region":{"startLine":6274}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff7821b3ffd94a568d34201307bc3f5064d87d3e19771b1e0d4255114d4879d"}},{"ruleId":"D2","level":"warning","message":{"text":"AffineDialect.parseOperation (cognitive 21): AffineDialect.parseOperation has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (14 pts), ternaries 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":12092}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6970db103e7ad0bbc82d52bb3747c628dfd830678ad1d972ed14e22df4d452"}},{"ruleId":"D2","level":"warning","message":{"text":"HALDialect.parseBindings (cognitive 21): HALDialect.parseBindings has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (7 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":"source/mlir.js"},"region":{"startLine":14097}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c4e730dd352f9d0f17ed311149bfec4d90c8c2ff7e5d43dccd348ad3e44b39"}},{"ruleId":"D2","level":"warning","message":{"text":"UtilDialect.parseAssumeIntOp (cognitive 21): UtilDialect.parseAssumeIntOp has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 4 (9 pts), boolean chains 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":"source/mlir.js"},"region":{"startLine":14654}}}],"partialFingerprints":{"codehealthFindingId/v1":"352054702816bd10c898dd62a670aa49ff563db423f9dcb5ecd27312b7ea3781"}},{"ruleId":"D2","level":"warning","message":{"text":"TFExecutorDialect.parseIslandOp (cognitive 21): TFExecutorDialect.parseIslandOp has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (9 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":"source/mlir.js"},"region":{"startLine":24297}}}],"partialFingerprints":{"codehealthFindingId/v1":"31602167fb7ef70facbeb9041b6c58d35845ef9660ed9f141227d197dc0af08f"}},{"ruleId":"D2","level":"warning","message":{"text":"TritonGPUDialect.parseOperation (cognitive 21): TritonGPUDialect.parseOperation has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (7 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":"source/mlir.js"},"region":{"startLine":26802}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9362ad620a586c6405f76d4b0764a688c48d57e6d8b45eecc907e46a2e8f80"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.constructor (cognitive 21): Node.constructor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, loops 2 (3 pts), ternaries 2 (3 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":"source/lasagne.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"433c7b1502befab8191c4902022e0be2ce2b8039497198c9c6f3d99bd7696d35"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.open (cognitive 21): ModelFactory.open has cognitive complexity 21 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 3 (7 pts), boolean chains 2, match/switch 1 (2 pts), ternaries 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":"source/litertlm.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"487757dc6ba02f89071e4c5ad97b9a6e52dce356576f62eb078e8a4c717ea8aa"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.match (cognitive 21): ModelFactory.match has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 1 (2 pts), ternaries 1 (2 pts) (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":"source/megengine.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b64ef933838eadf7c646af0ee880b189948c61e4048e9af22487ad4fbd1589b"}},{"ruleId":"D2","level":"warning","message":{"text":"Container.read (cognitive 21): Container.read has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 1 (3 pts), boolean chains 2, 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":"source/rknn.js"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"1047e782f093b6e22a6fe87920b1b3dfa142d4de00b04da375e936423b106a7f"}},{"ruleId":"D2","level":"warning","message":{"text":"Container.signature (cognitive 21): Container.signature has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6 (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":"source/rknn.js"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1329a3d2d06eefdac871efe1455457c8867c017f20979f9492ed6a1670eb6c1"}},{"ruleId":"D2","level":"warning","message":{"text":"_Graph._argument_type (cognitive 21): _Graph._argument_type has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73be61af2fbd89bda773bfe24582e53e66dfea6a61bb27b5d8ed71d2fa278cb"}},{"ruleId":"D2","level":"warning","message":{"text":"decodeJson (cognitive 21): decodeJson has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, ternaries 3 (6 pts) (nesting depth added 3). Of this number, 19 points are the body\u0027s own statements and 2 belong to 11 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx-proto.js"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fa4d90d9b267077176db307519b07b975404b2f7ed9414533a2803f46b5a09"}},{"ruleId":"D2","level":"warning","message":{"text":"decodeJson (cognitive 21): decodeJson has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, ternaries 4 (8 pts) (nesting depth added 4). Of this number, 19 points are the body\u0027s own statements and 2 belong to 9 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch-proto.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"b270c508fae5eb5e5c13e5777d767362e6950ae9b77eccebbfe48eacfb6c5a16"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 21): constructor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8, ternaries 3, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":4059}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d348952a3ade0885d54277166041107f963b15e26e0a52d47fd07d03e733acf"}},{"ruleId":"D2","level":"warning","message":{"text":"content (cognitive 21): content has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 5). Of this number, 14 points are the body\u0027s own statements and 7 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":"source/view.js"},"region":{"startLine":4252}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4d67ca2b3bdc4d392c31183d5b5d8d795ce6c3d724fab6fd2d29550eff8b54"}},{"ruleId":"D2","level":"warning","message":{"text":"Execution.constructor::convertObject (cognitive 20): Execution.constructor::convertObject has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 2, ternaries 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. This shape REPEATS in the file: one other method here (Execution.constructor) 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":"source/python.js"},"region":{"startLine":14175}}}],"partialFingerprints":{"codehealthFindingId/v1":"662e661f577ceb9be7e9a798ae505bfc4351cc702d316084bb661ebefc594b39"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.open (cognitive 20): ModelFactory.open has cognitive complexity 20 (threshold 15). Drivers by points: error handling 3 (6 pts), ternaries 2 (6 pts), loops 1 (3 pts), boolean chains 2, if/else 1 (2 pts), 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":"source/circle.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b455e1a2fc2b4e669c1c8015054e5f67ceb2cde25c29bbbfadfcb6e327040c"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor.values (cognitive 20): Tensor.values has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/circle.js"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"615f4aab3dbe1a45a9df72204e2794ad9b8eec0456196d7cd4bb1001b2702739"}},{"ruleId":"D2","level":"warning","message":{"text":"dagre.dagre.layout::rank::networkSimplex::initLowLimValues::dfs (cognitive 20): dagre.dagre.layout::rank::networkSimplex::initLowLimValues::dfs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (5 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. This shape REPEATS in the file: 12 other methods here (dagre.dagre.layout, dagre.dagre.layout::rank::longestPath, dagre.dagre.layout::removeEmptyRanks, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 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":"source/dagre.js"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"debb2d1179c59f4e8d76a614c349cd2986605680536afa5b76c47765072a1f4f"}},{"ruleId":"D2","level":"warning","message":{"text":"Host._open (cognitive 20): Host._open has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 2 (4 pts), boolean chains 2, ternaries 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":"source/desktop.mjs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f85f3ea509ac8124a06762ab98f3d3b892600f1e8e0817a6859889d0969626"}},{"ruleId":"D2","level":"warning","message":{"text":"Container._signature (cognitive 20): Container._signature has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 11). 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":"source/dlc.js"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"f993d8c4dad808123cbde31f6ab17969e4b6e5c635be63b560eb0423d0c3e768"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.constructor (cognitive 20): Graph.constructor has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 2 (7 pts), if/else 4 (6 pts), loops 3 (6 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":"source/espdl.js"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3d5e9459f42bf110bdd14ba49b6617fd6c9af849a7c18117bda1b0c3b0c6ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.constructor (cognitive 20): Model.constructor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/gguf.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7a7842dce481f3a207d4580d0a516f51bab06bc9f8679b251e7fe6e6c74b47"}},{"ruleId":"D2","level":"warning","message":{"text":"AffineBinaryOpExpr.printAffineExprInternal (cognitive 20): AffineBinaryOpExpr.printAffineExprInternal has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 4 (5 pts), boolean chains 4, 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":"source/mlir.js"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee41f23a93009bcb3eab2eebe5a8a67e0da830df6886fea606b9e74757b4240f"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeReader.parseBlockArguments (cognitive 20): BytecodeReader.parseBlockArguments has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 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":"source/mlir.js"},"region":{"startLine":7779}}}],"partialFingerprints":{"codehealthFindingId/v1":"0120254cb49c6de882b16dd9855b91e35536c0721ece1ab0e3dd8d1217a93f01"}},{"ruleId":"D2","level":"warning","message":{"text":"Constraint.parseArgumentTokens (cognitive 20): Constraint.parseArgumentTokens has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, 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":"source/mlir.js"},"region":{"startLine":8335}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ba822a29e1d0ef4e79a558e01fdd6695bb1c4e4fcd060180f380de141d5b70"}},{"ruleId":"D2","level":"warning","message":{"text":"VhloDialect.readAttribute (cognitive 20): VhloDialect.readAttribute has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 9, loops 2 (4 pts), if/else 2 (3 pts), ternaries 1 (3 pts), match/switch 1 (nesting depth added 5). 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":"source/mlir.js"},"region":{"startLine":11956}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d45863ab6362e0aa6aa99e036d8f81e5daa5febf2316d6122e8ad3f9234724"}},{"ruleId":"D2","level":"warning","message":{"text":"LinalgDialect.parsePackOp (cognitive 20): LinalgDialect.parsePackOp has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 4 (8 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":"source/mlir.js"},"region":{"startLine":16344}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb22115c70047a73ab8830cbb17be8a61d40104a8f2f88367fa38e3143945f4e"}},{"ruleId":"D2","level":"warning","message":{"text":"TFGDialect.parseTFGOperation (cognitive 20): TFGDialect.parseTFGOperation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (5 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":"source/mlir.js"},"region":{"startLine":24106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7d77324f67fc62fc11eb2cffafe07298c22678df2ed351f35da33a4c7fbe2d"}},{"ruleId":"D2","level":"warning","message":{"text":"TFRTFallbackAsyncDialect.parseExecuteOpCommon (cognitive 20): TFRTFallbackAsyncDialect.parseExecuteOpCommon has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 3 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":24634}}}],"partialFingerprints":{"codehealthFindingId/v1":"970ccdbc22fa771521e307b6609aa03b43fb16a7c54f60b3890fcd60dab0772c"}},{"ruleId":"D2","level":"warning","message":{"text":"SMTDialect.parseType (cognitive 20): SMTDialect.parseType has cognitive complexity 20 (threshold 15). Drivers by points: loops 2 (8 pts), if/else 3 (7 pts), ternaries 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":28208}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e2dc2b81b40b73ff2ca414fd0840d3173bcb9b6fbaa388922b65d206575427"}},{"ruleId":"D2","level":"warning","message":{"text":"NDArray.constructor (cognitive 20): NDArray.constructor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 3 (8 pts), match/switch 2 (3 pts) (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":"source/mxnet.js"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb13562dfe504d64e10378061e2b18af98054c55ea3fdb862beb3a845d56503d"}},{"ruleId":"D2","level":"warning","message":{"text":"Metadata.constructor (cognitive 20): Metadata.constructor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 1 (2 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/ncnn.js"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6dfe6a8601091d628fb1ecf4756d50cd71e73e98f97682fec42d639f31ef87a"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigProto.decodeJson (cognitive 20): ConfigProto.decodeJson has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, loops 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":8791}}}],"partialFingerprints":{"codehealthFindingId/v1":"463af5621a15773adada30ba746889aa61cd822d560bdab26cf8c1184da23c68"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.open (cognitive 20): ModelFactory.open has cognitive complexity 20 (threshold 15). Drivers by points: error handling 3 (6 pts), ternaries 2 (6 pts), loops 1 (3 pts), boolean chains 2, if/else 1 (2 pts), 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":"source/tflite.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2092e143b6266c6f4c77b0116e1f4cacb702561f7768b2c4a84b07547c2c23"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor.values (cognitive 20): Tensor.values has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tflite.js"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"00370858cf132a4c89db23509acba1450e8a887670e05a0e10896d0aac03c353"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor::map (cognitive 20): constructor::map has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/executorch.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ae4e522312bf56cc98841b5ea8e82e98d8a26370f11f1cfceb5b6de273e448"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 20): constructor has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (9 pts), boolean chains 4, if/else 2 (3 pts), loops 3, match/switch 1 (nesting depth added 5). None of this is in the body itself: all 20 points belong to 9 function items inside it that branch (a function literal at line 140, get_parameters, a function literal at line 142, \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":"source/nnabla.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"79031291f4a4b0b2d3b8fb6375f3186f7327a27c9cda60a41023f581988260d2"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 20): constructor has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (8 pts), boolean chains 7, if/else 2 (3 pts), ternaries 2 (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 2 belong to 5 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":"source/onnx.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a9c208740d88567b38d1535152a4b269d04bcf86c56fabd2809f742da71d36"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 20): constructor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 2 (8 pts), boolean chains 3 (nesting depth added 9). Of this number, 10 points are the body\u0027s own statements and 10 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":"source/tf.js"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcaced5ebf46006a9e78637ebc198540cf9f8f1f707e7ca27c26602077ac254"}},{"ruleId":"D2","level":"warning","message":{"text":"open (cognitive 20): open has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 6, if/else 5 (6 pts), ternaries 4 (6 pts), error handling 1, loops 1 (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":"source/view.js"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cf1b584ddb1fc7c2d6f1121f32fad883f210c2f44c79ffd7230d0c61a608e0"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor::_keydown (cognitive 20): constructor::_keydown has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 6, ternaries 5 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf74546e9f0e2a04a565212394c410754e0f1b8ccdb65b3842cb51c2bc0a85a"}},{"ruleId":"D2","level":"warning","message":{"text":"Application._openPath (cognitive 19): Application._openPath has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, ternaries 1 (2 pts) (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":"source/app.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf19d23cbed4d8641f1dba88eb4dbaaf6f07d3a1f786505c9c295f5730d6d096"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.open::open (cognitive 19): ModelFactory.open::open has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 2 (8 pts), error handling 2 (6 pts), boolean chains 2, match/switch 1 (2 pts), if/else 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. This shape REPEATS in the file: one other method here (ModelFactory.open) 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":"source/caffe2.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7f5f6e3e5a4fcbefc6bf536e06d751a2cb35f7444309a8f9a8b0354803a3b7"}},{"ruleId":"D2","level":"warning","message":{"text":"Execution.resolve (cognitive 19): Execution.resolve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 4 (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":"source/python.js"},"region":{"startLine":21953}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea8564d0406804d4dc42809f4abd9b3b7ade3fe24ac5a60f019cf8d05533972"}},{"ruleId":"D2","level":"warning","message":{"text":"dagre.dagre.layout::position::verticalAlignment (cognitive 19): dagre.dagre.layout::position::verticalAlignment has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 2 (8 pts), boolean chains 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. This shape REPEATS in the file: 12 other methods here (dagre.dagre.layout, dagre.dagre.layout::rank::longestPath, dagre.dagre.layout::rank::networkSimplex::initLowLimValues::dfs, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 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":"source/dagre.js"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e29a84a14dfa5e9b5031c5b84be52819434b76a8436a926e12ed491e5820e5f"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.match (cognitive 19): ModelFactory.match has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (2 pts), ternaries 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":"source/darknet.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdf26c78c4ac8868cb6d14b7141867d412d0074c263e926f45d3cd6870f7fff"}},{"ruleId":"D2","level":"warning","message":{"text":"TextReader._string (cognitive 19): TextReader._string has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 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":"source/json.js"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"022a7512d8f49019cce40b17495069a705d1b704d5b1484fd1335d3870865597"}},{"ruleId":"D2","level":"warning","message":{"text":"Formatter.tensor (cognitive 19): Formatter.tensor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 3 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":"source/view.js"},"region":{"startLine":5651}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6f8039db5d342cc0a86524d4d2b2e8a0a86a4a95fa352f4905471806ff2868"}},{"ruleId":"D2","level":"warning","message":{"text":"Package.read (cognitive 19): Package.read has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 7). Of this number, 10 points are the body\u0027s own statements and 9 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":"source/pytorch.js"},"region":{"startLine":1932}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb37aaafdb62c6ed7b78cadfc13263668c62410c7bc38763a3ffcccb91bcfe9f"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.constructor::collectModules (cognitive 19): Model.constructor::collectModules has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 5 (7 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Model.constructor) 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":"source/mlir.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73265fd309d852dd6b89ab5d08691e6e158bf2702795c75ad77b76b29b4c4eb"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.constructor (cognitive 19): Model.constructor has cognitive complexity 19 (threshold 15). Drivers by points: loops 8 (14 pts), if/else 9 (13 pts), boolean chains 9, ternaries 2 (6 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 shape REPEATS in the file: one other method here (Model.constructor::collectModules) 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":"source/mlir.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4b51940eba1098727d756d360aaf65f976a34c8def89c241fb4fcec755e36d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.parseExtendedSymbol (cognitive 19): Parser.parseExtendedSymbol has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, ternaries 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":"source/mlir.js"},"region":{"startLine":3585}}}],"partialFingerprints":{"codehealthFindingId/v1":"452786c1a3f392a56b07213c3ed05051f9b860ca089e055e667c01b2157a3aa1"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.parseCommaSeparatedList (cognitive 19): Parser.parseCommaSeparatedList has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, 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":"source/mlir.js"},"region":{"startLine":3645}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28a570b6b225edadbfb6115604643f7ab12d16ffb935f4bc991f332ebb95b8a"}},{"ruleId":"D2","level":"warning","message":{"text":"TensorLiteralParser.parseList (cognitive 19): TensorLiteralParser.parseList has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts) (nesting depth added 11). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to one function item inside it that branches (compareDims). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":6394}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e2003d91258c4f7c4f706b6d3b9558a0ab021d3ea6a8e9a9388128d1cee7be"}},{"ruleId":"D2","level":"warning","message":{"text":"Dialect.parseEnumFlags (cognitive 19): Dialect.parseEnumFlags has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, 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":"source/mlir.js"},"region":{"startLine":11086}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa9ab38ab5ae2f71294920e5b826016bb788838a03d1663c30124fabe547ed3"}},{"ruleId":"D2","level":"warning","message":{"text":"HLODialect.parseWindowAttributes (cognitive 19): HLODialect.parseWindowAttributes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, loops 1 (nesting depth added 3). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"source/mlir.js"},"region":{"startLine":11282}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81c046ab3f39d9fc08d481d2ae18e33ff8996c747edb039ccb8220660016a17"}},{"ruleId":"D2","level":"warning","message":{"text":"StableHLODialect.parseOperation (cognitive 19): StableHLODialect.parseOperation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 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":"source/mlir.js"},"region":{"startLine":11738}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cc061641cb159b1ecfdb953e6df326ecfddd6c963032e342c8fdb306ec5cbc"}},{"ruleId":"D2","level":"warning","message":{"text":"AMDGPUDialect.parseMFMAOp (cognitive 19): AMDGPUDialect.parseMFMAOp has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":20877}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cf668c18e7fb623c7030cd368d236264a2a4939559602ef7e5ab5ff219e081"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenMPDialect.parseDependVarList (cognitive 19): OpenMPDialect.parseDependVarList has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 2 (6 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":"source/mlir.js"},"region":{"startLine":22128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2a78d34b7b7d749d3c574eef128f61f3d0fcc6696ec45a4bf7fe1b376dfab6"}},{"ruleId":"D2","level":"warning","message":{"text":"SdyDialect.parseTensorShardingAttr (cognitive 19): SdyDialect.parseTensorShardingAttr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 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":"source/mlir.js"},"region":{"startLine":28495}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e58372e6db8122cd891d4bff0e0f49dbb749c5cc9330dd775d0ec5ac9d941e0"}},{"ruleId":"D2","level":"warning","message":{"text":"Container._openShards (cognitive 19): Container._openShards has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (6 pts), ternaries 2 (6 pts), if/else 2 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/keras.js"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"945776a9ede736a79f2a88998d670cf54e6bf87f0dc35e681a1dcc3ab9e71c89"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryParamReader.constructor (cognitive 19): BinaryParamReader.constructor has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 4 (8 pts) (nesting depth added 10). 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":"source/ncnn.js"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"436a88458aad3d3aa121d08ba965927696d02b1810ecc4c77362936c38a46a6f"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 19): constructor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 3 (7 pts), loops 3 (nesting depth added 5). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to one function item inside it that branches (map). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/executorch.js"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"695b034dffa145ee63d262baef0091d490675fcd0a20457f1fb323186d0fda81"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 19): constructor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 2, match/switch 1 (nesting depth added 3). Of this number, 12 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/om.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe2ef811e5c9c70f8181240ac5fc1cc83123653d5e9fbd73cca94ba6bc65420"}},{"ruleId":"D2","level":"warning","message":{"text":"updateTunnels (cognitive 19): updateTunnels has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18 (45 pts), boolean chains 16, loops 6 (10 pts), ternaries 2 (3 pts) (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":"source/view.js"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50201a5cf50870c87f471684387b85a59dbe8f215f72a6305011346664bb9de"}},{"ruleId":"D2","level":"warning","message":{"text":"_attributeDefinition (cognitive 19): _attributeDefinition has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 9 (nesting depth added 6). 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":"source/xml.js"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a1fe8ef0f18ddcd0b458e3d31b3d2a7aecbc65f46040ee1a7f82849d4c86b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor._decodeSparse (cognitive 18): Tensor._decodeSparse has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (13 pts), if/else 3 (4 pts), match/switch 1 (nesting depth added 10). 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":"source/base.js"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"f622afc13d6304a3e9e3b4786022f3bb2533b8e7532200120daba0aa20285caa"}},{"ruleId":"D2","level":"warning","message":{"text":"Application._parseCommandLine (cognitive 18): Application._parseCommandLine has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (13 pts), boolean chains 3, loops 1 (2 pts) (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":"source/app.js"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"de02124ff5ec4a1121b2e2fd2611a00db0800b6ca558077192b083b6381a2ad7"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.constructor (cognitive 18): Graph.constructor has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (6 pts), ternaries 3 (6 pts), boolean chains 5, if/else 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":"source/coreml.js"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1936672cb8388230632b98c02ffaf886b88f6acd50e71f678b627e40391a93a"}},{"ruleId":"D2","level":"warning","message":{"text":"dagre.dagre.layout::rank::longestPath (cognitive 18): dagre.dagre.layout::rank::longestPath has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 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. This shape REPEATS in the file: 12 other methods here (dagre.dagre.layout, dagre.dagre.layout::rank::networkSimplex::initLowLimValues::dfs, dagre.dagre.layout::removeEmptyRanks, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 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":"source/dagre.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"385ca797be11b2ba5ca295317740df79077ead25beaea026f0ecc80692b1072b"}},{"ruleId":"D2","level":"warning","message":{"text":"dagre.dagre.layout (cognitive 18): dagre.dagre.layout has cognitive complexity 18 (threshold 15). Drivers by points: if/else 195 (520 pts), loops 173 (336 pts), boolean chains 61, ternaries 26 (55 pts), match/switch 4 (14 pts) (nesting depth added 527). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 12 other methods here (dagre.dagre.layout::rank::longestPath, dagre.dagre.layout::rank::networkSimplex::initLowLimValues::dfs, dagre.dagre.layout::removeEmptyRanks, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 13 times rather than 13 independent problems. Splitting this body alone leaves the other 12 exactly as they are. Where these are variations on one operation, the change that clears all 13 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":"source/dagre.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08cabcf29842bf2143c5078ea2930b3e3667f65b27bdd83c97af1b06644b524"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.read (cognitive 18): Context.read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":7028}}}],"partialFingerprints":{"codehealthFindingId/v1":"431927a96dbfdc7c6800152ec1e82a6afa637735859f8a8b5f1038eecf2d0776"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactoryService._unsupported::flatbuffers (cognitive 18): ModelFactoryService._unsupported::flatbuffers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 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. This shape REPEATS in the file: one other method here (ModelFactoryService._unsupported::pb::match) 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":"source/view.js"},"region":{"startLine":7608}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8832fbe2f0b36f4e66b6b6568787922caf7ea200407c944c33c6b994abec073"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactoryService._openEntries::filter (cognitive 18): ModelFactoryService._openEntries::filter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":7766}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1e8f103ddb5a9e63f934eb5c59c77d06bb32168fc0c278b7c74e7bdeb54f62"}},{"ruleId":"D2","level":"warning","message":{"text":"Host.view (cognitive 18): Host.view has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 5, error handling 1 (2 pts), loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 5). None of this is in the body itself: all 18 points belong to 3 function items inside it that branch (consent, telemetry, age). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/desktop.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc4d75e7e9c14629f3834d07519b0540201b32475f7d5e3ec17888b3169c307"}},{"ruleId":"D2","level":"warning","message":{"text":"Host.fetch (cognitive 18): Host.fetch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 3). None of this is in the body itself: all 18 points belong to 3 function literals inside it that branch (lines 359, 350, 367). 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":"source/desktop.mjs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f3bd91d417ae16d9bde6d724d5e35c76617a6ef3e08c3abc7d5d47a04d2a2d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.parseDimensionListRanked (cognitive 18): Parser.parseDimensionListRanked has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":3300}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f3b374c7065674592eb0829f5a854dbda4f9e5c5f872f132365f3b6c2358d5"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.parseMemRefType (cognitive 18): Parser.parseMemRefType has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 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":"source/mlir.js"},"region":{"startLine":3363}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b51712193a14bdd6774a0a486abdc615f9bb027a557b28590f7d18f54036cd3"}},{"ruleId":"D2","level":"warning","message":{"text":"DialectReader.readAPFloatWithKnownSemantics (cognitive 18): DialectReader.readAPFloatWithKnownSemantics has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 6 (8 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":6882}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d360144e8025f7b6d9504f3fbbc94fa0c6656c30b59910a4f6085f3aa21f375"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorDialect.inferResultTypes (cognitive 18): VectorDialect.inferResultTypes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 1 (4 pts), loops 1 (3 pts), boolean chains 2 (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":"source/mlir.js"},"region":{"startLine":12957}}}],"partialFingerprints":{"codehealthFindingId/v1":"18df1772ee59a8a23166351dd1a13df07cceca78c214d9f1a6624b36c8866b20"}},{"ruleId":"D2","level":"warning","message":{"text":"ValueTensorType.parse (cognitive 18): ValueTensorType.parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 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. This shape REPEATS in the file: one other method here (NonValueTensorType.parse) 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":"source/mlir.js"},"region":{"startLine":13052}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d1413cf6e845f642c893b32502229205662ed95b1e1a295b320d55d011891e"}},{"ruleId":"D2","level":"warning","message":{"text":"NonValueTensorType.parse (cognitive 18): NonValueTensorType.parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 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. This shape REPEATS in the file: one other method here (ValueTensorType.parse) 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":"source/mlir.js"},"region":{"startLine":13107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ffebf5f2ef32eade794f6d2d90e3054b54bac6bc733ac639c1f9aed60696b0"}},{"ruleId":"D2","level":"warning","message":{"text":"TorchDialect.parseDefaultTorchOp (cognitive 18): TorchDialect.parseDefaultTorchOp has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (6 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":"source/mlir.js"},"region":{"startLine":13383}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3189739afff26265e10bbfad77952e26851b5be9806f2461f2ab9f95f80c61f"}},{"ruleId":"D2","level":"warning","message":{"text":"IREEDialect.parseWorkgroupCountRegion (cognitive 18): IREEDialect.parseWorkgroupCountRegion has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":13581}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22cac39d7feb578579462c561cd33ff991d06e7a04010b92b293b7d2c0782f4"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowDialect.parseDispatchWorkgroupsOp (cognitive 18): FlowDialect.parseDispatchWorkgroupsOp has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":14928}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3cfca8f2dab80089b6a301fbbbd084dbd1e8815aa04f8cc8d77613d5f8f3af"}},{"ruleId":"D2","level":"warning","message":{"text":"LinalgDialect.parseUnpackOp (cognitive 18): LinalgDialect.parseUnpackOp has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (8 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":"source/mlir.js"},"region":{"startLine":16417}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bb9a626f5d788a844b7469ee3f9750b8b728aec502db202a7a106e0d732ee7"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmSSADialect.inferResultTypes (cognitive 18): WasmSSADialect.inferResultTypes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 1 (3 pts), boolean chains 2 (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":"source/mlir.js"},"region":{"startLine":18726}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a8882288f831bf26e222a0a1195f2c799675bd383d647eb231d5b47d72f796"}},{"ruleId":"D2","level":"warning","message":{"text":"TritonNvidiaGPUDialect.parseBarriersAndPreds (cognitive 18): TritonNvidiaGPUDialect.parseBarriersAndPreds has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (17 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":26946}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7a6bb6deb983f7415e2b477c00fa791bccec85e4e615e4fe9fb25956a78a57"}},{"ruleId":"D2","level":"warning","message":{"text":"TensorRTDialect.parseForOp (cognitive 18): TensorRTDialect.parseForOp has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 1 (2 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":"source/mlir.js"},"region":{"startLine":27219}}}],"partialFingerprints":{"codehealthFindingId/v1":"223cf3a8ea50d609e7200f606ff0142dbb95560131eab8c642495e675b545876"}},{"ruleId":"D2","level":"warning","message":{"text":"XtenNNDialect.parseSubgraphOp (cognitive 18): XtenNNDialect.parseSubgraphOp has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 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":"source/mlir.js"},"region":{"startLine":29127}}}],"partialFingerprints":{"codehealthFindingId/v1":"58537fd3b5e28757bee537bb84f6bfddaa5442ffe003d2f4987f949f29f71d3b"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.constructor (cognitive 18): Graph.constructor has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (12 pts), boolean chains 3, if/else 2, ternaries 1 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 3 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":"source/mslite.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bbd43e1c157bd1c1dfe7b2174602ff814b1917a16bd56c3c2d3f6ab98c9f5b"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.match (cognitive 18): ModelFactory.match has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/sklearn.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf14617ae99fb7b95d3ac7b2e83c9a294f72c56ef33bac9b708b66b41ec0946"}},{"ruleId":"D2","level":"warning","message":{"text":"Experimental.decodeJson (cognitive 18): Experimental.decodeJson has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":8073}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6294e5c3188ba2f46c0b6b0817eaba67b46b70d5a505d505bc0f6eb4c1fced"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch (cognitive 18): fetch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 4). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 3 function items inside it that branch ((anonymous)::onload, (anonymous)::onerror, a function literal at line 656). 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":"source/browser.js"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"d816bf6b95941f8fba55303a63512dc666de70c1033adc850f898f8756734cf3"}},{"ruleId":"D2","level":"warning","message":{"text":"entries (cognitive 18): entries has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 6 (8 pts), ternaries 1 (nesting depth added 5). Of this number, 12 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/executorch.js"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"239dd5c5f979e493a6dee081d82fb25dd066922e0af42ebf327ab375370614d3"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 18): constructor has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 5, if/else 3 (5 pts), loops 3, ternaries 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 9 function items inside it that branch (map, a function literal at line 2449, map::__reduce__, \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":"source/pytorch.js"},"region":{"startLine":2420}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d73bcde169fa4b8f8659db02b37976ced69eb5b2d5bdb0903bc56146ca25291"}},{"ruleId":"D2","level":"warning","message":{"text":"decodeJson (cognitive 18): decodeJson has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":4884}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8fcc4834c1014558be0665b8bd245ae73587717b25134deeabf26ed298ffa5"}},{"ruleId":"D2","level":"warning","message":{"text":"_name (cognitive 18): _name has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 7, loops 1 (3 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":"source/xml.js"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"790470d7e12415ffbbebc1c9a8b8c6bc8d4a95b2ba81abd567abae92337964bd"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryReader.string (cognitive 17): BinaryReader.string has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), 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":"source/flatbuffers.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"67895165f70a234ed2a4539a2375041397b4535c4f018a91b42d7e8a6a28f7e9"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryReader.signature (cognitive 17): BinaryReader.signature has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 1 (3 pts), boolean chains 2, error handling 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":"source/protobuf.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"869b6c83542872569bf77157f8264cd64e854eaeeb93158c640faa3b5d94403f"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelSidebar.render (cognitive 17): ModelSidebar.render has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, loops 2 (4 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":4610}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfad0864faed39e7846b637e0c924391f707dcbd2d77aee7e7d44853f609dfb"}},{"ruleId":"D2","level":"warning","message":{"text":"Container._list (cognitive 17): Container._list has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (6 pts), loops 2 (6 pts), boolean chains 5 (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":"source/view.js"},"region":{"startLine":6533}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd74fe1681d847a3e2d0132c8a09dc4df8f3e4a8014c26ecd14a88f5454cbb0"}},{"ruleId":"D2","level":"warning","message":{"text":"Utility.unpack (cognitive 17): Utility.unpack has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, loops 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.js"},"region":{"startLine":2061}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f26f990193dc5e99f42c84016e512242739221b9cf06375dd37c90db058786"}},{"ruleId":"D2","level":"warning","message":{"text":"Metadata.attribute (cognitive 17): Metadata.attribute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (8 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":"source/pytorch.js"},"region":{"startLine":2726}}}],"partialFingerprints":{"codehealthFindingId/v1":"530d46450ee734585eeb532c564e1ee6c8e5990906606c74e00bb702109f904a"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.build::buildBlockLayers (cognitive 17): Context.build::buildBlockLayers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 5 (8 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 shape REPEATS in the file: 3 other methods here (Context.build, Context.build::resolveBlock, Context.build::sectionFlat) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/gguf.js"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29c42b1b263ffe5072e72a4492868d3d8615a104f6e7f397010e4391afcdfcf"}},{"ruleId":"D2","level":"warning","message":{"text":"Context._classifyTensorGroups (cognitive 17): Context._classifyTensorGroups has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 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":"source/gguf.js"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d92cd2c16e12517137512f99b13e0839bce21eea0c3d9e4c6153c2d3e75865"}},{"ruleId":"D2","level":"warning","message":{"text":"HLODialect.parseDims (cognitive 17): HLODialect.parseDims has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (3 pts) (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":"source/mlir.js"},"region":{"startLine":11250}}}],"partialFingerprints":{"codehealthFindingId/v1":"85073718765ea9b791a657e2d40bfbccd17bd89b4f55e6da3eda22aff8989c85"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowDialect.parseShapedOperandList (cognitive 17): FlowDialect.parseShapedOperandList has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":15177}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d45715aa3410b02722f1057919344de260c912db354a61e616b909db0db201"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamDialect.parseWorkgroupCountRegion (cognitive 17): StreamDialect.parseWorkgroupCountRegion has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (6 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":"source/mlir.js"},"region":{"startLine":15595}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a9a1f364d6a80861fcabc0b832c2cc6ef17c07a05973ceb7a0709141afdc3d"}},{"ruleId":"D2","level":"warning","message":{"text":"PtrDialect.inferResultTypes (cognitive 17): PtrDialect.inferResultTypes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":19093}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e18c10cafaa61667feee376777499d0c7f0bf8e987f497d9e07c7e69772a7a"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreRTDialect.parseOperation (cognitive 17): CoreRTDialect.parseOperation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (7 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":"source/mlir.js"},"region":{"startLine":24362}}}],"partialFingerprints":{"codehealthFindingId/v1":"7587fd5144d83e2864da29cec8c212716a12ef49d57406e390f2b024fd942afc"}},{"ruleId":"D2","level":"warning","message":{"text":"Metadata.attribute (cognitive 17): Metadata.attribute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (8 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":"source/ncnn.js"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"028c20848f40f990b06e195be0d7eeb9b207a414241fa6353ccaffb31e22af25"}},{"ruleId":"D2","level":"warning","message":{"text":"Metadata.type (cognitive 17): Metadata.type has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 1 (4 pts), boolean chains 3, loops 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":"source/onnx.js"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4adb85428da5986f737d9fa3dc3672b62b8f9b815c5aab533ec26f6c7410c3"}},{"ruleId":"D2","level":"warning","message":{"text":"Pickle.constructor::filter (cognitive 17): Pickle.constructor::filter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 1 (4 pts), boolean chains 3, 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. This shape REPEATS in the file: one other method here (Pickle.constructor) 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":"source/paddle.js"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8eedbed5c9b43929f937576f16e0c586900cd35fc8ce25c7392393bc664c9be"}},{"ruleId":"D2","level":"warning","message":{"text":"Pickle.constructor (cognitive 17): Pickle.constructor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 6, ternaries 1 (5 pts), loops 1 (3 pts) (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. This shape REPEATS in the file: one other method here (Pickle.constructor::filter) 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":"source/paddle.js"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4abb9a47931af73dc3c9f727db0a9e388d0ff0b8a6ea807d4f03d676f2a6891"}},{"ruleId":"D2","level":"warning","message":{"text":"IR.block (cognitive 17): IR.block has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (5 pts), ternaries 1 (3 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":"source/paddle.js"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed5a00f549d05437f3f553a35fc45fa690085d8a0285c031460957e5e85ca16"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.constructor (cognitive 17): Model.constructor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), ternaries 1 (2 pts), boolean chains 1, match/switch 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":"source/sklearn.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a866d8ff092e789080de3c452f88527c3d386220803df3ab699016d1d793f1"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionDef.decodeJson (cognitive 17): FunctionDef.decodeJson has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 7 (nesting depth added 5). 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":"source/tf-proto.js"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2bce72db503b175bd2047caf5cd65d540e2a2ea3c3e04ae4503588ddcbe63a"}},{"ruleId":"D2","level":"warning","message":{"text":"SavedObject.decodeJson (cognitive 17): SavedObject.decodeJson has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, loops 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":3740}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf0412ddff09b48697f24eb1b74471e59084dec1827fd7b95bfc253579b24fb"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeExecStats.decodeJson (cognitive 17): NodeExecStats.decodeJson has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":11090}}}],"partialFingerprints":{"codehealthFindingId/v1":"96290cd7ce60a19a09c11307687f7dcb3fed83253e9c37992942f3864c17c710"}},{"ruleId":"D2","level":"warning","message":{"text":"server._make_port (cognitive 17): server._make_port has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (5 pts), error handling 1 (3 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":"source/server.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0d8964f4cd322f3029f8157330f84634bdd6d947814f07309ecc82f440f908"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor::map (cognitive 17): constructor::map has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 6, ternaries 3 (4 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/openvino.js"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7adacdb7b52373feb113832f4351a9f444321504021fa69030df4bc81b79f6"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 17): constructor has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (6 pts), ternaries 5, boolean chains 4, if/else 2 (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":"source/tf.js"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf2d52b29c763ce77cf38e1da84afde426bc605170568fc92388daf9e240191"}},{"ruleId":"D2","level":"warning","message":{"text":"open::masked_crc32c (cognitive 17): open::masked_crc32c has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8 (16 pts), 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":"source/tf.js"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b703c05a265512176b9a5a1b355888baef312a27e949b6d76815bad84477a40"}},{"ruleId":"D2","level":"warning","message":{"text":"start (cognitive 17): start has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 4, boolean chains 2 (nesting depth added 1). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 24 function literals inside it that branch (lines 229, 187, 260, \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":"source/desktop.mjs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"84613fd817254b1bd416d11c64f95274ad2cee6081da30b9b2e09bc23376c1bb"}},{"ruleId":"D2","level":"warning","message":{"text":"MenuService._updateLabel (cognitive 16): MenuService._updateLabel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (14 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":"source/app.js"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c38e7214310cfd1c4d0b8f1357835aa86942207c1e6b1ea155f9d18d3ba015"}},{"ruleId":"D2","level":"warning","message":{"text":"Execution.invoke (cognitive 16): Execution.invoke has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 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":"source/python.js"},"region":{"startLine":21985}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fe0227ef0a71fd5f7368ccb75bd023adcdf7a788e66ddfe4652c7446a6352b"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.open::openBinary::walkProgram (cognitive 16): ModelFactory.open::openBinary::walkProgram has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 1 (5 pts), boolean chains 1 (nesting depth added 10). 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":"source/coreml.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cfcb6ce988fdcaf3d30fc9718b10888014fbdeb99018458ae29c9351e219c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.program::convertValue (cognitive 16): Graph.program::convertValue has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 3 (7 pts), boolean chains 2 (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. This shape REPEATS in the file: one other method here (Graph.program) 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":"source/coreml.js"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"7280f2ede4b75ca5792caf9f21b28de486c330afcd6ac65282deb4ce969ad601"}},{"ruleId":"D2","level":"warning","message":{"text":"Tree.constructor (cognitive 16): Tree.constructor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/hdf5.js"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"71485a7d71b1c741ffa9f00c60adcf1b2e4017f9a1d2c2c015cc6ba6b1cd6e02"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.find (cognitive 16): Graph.find has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 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":"source/view.js"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"73eeb95eaad23a52107b7d756b00c93a07210d857eae439cccd333c0597c51a4"}},{"ruleId":"D2","level":"warning","message":{"text":"Container.open (cognitive 16): Container.open has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 1 (4 pts), boolean chains 2, 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":"source/view.js"},"region":{"startLine":6497}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8241f23cb38d9d51a656037ebbd1fcd54962c86574c7ac944d9b662ddb8aca"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactoryService._unsupported::pb::match (cognitive 16): ModelFactoryService._unsupported::pb::match has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ModelFactoryService._unsupported::flatbuffers) 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":"source/view.js"},"region":{"startLine":7568}}}],"partialFingerprints":{"codehealthFindingId/v1":"6155ec64c6fefa193aaa15973470a8cbd2ef8cb804719fff70e6d7a23a8a0283"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.open::backref (cognitive 16): ModelFactory.open::backref has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 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":"source/flux.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e7ac84781f13c805b52ec66856264b0ec543fc7a0314e7be4794a4cb296f02"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.build::sectionFlat (cognitive 16): Context.build::sectionFlat has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (6 pts), if/else 2 (4 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (Context.build, Context.build::resolveBlock, Context.build::buildBlockLayers) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/gguf.js"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09cbb8a7d1c698a29d16d53a3736adf604ea81034501de2d3f75f784388ac8f"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.constructor::deserialize (cognitive 16): Graph.constructor::deserialize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 1 (4 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":"source/hickle.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"144436076e7e4789b5b1994f72065a5b768d91a48f5806ee82707f3357d479b0"}},{"ruleId":"D2","level":"warning","message":{"text":"Utility.dataType (cognitive 16): Utility.dataType has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"68137dfa6a92dbbb2e934004628427dd92cec27ccb79066e8bb8341391dce46b"}},{"ruleId":"D2","level":"warning","message":{"text":"AssemblyFormatParser.parseParenList::parseElement (cognitive 16): AssemblyFormatParser.parseParenList::parseElement has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 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":"source/mlir.js"},"region":{"startLine":8715}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b03872193252cf6ae4fd4108cc1096c40d1838a0bb838f9f6950c6f0d6fcae"}},{"ruleId":"D2","level":"warning","message":{"text":"IREEDialect.parseSymbolAlias (cognitive 16): IREEDialect.parseSymbolAlias has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, ternaries 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":"source/mlir.js"},"region":{"startLine":13538}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8b7e2bd382d031e24290dba068d9f90fcf61dab33ad115811289c6204756c5"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamDialect.parseExplicitResourceRegion (cognitive 16): StreamDialect.parseExplicitResourceRegion has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (4 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":"source/mlir.js"},"region":{"startLine":15303}}}],"partialFingerprints":{"codehealthFindingId/v1":"e817987cd1898e03399d888f4ee6993f67bc0e1b602a4421336720b90bb5f9c1"}},{"ruleId":"D2","level":"warning","message":{"text":"LinalgDialect.parseMapOp (cognitive 16): LinalgDialect.parseMapOp has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 1 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":16289}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e53badcec549394e7df4a8441eb3adf0ee7a2cfa10ffff997ef90285d553acb"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformDialect.parseApplyRegisteredPassOptions (cognitive 16): TransformDialect.parseApplyRegisteredPassOptions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":25829}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5a1296212f1656324d4aa53ffd01e9c1b5f355e766f595f5e4a35b94525bd8"}},{"ruleId":"D2","level":"warning","message":{"text":"MemDescType.parse (cognitive 16): MemDescType.parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (16 pts) (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":"source/mlir.js"},"region":{"startLine":26748}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f2d985eae032e712ae387b6ed2ef43824f5cfb73d02cd906332d89c79a655c"}},{"ruleId":"D2","level":"warning","message":{"text":"ACCDialect.parseWaitClause (cognitive 16): ACCDialect.parseWaitClause has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":27763}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58a5763d26ce659209a45a14b295666e9c12a853a4f0e54f87b34c61d4b38c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelHeader.constructor (cognitive 16): ModelHeader.constructor has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (10 pts), if/else 3 (5 pts), boolean chains 1 (nesting depth added 9). 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":"source/mlnet.js"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"04673345cb1166ea7c71ab2fe0e6c9693ec12428e30ec865f7f69904d2cef744"}},{"ruleId":"D2","level":"warning","message":{"text":"Model.constructor (cognitive 16): Model.constructor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6 (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":"source/mxnet.js"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fa6cb36c9739b93eceb7a910c9f1a0ca13612a48a7eca1615dce654178d7a3"}},{"ruleId":"D2","level":"warning","message":{"text":"Utility.weights::list (cognitive 16): Utility.weights::list has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), loops 2 (6 pts), boolean chains 3, ternaries 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 shape REPEATS in the file: one other method here (Utility.weights::dict) 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":"source/numpy.js"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb45615c196b8cf5b6a3376cadbed5d4ca7172ae529c5f31dd894357db8cba3d"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtoReader.open::match (cognitive 16): ProtoReader.open::match has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ProtoReader.open) 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":"source/onnx.js"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"78da95ecc648b90a3cdab6a7f45f3fb4e369e50c6041c4ec3f61bbdee8093f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.match (cognitive 16): ModelFactory.match has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25b27c0d3f6c686b4d9dfe5f543e9283ba1fdf5c064ab1cd70d04303c53340d"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.decodeJson (cognitive 16): Node.decodeJson has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":10379}}}],"partialFingerprints":{"codehealthFindingId/v1":"5902adca6607f29786e5b239af225429202d297efd227093d878193b44565a8d"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFactory.match::match (cognitive 16): ModelFactory.match::match has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ModelFactory.match) 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":"source/tf.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"06737f64e7221c4229f9f8e90ad1eaeeef24b5c875d0ca939fa959a20ce98e48"}},{"ruleId":"D2","level":"warning","message":{"text":"TensorType.constructor (cognitive 16): TensorType.constructor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 1 (2 pts), match/switch 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":"source/xmodel.js"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8587cf286ec8ef6b87396a24318dfc9e815eea26ef9cdecb0cfb7013d3bb37"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 16): constructor has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (7 pts), if/else 4 (5 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 4). Of this number, 11 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/barracuda.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bc427a89310267503867198eb50bb8f180b4c14fa9b20548d47027b5cd40c1"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 16): constructor has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, ternaries 5, if/else 2 (3 pts), loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/browser.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"241cebfc564d6e9437c023e09263d2f4c4884ca51c5934ef1aaf175cca00ee0b"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 16): constructor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 8). 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":"source/dlc.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a2da8011916c00b115614fe8b8998f44c359d954c6488ed0458b456442b330"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 16): (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 12, if/else 4. Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"source/index.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5539dcded866d3ceb9459fe8fee6dc876aa1cee7e9677cee7d482bcb719fe4"}},{"ruleId":"D2","level":"warning","message":{"text":"decodeJson (cognitive 16): decodeJson has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, ternaries 2 (4 pts) (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 2 belong to 8 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch-proto.js"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7415d5090aed70dc5d4343ecd69e0aa72ef3296fabc6f58e13019eea3dad09"}},{"ruleId":"D2","level":"warning","message":{"text":"read (cognitive 16): read has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (5 pts), boolean chains 4, loops 3, ternaries 2 (3 pts), error handling 1 (nesting depth added 2). Of this number, 10 points are the body\u0027s own statements and 6 belong to 6 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":"source/pytorch.js"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"5139b7f5e79931db006e5920b54bafc6f8ae1cb4ed6de26a0224bfa417a613e6"}},{"ruleId":"D2","level":"warning","message":{"text":"_elementChildren (cognitive 16): _elementChildren has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 1 (nesting depth added 4). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/xml.js"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12bfc21972ae7fe4c1591371de23d58afab33e22ce0df8a035bc912e49b4840"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/mlir.js: FileTooLong \u2014 21147 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 20647 over it, 42.29\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":"source/mlir.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da86c4b4ca6595e217882c4f95fc59e9ea0f606303589424671132f6c6599fc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/python.js: FileTooLong \u2014 16626 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 16126 over it, 33.25\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":"source/python.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07be2a35ad21e96e235898241656de9d03a385011a50a6c7163d435a1a0e8000"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/coreml-proto.js: FileTooLong \u2014 14440 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 12940 over it, 9.63\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":"source/coreml-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8388a53fe4c8c1f20ce1eaa2aeb2ccb160ff69d61264c48c9d0b5d5caa752f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/tf-proto.js: FileTooLong \u2014 10428 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 8928 over it, 6.95\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":"source/tf-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfbce0ff1a65213be47d798e11c969e4fbf40dabb359cfce69be615dd53346f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/nnabla-proto.js: FileTooLong \u2014 10038 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 8538 over it, 6.69\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":"source/nnabla-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b20b2f317b5734fc7d9dd0d3a51d4420c3219a03d204525270af85eda110199"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/view.js: FileTooLong \u2014 5880 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 4380 over it, 3.92\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0d93d22a4c8a1d4482a3b4785b7e6e6ebb8c2fa49e371550b90daf076e2ca3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/caffe-proto.js: FileTooLong \u2014 4441 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 2941 over it, 2.96\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":"source/caffe-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f77c017c3ec4eaa39bb22d087bf70e7384abd25a5effd8402654cec8e85ffa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reader.read: MethodTooLong \u2014 read runs 761 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 661 over it, 7.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":"source/kmodel.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"0777ef2b63cf3cf24906765248d8b401b387288ece91c75039a18ef3307cc6a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/mslite-schema.js: FileTooLong \u2014 3168 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 1668 over it, 2.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mslite-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"989c66728f6434331fefeefb673b6c44fea4af8736a0302356aa2df30aaf0f27"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Graph.constructor: MethodTooLong \u2014 constructor runs 600 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 500 over it, 6.00\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":"source/darknet.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6baaadc8e6b64373ab9a46a9973b0f194ccb5aeb918a3b6d2f32c8963f45d4f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/tflite-schema.js: FileTooLong \u2014 2792 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 1292 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":"source/tflite-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b24c03ecb26b89684d73b8c79570cebc117dbe3745987cd91307dfa8410894"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/mnn-schema.js: FileTooLong \u2014 2613 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 1113 over it, 1.74\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":"source/mnn-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e40341a8099067896db423fd085e8015cf9f2255ab82146032f1cbc4ae415fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/circle-schema.js: FileTooLong \u2014 2542 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 1042 over it, 1.69\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":"source/circle-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ca18f4f38c528ecc9603c021aa943bf9fd4fdf4fe3916a5785e7655d022780"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NeuralNetworkLayer.decode: MethodTooLong \u2014 decode runs 502 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 402 over it, 5.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":"source/coreml-proto.js"},"region":{"startLine":6641}}}],"partialFingerprints":{"codehealthFindingId/v1":"36275c2ef40bf7059834a0fbd6585c9e149f1123e86a3345caf0fb54cce52099"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NeuralNetworkLayer.decodeText: MethodTooLong \u2014 decodeText runs 502 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 402 over it, 5.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":"source/coreml-proto.js"},"region":{"startLine":7147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cd1fe2c24567678716c0d6520b0bd7b0d49aba8f5d830f0171ef819d3eaae8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Function.decode: MethodTooLong \u2014 decode runs 502 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 402 over it, 5.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":"source/nnabla-proto.js"},"region":{"startLine":3180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6a62d907b94a17de063af91df51eed69ea017cc23ac650150a0de1cb837e6f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Function.decodeText: MethodTooLong \u2014 decodeText runs 502 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 402 over it, 5.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":"source/nnabla-proto.js"},"region":{"startLine":3686}}}],"partialFingerprints":{"codehealthFindingId/v1":"008c2c10ed9c52136f109590030c0b04a05ed4419780e9bed778a3dac98b41d3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Graph.constructor: MethodTooLong \u2014 constructor runs 483 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 383 over it, 4.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":"source/gguf.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c49a7603938856c25ad40378a51c9ef93a9b54812eeaef97df0857658efa95"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Node.constructor: MethodTooLong \u2014 constructor runs 470 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 370 over it, 4.70\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":"source/ncnn.js"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac1b21354587de2f57dab8ed7fc4b5e1c2c16a260d439935d67f7ffa6f56e9d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Node.constructor: MethodTooLong \u2014 constructor runs 454 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 354 over it, 4.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":"source/pytorch.js"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcc3307ebc541c9571446c8ce0efe3128a6294fb3e53102f8330eaa4cc0b5ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/armnn-schema.js: FileTooLong \u2014 2198 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 698 over it, 1.47\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":"source/armnn-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5185058480a0f7bbf6baa9e83a820d18be325bfbf6b0a89ecf1d717ef5947ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/onnx-proto.js: FileTooLong \u2014 2128 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 628 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fc65a1eda925c7c3d1515f79d94f79c804ebc4c0b0297dd907b141a40f2268"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/onnx.js: FileTooLong \u2014 2094 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 594 over it, 1.40\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":"source/onnx.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdfa60631c4e35bd7d49d26b6c5c36cc44b1c272c7e3f434f669bfb64b870fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/pytorch.js: FileTooLong \u2014 2069 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 569 over it, 1.38\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":"source/pytorch.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40cd76aef5b6e41697308eca9b802901641022aacb44fee5f0b65702ef9307f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModelFactory.open: MethodTooLong \u2014 open runs 364 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 264 over it, 3.64\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":"source/tf.js"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0461e7d8d0e3dc9772de7421ee784e6a9cf499432df0a231e47570e1987637f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/kmodel.js: FileTooLong \u2014 1776 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 276 over it, 1.18\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":"source/kmodel.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1de334d167a5043592ae2faecf957b7845903db2fa6c91580cca3e507b0790"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/megengine-schema.js: FileTooLong \u2014 1725 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 225 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/megengine-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a659b36ba90d022dba79b6e6458665e188ac47f8fb350ce005b0cebc5bd5a67d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Inference.infer: MethodTooLong \u2014 infer runs 343 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 243 over it, 3.43\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":"source/acuity.js"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae286605cce72369773205a341108e1c2bda6f79728c0617a017582323db115d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/tf.js: FileTooLong \u2014 1657 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 157 over it, 1.10\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":"source/tf.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e4bc8d98f9bd07e00ebb0ef7e728ce91b30a19ac913c2501d6d7efb37420b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/dagre.js: FileTooLong \u2014 1639 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 139 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dagre.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ddb3893f62263528f43bb57fecd7e7bdecd9c27105fa59bfd56d3549fda3e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/tosa-schema.js: FileTooLong \u2014 1563 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 63 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":"source/tosa-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2085f057c138fc547f2e0219a7d381ca72b759f0ff05325065961c6ddec4374"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/mlnet.js: FileTooLong \u2014 1544 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 44 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlnet.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2845920b8fc824b564bcf44b1dd50d6196a597f8e964f157981efb150d4af309"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Context.graph: MethodTooLong \u2014 graph runs 299 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 199 over it, 2.99\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":"source/tf.js"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abcf601a51824b8dddcafc06ecccf2dde47a82375595ca6e9267c3387a558f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/caffe2-proto.js: FileTooLong \u2014 1443 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 943 over it, 2.89\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":"source/caffe2-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2aa8fc2cd4ddf969fe430062c49533877271b90bf8ed7c38ba6e9584a4163c8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ComputationNetwork.constructor: MethodTooLong \u2014 constructor runs 287 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 187 over it, 2.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":"source/cntk.js"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2988575bdcd1f56a673550a99e607a54a9714520c5096773e1cd227a230e1ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/paddle-proto.js: FileTooLong \u2014 1325 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 825 over it, 2.65\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":"source/paddle-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0554e5ce522d21e59270a7ba018de37f776339719ebd974a4ecfabdaf2b6f7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/hdf5.js: FileTooLong \u2014 1314 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 814 over it, 2.63\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":"source/hdf5.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8146ba7665d972e970469a6436e05d9d3a01ea41a99532cc16a7eb99fabc0b21"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Graph.constructor: MethodTooLong \u2014 constructor runs 252 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 152 over it, 2.52\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":"source/megengine.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b85c4233f334b5258989c65dec70e54d43c98ccce77aad23509af8fb8e2fc30"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/xmodel-proto.js: FileTooLong \u2014 1256 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 756 over it, 2.51\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":"source/xmodel-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"054efe50c4900141be2f928a4c4f0c07f774c8d57c3331d2c0b80b864a0e2254"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reader.read: MethodTooLong \u2014 read 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":"source/tengine.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d10c325df45c3bbaf3620132011ebfaa088545bd1b962ed4101c2efbbe074b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/mindir-proto.js: FileTooLong \u2014 1242 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 742 over it, 2.48\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":"source/mindir-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca749d5798f8260c586bb24f846a7babe7b65dfe5bb9023af205e6e1c4885e03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/xml.js: FileTooLong \u2014 1220 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 720 over it, 2.44\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":"source/xml.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c934e5f575598de4f71aefcaf90fc7c670bca6a9223a01dd2d4a771012839ec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 73 methods. The bar is 30 methods; this is 43 over it, 2.43\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":"source/mlir.js"},"region":{"startLine":2942}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffbc9dd2fadc462365e17916c47595daa3a397d80e3b5ec1a15f85007c72a07"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AsmParser: TooManyMethods \u2014 71 methods. The bar is 30 methods; this is 41 over it, 2.37\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":"source/mlir.js"},"region":{"startLine":5469}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8bba85f8f67d3dfb67b986dd2d7aa41cf4dd3610c41e2dcee5b741a7e5a4a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/coreml.js: FileTooLong \u2014 1149 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 649 over it, 2.30\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":"source/coreml.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b76a0db8b51c8d8670b9324e6269677a0d0b8ec814c16c52306553b4baf8c2f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PrimitiveType.decode: MethodTooLong \u2014 decode runs 224 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 124 over it, 2.24\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":"source/mslite-schema.js"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"472e271c1261560ce7212a898f7f7daac8952e68ea587d3c6ff6251c7200c98e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PrimitiveType.decodeText: MethodTooLong \u2014 decodeText runs 224 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 124 over it, 2.24\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":"source/mslite-schema.js"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1b61c9d5fd5883c1dec69d40c63d7eeeb20e5be69ce6372f287ecd76363fb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/base.js: FileTooLong \u2014 1117 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 617 over it, 2.23\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":"source/base.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98664c084eb9dfa1259d3cae0dbd93404d6ca9ec5cd2f1ce2996db306890d16"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Graph.model: MethodTooLong \u2014 model runs 223 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 123 over it, 2.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":"source/coreml.js"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef518330ae85a83d94a91b678068a486c9fc92e58fb51ccd8d02ffc8c22c624"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/keras.js: FileTooLong \u2014 1098 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 598 over it, 2.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/keras.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23c8a0018c37552b4abd64fe2b3daa2940e0fc9eb448dc0b9788b5aeb8c8480"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/paddle.js: FileTooLong \u2014 1060 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 560 over it, 2.12\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":"source/paddle.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf4c7da55ac5e8421ba7dff00dd9b01c237d32a61a415209cd464726efbb111"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/gguf.js: FileTooLong \u2014 1025 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 525 over it, 2.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/gguf.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace28a4abec4e1f6678272a14298814450200a780096082ecbb3a98bfd37db8e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Node.constructor: MethodTooLong \u2014 constructor runs 204 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 104 over it, 2.04\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":"source/openvino.js"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"281ebd938083042c1ee9b35e77d3bfabb99cb130590a710f90ca2c79ec0b1e3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/protobuf.js: FileTooLong \u2014 993 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 493 over it, 1.99\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":"source/protobuf.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59fc6bf3c24496951739440675751ef845eece1b92e54b5641b5430b53e8e72"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/executorch-schema.js: FileTooLong \u2014 991 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 491 over it, 1.98\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":"source/executorch-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e723542a15b3b63240f7308c2d4930d25100bb7cfa77ba5d30d0b8b587113de6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayerParameter.decode: MethodTooLong \u2014 decode runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.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":"source/caffe-proto.js"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5770169727cdbc125b1464b6000ccaa289381e41688043b253a42058c484f2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayerParameter.decodeText: MethodTooLong \u2014 decodeText runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.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":"source/caffe-proto.js"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1db6d67cd275f08d47fea92d5b7af7cef60b93bce94ac5cf24fadfd19019ef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Graph.constructor: MethodTooLong \u2014 constructor runs 189 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/openvino.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6139c8879dfb7950082d07109c036aa8b96af0bfcf2d70cf3021ea712c5b81"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/executorch.js: FileTooLong \u2014 942 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 442 over it, 1.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/executorch.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a4ee42205be37c81f33b4fc1c08c0812d6e62315b29186c48b4365f2d99325"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Graph.node: MethodTooLong \u2014 node 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":"source/coreml.js"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"372953aac753b00b11a5f51fec57646aa475aece9b5a323819be15f9907f3a82"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: package.publish: FunctionTooLong \u2014 publish 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":"package.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b855fe59b422a555c914a5f4ede46cea17233cd8bb0e4b8f40a0f71f339f64a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/ncnn.js: FileTooLong \u2014 915 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 415 over it, 1.83\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":"source/ncnn.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7a6b0904a874d39544ab4a2d63eb37144e02a948f20bd8202fa81245ceb0ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Application._updateMenu: MethodTooLong \u2014 _updateMenu runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\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":"source/app.js"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13c0eede85342c864fb6834c3d810549e3d31e51178fdce6c2c3b9aa05ce399"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/litertlm-proto.js: FileTooLong \u2014 889 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 389 over it, 1.78\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":"source/litertlm-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06e0e3a8127bc272228a70abd2af861370cbb38925df0bdf3999fcec3ad0ffc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/om-proto.js: FileTooLong \u2014 888 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 388 over it, 1.78\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":"source/om-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0e9a91a69122b2da314e814ae60e66e8ed216e0124d6f68f188bb8ebf46482"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Dialect: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\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":"source/mlir.js"},"region":{"startLine":8988}}}],"partialFingerprints":{"codehealthFindingId/v1":"199c39b6c2603e3d21818584c2b277f5826ff1dc1fd862c764ea234a9a6b2240"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModelFactory.open: MethodTooLong \u2014 open runs 173 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\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":"source/paddle.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"211236904cb2fa3f7cfa231f1b7e7e75cd94c2824be774b035d77a828ef6a248"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextReader.next: MethodTooLong \u2014 next runs 173 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\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":"source/protobuf.js"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac713fcf1f787d3e6bc1e371d7e1a31afe79b834a30107071fbdc65cce889e6c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Graph.constructor: MethodTooLong \u2014 constructor 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":"source/pytorch.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8047ada6b663b56cbc74abb3caee2beae8df855181349082bd2452eb7a26dcb8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Node.constructor: MethodTooLong \u2014 constructor 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":"source/tnn.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a7dac25aa69e82bb1230c7ce950964b41e7cd2d25872d6dc507462a63703d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/cntk.js: FileTooLong \u2014 821 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 321 over it, 1.64\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":"source/cntk.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d2b0887120f241c33aff0d3a44236bd1fbd99349bc52252c49b0137f91bcaf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Node.constructor: MethodTooLong \u2014 constructor runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\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":"source/tf.js"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"8686556fec0f7c4564d3b86b455305107a3e4b57e9264a26ecbe22e23e5827e5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tensor._decodeData: MethodTooLong \u2014 _decodeData 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":"source/base.js"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fecfd937ab76bb5aa8ef304475163899d441de0fbe3ee3f5ba5935bd7d5a08a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/darknet.js: FileTooLong \u2014 811 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 311 over it, 1.62\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":"source/darknet.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf5c9f016acf7229ee02ad94fa7a2656efbafc06172266515b5f80445d6293a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: v5.tensor: MethodTooLong \u2014 tensor runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\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":"source/kmodel.js"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4e6b817e60dd00b56bba820ca4c78a127e5a6008499cfecbd283ab4c4a4afb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModelFactory.match: MethodTooLong \u2014 match runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\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":"source/tf.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1096c51d033921027bf943dc9be3a690ab6215acf1346c06cc111e77cf88da95"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/grapher.js: FileTooLong \u2014 779 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 279 over it, 1.56\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":"source/grapher.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a521fb580fa8190ff1f2d038872488398cd5dfa09292e6ff6a52d0d641ee8b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Context.build: MethodTooLong \u2014 build 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":"source/gguf.js"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44d8649a5b183ee7fbf0ee95aec31653068d6196d04407114151de11973e24e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TrainerSpec.decode: MethodTooLong \u2014 decode runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.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":"source/sentencepiece-proto.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee9dd763639712e6f1b26ff4bc79305ffa4657ebb3912ac940a4aa44b395dc6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TrainerSpec.decodeText: MethodTooLong \u2014 decodeText runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.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":"source/sentencepiece-proto.js"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3e0e89f0971b5521b213f09d030a3ab46f770f02d47ea3bf58d65426052103"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: T7Reader.constructor: MethodTooLong \u2014 constructor runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.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":"source/torch.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc99a2144089a30ab5a5dea17473c695052222c94fa8c3cb8fd32dfff8e8b79"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/uff-proto.js: FileTooLong \u2014 741 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 241 over it, 1.48\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":"source/uff-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7265ddd9be4f4162dd78f8ed729cd57dfae8d96341cbf2525b835b66c979d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/app.js: FileTooLong \u2014 734 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 234 over it, 1.47\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":"source/app.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57db7817819a0df1b6957e631c2a39047b88e2a25ea7873c328d8089c90cb3a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Graph.program: MethodTooLong \u2014 program 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":"source/coreml.js"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d452c31807071294e8b2cd495301507f2efaf72052f2fcc1f0fe7d264ff8f8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModelFactory.open: MethodTooLong \u2014 open 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":"source/mxnet.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e1d1c030f8ac97d71453b78cafafacc3609305adc98f6ca468561a6bcb9164"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TextReader: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\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":"source/xml.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"29251610baffc6d6e007aba7f7c4c15a0d2c6a7c1e8602f70ef5d2266302df00"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: V1LayerParameter.decode: MethodTooLong \u2014 decode runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\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":"source/caffe-proto.js"},"region":{"startLine":4501}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd36a86f0a9943f060ac0f1f8e555b5feddda111c41eea43d2094f894180998"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: V1LayerParameter.decodeText: MethodTooLong \u2014 decodeText runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\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":"source/caffe-proto.js"},"region":{"startLine":4644}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e93aedfd6989550b58afe2a3a1257f3d03d6ce4c494db15326a7402af2b54bc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BuiltinOptions.decode: MethodTooLong \u2014 decode 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":"source/circle-schema.js"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ed80f5e81d8204158219de9218c9222868516a13729e1a2a0dbbf8c58ea80a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BuiltinOptions.decodeText: MethodTooLong \u2014 decodeText 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":"source/circle-schema.js"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"e369a4f93218767e194fcd98ec98c7421ffcc519d99346ed738bb1fe0011d1d6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SolverParameter.decode: MethodTooLong \u2014 decode runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd1666c325027ef1585baf96cac5e40939f27136f8dfb88fa8277f411a6ec8d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SolverParameter.decodeText: MethodTooLong \u2014 decodeText runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ec2cb5efb4399c976e552d5b93500a1d75ef2b8a0993e808e25e9ad44ed6fe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tensor.constructor: MethodTooLong \u2014 constructor 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":"source/onnx.js"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"69805ea6846012e0ae7d6ad096645aacbf27b5289f3db5e01a9ed4946b0d48fb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OpenMPDialect: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\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":"source/mlir.js"},"region":{"startLine":21371}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff842d1a6807fc4c4ca633e34715f0460018b776ceada793efdc780b520f388d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TextReader: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\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":"source/protobuf.js"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"565fef451a0fb676469dd94d5a6bb350a36c7a3f2786d9757eecd600dac3197a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextReader.read: MethodTooLong \u2014 read runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\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":"source/json.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c30a7fe312e10d4ea8f28934cc818338572b3a6c927494eec693732ef51f5b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/zip.js: FileTooLong \u2014 657 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 157 over it, 1.31\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":"source/zip.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"373b2539333937c743f01fd0e096ff751635aa311919175a70cdafa8ca4a5655"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Node.constructor: MethodTooLong \u2014 constructor 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":"source/om.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ea445d4ddfbf52b18b032c949b619f4d93561fe91b60b6de2bac28c0c0c8bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/openvino.js: FileTooLong \u2014 653 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 153 over it, 1.31\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":"source/openvino.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a853946f9628d9685039f997025b67756f018fa72fb2349da6d855700b4339"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.decode: MethodTooLong \u2014 decode runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.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":"source/coreml-proto.js"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"95321bf10c0bbd407871e291f494d5f311de5279cd341b4b2a8ef08ee294c118"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.decodeText: MethodTooLong \u2014 decodeText runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.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":"source/coreml-proto.js"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c0c6ccbf074639377d408fde44e06b8ce0938a58ab5ac14484df2eed6cbb61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/browser.js: FileTooLong \u2014 647 significant lines (blank, comment-only and punctuation-only lines excluded), about 69% of them inside a single declaration: browser (4-623). The bar is 500 significant lines; this is 147 over it, 1.29\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":"source/browser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a849e448a7507ba18b7f89035cbcaaf3efad76d0cd669ec785fcf05d5341a3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BuiltinOptions.decode: MethodTooLong \u2014 decode 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":"source/tflite-schema.js"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf180b3bbcfd68d0c2976a53434efbef12cd67b8b90af2dd1733e071a98ea59"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BuiltinOptions.decodeText: MethodTooLong \u2014 decodeText 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":"source/tflite-schema.js"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e91fcc7ca1667d8b06abbaeb151bea76acef5511ff9a5c41474c8a76aecde64"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/pytorch-proto.js: FileTooLong \u2014 641 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 141 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab49a298f15c60e8b8289f5027a0cf9495840fcf7f7e1ff55617952c7e74fcc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GenericModel.decode: MethodTooLong \u2014 decode 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":"source/litertlm-proto.js"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"765efe843b537d7164aedf82942f2acdf3a14084e7b03b4aaafac3d5eb3e1250"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./package.js: FileTooLong \u2014 628 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 128 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e1b18a514c55712062b5023146aad93c162b4c41262541343c623f09855316"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: V0LayerParameter.decode: MethodTooLong \u2014 decode runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\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":"source/caffe-proto.js"},"region":{"startLine":4878}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f7f9f25e5639cc5c475b6080e61aae4834dd8045a0c6357c8cf95a7283c213"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: V0LayerParameter.decodeText: MethodTooLong \u2014 decodeText runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\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":"source/caffe-proto.js"},"region":{"startLine":5006}}}],"partialFingerprints":{"codehealthFindingId/v1":"12711d8a065663c722a511493b5938ad7f8f833a34cbbfea18ec19ba032c95b3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Graph.constructor: MethodTooLong \u2014 constructor runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\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":"source/mxnet.js"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"767cf95985af0a1f60336b70f14f65f44986b47213b10b913ce179f61078e782"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TestDialect: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\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":"source/mlir.js"},"region":{"startLine":25901}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc386537d523182c419de5fc5d1db686413f82e21013eaf810d16f7b4239f66"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Graph.constructor: MethodTooLong \u2014 constructor 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":"source/rknn.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7284706bf9d08ac44978bc91b92ac8c0e9e72959fbf72cdb79f8a4b076e2d4b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: v6.constructor: MethodTooLong \u2014 constructor 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":"source/kmodel.js"},"region":{"startLine":2061}}}],"partialFingerprints":{"codehealthFindingId/v1":"8272abd3f6e4b4d798717fae4c9a8990ede8ff4a222420e6a50162f792e2c454"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/om.js: FileTooLong \u2014 605 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 105 over it, 1.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":"source/om.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f558fa50350027078ff61a3428ac865aa4db8b12ff1b7745b3c853c26b6a4654"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RewriterConfig.decode: MethodTooLong \u2014 decode 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":"source/tf-proto.js"},"region":{"startLine":11970}}}],"partialFingerprints":{"codehealthFindingId/v1":"81491e3be71f22b95e8d2866491c6bc4a1cae7d5f22935360e95d39305ae61d7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RewriterConfig.decodeText: MethodTooLong \u2014 decodeText 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":"source/tf-proto.js"},"region":{"startLine":12095}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca672943c5ba17c99868f20e1778ddf5f3997cab488fc48fe38ea61b07d0566"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reader.read: MethodTooLong \u2014 read runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/espresso.js"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7ce34d13e105dfe9abe639db48479b605a26482c61bf06112450bf6540821a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProtoReader.read: MethodTooLong \u2014 read runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx.js"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b9555cbd31fe9b8cf4f37d39dccf681f247224f70d8609c2e5d81064187235"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Node.constructor: MethodTooLong \u2014 constructor runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\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":"source/mxnet.js"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df6d9d6cb0f19ad90d4ba220918f3e2dcbcccc760d3439f0f069859d0504083"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Container.read: MethodTooLong \u2014 read runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\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":"source/om.js"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b1c330e66054ef55cbe8293e2886f829d3a5c74542bdfeb2b23661b5d56abf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Node.constructor: MethodTooLong \u2014 constructor 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":"source/paddle.js"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c515c02ce388fea3bbceec7c7df232402e60e5ac378c55115ebbcb5624b7f4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: View: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\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":"source/view.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"644731e8c14bbc10e61e3e331bd7d3a31383c8b0b034c3ff83ead39320a0d155"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/mxnet.js: FileTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 75 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mxnet.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdc9f1a3bfe38f697fdeb75fa329590eddb4050a944e89064ac8063fdebdd5f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BinaryReader._readBson: MethodTooLong \u2014 _readBson runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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":"source/json.js"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d2ec15f71eb0d277b2d3409d5d8307d9e465e51c873bcbfe0744e1829cd7da"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TextReader: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\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":"source/onnx.js"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"3794e57115997e4fdd94e8b513988b0dc3e2b6247db967fca4e99043d338fdfb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Execution.constructor: MethodTooLong \u2014 constructor 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":"source/pytorch.js"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c4695d0b0d1965e356585d69ee6e68d6605e5a66d5d13c6ec8b9da331d9964"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/torch.js: FileTooLong \u2014 541 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 41 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":"source/torch.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"190a2b89e74d4f7bbec76137193a2191477bb8a85f3e35bbe39793470ea21c61"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Node.constructor: MethodTooLong \u2014 constructor runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.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":"source/cntk.js"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac43ca38ef3e20764778e2ec1558d7b93ef2fababe16fe3e510d92ad9edeeb7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OpParameter.decode: MethodTooLong \u2014 decode runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.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":"source/mnn-schema.js"},"region":{"startLine":3001}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbca347150a74ade2df0f7f149bd2b752ec56fee24a4008dc72656c9a97aeeb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OpParameter.decodeText: MethodTooLong \u2014 decodeText runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.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":"source/mnn-schema.js"},"region":{"startLine":3111}}}],"partialFingerprints":{"codehealthFindingId/v1":"34588f813b6f30ad097a07d6506ab61ac60efc2f606be6b6fed4bd33a086ee5e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BinaryReader: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\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":"source/flatbuffers.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6251bc75202e0ba9653f1a0bfbe26b0a2481beb1c8769a2267b90f0643a5fc62"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Solver.decode: MethodTooLong \u2014 decode 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":"source/nnabla-proto.js"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec031c199403054c6cb88525ce52be850bba506003b91fe89e54085ebe02713d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Solver.decodeText: MethodTooLong \u2014 decodeText 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":"source/nnabla-proto.js"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"e020e623570b9d9d21ef13c729e64123805430275a434e47728b1a6f7bce612d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Experimental.decode: MethodTooLong \u2014 decode 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":"source/tf-proto.js"},"region":{"startLine":8871}}}],"partialFingerprints":{"codehealthFindingId/v1":"7781a68cbaa39906d21123cbe924f62432bea07fe11f53b741c6687b8f63cc76"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Experimental.decodeText: MethodTooLong \u2014 decodeText 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":"source/tf-proto.js"},"region":{"startLine":8981}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c073ebe0150791e6e21d67bd47fe213a8c8d71674230672a912882e6274a70"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Node.constructor: MethodTooLong \u2014 constructor 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":"source/caffe.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"553a761ec1c0c0213b750d0b6114064b53e4599b5eb1b32978dd7dcd62f461db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/bigdl-proto.js: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 22 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":"source/bigdl-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28446199bdd40914dabe6dc742586174e9e42d287c6afbb462687fb90eafb63b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tensor._context: MethodTooLong \u2014 _context runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\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":"source/base.js"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63e1ce145f2e11f79ce811f06f02269835750511a626e4bc75bd53d28025a69"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Graph.constructor: MethodTooLong \u2014 constructor runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\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":"source/executorch.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5c296e3d1f8a12448af750de8e64da256290daabdb9c991b37ced17eccd6fe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SerializedModel.constructor: MethodTooLong \u2014 constructor runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\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":"source/pytorch.js"},"region":{"startLine":2286}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf77f4fa023e55a59e5e1cc3da4ddfb54f160bcc1fb522409b4e08421abc552c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/sentencepiece-proto.js: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded), about 60% of them inside a single declaration: sentencepiece (2-322). The bar is 500 significant lines; this is 19 over it, 1.04\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":"source/sentencepiece-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54c805736961de7489ad957cdf41095dd0ea74b179da79f0972e741c9daabf9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Graph: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\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":"source/view.js"},"region":{"startLine":1840}}}],"partialFingerprints":{"codehealthFindingId/v1":"8302855a4ffef2f8e87d24e6ac70a3b0523ce63eaaef307a15b20d38bfc5b413"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Node.constructor: MethodTooLong \u2014 constructor 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":"source/megengine.js"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"2758d0eae9d7e85b6dd83013d6fff3b29bebe1fea810423dbab0125f94b3ad9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/tengine.js: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5 over it, 1.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":"source/tengine.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ae79088636bbbe0b6d219434bfd935862562dd94c61adcb870887b0c961a6b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModelFactory.open: MethodTooLong \u2014 open runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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":"source/caffe2.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfd0b7b5ad2785e332a97ee3671c6443a4f85cdf8d4636e7e7ccbc7c4e3f8cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): tools/onnx_script.py:141-171 | tools/onnx_script.py:257-287 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/onnx_script.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"a949e9c02282459f44a6c417321c1b2d6a290acbbc49e5ed84127e2ccb46bfee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): tools/onnx_script.py:71-86 | tools/onnx_script.py:196-213 \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":"tools/onnx_script.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a05e2404a23f8f4f2a4fee78ee96db3beee5317ea335a098a1a30ba0f8ddcf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tools/onnx_script.py:48-53 | tools/onnx_script.py:177-181 \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":"tools/onnx_script.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"525f9760460c78e36f55e22fe742b33978ca69640e5157b59b3fcfc135729f34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): tools/onnx_script.py:148-168 | tools/onnx_script.py:266-286 \u2014 both copies are in the same file, so extract the block 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":"tools/onnx_script.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"870b811ab2404250863c09aa03a4239c3d852158f30bf3b6f08de0e856984d4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): tools/onnx_script.py:216-229 | tools/onnx_script.py:232-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/onnx_script.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ea868d036fd2a1e6465a428f9db738d9c7569155b8aaf4b5f5515f398e6d04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): tools/onnx_script.py:89-101 | tools/onnx_script.py:104-116 \u2014 both copies are in the same file, so extract the block 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":"tools/onnx_script.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6a428ea7e3c649c3c0dd8721afef33e0a0159ec943a7e9894e3c9b4cf8b815"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Dialect (LCOM4 20): Dialect\u0027s methods fall into 20 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 20 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":8988}}}],"partialFingerprints":{"codehealthFindingId/v1":"541050146bf2c7a0d49a89cce44b437a30e5a94301eaaa60a383cfb9ac35ae37"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Reader (LCOM4 8): Reader\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/hdf5.js"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d75bd9e2c11b748a1d8d8f72afcac775da0694248d676bf59c76eecf8349cdc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Document (LCOM4 4): Document\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/mock.js"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab9002ecbab99aa19f8858e760535a149e48fe6610519378e40a3484f550e5a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Host (LCOM4 4): Host\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/mock.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a829f34f3af79df5008cffcc3e55288cb972a833f6b8074b7e95d97c1eca5b0"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: boolean: boolean 3.2.0 is resolved in package-lock.json and is marked deprecated by its publisher: \u0022Package no longer supported. Contact Support at https://www.npmjs.com/support for more info.\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package-lock.json"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"60506cf61a5955b000bad3921f6013f6bf94d17cc6a4999fdc8f0767e5cfeeba"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: glob: glob 7.2.3 is resolved in package-lock.json and is marked deprecated by its publisher: \u0022Old versions of glob are not supported, and contain widely publicized security vulnerabilities, which have been fixed in the current version. Please update. Support for old versions may be purchased (at exorbitant rates) by contacting [e-mail redacted]\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package-lock.json"},"region":{"startLine":2520}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6a21a0f511e79bf1641d8781e0ca2d1a227ed4ef5f1fd822135ca3108ada0d"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: inflight: inflight 1.0.6 is resolved in package-lock.json and is marked deprecated by its publisher: \u0022This module is not supported, and leaks memory. Do not use it. Check out lru-cache if you want a good and tested way to coalesce async requests by a key value, which is much more comprehensive and powerful.\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package-lock.json"},"region":{"startLine":2836}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f44f2d08ee8839d5172f941ab3bc1c660bb2257c3c3bd3354971f7072e14eb"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: lodash.isequal: lodash.isequal 4.5.0 is resolved in package-lock.json and is marked deprecated by its publisher: \u0022This package is deprecated. Use require(\u0027node:util\u0027).isDeepStrictEqual instead.\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package-lock.json"},"region":{"startLine":3071}}}],"partialFingerprints":{"codehealthFindingId/v1":"d267f11ad0d5ac531c90bc1afbe83e99b9ea44a98c2599a200ce02dbe6d2e45c"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: rimraf: rimraf 2.6.3 is resolved in package-lock.json and is marked deprecated by its publisher: \u0022Rimraf versions prior to v4 are no longer supported\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package-lock.json"},"region":{"startLine":3842}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f19ad8cb4391b735e04142442af28e60cbd91c2bb1f98ea175f4eb33e27294f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: source/mlir.js: source/mlir.js changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 356 in Dialect.parseDirective at line 9649. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 09:40:35 -08:00\u0027 --until=\u00272026-11-12 09:40:35 -08:00\u0027 --full-history --no-merges -- source/mlir.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":9649}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4e913c7b835999bb2ad63f2fbe33e5a6abe1efd1fcf5b697cd131f173db6d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/mlir-script.js: tools/mlir-script.js changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 302 in mlir-script.schema at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 09:40:35 -08:00\u0027 --until=\u00272026-11-12 09:40:35 -08:00\u0027 --full-history --no-merges -- tools/mlir-script.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/mlir-script.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2704a089ec49f680f44bfb0605af1d335d4a39dc3f31224081f2df416c78f06e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: source/gguf.js: source/gguf.js changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 164 in Graph.constructor at line 95. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 09:40:35 -08:00\u0027 --until=\u00272026-11-12 09:40:35 -08:00\u0027 --full-history --no-merges -- source/gguf.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/gguf.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eead1e8916c8761cfeb3011e2cfd6c367dde1ec452c796133183506140ed3de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: source/base.js: source/base.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in Tensor._decodeData at line 1006. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 09:40:35 -08:00\u0027 --until=\u00272026-11-12 09:40:35 -08:00\u0027 --full-history --no-merges -- source/base.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/base.js"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2e726033b1dd83e1d96cfd2685aa22644c63eec60f28443b542fe1882ea6e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: package.js: package.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in package.update at line 562. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 09:40:35 -08:00\u0027 --until=\u00272026-11-12 09:40:35 -08:00\u0027 --full-history --no-merges -- package.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.js"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1478759a9f3ebd696ebc59f3f8b1ce3c477c42093005f0c73a1a472d616e4b"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060package.json\u0060 makes this repository a deployable product (line 17)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f571cc2c2542badcf90ae46e31e24c43d9ca80090c40fca9fd1434a5c34546"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060GenOP\u0060 spells \u0060OP\u0060 where 134 names in the project spell it \u0060Op\u0060: 134 of 135 names in project netron spell the token \u0060Op\u0060 (134 of 135; unit: names in project netron containing \u0060Op\u0060). Peers: source.mindir-proto.PreprocessOpProto (source/mindir-proto.js:669); source.mlir.AffineBinaryOpExpr (source/mlir.js:1409); AffineParser.parseAffineLowPrecOpExpr (source/mlir.js:4671); AffineParser.parseAffineLowPrecOpExpr(llhsOp) (source/mlir.js:4671); AffineParser.parseAffineHighPrecOpExpr (source/mlir.js:4703). Rename to \u0060GenOp\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mslite-schema.js"},"region":{"startLine":3830}}}],"partialFingerprints":{"codehealthFindingId/v1":"439f4b7ec4a74f47b4b981654e9dbf59ae456446a19d15173c6cec3a8470d3f9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Adds a dummy node to the graph and return v.\u0022 repeats the code it sits on: 4 of its 5 words (adds, dummy, node, return) are already in \u0060const addDummyNode = (g, type, label, name) =\u003E\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":"source/dagre.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b1b9193d5ac18fe6b84dc075d6cd8e6318e0c673123ea348d3178641ac36ef"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 19 comments in this file only repeat the code they sit on (lines 9417, 10245, 10601, 10739, 11004, 11211, 11228, 11235, 11466, 12678, 19564, 19565, 19566, 19567, 19568, 19569, 26343, 28973, 28993), for example \u0022SameOperandsAndResultType: result type = first operand type\u0022. 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":"source/mlir.js"},"region":{"startLine":9417}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcd604411625120d6207046b2505825cd9f03e308685367bde90b3db3d586fc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022RankSelectionMethod\u0022 repeats the code it sits on: 3 of its 3 words (rank, selection, method) are already in \u0060this._rankSelectionMethod = reader.byte();\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":"source/mlnet.js"},"region":{"startLine":2186}}}],"partialFingerprints":{"codehealthFindingId/v1":"4febe85163762aa54546b0ac794637113e86387e901941ee227d5658dbdec221"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set up file chooser promise before clicking\u0022 repeats the code it sits on: 4 of its 5 words (set, file, chooser, promise) are already in \u0060const fileChooserPromise = page.waitForEvent(\u0027filechooser\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":"test/browser.spec.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb55804939a1942fee4a9033d79f453a93c4222ec9cb289d0ed03d221bcfcb86"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Recursively get cases from the underlying enum\u0022 repeats the code it sits on: 4 of its 5 words (get, cases, underlying, enum) are already in \u0060return underlyingEnum.getEnumCases();\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":"tools/tablegen.js"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13f0829cd07e6ab8ab564bdb03000a53926639e9442b8c92684c438641b574a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Build the full name from prefix \u002B template name\u0022 repeats the code it sits on: 4 of its 5 words (full, name, prefix, template) are already in \u0060const fullNameTemplate = [...namePrefix, ...template.nameTemplate];\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":"tools/tablegen.js"},"region":{"startLine":2075}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fed11158ece4d10dfaca0acf54a1d14f3d11ae6bbdab30744d767b44ae2aa6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create the def record\u0022 repeats the code it sits on: 3 of its 3 words (create, def, record) are already in \u0060const def = new tablegen.Record(name, this);\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":"tools/tablegen.js"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f6e490f06cf2d082b1c7e0c331bfd8f1ab2f2f48cf5cca801bb0e5e0d66d4d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Resolve the argument value with template bindings\u0022 repeats the code it sits on: 4 of its 5 words (resolve, value, template, bindings) are already in \u0060const resolved = this._resolveTemplateValue(argValue, bindings);\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":"tools/tablegen.js"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b204f226230ec6e5dcf7bcd3f17ec7a7cc2d7c870d52b56a5aafb73f2e1a67d"}},{"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":"1a4cba461b2514b3e62ec5de57bb69080886fd613c18d48f725946482ed72dbb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74e4d9d0be6b8e3d81f682a38fbea383bbb915e487a9f94dfff6f7f8d18c5700"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"090fb9073f5fdb2293b171ef4b915ee479b569f28c51d74d7b541818cea372a9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63971014418d75eef7a8e55f7f272933c4622a893210d5a7fcc7a42b6eb9ba96"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ddc57d702ac4994fbe0a61c1885243650d454b0af6575ec54d1e6519738ed1ee"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90adf1fc3f2aa36686aa66d67145018e8aac8b90e91250020e9cbca39269b01d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2007dbb99851510960031b7ae4658a412dd9ed0e9880dc77c01e29924d69a442"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4fbc6df3d72864219648f8a5e2a3fe4857d204776cc76785ab693bf45ade35c2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f225e09bc3ecda96d2ace0defd7cf7cce3fa7522422d58ba7fc7d758ae70c8f3"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"d75904c8723a31ba01c02a467ad73fa22eed54ca13ff19ae4442cb79f4d82afd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da437c77adf6e6da18ed294f45b71c3b1e1a4a214c7171345bf37016c0b450cd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4478b2f8039b8a4e1817cbc51bb0252344bc87de04c8fc587a992bdd1909dc39"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"c3e4b8dd6d785446cd278e78880d52ccf6bf99cfdc6cc181e691f9a990540cea"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"8af93b54d7b6d09176d9c9016e65470b9e3497c2e30cd6af0b8b0a89230292a4"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"79d51da5068e0db80e007c425ed2d5e30426d3d532564e1a11c7165e2e0580ba"},"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":"6dad93e50d2ada4a3dc732a85f90e62190d3ae2d4e82675c2315ec783ef75088"},"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":"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":"735fe0b3e06367424b6faa27f4b329e443bdfeebb2a0f67e5ff72409451f8d93"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","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-3","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":"0f3f3743cdbf49e7a97198dad4c6e63083371a4a8fdd0e8fa52b010142292ac4"},"taxa":[{"id":"CWE-125","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":"3aaf3bb406dbf1edc6e4a854502ba0a792cd4c612e801ca0a0ed7a57859260aa"},"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":"0e4319a9895a737c474e91bb3d46cd28da509774946e96809ef3dc031f61b432"},"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":"381b42cf2404b8a2f6809b6e96c04f569cba791a009d0b8c9e6979c21054c5ce"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"5663b5d3983a9f6f7744b9af8d10ede9d273d65b8a859266b06bf516fc0e4e27"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5a31a0b5364830f542d37385755d27dd90f97746286a80cb6c17836bc6e14179"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6532f69593dd3d2ea46577ad478f1657ba969b6919f855a6261cf5feb9c06e85"},"properties":{"dependency":{"package":"undici","version":"7.25.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[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]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"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":"3a869334227afbbb495661cd12cb9e8ac044bc853b5d941ba54f9b0cdd39fb02"},"properties":{"dependency":{"package":"minimatch","version":"9.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"04f4867dd1597acb7dfbce730192aeb25669fe57c04b701e7776c1295fbe164e"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: uff-proto.js \u2192 caffe-proto.js, caffe2-proto.js, onnx-proto.js, paddle-proto.js, protoc.js: \u0060source/uff-proto.js\u0060 changes together with 5 other files \u2014 \u0060source/caffe-proto.js\u0060, \u0060source/caffe2-proto.js\u0060, \u0060source/onnx-proto.js\u0060, \u0060source/paddle-proto.js\u0060, \u0060tools/protoc.js\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 5 separate couplings, not 5 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 5."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/uff-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d644b87857aa8580a09323610c91dc201a5059faa77deff5f7828a6bdbb781d9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: pytorch.py \u2194 pytorch_script.py: \u0060source/pytorch.py\u0060 and \u0060tools/pytorch_script.py\u0060 change together 50% of the time (14 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u00605f466cc7\u0060 Update lint rules; \u006094c2a0e0\u0060 Add Ruff; \u0060e97c8a10\u0060 Update backend test (#990) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf5baf03aa9f3b900f80a6dc844d21bfac211d3858473ef02109b98db3b873f"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cfcd82fdb168b13bb41affabdcb2cb35cf5ac7f10a66641c54fea8dc5b92503c"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3d9450c1e9a738f2d810b3eef41d9babb54722911a7ca830a4cd182d6263d27e"},"taxa":[{"id":"CICD-SEC-4","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":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"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":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"publish/icon.html"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"085bcf546188a6c59372d62f5e9169fdccef33b7841a547e9b81bdeff78dc205"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"publish/icon.html"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"401fbb065b24a7e004c3da2f6aac92a04191ebc02af54d3af84f95785eee6f6c"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"publish/icon.html"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b64eb60e00e2c17ebd1500ca8d1a2b379020f214df7be7b3783bbb982ddc511"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"publish/icon.html"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6f2553408ad3cb55687ad9399bf104d222842c39d56c8dbafe52ed38c1cb04"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"publish/icon.html"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe1a4431d5339f5b419f7185e07e29d7dd71475527d8476d24768f554fb7e0a"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"publish/icon.html"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d298241385baf1dec99bc7d480afddabd62a21487177515c7b49d3a458df3223"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44bfd7af0fa9feab8ca2bb3d5736ea1c96b25d422c6578b2c54fb99873d05dc"}},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"2598979f4e099322bf5b10cd0c444dbf3ac9b71158609f81ab1827bf15cbb696"}},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac873501ab04a5a0aa5b0e5db20bc431b4476f1042e8dc665b067f46d6ca10b"}},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4664c5f77b940cc5918041d86c4069b6bb76f209c5d6edc0812aa50e4b648f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e81e5de05d816ea98879556e3e6542613a177a03f79553c046bef99a6743a9"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"publish/icon.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a454c3228682173da0bc3cc43b000e30d338c588749f91892b6e9768ac99e1ad"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"publish/icon.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1faf8fc7c15144271359f99080f65ce79aa8c0d0d88cb7f4590322d65e5dfd3"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"publish/icon.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e07059ff06fec8962c5650bbb7dfa1366a31ec9fc22655473484a090595f50"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be6695d6875ebe361bc21e07f7496c90a37577f95d553a888b15b4ef21e1bcf"}},{"ruleId":"AC3","level":"error","message":{"text":"Viewport restricts zoom: user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a9d8ed471e5288704a3c707dca39157e53d808b9bb4987a4eb2ee7009d3932"}},{"ruleId":"AC3","level":"warning","message":{"text":"Empty \u003Ch1\u003E heading: An empty heading appears in the document outline announced with no text. Give the heading text, or remove it if it\u0027s decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b2c109da5c11a33b2f80207f4aa38c991984e5fec53684d60834b66bd90732"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.welcome.spinner .logo-spinner\u0060 moves (\u0060animation: orbit 0.5s infinite linear\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"165d91803007b30f15e168971198e819a52cad0c087828d7f1d6e6c125421eec"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.target\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e8b28a52644e5561e3227760a470f7a8a419bda755b27ee19f73709d721f84"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.toolbar button:focus\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b3ed6334840f2395e8c93d2c0887a9a16af987cd3840663f449af5ba115807"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.toolbar-select select:focus\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"93448b9c19f7cb2002c1962da8de0555da8e0143f5dc03b2f7bfa0fd0a18faa9"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.logo-button:focus\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"622fb17b09c143edf3050aa9976fccc489d242582db1fef66acccc7d3511542e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.sidebar-item-name input\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2c57eafde350589382a5a65b506935a1ce981fdceafd9c3bd8ae9f505e5b9d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.sidebar-item-selector\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"37051d4093ef7d81b81c4fef4f491cd042125a66869e84eeb854dd9e6c7ec8c2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.sidebar-find-query\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"44920197c68c9ea9aa78efa2d3292a91ee89831f22055f96a0e13ed527defd29"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.sidebar-find-content\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"500cc4dba932211d818e26d0e027a3d19d4a92c5ae342a16bb9a516665fec0a6"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.4:1): \u0060.toolbar-select select\u0060 sets color: #fff on background-color: #777 \u2014 4.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe560e3eb6965dcc619bff9920f51c3fd3c80498b1a62bdeea5e628005783da5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.4:1): \u0060.toolbar-path-back-button\u0060 sets color: #ffffff on background-color: #777 \u2014 4.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3762350783981fe1d85e30efa2840f3792a2b69e28a7b3b7d9e257e594b47bd7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.4:1): \u0060.toolbar-path-name-button\u0060 sets color: #ffffff on background-color: #777 \u2014 4.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d50008be91d0656a32f344fb56004a82478a76ccd045a6eb963996941fc5b12"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.4:1): \u0060.toolbar-path-name-button\u0060 sets color: #404040 on background-color: #aaaaaa \u2014 4.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f947f3a6aea5f9396038b23a76f5401924f90de559fb9c2bb095878974126bc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.4:1): \u0060.toolbar-select select\u0060 sets color: #404040 on background-color: #aaaaaa \u2014 4.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.html"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"911cee8cbdfd7cb59f05f8ce3bca8a33274ba6dc3668c96f9754dbd63cde4982"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 throws a \u0022not implemented\u0022 error: A shipped function\u0027s whole body still throws a \u0022not implemented\u0022 error \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":13316}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7460b8822d3a7a295cb67cdeff7bc5bb3b469c1185a5eb40168652cbd2dfa32"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060export\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/browser.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7709ce2a68be9af1ca59253ad6f081bee9a50cc23edcaa54501ea33d2a2873"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060execute\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/browser.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"471f63a0678833d421a169008f1804b9129989ce7a2449eb1d6bb9117ef79672"}},{"ruleId":"IC1","level":"warning","message":{"text":"Both branches are identical \u2014 the condition decides nothing: The \u0060if\u0060 and its \u0060else\u0060 contain the same statements, so no input can make the condition matter. Implement the distinction that was intended, or drop the branch and keep the body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/flax.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad697f342b73c9d16e27f0b0a30cbdbf37f238ebb812c6b96f9e22be97cc3582"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060match\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/imgdnn.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fd2513553d5fa5dcc98a8d7b6a101bc9428d2a57abe28066dfcea57cce9d2d"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return attr;\u0060 also returns \u0060attr\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":3223}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e2568ef3ae4744d6a464f09eb631cec863c8797bfae383e400969a38296b5f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060open\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/nnef.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd378cf41d2209e00b6dd28a729d753533a0ebbe206cfc21e4f2e5c9e896229"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060read\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx.js"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"db600524194977cf960054f023c906c4b6eaa3831bab3971411a5b9644a02f19"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060read\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/safetensors.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec911956c8a5a21e992c3dee86d435c257e94b5db99cd902469610843a63fff4"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060read\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tensorrt.js"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdae731d6379216ee3fe79f5154e393741e8586f9d8ccce031922aa406367fd6"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 throws a \u0022not implemented\u0022 exception: \u0060decodeJson\u0060 throws an exception whose message says it isn\u0027t finished \u2014 a not-implemented stub wearing an ordinary exception. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":13316}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d02c436211950e8a748712b48480053d35944ba9a254ecdbba6c84136e28f8"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return value;\u0060 also returns \u0060value\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":5580}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5626d64af8ceb3f2907e8450036fe9957ba78fdc6258aa01869f4022ad235b"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060_openSignature\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":7855}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8d022e2118a251d781171401b7de0c0f8330a1b88069100c36364b72e088d7"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060open\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/weka.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"214d0bb6dd697a274b33352ce171511b04cca3e6e483abc05397300569e483b8"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060layout\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/grapher.js"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"51edd7bee3c24a824d43b1c978ea8585d603e06a7650c405634f1d34832f677e"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060emitWarning\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":4397}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae50f1c6ea1e8e93984cdcd711cb60eb4e9231d0593fb37b2efa3c526126851"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060layout\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":3075}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c810e59c9777972227a07c57b83632cb0940c140ac909fc3522e0c462ba2c0e"}},{"ruleId":"IC1","level":"note","message":{"text":"Blanket warning suppression: A bare \u0060eslint-disable\u0060 or \u0060@ts-nocheck\u0060 with no rule list switches every lint rule or the whole type checker off for the rest of the file \u2014 hidden debt. Disable the specific rule on the specific line, with a justification, instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/xml.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49c50037eec462fbbd1e4808c64822446d2c041b40652d691140e7fba8f4b62"}},{"ruleId":"IC1","level":"note","message":{"text":"Blanket warning suppression: A bare \u0060eslint-disable\u0060 or \u0060@ts-nocheck\u0060 with no rule list switches every lint rule or the whole type checker off for the rest of the file \u2014 hidden debt. Disable the specific rule on the specific line, with a justification, instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/xml.js"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f510f1b1f914f4f77302e038aacb5ce0a0963ef6450e0ee2e6503ff74e0d43d"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060package.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":"package.json"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060layout\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":"source/grapher.js"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cea5de705b89298e7ea6dae4beda1dc2ce19411a405628b3ad6d0f9716f6bec"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 144 plain JS \u2014 the untyped files are package.js, source/acuity.js, source/app.js, source/armnn-schema.js, source/armnn.js, source/barracuda.js (\u002B138 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (328 identical lines \u00D7 2 files): source/circle.js:2 \u00B7 source/tflite.js:2 \u2014 these 2 files are line-for-line copies of one another \u2014 328 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/circle.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a9d9f5f4b317b7b23e001ad6ff9ea41940e7d8656bbba227efde9831179c8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (137 matched lines \u00D7 2 locations): source/coreml.js:231 \u00B7 source/espresso.js:83 \u2014 the two spans are one implementation copied and then locally edited \u2014 1176 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":"source/coreml.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f100a031f05253e608357db3478c0dc6c608adf7c4e3a431952d08f54db25646"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (130 matched lines \u00D7 2 locations): source/mindir.js:51 \u00B7 source/mslite.js:60 \u2014 the two spans are one implementation copied and then locally edited \u2014 792 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":"source/mindir.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa52e437a9116e879c7ae32f9dccc73f84a3957bdff910e8d87f81246a6548c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (120 matched lines \u00D7 2 locations): source/uff-proto.js:64 \u00B7 source/uff-proto.js:266 \u2014 the two spans are one implementation copied and then locally edited \u2014 599 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":"source/uff-proto.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc849cc0b66f6439a0cc67f0302778313cde9576e731185693945745a3fad275"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (78 matched lines \u00D7 2 locations): source/caffe.js:88 \u00B7 source/caffe2.js:167 \u2014 the two spans are one implementation copied and then locally edited \u2014 525 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":"source/caffe.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15ca17ac31e9fc9594228b345354b3000c51d520217021c746d7924c31577e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (76 matched lines \u00D7 2 locations): source/caffe2-proto.js:942 \u00B7 source/mindir-proto.js:409 \u2014 the two spans are one implementation copied and then locally edited \u2014 423 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":"source/caffe2-proto.js"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"92be0383d1a62bd0662f38dcf5baf91d3c7fa706ab7eef8e6c2a5913f19ad341"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (60 matched lines \u00D7 2 locations): source/uff-proto.js:10 \u00B7 source/xmodel-proto.js:9 \u2014 the two spans are one implementation copied and then locally edited \u2014 325 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":"source/uff-proto.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b85686859e787a81a1cbe27a5b6b3c95072b1f73fdc14f14b93676a63375a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (59 matched lines \u00D7 2 locations): source/catboost.js:5 \u00B7 source/jax.js:5 \u2014 the two spans are one implementation copied and then locally edited \u2014 318 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":"source/catboost.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9052b4fa6b9940ce684a01624763e4f3bd3775da6068e15184f2d07cc7b93524"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (58 matched lines \u00D7 2 locations): source/lightgbm.js:44 \u00B7 source/xgboost.js:60 \u2014 the two spans are one implementation copied and then locally edited \u2014 401 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":"source/lightgbm.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b3d6703df2e8bbadb8781418e081fbd37ac79ccbb8e1ed83cfa414dc95716a"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (58 identical lines \u00D7 2 files): tools/circle-script.js:2 \u00B7 tools/tflite-script.js:2 \u2014 these 2 files are line-for-line copies of one another \u2014 58 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/circle-script.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b63dfc6f2a236e52d5da7cfc6b5c0bba7484dc84eff79ce282b4d2622c20f9a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (56 matched lines \u00D7 2 locations): source/python.js:264 \u00B7 source/python.js:404 \u2014 the two spans are one implementation copied and then locally edited \u2014 293 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":"source/python.js"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c8a83a306df479b7801ee7986afcbfcf7eec971597abe8f235a7e78a42e729"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (55 matched lines \u00D7 2 locations): source/dlc.js:149 \u00B7 source/kann.js:62 \u2014 the two spans are one implementation copied and then locally edited \u2014 388 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":"source/dlc.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd50def7f53004e5edc9a56b283a39c0acc32cc589ffcdbbbe861260207979d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2 locations): source/mlir.js:17838 \u00B7 source/mlir.js:18775 \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":"source/mlir.js"},"region":{"startLine":17838}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee61e7463d431f4670a9393ece9927286ec637a5c7f59874392e7764898f324c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (49 matched lines \u00D7 2 locations): source/mlnet.js:1608 \u00B7 source/mlnet.js:2190 \u2014 the two spans are one implementation copied and then locally edited \u2014 328 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":"source/mlnet.js"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e6116a006c3ffda14e36c5db5283bb4cfc35fd2795cecaee6247ff0cf7e55b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (46 matched lines \u00D7 2 locations): source/mxnet.js:493 \u00B7 source/openvino.js:563 \u2014 the two spans are one implementation copied and then locally edited \u2014 304 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":"source/mxnet.js"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"935c25b0bf9ec64fd5399d4925b1b117635b39ab13b6cc00460b4174ec455cdf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (46 matched lines \u00D7 2 locations): source/tf-proto.js:1086 \u00B7 source/uff-proto.js:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 225 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":"source/tf-proto.js"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bddb6cd75e46c6dee406d2bcb88fa22a6c361181777c789e024fdd36e610e7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (45 matched lines \u00D7 2 locations): source/coreml-proto.js:11754 \u00B7 source/om-proto.js:985 \u2014 the two spans are one implementation copied and then locally edited \u2014 272 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":"source/coreml-proto.js"},"region":{"startLine":11754}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf4275e34a64659b8c8d2e6e87a659000d128ab3e95738eb0151331e55bef4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2 locations): source/executorch.js:499 \u00B7 source/executorch.js:745 \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":"source/executorch.js"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"beca13d1913364e95b41927663c6a56390b3d019515991f486079f64d04d11bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (44 matched lines \u00D7 2 locations): source/tar.js:89 \u00B7 source/zip.js:711 \u2014 the two spans are one implementation copied and then locally edited \u2014 290 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":"source/tar.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6332366ac962a1c9d6118e505625f5b2d7d14a5832dd0ddca87e50512be91f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2 locations): source/python.js:4794 \u00B7 source/python.js:4837 \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":"source/python.js"},"region":{"startLine":4794}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77e69798f1e865c8ecd491b06b8f286447393f259d0a508fdf3ed914d7850b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (41 matched lines \u00D7 2 locations): source/coreml-proto.js:10408 \u00B7 source/mindir-proto.js:900 \u2014 the two spans are one implementation copied and then locally edited \u2014 275 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":"source/coreml-proto.js"},"region":{"startLine":10408}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac97d4291c81fc32c6d9c5a1dfd6b88c5ef2ed2a0d8afad6db8ff9acee167c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2 locations): source/mlir.js:9932 \u00B7 source/mlir.js:9977 \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":"source/mlir.js"},"region":{"startLine":9932}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8fe18eba9060bc030f56b4bf4cd2723e5c745804586d915d9eebaa58017cfc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): source/espdl.js:286 \u00B7 source/onnx.js:1339 \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":"source/espdl.js"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5cb472bae2560588f9a29f146e1b33be83d32f878983a3dc6d54854b3e00d3a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): source/mlir.js:13052 \u00B7 source/mlir.js:13107 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":13052}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed575c2dc885de5d353546d65bab7e6e2f5f14d6fe252629313e8c7c92b778d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (37 matched lines \u00D7 2 locations): source/caffe2.js:254 \u00B7 source/paddle.js:322 \u2014 the two spans are one implementation copied and then locally edited \u2014 296 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":"source/caffe2.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b132896e01dfde76e4b4bc926f9787552d94bdb94cf4f61d49e7a4a25e3ea672"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (37 matched lines \u00D7 2 locations): source/mlir.js:20227 \u00B7 source/mlir.js:20330 \u2014 the two spans are one implementation copied and then locally edited \u2014 207 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":"source/mlir.js"},"region":{"startLine":20227}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb30031f273b619caef4ae8bfdd80a44b273df14d971a76250515232e1f014c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (37 matched lines \u00D7 2 locations): source/tengine.js:103 \u00B7 source/tnn.js:174 \u2014 the two spans are one implementation copied and then locally edited \u2014 392 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":"source/tengine.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfbdae2707e31d538a2b2130e0f86f27c71f3475fb8f6b96535faee56dc248a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (37 matched lines \u00D7 2 locations): tools/circle-script.js:48 \u00B7 tools/mslite-script.js:34 \u2014 the two spans are one implementation copied and then locally edited \u2014 319 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":"tools/circle-script.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7b853e61a2580dcf65f7bcefbac21a71fcf598c96fd91750a06193b10e77a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (37 matched lines \u00D7 2 locations): tools/mslite-script.js:34 \u00B7 tools/tflite-script.js:48 \u2014 the two spans are one implementation copied and then locally edited \u2014 319 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":"tools/mslite-script.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab2f0166a222c7558cb6556f9cfb317d046454c2c4557203ccbaa60ac6e2fb1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (34 matched lines \u00D7 2 locations): source/zip.js:595 \u00B7 source/zip.js:872 \u2014 the two spans are one implementation copied and then locally edited \u2014 188 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":"source/zip.js"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82a1e9fd61cdc679df49610da3568885312ce048ca09c7bde354b273db0725b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2 locations): source/mlir.js:16355 \u00B7 source/mlir.js:16419 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":16355}}}],"partialFingerprints":{"codehealthFindingId/v1":"e318fb51ae2948bb3e3399e119d60c92984ffac66a4172478127c9d4b09f1017"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): source/armnn.js:24 \u00B7 source/mnn.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":"source/armnn.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b7cc9d0bc57b6c3c2699393ef86c57c877ee7dc602a71cbdf2e3bf5b928896"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (31 matched lines \u00D7 2 locations): source/pytorch-proto.js:330 \u00B7 source/pytorch-proto.js:388 \u2014 the two spans are one implementation copied and then locally edited \u2014 136 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":"source/pytorch-proto.js"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4e27dbc17f176e529f9e562a695868434e6eb6ec4843fe459a1e43e86fda36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): source/executorch-schema.js:114 \u00B7 source/executorch-schema.js:1390 \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":"source/executorch-schema.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd617335b57eb0513dc28d4b0388f89795dd063b7c98cc07bb6f8817b6ff5b7c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (30 matched lines \u00D7 2 locations): source/tosa.js:363 \u00B7 source/view.js:7962 \u2014 the two spans are one implementation copied and then locally edited \u2014 189 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":"source/tosa.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"610a316465ecb62024e956ef12009dd25530b1c7b33a9fa20f408e6d4ef80176"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (29 matched lines \u00D7 2 locations): source/darknet.js:361 \u00B7 source/darknet.js:584 \u2014 the two spans are one implementation copied and then locally edited \u2014 271 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":"source/darknet.js"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e341ba3d2a51e75b3da3a6b9b6bf63acf164e5972112bbb0662cd5e9a3d7b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): source/kmodel.js:614 \u00B7 source/kmodel.js:820 \u2014 both copies are in the same file, so extract the block 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":"source/kmodel.js"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"08488f29c250b8c88e3639c236ae227cca4363022b3c8a93df559b27caadc039"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (29 matched lines \u00D7 2 locations): source/lightgbm.js:70 \u00B7 source/sklearn.js:108 \u2014 the two spans are one implementation copied and then locally edited \u2014 189 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":"source/lightgbm.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"69da0f730114c819a3b985721433994c5c06e605eb2ba2e1241de1a2dea1106f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (28 matched lines \u00D7 2 locations): source/dl4j.js:387 \u00B7 source/gguf.js:842 \u2014 the two spans are one implementation copied and then locally edited \u2014 130 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":"source/dl4j.js"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff329e86deaaa978986e22e72f4503c6189f879975794ce90e4489c176695c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (28 matched lines \u00D7 2 locations): source/gguf.js:845 \u00B7 source/tf.js:1493 \u2014 the two spans are one implementation copied and then locally edited \u2014 136 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":"source/gguf.js"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4b3e79279c3ee5eb93e4db7f6be4145f3deeba3ea90c46f1a716aee04607a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 4 locations): source/nnabla-proto.js:48 \u00B7 source/nnabla-proto.js:8166 \u00B7 source/nnabla-proto.js:8197 \u00B7 source/nnabla-proto.js:8228 \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":"source/nnabla-proto.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca5d294ef3226e5a749d2412502b566181a7d9354eac89f18106a3c00dce07b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 3 locations): source/onnx-proto.js:1995 \u00B7 source/onnx-proto.js:2099 \u00B7 source/onnx-proto.js:2203 \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":"source/onnx-proto.js"},"region":{"startLine":1995}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebc801ef6e833e6045e1463d4eff1bb9298b63b62b2127bca97adc2aaeabba1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): source/onnx-proto.js:2043 \u00B7 source/onnx-proto.js:2147 \u2014 both copies are in the same file, so extract the block 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":"source/onnx-proto.js"},"region":{"startLine":2043}}}],"partialFingerprints":{"codehealthFindingId/v1":"a465226d6fbe8fdde7a2be85dc344c08fa7ff1214ae3fdd99a8fd227c573ea6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): source/mlir.js:5324 \u00B7 source/mlir.js:5398 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":5324}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b86856011b2a65969f219180d7a496ad24fae63d5a1912177b1b70bfc761070"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): source/mlir.js:8306 \u00B7 source/mlir.js:8392 \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":"source/mlir.js"},"region":{"startLine":8306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66f94db708cd7ee559db28036090e0572af5aa51e898a4f3b77d36e44d86278"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (27 matched lines \u00D7 2 locations): tools/megengine-script.js:84 \u00B7 tools/mslite-script.js:53 \u2014 the two spans are one implementation copied and then locally edited \u2014 205 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":"tools/megengine-script.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffc46d30ac4a80c34f3c45e890d250a3d422f8e7e8d7b85d45f927f9c05fd67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 67 locations): source/coreml-proto.js:1310 \u00B7 source/coreml-proto.js:1862 \u00B7 source/coreml-proto.js:1893 \u00B7 source/coreml-proto.js:1924 \u00B7 \u002B63 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":"source/coreml-proto.js"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f99c07470993d6ccfc4d534928e86893299406f88ee51e673cf23159ee5105"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): source/mlir.js:17176 \u00B7 source/mlir.js:20024 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":17176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4fedc8007477e0aea71151c580f7495eba9b51061a0980bb7820d0f57794c34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): source/hdf5.js:398 \u00B7 source/hdf5.js:424 \u2014 both copies are in the same file, so extract the block 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":"source/hdf5.js"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8002452e7a627714c5ef4790d16601c8912e700dba39ec0560b6200861fdfe70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): source/json.js:75 \u00B7 source/json.js:124 \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":"source/json.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e15726a980e5a51b2dceac19aac2bb2fd2762318857b888e4505ffdb25e28b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): source/mlir.js:16172 \u00B7 source/mlir.js:16197 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":16172}}}],"partialFingerprints":{"codehealthFindingId/v1":"3392396b2c445585fcf8fbe45ffc0430228457da1449004f359eea7719f3b27c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): source/mlir.js:11019 \u00B7 source/mlir.js:11061 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":11019}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d09efea02e810e97e34b30ca36ee9b0fa4d59113251a2f48fe77af75b88c3c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): source/om.js:262 \u00B7 source/openvino.js:756 \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":"source/om.js"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"5193d897df4b548645a27867a9f6e1a4c15c422ffb0a6798405eccebb1e807db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): source/paddle-proto.js:249 \u00B7 source/paddle-proto.js:570 \u2014 both copies are in the same file, so extract the block 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":"source/paddle-proto.js"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb14247e946bd26cc6ed707cc9154715eda66db272913895750e2ac4e171e78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): source/protobuf.js:314 \u00B7 source/protobuf.js:339 \u2014 both copies are in the same file, so extract the block 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":"source/protobuf.js"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee095506f719e001f83ffe07c5034665788f93ff79bf0d4a6d6ce3f672f9125b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): source/base.js:172 \u00B7 source/base.js:264 \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":"source/base.js"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b647f58a59694410dd06fa1a36a48d3087f3778e1f3f735bb1fb0d8a1794aaa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): source/mlir.js:951 \u00B7 source/mlir.js:1052 \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":"source/mlir.js"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"df704577263def62aa8d252dfdc4fa4c675cadb410afacf176fb422ae0d85faf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): source/mlir.js:23111 \u00B7 source/mlir.js:23265 \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":"source/mlir.js"},"region":{"startLine":23111}}}],"partialFingerprints":{"codehealthFindingId/v1":"57353929aab934853bd91ea87f4d2229452cdd7c48b1c9c8294772325e1dae68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): source/python.js:22556 \u00B7 source/tar.js:89 \u2014 the two spans are one implementation copied and then locally edited \u2014 125 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":"source/python.js"},"region":{"startLine":22556}}}],"partialFingerprints":{"codehealthFindingId/v1":"5806caf73de19c9c5cafc68de359a26e6aa3b2a48b698ddf15db8f714dabadad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): tools/tf-script.js:297 \u00B7 tools/tf-script.js:322 \u2014 the two spans are one implementation copied and then locally edited \u2014 150 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":"tools/tf-script.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e9c394d7bcf13c2ef854a0bcfc90428c26afd295499c8a046a8353c02346cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): source/caffe-proto.js:2647 \u00B7 source/caffe-proto.js:3159 \u2014 both copies are in the same file, so extract the block 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":"source/caffe-proto.js"},"region":{"startLine":2647}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5383a5875048fc713e6639860b4b00261e6c2f75242df741bd0079ccf64d28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): source/hdf5.js:509 \u00B7 source/hdf5.js:577 \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":"source/hdf5.js"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b4c336d017d27d62e7cb8d8562a8dc6db16f53aabdd14e2f60d49f26dafe69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): source/keras.js:1405 \u00B7 source/tf.js:425 \u2014 the two spans are one implementation copied and then locally edited \u2014 267 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":"source/keras.js"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0640a6380c1a67bea12a6e2bdd817d790c592b72988efee2fe6f0446256ae44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4 locations): source/mlir.js:22582 \u00B7 source/mlir.js:23094 \u00B7 source/mlir.js:23149 \u00B7 source/mlir.js:23248 \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":"source/mlir.js"},"region":{"startLine":22582}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a729fded323f873a5f791ea6fb42d4cb4a00b4f1876334bc0fb1df267eadc4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): source/nnabla.js:269 \u00B7 source/uff.js:241 \u2014 the two spans are one implementation copied and then locally edited \u2014 121 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":"source/nnabla.js"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8126c5302f0d1cb92239fe392eb33f41c487f7b052ddbe832220d038b48a77c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): source/paddle-proto.js:1032 \u00B7 source/paddle-proto.js:1084 \u2014 both copies are in the same file, so extract the block 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":"source/paddle-proto.js"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"0831120bfee924cddac4c5e3cdbcf669128e1425c220147322cee0944ccb7ed8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): source/caffe2.js:328 \u00B7 source/keras.js:883 \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":"source/caffe2.js"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fcaaf5cd6c050cb873c1d7eeeffb50e584a9802f0654bcae3c821efb686cec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): source/executorch.js:557 \u00B7 source/executorch.js:802 \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":"source/executorch.js"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f9f331aa0495685372f36ff90639ea5822516fc99b8d4995cc0eeb0958db0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): source/mlir.js:10926 \u00B7 source/mlir.js:10965 \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":"source/mlir.js"},"region":{"startLine":10926}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55438ae304271b739d581af19fed91c01d6d486ef1383a42e5598e8e0d76a99"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 4 locations): source/mlir.js:18029 \u00B7 source/mlir.js:18151 \u00B7 source/mlir.js:18527 \u00B7 source/mlir.js:18549 \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":"source/mlir.js"},"region":{"startLine":18029}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4d6b8aa5fbf2528ed65beab31c9b4aa66f893b6f5cf62974451253becdbccc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): source/mslite-schema.js:928 \u00B7 source/mslite-schema.js:2258 \u2014 both copies are in the same file, so extract the block 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":"source/mslite-schema.js"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2dea5d582c79ef030ffdf8b5479c6e0851073debfb38358ab4868415c28d2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (21 matched lines \u00D7 2 locations): source/nnabla.js:269 \u00B7 source/tflite.js:528 \u2014 the two spans are one implementation copied and then locally edited \u2014 82 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/nnabla.js"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b001984a3f18502de0835a4f63e32fa9aa1b670e660d7701c4824706e35f4c9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (21 matched lines \u00D7 2 locations): source/tengine.js:560 \u00B7 source/torch.js:754 \u2014 the two spans are one implementation copied and then locally edited \u2014 91 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":"source/tengine.js"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"02069aef520e68b5b1f0bdbf72e6267b36a1f59ed52fa19bbeecb4c04841e668"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (21 matched lines \u00D7 2 locations): source/tf.js:834 \u00B7 source/tnn.js:110 \u2014 the two spans are one implementation copied and then locally edited \u2014 130 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":"source/tf.js"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab34e2649c0ab59c4d98c958fc8708e48637084d65c44ed402dd1285a484be4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): source/acuity.js:183 \u00B7 source/rknn.js:440 \u2014 the two spans are one implementation copied and then locally edited \u2014 95 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":"source/acuity.js"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c565ccf88faf7b60dfe12c246852cc1d2e6b34d1116b16bd948d4d15f5f5508"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): source/base.js:464 \u00B7 source/base.js:540 \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":"source/base.js"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d211274257a5b3f73a65c8f2e09cc378c2b4bc69d3a9174228d98aae679b83"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): source/base.js:1023 \u00B7 source/base.js:1056 \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":"source/base.js"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"766013755bb20ed54bb41697fff64b17d84ead740f10cf0f246b1d91db9b6772"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): source/circle-schema.js:3039 \u00B7 source/circle-schema.js:3402 \u2014 both copies are in the same file, so extract the block 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":"source/circle-schema.js"},"region":{"startLine":3039}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38d0d6568054e9330560e0da399fccf777ff841562143932161074e8de06f73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): source/json.js:382 \u00B7 source/onnx.js:2770 \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":"source/json.js"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"d869afd268a0f1b1cd2aaa1bfb030176c94e98e96264abf1da2a8ddae9b772ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): source/mlir.js:8285 \u00B7 source/mlir.js:8372 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":8285}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7cf1546fc88417bb320285c5fb11bca7731cf58c2413ab92035a5b37cdacad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): source/mlir.js:18062 \u00B7 source/mlir.js:18187 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":18062}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae76cffd5af4c4b2facda78d994a1e3fe3305032005d32c292c4031283055857"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): source/mlir.js:23494 \u00B7 source/mlir.js:23528 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":23494}}}],"partialFingerprints":{"codehealthFindingId/v1":"101caecf63aa9162fbf18b204ee47be1f86a347e0f2b8ee4eac252fa605adfe8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): source/onnx.js:2770 \u00B7 source/protobuf.js:1357 \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":"source/onnx.js"},"region":{"startLine":2770}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e80278afcaa07b7acde3182ddb3da9793d7a6f3553d4eaec7ed620374e5de8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): source/bigdl-proto.js:173 \u00B7 source/bigdl-proto.js:320 \u2014 both copies are in the same file, so extract the block 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":"source/bigdl-proto.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ba3857b7fac0b64de387ab13ba33d3b03d93bf28a5e6118a5cfbef36508c8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): source/browser.js:760 \u00B7 source/browser.js:780 \u2014 both copies are in the same file, so extract the block 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":"source/browser.js"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9aa1afd099fbfcd7e70479bef4f3baacab6bea3e8817aa9ac900e9eb30e6d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): source/caffe.js:561 \u00B7 source/coreml.js:1435 \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":"source/caffe.js"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb8ee8596c8f1fb7b474a51355e412a720458bdd36fb033aafde24e2b00a1a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): source/circle-schema.js:1576 \u00B7 source/circle-schema.js:1891 \u2014 both copies are in the same file, so extract the block 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":"source/circle-schema.js"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"5103e1ea93a9a194c14ac40d1dee8a31a2350678962f8733ede5b5d5fc623b7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): source/cntk.js:566 \u00B7 source/ncnn.js:1184 \u2014 the two spans are one implementation copied and then locally edited \u2014 101 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":"source/cntk.js"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c557bd154b7160eaa943d0f1b895e82385e5edbc8995050003f4ba87a04aba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): source/coreml-proto.js:8616 \u00B7 source/coreml-proto.js:16924 \u2014 both copies are in the same file, so extract the block 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":"source/coreml-proto.js"},"region":{"startLine":8616}}}],"partialFingerprints":{"codehealthFindingId/v1":"e287eb18da0675b34525feeef14e1fa2ffb9dd4fc9c1cf9ecbb3b3eb1e01daa7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): source/coreml-proto.js:13404 \u00B7 source/coreml-proto.js:13559 \u00B7 source/coreml-proto.js:18090 \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":"source/coreml-proto.js"},"region":{"startLine":13404}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1613e3973d578141311e6cb421583d46c90393bb828e776a38345ed03bf4c19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): source/dl4j.js:312 \u00B7 source/mxnet.js:642 \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":"source/dl4j.js"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab898cffa7c73b08c96f9d73e64ae141bf0087b5ceb0770bcf0f6332fb9eefb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): source/hdf5.js:971 \u00B7 source/hdf5.js:1632 \u2014 both copies are in the same file, so extract the block 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":"source/hdf5.js"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"576bcc786d8d342d9cfbc80a375c7041410ecbcecea40b221e26df216ab67c02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): source/mlir.js:13176 \u00B7 source/mlir.js:13200 \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":"source/mlir.js"},"region":{"startLine":13176}}}],"partialFingerprints":{"codehealthFindingId/v1":"632c7749a77dbe6fa1e225d583666fff773ec4b1678543f0f03f3018238734fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): source/mlir.js:13847 \u00B7 source/mlir.js:13891 \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":"source/mlir.js"},"region":{"startLine":13847}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ce1ee203ccf42c6c28a5a8ff60ceb0276f3d30eb5b02c3d619f331ed481f96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): source/mlir.js:27765 \u00B7 source/mlir.js:28020 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":27765}}}],"partialFingerprints":{"codehealthFindingId/v1":"174141a43b66eaa1df9588e1afd244d9dd07d2cd1596df9bf6acb8b6b9181dce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): source/protobuf.js:96 \u00B7 source/protobuf.js:147 \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":"source/protobuf.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"539cd65ed177a4243748b4dcdfce66d253e1130277689945c5adc031fa2aa075"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): source/armnn-schema.js:3048 \u00B7 source/circle-schema.js:3630 \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":"source/armnn-schema.js"},"region":{"startLine":3048}}}],"partialFingerprints":{"codehealthFindingId/v1":"107a3d72dbbe67e5daba7cf0759828b6422bf812bca70c3f8beeeb685f1f2056"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): source/barracuda.js:265 \u00B7 source/cntk.js:958 \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":"source/barracuda.js"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"1821ba38ff715f35a40dab22f88ac1c1bb0e982d5abd3f9eb50de13ad430c0cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): source/base.js:1191 \u00B7 source/base.js: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":"source/base.js"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d28ca9bdda27ffed11ec6cd85ca9c8285609ad49491867f7c28a8045d5df12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): source/browser.js:322 \u00B7 source/desktop.mjs:403 \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":"source/browser.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa2c67b99cc672de3153e570e6c3c0055b157346427f78443fcd321014cd98e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): source/cntk.js:565 \u00B7 source/pytorch.js:2719 \u2014 the two spans are one implementation copied and then locally edited \u2014 99 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":"source/cntk.js"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb8319d37001c083aa8e416b16610d24687562819460866f18a494e083902a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): source/cntk.js:566 \u00B7 source/tosa.js:374 \u2014 the two spans are one implementation copied and then locally edited \u2014 98 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":"source/cntk.js"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"894887b53b7bcd4e22514ee60731d0a02207658ae6ab5582b337459f45968cd4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): source/coreml-proto.js:3065 \u00B7 source/coreml-proto.js:11802 \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":"source/coreml-proto.js"},"region":{"startLine":3065}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b464af94e92eb40b97585c074d798988fb7e342b1cd2290a95b29da48202e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): source/coreml-proto.js:5774 \u00B7 source/coreml-proto.js:16194 \u00B7 source/coreml-proto.js:16387 \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":"source/coreml-proto.js"},"region":{"startLine":5774}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ba8965fae8554bdddea4809fdab3733421683a0e8569e161a10eccfa7dfe70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): source/dlc.js:121 \u00B7 source/lasagne.js:70 \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":"source/dlc.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdad41f0e39328bb223e6eabe5dd157e9540253d3b77df376a10e3f6f9cefff5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): source/hdf5.js:335 \u00B7 source/hdf5.js:621 \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":"source/hdf5.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"d830f1bb803e7e1443de72363ffadb451139263ac57a4ba11318ec75d8c093f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): source/hickle.js:133 \u00B7 source/keras.js:1230 \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":"source/hickle.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f658136d5cb0000e45a1dd70351c73bcc8d5af27b1c8ebe3a09160fbb75b2d7f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): source/megengine-schema.js:2084 \u00B7 source/megengine-schema.js:2114 \u2014 both copies are in the same file, so extract the block 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":"source/megengine-schema.js"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54787ec58f79dbbf37da02b29a87d8a8a4289fc1620ef73bfd334e022aed90d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): source/megengine.js:593 \u00B7 source/om.js:292 \u2014 the two spans are one implementation copied and then locally edited \u2014 135 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":"source/megengine.js"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1a9d9b038386e9a082681395b03bcb6591b401262aa6ed87047697b5571696"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): source/mlir.js:15079 \u00B7 source/mlir.js:29018 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":15079}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c377ce50eb747c635b43fc8f72b06616a9af2422f981446fc70d23b7fe891cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): source/mlir.js:16072 \u00B7 source/mlir.js:16307 \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":"source/mlir.js"},"region":{"startLine":16072}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ddd53fd18c731392d35db5c1b2a47f5b576770816c181eb5c3bf20301f0c10"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4 locations): source/mlir.js:23441 \u00B7 source/mlir.js:23460 \u00B7 source/mlir.js:23482 \u00B7 source/mlir.js:23513 \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":"source/mlir.js"},"region":{"startLine":23441}}}],"partialFingerprints":{"codehealthFindingId/v1":"af78a344a042121d7f39653aa71fae4d00759733fb19ca167459c9ff293abf77"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4 locations): source/mslite-schema.js:2580 \u00B7 source/mslite-schema.js:3077 \u00B7 source/mslite-schema.js:3480 \u00B7 source/mslite-schema.js:4341 \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":"source/mslite-schema.js"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f75fd0ebc2a00f9722d37287fcc65228d7e188665ecbb2969b58085d887cfc3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): source/python.js:1836 \u00B7 source/python.js:1861 \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":"source/python.js"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"584f3ed4bc410bd13636b1d662bb1241da8a17d391c527ff7ef4bf6cddb786c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): source/tf.js:834 \u00B7 source/uff.js:138 \u2014 the two spans are one implementation copied and then locally edited \u2014 113 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":"source/tf.js"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"5294032e1ea169349f12545be01e10bb9da4cc4a939fe17580505e0d1b78a12e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): source/xml.js:529 \u00B7 source/xml.js:550 \u2014 the two spans are one implementation copied and then locally edited \u2014 129 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":"source/xml.js"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"d626593b6cf852415668910265f6712239225bf9058f13adc650a1e67b5ffb6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 5 locations): source/armnn-schema.js:155 \u00B7 source/circle-schema.js:883 \u00B7 source/circle-schema.js:1003 \u00B7 source/circle-schema.js:1052 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"source/armnn-schema.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6116cac55b1e4de6cac7246d255778335defd70780fb18571d746af943b28dcf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4 locations): source/caffe-proto.js:209 \u00B7 source/caffe-proto.js:2467 \u00B7 source/coreml-proto.js:3303 \u00B7 source/nnabla-proto.js:690 \u2014 the 4 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":"source/caffe-proto.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c5eccd9eff34e1b0225ef73a2c3b5a9f389b338a6f37beeeb9aab0be44bdd1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): source/caffe.js:321 \u00B7 source/onednn.js:203 \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":"source/caffe.js"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"252e662182d8051789a082dcfe56bf74e570f56085d010eef0e9542c869b0a0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): source/caffe.js:519 \u00B7 source/dl4j.js:300 \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":"source/caffe.js"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f8b4730878853d8890696705b07f81c6c5db04f8f11c57ca4a6af530b753a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): source/caffe2.js:394 \u00B7 source/caffe2.js:411 \u2014 both copies are in the same file, so extract the block 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":"source/caffe2.js"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cecde045634ce24dde0855eb05eeae013d08b198e17346477eed0b623da3420"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): source/caffe2.js:453 \u00B7 source/flax.js:130 \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":"source/caffe2.js"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8d2bc25bd35360c8a6be110d4ace97aa19f09be034d0d2ed60f1068324ea25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): source/circle-schema.js:2009 \u00B7 source/circle-schema.js:2320 \u00B7 source/circle-schema.js:3108 \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":"source/circle-schema.js"},"region":{"startLine":2009}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48c08527276725a84f189701a0877c19e30445110c997a76f57a7e4bcd3c6d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): source/circle.js:517 \u00B7 source/espdl.js:269 \u00B7 source/mlir.js:716 \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":"source/circle.js"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7e1c81279fc8a080dfb8f853d4c52d29044cac3bff127a9bd24bf8fe7f0b95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): source/coreml-proto.js:10582 \u00B7 source/coreml-proto.js:10636 \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":"source/coreml-proto.js"},"region":{"startLine":10582}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab61ccd0cba7bfc42e112901cfa6e87824b0a95be2d00e614c55ca8418e02b60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): source/dl4j.js:147 \u00B7 source/hailo.js:113 \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":"source/dl4j.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb42440b13fb1030937d8c80a744023396744786bdae0f83b9134ba1464d1d70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): source/dnn.js:217 \u00B7 source/mlnet.js:214 \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":"source/dnn.js"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c38ce619fa1037273516d0b9ed5ecd82722e0f62ad8ceff1f2872c868cfca7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): source/dot.js:606 \u00B7 source/onnx.js:2747 \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":"source/dot.js"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"728a1e85cc6f5a17ca56820c0263c8975789148c7fb19f60b587103ff4c3ba4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): source/executorch.js:109 \u00B7 source/executorch.js:839 \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":"source/executorch.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"28cd65e05733a1942b661a67530bbb6f2623e798cc5b0921e3429f52035d3156"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): source/flax.js:133 \u00B7 source/numpy.js:138 \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":"source/flax.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9199a4cdc266219b9d7a32c785d8abee9d8bccd3d5aacfc5c4b5a1c59d242f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): source/hdf5.js:1387 \u00B7 source/hdf5.js:1619 \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":"source/hdf5.js"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"d602fea11461a3dbeae5b06b86834db4ade19df5543347a33c1557ec6f9307b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): source/keras-proto.js:25 \u00B7 source/keras-proto.js:74 \u00B7 source/keras-proto.js:139 \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":"source/keras-proto.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d15eb0fa0f144277dbec1c015933bf5411a6f6aa3f5f2d3ca964f3c0e46346"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): source/megengine-schema.js:424 \u00B7 source/megengine-schema.js:450 \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":"source/megengine-schema.js"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca55e24d08dddfdf9ea0c975994b43ff246ccad58d4ba4e8230a3910516cea89"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): source/mindir.js:200 \u00B7 source/onednn.js:196 \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":"source/mindir.js"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"299cf65eb78f8003710d6fedcccebc36f9a72471d5f1b1288cc4c74b1e42f737"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): source/mlir.js:16966 \u00B7 source/mlir.js:17045 \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":"source/mlir.js"},"region":{"startLine":16966}}}],"partialFingerprints":{"codehealthFindingId/v1":"45723e690ac3a763634e5c5d9d041de8b272f2ccd26a33bbf522a6dd7ac02ba7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): source/mlir.js:24413 \u00B7 source/mlir.js:27456 \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":"source/mlir.js"},"region":{"startLine":24413}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e39d79681fbdbe4aa307546155af7a1a77aaef88c963d9e16100c51b19b1b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): source/mlir.js:24434 \u00B7 source/mlir.js:24481 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":24434}}}],"partialFingerprints":{"codehealthFindingId/v1":"26332ef4decd60ebf314caec96e635141f61e4c7ffeeabae320093a850698c90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): source/mlnet.js:42 \u00B7 source/tnn.js:75 \u2014 the two spans are one implementation copied and then locally edited \u2014 121 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":"source/mlnet.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a95cfbf4d47157a5839eb4cfe15a2e9c60e0a253947263795fe657baef6c39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): source/mslite.js:135 \u00B7 source/mslite.js:153 \u2014 both copies are in the same file, so extract the block 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":"source/mslite.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c257d34dbc334483ac0898ea98957718b8ff987d0a99cb326444ee93f5e494c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): source/nnabla.js:269 \u00B7 source/qnn.js:243 \u2014 the two spans are one implementation copied and then locally edited \u2014 82 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/nnabla.js"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a338db3745b0f85ff96f6c8c02b2b988fc9ffe938f24aacb671d1b72993e6e29"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): source/nnabla.js:180 \u00B7 source/tnn.js:110 \u2014 the two spans are one implementation copied and then locally edited \u2014 98 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":"source/nnabla.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ccdd779784907ab8dc63c7b1dfa1785c4edd2a843c08b6214a5639f08dc5bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): source/nnabla.js:180 \u00B7 source/tvm.js:188 \u2014 the two spans are one implementation copied and then locally edited \u2014 102 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":"source/nnabla.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ceb2309785e3b7a53b6a7663139b68cf5ac5842a35283f7b2ffe021b366acc7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): source/onnx.js:678 \u00B7 source/tflite.js:528 \u2014 the two spans are one implementation copied and then locally edited \u2014 69 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":"source/onnx.js"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f10aa22e7fc42a9730b986647f99fd829c4a675bc9901c146d5a0250afe949"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): source/onnx.js:2700 \u00B7 source/xml.js:1126 \u2014 the two spans are one implementation copied and then locally edited \u2014 93 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":"source/onnx.js"},"region":{"startLine":2700}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe4ff46542b8fd2482e0620259f4610d493bee9dd7f27308870f01ce20deb05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): source/python.js:4544 \u00B7 source/python.js:4632 \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":"source/python.js"},"region":{"startLine":4544}}}],"partialFingerprints":{"codehealthFindingId/v1":"de49aab154d9ba1a7078162edfd5fbfdef1374e99fc26580fdcf7611f48045c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): source/pytorch.js:972 \u00B7 source/rknn.js:440 \u2014 the two spans are one implementation copied and then locally edited \u2014 76 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":"source/pytorch.js"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"606a8079294081cd4f5dfefa93365153dffa9b46cc304838c2d01a8aff3c3ac5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): source/pytorch.js:2718 \u00B7 source/tosa.js:377 \u2014 the two spans are one implementation copied and then locally edited \u2014 112 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":"source/pytorch.js"},"region":{"startLine":2718}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d5b1c8fc056da3c41aea3b9f028636db5abd255b0fe559f26e8d66c9ab9231"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): source/qnn.js:243 \u00B7 source/tosa.js:298 \u2014 the two spans are one implementation copied and then locally edited \u2014 83 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":"source/qnn.js"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"0deb6c54d7768f3931cebeb8d14bbea64fc2e16989d7488b3bf1c6a00c194643"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): source/rknn.js:265 \u00B7 source/tf.js:834 \u2014 the two spans are one implementation copied and then locally edited \u2014 101 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":"source/rknn.js"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bf6508a4a32c8b4136f0f401e106455d44b122d037e6001c87c6c10cbf2c91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): source/rknn.js:444 \u00B7 source/tflite.js:528 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 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":"source/rknn.js"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1f16d257e43c37ea5f1da37b56dbd9971a83945ca184055c140e69f44bb38f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): source/tosa.js:298 \u00B7 source/tvm.js:259 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 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":"source/tosa.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8ae825a27e7fd1a9fa5244d7c22f8a6d7ba1ee4417904ab6cf095612271e48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/acuity.js:160 \u00B7 source/caffe.js:317 \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":"source/acuity.js"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a311a2608fd7af85ad90d7e04aab8dfc678b8033cf1ee8dfdb470d7d1b8ebc1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/armnn-schema.js:913 \u00B7 source/mnn-schema.js:2864 \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":"source/armnn-schema.js"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b0c088475e6eff50903b1b78c3b38471f786a673c1ebeb065901b831ad8abf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4 locations): source/armnn.js:201 \u00B7 source/bigdl.js:80 \u00B7 source/dlc.js:123 \u00B7 source/lasagne.js:72 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/armnn.js"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab67cfd1f59cb761db56f03a868f2c65f2f94d81f03a2ef9086d0538fe4db86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/armnn.js:275 \u00B7 source/circle.js:527 \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":"source/armnn.js"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eadd97498aea0449fbcd517b6fb0a20efe0f938f73af9c30d04847073fd7510"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): source/bigdl.js:87 \u00B7 source/kmodel.js:125 \u00B7 source/lasagne.js:79 \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":"source/bigdl.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1927f5909e116023592f7fc59a6663c0aeca81d97b60dc42d626f803376299e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/browser.js:301 \u00B7 source/desktop.mjs:390 \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":"source/browser.js"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c12f4381d6e97075daa51705ae96f4548f2854dc0dcc56239ec444a93053816"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 36 locations): source/caffe-proto.js:27 \u00B7 source/coreml-proto.js:1524 \u00B7 source/coreml-proto.js:1565 \u00B7 source/coreml-proto.js:1606 \u00B7 \u002B32 more site(s) not listed \u2014 the 4 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":"source/caffe-proto.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb0ac018e48c67e38e40a24dd59b87ba3813eafc692d9e2a2a6e3815b795841"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 110 locations): source/caffe-proto.js:2341 \u00B7 source/caffe-proto.js:2518 \u00B7 source/caffe-proto.js:2776 \u00B7 source/caffe-proto.js:2815 \u00B7 \u002B106 more site(s) not listed \u2014 the 4 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":"source/caffe-proto.js"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a55cd60e536596f76c5a82a9bbf52e7845ae228f20f31035d9febb7dcd9d1d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 97 locations): source/caffe-proto.js:2358 \u00B7 source/caffe-proto.js:2535 \u00B7 source/caffe-proto.js:2793 \u00B7 source/caffe-proto.js:4148 \u00B7 \u002B93 more site(s) not listed \u2014 the 4 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":"source/caffe-proto.js"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeccceb8786915947ef23ebe7f1c9896ef9f9a86aba1956a3289099f952edea3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4 locations): source/caffe-proto.js:2832 \u00B7 source/caffe-proto.js:3995 \u00B7 source/caffe-proto.js:4187 \u00B7 source/coreml-proto.js:13478 \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":"source/caffe-proto.js"},"region":{"startLine":2832}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba368803c8c9b8bcf2b1def88db86249f0f3d767c3b263bd068d1a0c850a01b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 5 locations): source/caffe-proto.js:3116 \u00B7 source/mindir-proto.js:651 \u00B7 source/nnabla-proto.js:27 \u00B7 source/nnabla-proto.js:8507 \u00B7 \u002B1 more site(s) not listed \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":3116}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d8a3c6ec2c5a32215846638b89f891978233dad32b5710402835eebcaa9830"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 6 locations): source/caffe-proto.js:3404 \u00B7 source/nnabla-proto.js:263 \u00B7 source/nnabla-proto.js:8544 \u00B7 source/nnabla-proto.js:8663 \u00B7 \u002B2 more site(s) not listed \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":3404}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bc48f0e40a852208d91b6b9cd1f6e6a25ceb62864c8257b8d88b0c2a8450fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/circle-schema.js:1075 \u00B7 source/circle-schema.js:1151 \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":"source/circle-schema.js"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"94eb52f9eaa455de0bb1e08cc1f319fd427613d60435e4f2a45d5706c9dc6a81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): source/cntk-proto.js:12 \u00B7 source/cntk-proto.js:198 \u00B7 source/litertlm-proto.js:982 \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":"source/cntk-proto.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"985c5c9fea8b98afd77abd24cf6c17d90b4fea39b7d48f62314664ad5011ad43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/cntk-proto.js:135 \u00B7 source/litertlm-proto.js:965 \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":"source/cntk-proto.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fde462b157881f84639773a584c8a0e1c26b0d06e51d062c300f0ef1c38fe1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): source/cntk.js:566 \u00B7 source/view.js:7977 \u2014 the two spans are one implementation copied and then locally edited \u2014 104 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":"source/cntk.js"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"26236a6317255cc15706ca639a62cc755819320edd6eb5f2a5ddf3ec2f59e456"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 6 locations): source/coreml-proto.js:73 \u00B7 source/coreml-proto.js:112 \u00B7 source/coreml-proto.js:2557 \u00B7 source/coreml-proto.js:6258 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 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":"source/coreml-proto.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a5109aa905a7f3554ee6c549a7b94a5158ac61bbc2c4045dd5b74ba8f8e1c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/coreml-proto.js:825 \u00B7 source/coreml-proto.js:966 \u2014 both copies are in the same file, so extract the block 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":"source/coreml-proto.js"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de8937a2a3a1518911ff2387bd61c08a8eb44d907b6e3dd2b2e4246d1bb3999"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/coreml-proto.js:929 \u00B7 source/coreml-proto.js:1288 \u2014 both copies are in the same file, so extract the block 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":"source/coreml-proto.js"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa145b719225a74e233ac4535f47c70f48638a2d73fa2a2b49d50fd8a1e506f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4 locations): source/coreml-proto.js:1360 \u00B7 source/coreml-proto.js:1401 \u00B7 source/coreml-proto.js:1442 \u00B7 source/coreml-proto.js:1483 \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":"source/coreml-proto.js"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee8e05be257c5a9b27ed7b4f02073c30384fadf0f10c1757e1fc16d2603f5a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/coreml-proto.js:1507 \u00B7 source/coreml-proto.js:5482 \u2014 both copies are in the same file, so extract the block 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":"source/coreml-proto.js"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d4bf57171c1bc504c0e6396d68f4c6bedd39cc88f4cb372c229db1f91848bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 11 locations): source/coreml-proto.js:1589 \u00B7 source/coreml-proto.js:1630 \u00B7 source/coreml-proto.js:3351 \u00B7 source/coreml-proto.js:3478 \u00B7 \u002B7 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":"source/coreml-proto.js"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1a5696ef021ca3136880ccb41238bd75cf30889a60591fc7d15d2e16cd301e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 7 locations): source/coreml-proto.js:2144 \u00B7 source/coreml-proto.js:2370 \u00B7 source/coreml-proto.js:3225 \u00B7 source/coreml-proto.js:4749 \u00B7 \u002B3 more site(s) not listed \u2014 all 7 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":"source/coreml-proto.js"},"region":{"startLine":2144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be2baeb6a1d5d2f5b8c6872333a6a3f94a7019d167e10908ea1485a9505f190"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4 locations): source/coreml-proto.js:2312 \u00B7 source/coreml-proto.js:3351 \u00B7 source/coreml-proto.js:3478 \u00B7 source/coreml-proto.js:9437 \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":"source/coreml-proto.js"},"region":{"startLine":2312}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c07032fad0561e2f2ff4155bf5a7a61daac55aa4d5fa4d7d31dcec763c0efa7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 7 locations): source/coreml-proto.js:2336 \u00B7 source/coreml-proto.js:2377 \u00B7 source/coreml-proto.js:4355 \u00B7 source/coreml-proto.js:5586 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 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":"source/coreml-proto.js"},"region":{"startLine":2336}}}],"partialFingerprints":{"codehealthFindingId/v1":"04877dc0aadd8893d7c08f20787a6a135ba47198df092870f21c2087a9eda21b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 6 locations): source/coreml-proto.js:2394 \u00B7 source/coreml-proto.js:17401 \u00B7 source/coreml-proto.js:17442 \u00B7 source/coreml-proto.js:17524 \u00B7 \u002B2 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":"source/coreml-proto.js"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8c85654723ce9cc8d89b8cde2446de798e892107c65e0a023288639d15215d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 7 locations): source/coreml-proto.js:4372 \u00B7 source/coreml-proto.js:5644 \u00B7 source/keras-proto.js:18 \u00B7 source/om-proto.js:287 \u00B7 \u002B3 more site(s) not listed \u2014 the 4 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":"source/coreml-proto.js"},"region":{"startLine":4372}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54d7ef2784bd5e8b452f4afef435b4951f74bdf2ea37fd58201434c8c5e4c97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 9 locations): source/coreml-proto.js:5260 \u00B7 source/coreml-proto.js:5301 \u00B7 source/coreml-proto.js:5342 \u00B7 source/coreml-proto.js:5383 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 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":"source/coreml-proto.js"},"region":{"startLine":5260}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86b8dca45313c224650aa54c3d5a8e7d085ed4d2a708f2ecfc63b69f240d45d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 8 locations): source/coreml-proto.js:5277 \u00B7 source/coreml-proto.js:5318 \u00B7 source/coreml-proto.js:5359 \u00B7 source/coreml-proto.js:5400 \u00B7 \u002B4 more site(s) not listed \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml-proto.js"},"region":{"startLine":5277}}}],"partialFingerprints":{"codehealthFindingId/v1":"455bf37bde44b776286842b68377f0a3e068710695d893d01cc390cca9c0fe41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): source/coreml-proto.js:5499 \u00B7 source/coreml-proto.js:5661 \u00B7 source/paddle-proto.js:1521 \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":"source/coreml-proto.js"},"region":{"startLine":5499}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c8a0cb3c57eca29a0bbf60da9424d2c97612291cfde1d702f6d23b8ab18620"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 7 locations): source/coreml-proto.js:8359 \u00B7 source/coreml-proto.js:8403 \u00B7 source/coreml-proto.js:8449 \u00B7 source/coreml-proto.js:9639 \u00B7 \u002B3 more site(s) not listed \u2014 all 7 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":"source/coreml-proto.js"},"region":{"startLine":8359}}}],"partialFingerprints":{"codehealthFindingId/v1":"975d74f01cadbb30c644bd8363d7067ce21929a845dae11682af9d7ed42b7fb0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/darknet.js:293 \u00B7 source/darknet.js:328 \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":"source/darknet.js"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc7da17bfd0d5e0d94e329e0b1dc4132e950b30b5300e1194f06bf50d037bc3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): source/dnn.js:150 \u00B7 source/tnn.js:180 \u2014 the two spans are one implementation copied and then locally edited \u2014 142 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":"source/dnn.js"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26fc7a27c5787ec9bd9177c0e41b1fca58cec9f15daef43572fed82f4df4bcd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/espdl.js:135 \u00B7 source/espdl.js:151 \u2014 both copies are in the same file, so extract the block 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":"source/espdl.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafaa61852ac254b7f3ec7299aae8ad146e8157f867e70b1851b05bc19ce9e52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/hailo.js:102 \u00B7 source/keras.js:876 \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":"source/hailo.js"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f24a8a2869a4fc07814416f78e1c48113afb878ee59bfc2aac7e9d3caa30a17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/kmodel.js:170 \u00B7 source/om.js:319 \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":"source/kmodel.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc667e8390ecbdfd42bda30f5ce0ab07b273bec5e7cf900ccf31d9abd475630"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/lasagne.js:140 \u00B7 source/ncnn.js:872 \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":"source/lasagne.js"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf338d0931daddf853efcf087f8a55715ef09fbcd992e8b82440f1141479754"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4 locations): source/mlir.js:13249 \u00B7 source/mlir.js:19124 \u00B7 source/mlir.js:21337 \u00B7 source/mlir.js:27273 \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":"source/mlir.js"},"region":{"startLine":13249}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c9387e6badfd5f9f61b950e28c2025e2732d7d82aada69217876c169866f6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): source/mlir.js:13585 \u00B7 source/mlir.js:14275 \u00B7 source/mlir.js:15599 \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":"source/mlir.js"},"region":{"startLine":13585}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae356a45216c65dab049421dd94aa8a3dc673617a6b126ede4995ad0e2708ea2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/mlir.js:20193 \u00B7 source/mlir.js:29035 \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":"source/mlir.js"},"region":{"startLine":20193}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e61768c8d251a7efbc61c6a864e6b941269579a68155bb48d6271b9be544411"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/mlir.js:23207 \u00B7 source/mlir.js:23224 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":23207}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaeca1fb144b33b26b2990e35fa41204526939273fd20dbc9f6893245f0f61b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/mlnet.js:883 \u00B7 source/mlnet.js:920 \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":"source/mlnet.js"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"b972f6aa4230c7f4aa70f2dabe0641797975baec2ff0ace13fc5aa586c9c41de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/mnn-schema.js:387 \u00B7 source/mnn-schema.js:739 \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":"source/mnn-schema.js"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"421fcec8785e0efded17896653044659413d98bb5835604a2b26fe4fa39c7884"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/mnn-schema.js:812 \u00B7 source/mnn-schema.js:2200 \u2014 both copies are in the same file, so extract the block 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":"source/mnn-schema.js"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"05334477e5fcd48f7ec847c578fdbe87e20eed073970c173007b3b6c99463db4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/ncnn.js:881 \u00B7 source/onednn.js:249 \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":"source/ncnn.js"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"198a2b4298b956e62675eed7518c05bcf613c18f1478dfce13926c7cd09c87d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): source/paddle-proto.js:218 \u00B7 source/paddle-proto.js:536 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle-proto.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"deaa07b2f11cd3336f75d5b507a2628618edfd92f9a4a6be92f61560b1b634d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): source/rknn.js:442 \u00B7 source/tosa.js:296 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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":"source/rknn.js"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48a398338cb29928582b505c25818f7899afd44814fdd8f2020f5684a37540e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): source/tflite.js:528 \u00B7 source/tvm.js:259 \u2014 the two spans are one implementation copied and then locally edited \u2014 84 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":"source/tflite.js"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bd25ccfb861ec85220f7fcab639eb071f9e4595eb1eaeb35f62f75eb6c7480"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): source/base.js:1142 \u00B7 source/base.js:1162 \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":"source/base.js"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"3165982d4652ce732f5d81c8498c1b21f14d06aef7cc703853c4e8fa3e5b6bc1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 170 locations): source/bigdl-proto.js:231 \u00B7 source/caffe-proto.js:79 \u00B7 source/caffe-proto.js:292 \u00B7 source/caffe-proto.js:1014 \u00B7 \u002B166 more site(s) not listed \u2014 the 170 copies are spread across 10 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":"source/bigdl-proto.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ccc30d1194fbccf687a777b91be196f7445b5209b0a9ea22a77dad2ae3ae1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): source/bigdl.js:19 \u00B7 source/dnn.js:18 \u00B7 source/mindir.js:20 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/bigdl.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d020fb504590248c9a2f47987d56d3ea392e542a13cc5489022d5556e49d9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 8 locations): source/caffe-proto.js:332 \u00B7 source/caffe-proto.js:3239 \u00B7 source/caffe-proto.js:3518 \u00B7 source/caffe-proto.js:3832 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"730a1d823fac63d6fbc94877791c1c92675691e96350db0b065daff2f57a6d07"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 15 locations): source/caffe-proto.js:438 \u00B7 source/caffe2-proto.js:815 \u00B7 source/caffe2-proto.js:1493 \u00B7 source/mindir-proto.js:473 \u00B7 \u002B11 more site(s) not listed \u2014 the 15 copies are spread across 5 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":"source/caffe-proto.js"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"e982b3d6c4634a75aa2613a2926e7c982df736cdafcf1324048e0eae2e3c7de4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 6 locations): source/caffe-proto.js:597 \u00B7 source/caffe-proto.js:891 \u00B7 source/caffe2-proto.js:878 \u00B7 source/coreml-proto.js:863 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 5 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":"source/caffe-proto.js"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f5740a89bbfde7d03d7cb5029a129f34c6db224c31c47f59bbd806f4be7b9a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 14 locations): source/caffe-proto.js:1754 \u00B7 source/caffe-proto.js:1899 \u00B7 source/nnabla-proto.js:6489 \u00B7 source/nnabla-proto.js:6591 \u00B7 \u002B10 more site(s) not listed \u2014 the 14 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":"source/caffe-proto.js"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"232401f4e2d607060101a2e527ca92c226bfc429ce2e97ace2a748d10128b3ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 43 locations): source/caffe-proto.js:2219 \u00B7 source/caffe-proto.js:2542 \u00B7 source/caffe-proto.js:2800 \u00B7 source/caffe-proto.js:4155 \u00B7 \u002B39 more site(s) not listed \u2014 the 43 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":"source/caffe-proto.js"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d832a2b0b4fcc0090f8a0f6dc77f673e6d8cc2283fe9facc00fcaa0640b2891d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): source/caffe-proto.js:4005 \u00B7 source/caffe-proto.js:4197 \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":"source/caffe-proto.js"},"region":{"startLine":4005}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1941dc676e6b13b534d2e2cf4370e18d16795fd52500a026cde69aec7c6664"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 13 locations): source/caffe-proto.js:4036 \u00B7 source/coreml-proto.js:10608 \u00B7 source/coreml-proto.js:13678 \u00B7 source/coreml-proto.js:15027 \u00B7 \u002B9 more site(s) not listed \u2014 the 13 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":4036}}}],"partialFingerprints":{"codehealthFindingId/v1":"35553fa61ea06032aad925d46be99a6aefddd53fa3631525302ecd174ec16b66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 14 locations): source/caffe-proto.js:5205 \u00B7 source/nnabla-proto.js:4671 \u00B7 source/nnabla-proto.js:4819 \u00B7 source/nnabla-proto.js:4967 \u00B7 \u002B10 more site(s) not listed \u2014 the 14 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":"source/caffe-proto.js"},"region":{"startLine":5205}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bc2df05364de6e0511265077919a0c15ebd6526cf2eae7e120985f9d70201a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): source/caffe2-proto.js:1121 \u00B7 source/caffe2-proto.js:1183 \u00B7 source/mindir-proto.js:1100 \u2014 the 3 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":"source/caffe2-proto.js"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"224ff4f6de679acafb420f0f938bf42d5f02b7094e9615d3a5978bd8fc92f5e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5 locations): source/circle-schema.js:1743 \u00B7 source/circle-schema.js:2936 \u00B7 source/mnn-schema.js:1065 \u00B7 source/mnn-schema.js:1693 \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":"source/circle-schema.js"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"5930e569e431dffb8ce43b5b78cc53095f2ba7ea94bda09016ffeba3d2a2338d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 54 locations): source/coreml-proto.js:314 \u00B7 source/coreml-proto.js:459 \u00B7 source/coreml-proto.js:1694 \u00B7 source/coreml-proto.js:1781 \u00B7 \u002B50 more site(s) not listed \u2014 the 54 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":"source/coreml-proto.js"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55d30ef141745de90d93a94c0ab75e6b01335c13f5e590c1553b45f61be4298"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 16 locations): source/coreml-proto.js:2651 \u00B7 source/coreml-proto.js:10326 \u00B7 source/coreml-proto.js:11099 \u00B7 source/coreml-proto.js:11444 \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":"source/coreml-proto.js"},"region":{"startLine":2651}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac6998865b7305fd65ef1aca1ff2446db82139d14e1c6d971918ddccb4d0559"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 27 locations): source/coreml-proto.js:3684 \u00B7 source/coreml-proto.js:3816 \u00B7 source/coreml-proto.js:3953 \u00B7 source/coreml-proto.js:3992 \u00B7 \u002B23 more site(s) not listed \u2014 all 27 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml-proto.js"},"region":{"startLine":3684}}}],"partialFingerprints":{"codehealthFindingId/v1":"65adb2ffc5cb574c569e60c982b3a530623c775592bb789fa0d50788aac0261c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): source/coreml-proto.js:4031 \u00B7 source/coreml-proto.js:9853 \u00B7 source/coreml-proto.js:11051 \u00B7 source/coreml-proto.js:15051 \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":"source/coreml-proto.js"},"region":{"startLine":4031}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0d968b5803ad3ad2fe8ab97c2db369361dccf6dbeecc46f6bc2a68cc2b4625"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 10 locations): source/coreml-proto.js:14317 \u00B7 source/coreml-proto.js:14373 \u00B7 source/coreml-proto.js:14429 \u00B7 source/coreml-proto.js:14485 \u00B7 \u002B6 more site(s) not listed \u2014 all 10 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml-proto.js"},"region":{"startLine":14317}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9fd86f3232769ffbf9a3f822278d1662f8bf56885ae050de2f2b596fbb92f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): source/darknet.js:780 \u00B7 source/hailo.js:109 \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":"source/darknet.js"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c431eda3fd45f3c30cb1880cff7b5519358df16c43d087c6b6b1476e7c6284"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): source/dnn-proto.js:39 \u00B7 source/dnn-proto.js:98 \u00B7 source/dnn-proto.js:247 \u00B7 source/dnn-proto.js:334 \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":"source/dnn-proto.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b43738855f22f51837d79101eb8af2eb1c9f83d8e30e32d83615ed67de6a556"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): source/executorch.js:182 \u00B7 source/executorch.js:642 \u00B7 source/executorch.js:899 \u00B7 source/executorch.js:1221 \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":"source/executorch.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"8491b1662dcfad89052ca3cc804512157ffea36bf0396a203946ed02ab66ea04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): source/flax.js:89 \u00B7 source/mediapipe.js:183 \u00B7 source/numpy.js:90 \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":"source/flax.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1989389d7c2e434ea1e1956bd4d00815404221bf77c6b6d2f41df37a22f1363"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): source/gguf.js:730 \u00B7 source/pickle.js:243 \u2014 the two spans are one implementation copied and then locally edited \u2014 87 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":"source/gguf.js"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fe252e66bf2de71781a7d81c748d9eab3638a3be4371ff247a2557837509bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): source/gguf.js:730 \u00B7 source/sklearn.js:249 \u2014 the two spans are one implementation copied and then locally edited \u2014 87 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":"source/gguf.js"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00ecdd8bdcf25bb4b66a4539c77c0acd2078c5fae242e27c216b2fdadbd42a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): source/gguf.js:730 \u00B7 source/tnn.js:353 \u2014 the two spans are one implementation copied and then locally edited \u2014 76 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":"source/gguf.js"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"141f3538fbb45d882907a59d1d01b8b56697aab4b5360bd5fb364ca41b67e4b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): source/grapher.js:543 \u00B7 source/grapher.js:614 \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":"source/grapher.js"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"b003d1791002c5b8ca2e2c41085849d4cc1061f9c110d4bd8ef66dda44a2b702"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): source/keras.js:658 \u00B7 source/python.js:5675 \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":"source/keras.js"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8552883421081e70f3a102062917b396b84a8b06f3be3791f66392f0b183d7d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5 locations): source/mindir-proto.js:246 \u00B7 source/nnabla-proto.js:7990 \u00B7 source/onnx-proto.js:1991 \u00B7 source/onnx-proto.js:2095 \u00B7 \u002B1 more site(s) not listed \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mindir-proto.js"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f8999d3c348c45efaf7198943474c6b99641d4925a618b6e8c3e931eca3b61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): source/mlir.js:244 \u00B7 source/mlir.js:281 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d594265b5a55102f0bf43bab48c90f4e9acad33251f95f1d8c6dd4791549bdf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): source/mlir.js:794 \u00B7 source/mlir.js:860 \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":"source/mlir.js"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"765fe1b27e83fd423b93ce4f80c743d92e24a89b202aa48c196ae425a3b6c0c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): source/mlir.js:3233 \u00B7 source/mlir.js:5438 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":3233}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cede5164ba7653df35917739ddb874720cf25b689bf82cecac17071b0e29264"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): source/mlir.js:3327 \u00B7 source/mlir.js:3360 \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":"source/mlir.js"},"region":{"startLine":3327}}}],"partialFingerprints":{"codehealthFindingId/v1":"4010f4b567154c29915b2f762154ae4d608af86dcc394e9e0a4803c313fc6453"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): source/mlir.js:11852 \u00B7 source/mlir.js:19550 \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":"source/mlir.js"},"region":{"startLine":11852}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d23fbb2015e47d55ed3336e4eac2e1a9f5e28d8e60aa6efdb97a1511146761a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): source/mlir.js:13478 \u00B7 source/mlir.js:13494 \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":"source/mlir.js"},"region":{"startLine":13478}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7e9e7c85c12a5b55f2d4c65aae1a78a5e5be83d130357f7413ca1d7a128f75"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): source/mlir.js:16771 \u00B7 source/mlir.js:16786 \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":"source/mlir.js"},"region":{"startLine":16771}}}],"partialFingerprints":{"codehealthFindingId/v1":"948f665107ec81906cd3c093ed4f902ac121553d08116816b2251c33dd91ec2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): source/mlir.js:20364 \u00B7 source/mlir.js:20432 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":20364}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b8166706c4a3042c5bae4f3ab0c4e2a9fa4b25d8c1d0800dd40cfe0e21ca9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): source/mlir.js:25035 \u00B7 source/mlir.js:25057 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":25035}}}],"partialFingerprints":{"codehealthFindingId/v1":"829f48d1eee0224c378ee2de9133d1f474c7f6e1fafcb231d02d12e400998c53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): source/mlir.js:26255 \u00B7 source/mlir.js:27440 \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":"source/mlir.js"},"region":{"startLine":26255}}}],"partialFingerprints":{"codehealthFindingId/v1":"242c0281a0c175d4b7c12ddaed0e63da1f4317ed626ad477690c69598133ac5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 8 locations): source/mslite-schema.js:126 \u00B7 source/mslite-schema.js:1088 \u00B7 source/mslite-schema.js:2741 \u00B7 source/mslite-schema.js:2955 \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":"source/mslite-schema.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48b18266555e8c6ccfd0d23fdda6cec9561fb724009d47bdc4708fea1a2f1ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): source/mslite-schema.js:687 \u00B7 source/mslite-schema.js:2227 \u00B7 source/mslite-schema.js:2341 \u00B7 source/mslite-schema.js:3775 \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":"source/mslite-schema.js"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc9fe7b05f9bca7635a08f55f973788d063459b34174e81b19a4d6bbab290e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): source/mslite-schema.js:4550 \u00B7 source/onnx-schema.js:419 \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":"source/mslite-schema.js"},"region":{"startLine":4550}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8a9d5bd6b75fb32661b323eb86b6d2a0d4045331be0560003b812cdc8a5bb0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): source/ncnn.js:500 \u00B7 source/ncnn.js:721 \u00B7 source/ncnn.js:764 \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":"source/ncnn.js"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aee04d010044bfdffc6c1b8a6213049f8f1d586c09db2aef9a9ece32e71c13b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 20 locations): source/nnabla-proto.js:5264 \u00B7 source/nnabla-proto.js:6492 \u00B7 source/nnabla-proto.js:6825 \u00B7 source/nnabla-proto.js:6917 \u00B7 \u002B16 more site(s) not listed \u2014 all 20 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/nnabla-proto.js"},"region":{"startLine":5264}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10cb3bb7c1d79e9f6b2c26ad51a291170b5c82418ec307309b5626e7992b734"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): source/nnabla-proto.js:5638 \u00B7 source/nnabla-proto.js:6445 \u00B7 source/nnabla-proto.js:8592 \u00B7 source/nnabla-proto.js:10948 \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":"source/nnabla-proto.js"},"region":{"startLine":5638}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bf922b6de463abe10053702942dccc950a190e9ae1b9752757043e2f290483"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): source/nnabla.js:268 \u00B7 source/pytorch.js:2783 \u2014 the two spans are one implementation copied and then locally edited \u2014 82 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/nnabla.js"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe724421991b441774992836741d5e6d7923be5e3088c38f44ce673d8ab192a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): source/nnabla.js:180 \u00B7 source/tf.js:834 \u2014 the two spans are one implementation copied and then locally edited \u2014 93 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":"source/nnabla.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a0535626a6cbcb6982169633735b6badc0f59589be734330346482bbb56cad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): source/om-proto.js:478 \u00B7 source/om-proto.js:664 \u00B7 source/om-proto.js:971 \u00B7 source/om-proto.js:1039 \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":"source/om-proto.js"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93b21b45b5ec2a16009405070dcca71fbc1f767ce288fb5ebf30113f1f84bfd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 12 locations): source/onnx-proto.js:157 \u00B7 source/onnx-proto.js:305 \u00B7 source/onnx-proto.js:425 \u00B7 source/onnx-proto.js:657 \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":"source/onnx-proto.js"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"5676c30d5d0e8e0c2eeae21ab4d7ce946a094ffaeeb7286c3439cbe14e5620bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 6 locations): source/onnx-proto.js:789 \u00B7 source/onnx-proto.js:1158 \u00B7 source/onnx-proto.js:1637 \u00B7 source/onnx-proto.js:1829 \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":"source/onnx-proto.js"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13ef1412dd52ea14b3ceb80e671c019d24cf5b535afaa3dc211edbf87efd41c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): source/openvino.js:510 \u00B7 source/openvino.js:525 \u2014 both copies are in the same file, so extract the block 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":"source/openvino.js"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3b10114357e42947982145c3a2110f5039688f1847a056e4f884d8d8519091"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): source/paddle-schema.js:29 \u00B7 source/paddle-schema.js:136 \u2014 both copies are in the same file, so extract the block 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":"source/paddle-schema.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d3c0f3c6125d61fb067dc649186d1dfa9177af248585f2b82b9807a5183890"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): tools/flatc.js:904 \u00B7 tools/protoc.js:1127 \u2014 the two spans are one implementation copied and then locally edited \u2014 100 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":"tools/flatc.js"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3301ea750ca1cbbd8bc66f2f4479ad1271f6b4a12f6d6fb3ace91de7efc8b11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): source/barracuda.js:176 \u00B7 source/pickle.js:247 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 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":"source/barracuda.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"094199610cfbb62a8c359b488f78f21fe27e1156c498ef2bb6d8a2dfec930510"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): source/bigdl-proto.js:96 \u00B7 source/bigdl-proto.js:516 \u00B7 source/bigdl-proto.js:582 \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":"source/bigdl-proto.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c17c0534044881f6396731c34c904d708cacdb5c4445b4c319d3da57ae59c6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/bigdl-proto.js:297 \u00B7 source/litertlm-proto.js:962 \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":"source/bigdl-proto.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"369f641dbeee24389c96436f4d33d02069fcaf82008dc5cca8c26f6c6e0dcae5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 29 locations): source/caffe-proto.js:738 \u00B7 source/caffe-proto.js:915 \u00B7 source/caffe-proto.js:984 \u00B7 source/caffe-proto.js:2216 \u00B7 \u002B25 more site(s) not listed \u2014 the 29 copies are spread across 6 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":"source/caffe-proto.js"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e00e29f6b6192adcb242ba3a0dfd96755d3baa920239ec84390c40b2434d5f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 35 locations): source/caffe-proto.js:827 \u00B7 source/caffe-proto.js:5186 \u00B7 source/coreml-proto.js:2020 \u00B7 source/coreml-proto.js:2610 \u00B7 \u002B31 more site(s) not listed \u2014 the 35 copies are spread across 5 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":"source/caffe-proto.js"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c02e3827a30ad64a1c65a7c38babb9a69e0fb918db65dca1ea2c40ce125d35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 34 locations): source/caffe-proto.js:918 \u00B7 source/caffe-proto.js:1804 \u00B7 source/caffe-proto.js:1850 \u00B7 source/caffe-proto.js:3005 \u00B7 \u002B30 more site(s) not listed \u2014 the 34 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":"source/caffe-proto.js"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f2258d00b28150d7f837b5d2629ffa40d1ca3668bd084c5a6cf82f914f8c0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 116 locations): source/caffe-proto.js:1043 \u00B7 source/caffe-proto.js:1585 \u00B7 source/caffe-proto.js:1701 \u00B7 source/caffe-proto.js:1801 \u00B7 \u002B112 more site(s) not listed \u2014 the 116 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cf08745d5f623f9d144b5025e076e97959bb305eeb4fd18636ccb074d6f94c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 14 locations): source/caffe-proto.js:1455 \u00B7 source/caffe-proto.js:1952 \u00B7 source/caffe-proto.js:2602 \u00B7 source/caffe-proto.js:3956 \u00B7 \u002B10 more site(s) not listed \u2014 the 14 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":"source/caffe-proto.js"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"daac8b5225b4b763b5ec4223a19dd8d98b8b817dda629cba7c8303ba64f6191d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 73 locations): source/caffe-proto.js:1797 \u00B7 source/caffe-proto.js:1843 \u00B7 source/caffe-proto.js:1995 \u00B7 source/caffe-proto.js:2700 \u00B7 \u002B69 more site(s) not listed \u2014 the 6 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7151d3809af7bff7f3a92ef4a923c0c2edef6cc32c239feaec2d2b16926032"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 10 locations): source/caffe-proto.js:2002 \u00B7 source/nnabla-proto.js:5309 \u00B7 source/nnabla-proto.js:6393 \u00B7 source/nnabla-proto.js:6775 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 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":"source/caffe-proto.js"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"09867231f5b97b93ba65ef7d4e87b81aa1bb486000fc5bc3683ba30c2cdfed88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 45 locations): source/caffe2-proto.js:108 \u00B7 source/coreml-proto.js:167 \u00B7 source/coreml-proto.js:738 \u00B7 source/coreml-proto.js:1037 \u00B7 \u002B41 more site(s) not listed \u2014 the 45 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":"source/caffe2-proto.js"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb96c11ab9f0c2ac858b53ae06ce58ee582618c03ccf9d057f588f5ea5969dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4 locations): source/caffe2-proto.js:254 \u00B7 source/caffe2-proto.js:650 \u00B7 source/paddle-proto.js:627 \u00B7 source/paddle-proto.js:720 \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":"source/caffe2-proto.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"54eed738b9f9a418bc01a325e9f56db039f4235fd9cd37dd71502b02bc0f8c28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/circle-schema.js:3581 \u00B7 source/circle-schema.js:3598 \u2014 both copies are in the same file, so extract the block 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":"source/circle-schema.js"},"region":{"startLine":3581}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe037f9556b8c47a25d98dcdd0302980c9a634d044b68840289f03368eab62df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): source/cntk-proto.js:159 \u00B7 source/litertlm-proto.js:301 \u00B7 source/litertlm-proto.js:989 \u2014 the 3 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":"source/cntk-proto.js"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e49c105c4b9809ee1482d9f5b4b390ff44c06a212d62caace52558295f31f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 19 locations): source/cntk-proto.js:208 \u00B7 source/coreml-proto.js:1493 \u00B7 source/coreml-proto.js:1534 \u00B7 source/coreml-proto.js:1575 \u00B7 \u002B15 more site(s) not listed \u2014 the 19 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":"source/cntk-proto.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce0294e36246102be460b9cfd7bfa4ca5c5c141688a29c88a5e5bd1fef5b6f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/coreml-proto.js:236 \u00B7 source/mindir-proto.js:602 \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":"source/coreml-proto.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d050fc861fd8464911ae055d528e38cfa2a8da75abdd8577eabc67dc13ea8997"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 126 locations): source/coreml-proto.js:284 \u00B7 source/coreml-proto.js:441 \u00B7 source/coreml-proto.js:1676 \u00B7 source/coreml-proto.js:1763 \u00B7 \u002B122 more site(s) not listed \u2014 the 126 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml-proto.js"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"f340b39bda3aa96687b8cb014effa5e79aee3ce2c8c83f3e080886fc2f4c9028"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 10 locations): source/coreml-proto.js:1246 \u00B7 source/coreml-proto.js:2104 \u00B7 source/coreml-proto.js:2849 \u00B7 source/coreml-proto.js:3272 \u00B7 \u002B6 more site(s) not listed \u2014 all 10 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml-proto.js"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b034b09b210f3cf81194617390a794cf6beb90a153a7c055589260ceab41685"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 7 locations): source/coreml-proto.js:2049 \u00B7 source/coreml-proto.js:3329 \u00B7 source/coreml-proto.js:10198 \u00B7 source/coreml-proto.js:10629 \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":"source/coreml-proto.js"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33c09c46db3be674b08edd0435819afe26715ceee8f220563db103cf13c038d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6 locations): source/coreml-proto.js:2413 \u00B7 source/coreml-proto.js:17420 \u00B7 source/coreml-proto.js:17461 \u00B7 source/coreml-proto.js:17543 \u00B7 \u002B2 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":"source/coreml-proto.js"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a1cfdb0681ff8d7c26d6dcae48a5ecad97fa0a36f1108d1f54678682275493"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 10 locations): source/coreml-proto.js:2895 \u00B7 source/coreml-proto.js:4441 \u00B7 source/coreml-proto.js:4554 \u00B7 source/coreml-proto.js:4623 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 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":"source/coreml-proto.js"},"region":{"startLine":2895}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f8b51825b304d5882d6920b706925d1c5f5d2ad816512ba589de52aba5ca72"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5 locations): source/coreml-proto.js:4198 \u00B7 source/coreml-proto.js:4262 \u00B7 source/coreml-proto.js:4326 \u00B7 source/coreml-proto.js:4480 \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":"source/coreml-proto.js"},"region":{"startLine":4198}}}],"partialFingerprints":{"codehealthFindingId/v1":"2984bf76973e6341cc7ec834d927367d269e5a09ad199b7f0e7df4780cc28930"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5 locations): source/coreml-proto.js:4224 \u00B7 source/coreml-proto.js:4288 \u00B7 source/coreml-proto.js:4352 \u00B7 source/coreml-proto.js:4509 \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":"source/coreml-proto.js"},"region":{"startLine":4224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e85ad12cd0715634fa67cb564b3ee9fb1182097c25cecd872eb653cf73bb1d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 8 locations): source/coreml-proto.js:6614 \u00B7 source/coreml-proto.js:8596 \u00B7 source/coreml-proto.js:12086 \u00B7 source/coreml-proto.js:12261 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 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":"source/coreml-proto.js"},"region":{"startLine":6614}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0fa3d662351c6cb67ccdaef12198341e3f9b4ae75002a21d4ee4ffc3bc89b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5 locations): source/coreml-proto.js:12089 \u00B7 source/coreml-proto.js:12264 \u00B7 source/coreml-proto.js:13612 \u00B7 source/coreml-proto.js:14902 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"source/coreml-proto.js"},"region":{"startLine":12089}}}],"partialFingerprints":{"codehealthFindingId/v1":"d387c69f2a145448ae9d0a40eca0feb841553d7ed3c655134bcdf917651af7c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/dnn.js:16 \u00B7 source/mindir.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":"source/dnn.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"009879b935614b3e2f14874acf8e90762b208bbf62bcdd547a7bb0b6fee1a674"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): source/espdl.js:99 \u00B7 source/sklearn.js:113 \u2014 the two spans are one implementation copied and then locally edited \u2014 84 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":"source/espdl.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"217550ccd823b816c3fe7bac4f96d4510813824a47ba4abed5b5135a1a298556"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 19 locations): source/executorch-schema.js:973 \u00B7 source/executorch-schema.js:991 \u00B7 source/executorch-schema.js:1009 \u00B7 source/executorch-schema.js:1027 \u00B7 \u002B15 more site(s) not listed \u2014 all 19 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/executorch-schema.js"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"9792f47e3c283d76b3b1f8cc7c25453ecbbb39d978a54274256d2d88dddddcb3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/executorch.js:633 \u00B7 source/executorch.js:889 \u2014 both copies are in the same file, so extract the block 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":"source/executorch.js"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb615c4a7ee7d0af35830a728932b76e5742dc8a274cd765ae21f500c9fba257"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): source/executorch.js:1116 \u00B7 source/executorch.js:1290 \u00B7 source/executorch.js:1315 \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":"source/executorch.js"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d8a690407e2dae464bbde91b31db323385825014f57a0271a9cf2cde6cbfaa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): source/gguf.js:730 \u00B7 source/pytorch.js:972 \u2014 the two spans are one implementation copied and then locally edited \u2014 83 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":"source/gguf.js"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"61651ae068d09ce4af81cdee436bfe6d196b49b41e8c86d5b8e3e089ca23e296"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): source/gguf.js:734 \u00B7 source/safetensors.js:144 \u2014 the two spans are one implementation copied and then locally edited \u2014 73 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":"source/gguf.js"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b0b2a9c541df9fef2f7891224e0d179baf42780ec07073831f01263114f7c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/hdf5.js:1323 \u00B7 source/hdf5.js:1411 \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":"source/hdf5.js"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72ebf5b9627a7896d3fcb1a0c7509231817f3b38108a2274903b73e2fffdb9a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): source/kmodel.js:146 \u00B7 source/lasagne.js:141 \u00B7 source/ncnn.js:873 \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":"source/kmodel.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1e6b74c51f8be38ea48e03a2bc240e932e255a0b101c58eeeba505fc317893"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/kmodel.js:752 \u00B7 source/kmodel.js:776 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/kmodel.js"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c1a838e87643489be72c15dfdcd4793276142c6f3ffc93057bea4c703a00b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/kmodel.js:1592 \u00B7 source/kmodel.js:1693 \u2014 both copies are in the same file, so extract the block 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":"source/kmodel.js"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"394a95c55ba3dbdf7be23c4554cd6490af7bb7c92491d67e394b1eeda987949b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 8 locations): source/litertlm-proto.js:18 \u00B7 source/litertlm-proto.js:50 \u00B7 source/litertlm-proto.js:574 \u00B7 source/litertlm-proto.js:648 \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":"source/litertlm-proto.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8615a5864e1464ad57cc1f3e2b12ef99e4a77b422fc3a50bb7cd9bd467783c24"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): source/litertlm-proto.js:614 \u00B7 source/litertlm-proto.js:761 \u00B7 source/litertlm-proto.js:871 \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":"source/litertlm-proto.js"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57e0de4def7af1d8a244793a41f0291de7b4061b33091996a7a0fa317a6b91a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/mlir.js:1471 \u00B7 source/mlir.js:1565 \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":"source/mlir.js"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"a942a07e729bb5490bdbd1bebad793b0f72948c35704d06bd338f9989ca94885"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/mlir.js:9763 \u00B7 source/mlir.js:9783 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":9763}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8a8bf29cd6474a65e3051d1efc69b840a48c23186c4053572fb2d234ee2e38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/mlir.js:11951 \u00B7 source/mlir.js:19648 \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":"source/mlir.js"},"region":{"startLine":11951}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60e0b2d5350aa0e0e852d87f237f23552cfdef70d03195ba22713b0ef5b981d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/mlir.js:13443 \u00B7 source/mlir.js:14235 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":13443}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee3108507e5397c9601056f23b0607c101571bfa8626fc648db35de801b37ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/mlir.js:13869 \u00B7 source/mlir.js:13884 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":13869}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f2613df8ab2df16f46a3689f88c7dc5804072277de45663e0e10cabd2e3587"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/mlir.js:14318 \u00B7 source/mlir.js:14392 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":14318}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c683ff3278b0e01f74ca1628fb4b693b5483345860e27db35c1850c7ed4f0b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/mlir.js:15315 \u00B7 source/mlir.js:15354 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":15315}}}],"partialFingerprints":{"codehealthFindingId/v1":"758fd31f1f68404885d5e2317591ca8b84a6fc5f48e69b957caa1dd061a103f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): source/mlir.js:18836 \u00B7 source/mlir.js:18858 \u00B7 source/mlir.js:19313 \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":"source/mlir.js"},"region":{"startLine":18836}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a09627efd5f311de6f4fbcae0f4c42695ffc0a94b96d407c073958372eb6e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/mlir.js:20522 \u00B7 source/mlir.js:20592 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":20522}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7fcd2d472a4de6bfa85ff7cba83ef32fb7ff3e071b281498e37938e5698e86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/mlir.js:21517 \u00B7 source/mlir.js:21532 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":21517}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54eddea4a43ea5fb589c2eb58290efb6a9aa8938df785180883dd05c609cebc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/mlir.js:22859 \u00B7 source/mlir.js:22907 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":22859}}}],"partialFingerprints":{"codehealthFindingId/v1":"063b6bf085da8e5a5724d657598c8a29de8fe9842a65b756254a6b7f80cd94a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): source/mlir.js:23089 \u00B7 source/mlir.js:23144 \u00B7 source/mlir.js:23243 \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":"source/mlir.js"},"region":{"startLine":23089}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad68b46f04526fd768e743ece5fe5c071214798ba5c3edb8dda7b277a2349505"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/mlir.js:26568 \u00B7 source/mlir.js:26684 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":26568}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a111d5e1c7095dfa576a029f43743002c32dc7fe7836fdb199166736c33574"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/mlir.js:27793 \u00B7 source/mlir.js:27828 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":27793}}}],"partialFingerprints":{"codehealthFindingId/v1":"6311338dab95afb3b365c5b5a679fa473e332e7cd44dc53799d5791ccfb40829"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/mlir.js:27808 \u00B7 source/mlir.js:28005 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":27808}}}],"partialFingerprints":{"codehealthFindingId/v1":"285ee02321fbcd73cf99dce7ea04340ccb25ceffa4ea314c69e2451d1274113c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/mlir.js:29048 \u00B7 source/mlir.js:29073 \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":"source/mlir.js"},"region":{"startLine":29048}}}],"partialFingerprints":{"codehealthFindingId/v1":"7011fc471cfa78e8035521f906d6e81f19b2b60d3ea44554390fa568485fda04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/mnn-schema.js:134 \u00B7 source/mnn-schema.js:2653 \u2014 both copies are in the same file, so extract the block 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":"source/mnn-schema.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d385f6137d5ad1b0f7e49457747dd0807908b2f653df9c4f7fa31908cd833f17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4 locations): source/mslite-schema.js:998 \u00B7 source/mslite-schema.js:1015 \u00B7 source/mslite-schema.js:3030 \u00B7 source/mslite-schema.js:3047 \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":"source/mslite-schema.js"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cdb2164c10c3489396d35b6df3713893c976351ee19abae4404bdd760948a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6 locations): source/nnabla-proto.js:663 \u00B7 source/nnabla-proto.js:2519 \u00B7 source/nnabla-proto.js:6051 \u00B7 source/nnabla-proto.js:8473 \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":"source/nnabla-proto.js"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"592f48af7ed900bb6a93f824e87a32e5cb23b1eb113989422a5826b7a0d28adc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): source/nnabla-proto.js:1046 \u00B7 source/nnabla-proto.js:2566 \u00B7 source/nnabla-proto.js:6443 \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":"source/nnabla-proto.js"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1aa635715a71797933482a0784ea1dac5b6532d5917de366454d20e8520418b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/paddle-proto.js:1013 \u00B7 source/paddle-proto.js:1065 \u2014 both copies are in the same file, so extract the block 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":"source/paddle-proto.js"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14895877edd68cf662ccfe810e3615f13e9fdaf8521320b957653f772151176"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/paddle-schema.js:287 \u00B7 source/paddle-schema.js:304 \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":"source/paddle-schema.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff75905bcf5955165e65b5f5f540b2862b0c882ed04b21c7d3e777979027dae3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): source/pickle.js:247 \u00B7 source/tengine.js:168 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 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":"source/pickle.js"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed664ad0e67e7c35caff5c2a8288faeac7e294005befc7560fc38a230491491d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): source/protobuf.js:949 \u00B7 source/protobuf.js:985 \u2014 both copies are in the same file, so extract the block 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":"source/protobuf.js"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"947cb61f4f1b8d784e0ee82ae0a6b5543a0481c005f7cb27f54ad2560081ae79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): source/pytorch.js:977 \u00B7 source/tflite.js:528 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 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":"source/pytorch.js"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6f867a4022c1e1fce608c93d018f9d08629187348ddabefcf26899fca0adeb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): source/qnn.js:243 \u00B7 source/tflite.js:528 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 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":"source/qnn.js"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c9bfedea479fb75879c734c8c7d9defa65586255a1c75c9022c26954b7e4c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): source/safetensors.js:142 \u00B7 source/tengine.js:166 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 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":"source/safetensors.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b1f9129e2de4c8fe02e92b4a0fe559b2c14bd8a46e39f59d497116cff45b37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): source/safetensors.js:144 \u00B7 source/tflite.js:528 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 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":"source/safetensors.js"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d061aa4a0dd7200f3910cd5d8471d8524c332ad602bc923d1792006b4305bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): source/sentencepiece.js:15 \u00B7 source/uff.js:22 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 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":"source/sentencepiece.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a984fd09b2ef49cb78818cddc9fadb3ea9da05e3cdfb6d8c49462ac7ed94099"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): source/sentencepiece.js:17 \u00B7 source/xmodel.js:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 82 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/sentencepiece.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe17c99cdbd50244bab83ab937a60e048ad3563d0ea51fa93ca4d3d8e70cd16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): source/sklearn.js:253 \u00B7 source/tengine.js:168 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 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":"source/sklearn.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb534abc67ad484caf0c42981abdd1f515de3491a7207783214335d1479e514b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): source/sklearn.js:139 \u00B7 source/xgboost.js:108 \u2014 the two spans are one implementation copied and then locally edited \u2014 101 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":"source/sklearn.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3751118261b0559b4e9222fb512d4311137ff9e67c819c8b730c399945a485"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 10 locations): source/barracuda.js:75 \u00B7 source/dlc.js:121 \u00B7 source/gguf.js:681 \u00B7 source/kann.js:130 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 copies are spread across 10 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":"source/barracuda.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aefc8c8dc1b5c2c2b87461587f8307004ba05d7744559a6fab6112d186be18a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/base.js:340 \u00B7 source/base.js:357 \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":"source/base.js"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1cb807ee29d1e2c3a7f59d459a600c47c3be0d8ca25a26a35281d7dcb893d3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/bigdl-proto.js:273 \u00B7 source/nnabla-proto.js:10520 \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":"source/bigdl-proto.js"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"896b25aaafb2f9e2ef289e3e4c3dd3080c12f8f05739f62de1f2be16e5f5e9a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 22 locations): source/caffe-proto.js:400 \u00B7 source/caffe2-proto.js:768 \u00B7 source/caffe2-proto.js:1270 \u00B7 source/caffe2-proto.js:1473 \u00B7 \u002B18 more site(s) not listed \u2014 the 22 copies are spread across 5 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":"source/caffe-proto.js"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"693c76ecb62d31ac845cee95a7ee4321e324bd72bdac9926095adf348bd3a652"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): source/caffe-proto.js:481 \u00B7 source/nnabla-proto.js:571 \u00B7 source/nnabla-proto.js:862 \u00B7 source/nnabla-proto.js:3187 \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":"source/caffe-proto.js"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"0daa5e7aae1686875b036c0b26dfcb8569d3c5e32a07f58af2520eea384dd8a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 11 locations): source/caffe-proto.js:990 \u00B7 source/caffe-proto.js:1707 \u00B7 source/caffe-proto.js:3605 \u00B7 source/dnn-proto.js:45 \u00B7 \u002B7 more site(s) not listed \u2014 the 11 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":"source/caffe-proto.js"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"d231ffe2d09d82beeb287bf1e4bd3ca72e8ea75df924571707a4c0e4ee74d26f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 16 locations): source/caffe-proto.js:1040 \u00B7 source/caffe-proto.js:2145 \u00B7 source/caffe-proto.js:3069 \u00B7 source/caffe-proto.js:3721 \u00B7 \u002B12 more site(s) not listed \u2014 the 16 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9ea45857194fd87a8ee9c8b413eb32ae78b6d4cb4c90ffee3963823a52a171"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 17 locations): source/caffe-proto.js:1261 \u00B7 source/caffe-proto.js:1929 \u00B7 source/caffe-proto.js:2573 \u00B7 source/caffe-proto.js:3927 \u00B7 \u002B13 more site(s) not listed \u2014 the 17 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"074410296c57dd7d7d1f0f74ce47e8dfcf4bb68e4dd2a4c04b765972cce13505"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 21 locations): source/caffe-proto.js:1547 \u00B7 source/caffe2-proto.js:254 \u00B7 source/caffe2-proto.js:415 \u00B7 source/caffe2-proto.js:522 \u00B7 \u002B17 more site(s) not listed \u2014 the 21 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a014b526232d929c745faeb8dd7009352787da1e3734457c446b0de155b0db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 23 locations): source/caffe-proto.js:1582 \u00B7 source/caffe2-proto.js:316 \u00B7 source/caffe2-proto.js:444 \u00B7 source/caffe2-proto.js:548 \u00B7 \u002B19 more site(s) not listed \u2014 the 23 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"895b1bc916ee5cc29d7d92ca21b68e5321e436f6622e38755380bcdc5d260138"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 11 locations): source/caffe-proto.js:1928 \u00B7 source/caffe-proto.js:3926 \u00B7 source/caffe-proto.js:4992 \u00B7 source/dnn-proto.js:65 \u00B7 \u002B7 more site(s) not listed \u2014 the 11 copies are spread across 5 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":"source/caffe-proto.js"},"region":{"startLine":1928}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc74b91cfc549a9891f3247a870fdc3ce3c7254caeb7f95166e2f1cecae2d21c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 19 locations): source/caffe-proto.js:2196 \u00B7 source/caffe-proto.js:2408 \u00B7 source/coreml-proto.js:6591 \u00B7 source/coreml-proto.js:8752 \u00B7 \u002B15 more site(s) not listed \u2014 the 19 copies are spread across 5 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":"source/caffe-proto.js"},"region":{"startLine":2196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7f09b984274e4d1105189148708abfab4007463e1831616788d25b30d72ab7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/caffe-proto.js:2762 \u00B7 source/nnabla-proto.js:11973 \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":"source/caffe-proto.js"},"region":{"startLine":2762}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8fce5a37ed96c076ffd70c7000d65b4d1b2e5480e7909b8a5b48f2aae64df5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 45 locations): source/caffe2-proto.js:55 \u00B7 source/coreml-proto.js:144 \u00B7 source/coreml-proto.js:604 \u00B7 source/coreml-proto.js:1011 \u00B7 \u002B41 more site(s) not listed \u2014 the 45 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":"source/caffe2-proto.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d93f7372cd67178593d30b9e6d6255b6d9f59b2975071791c58da521d83978"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): source/caffe2-proto.js:160 \u00B7 source/caffe2-proto.js:1057 \u00B7 source/paddle-proto.js:75 \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":"source/caffe2-proto.js"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"23eff1db2a3a7a86aa6e757b803b9a9d6807610711401c55102838e48c77113e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): source/caffe2-proto.js:797 \u00B7 source/mindir-proto.js:112 \u00B7 source/onnx-proto.js:133 \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":"source/caffe2-proto.js"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"750814d48500105c47f2840a583c57bca501892f91fca92eb5d35667d430bcd7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5 locations): source/cntk-proto.js:90 \u00B7 source/litertlm-proto.js:81 \u00B7 source/litertlm-proto.js:212 \u00B7 source/litertlm-proto.js:299 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"source/cntk-proto.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1062ac478e3b7d842fbb969ea61f1deb29c7e48f6ece26e445c71480b5280a00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/cntk.js:815 \u00B7 source/cntk.js:828 \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":"source/cntk.js"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"950951590e0768ff299fbb4c15dd7c4ea20dba1f480695697a05f5acd4f7ea01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/cntk.js:987 \u00B7 source/kmodel.js:1197 \u2014 the 2 copies are spread across 2 files, 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":"source/cntk.js"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86a44e64e5a220bdac58dbef8c33ac0e82ed46344cbe3d723b9024b25563e35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/coreml-proto.js:861 \u00B7 source/paddle-proto.js:479 \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":"source/coreml-proto.js"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"67db5260b0c150ed2cdc84766bd7ae498307762013bbff3f8563c812dde21ef8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/coreml-proto.js:915 \u00B7 source/coreml-proto.js:1274 \u2014 both copies are in the same file, so extract the block 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":"source/coreml-proto.js"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1792f9181d751f302b32ad16d00dbcb1511b4d72afb7b0c9d098258f8267e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 14 locations): source/coreml-proto.js:1225 \u00B7 source/coreml-proto.js:2086 \u00B7 source/coreml-proto.js:2831 \u00B7 source/coreml-proto.js:3110 \u00B7 \u002B10 more site(s) not listed \u2014 the 14 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":"source/coreml-proto.js"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0af8d76dc4923ccc61372ddbfc210da2b9a9aeb53532262ca8cdb8f6793d01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 32 locations): source/coreml-proto.js:1555 \u00B7 source/coreml-proto.js:1596 \u00B7 source/coreml-proto.js:1637 \u00B7 source/coreml-proto.js:1724 \u00B7 \u002B28 more site(s) not listed \u2014 the 32 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":"source/coreml-proto.js"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6dc4a2c0836bea2a95560c5c9eae41cdbf15d779041df66f1fbcdbb1a45341"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): source/coreml-proto.js:4291 \u00B7 source/coreml-proto.js:4512 \u00B7 source/coreml-proto.js:9752 \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":"source/coreml-proto.js"},"region":{"startLine":4291}}}],"partialFingerprints":{"codehealthFindingId/v1":"961fd1cc2373f7753b28693de8e8791ff3a627c6a3c2c4356b909c3f98aecad7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/coreml-proto.js:4802 \u00B7 source/coreml-proto.js:4848 \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":"source/coreml-proto.js"},"region":{"startLine":4802}}}],"partialFingerprints":{"codehealthFindingId/v1":"07add3ec2c7af4426f4d9f3e12ea5a7c2b418106074f945552c7302cccf9aa70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): source/coreml-proto.js:6645 \u00B7 source/om-proto.js:930 \u00B7 source/onnx-proto.js:2367 \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":"source/coreml-proto.js"},"region":{"startLine":6645}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cfb2b87e2ec091a6c1aaed4a77e9657c21cbccb4f420e409feda7243eec249"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): source/coreml-proto.js:17922 \u00B7 source/paddle-proto.js:259 \u00B7 source/paddle-proto.js:580 \u2014 the 3 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":"source/coreml-proto.js"},"region":{"startLine":17922}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d5640a474f1557c8e6f08a1f809c79a542749209729a142f5f764156a77eb7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/dagre.js:1281 \u00B7 source/dagre.js: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dagre.js"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cd0718e5515ade3c12bd4a833228d0013d6f1c2a7a5818b4aa9380001c7e2d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/dot.js:201 \u00B7 source/mindir.js:199 \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":"source/dot.js"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b722420035a7a41b3545edbf80bf300ee8ac91e4ea339a0079295ded8fd52bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/executorch.js:734 \u00B7 source/executorch.js:958 \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":"source/executorch.js"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fb45a518197a9e5af8f36f66182c1a8b4f8e23e98b1de900d59837ef78f9cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/flatbuffers.js:167 \u00B7 source/flatbuffers.js:181 \u2014 both copies are in the same file, so extract the block 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":"source/flatbuffers.js"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1cd4b002203422f9901982cb5f095a28440a7b01332f906281698fd4c8ac1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/gguf.js:427 \u00B7 source/gguf.js:528 \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":"source/gguf.js"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"a887bc8a4c6eee7a8098d1da30c8e4696eb75b4ab243e619b104a8039d4aa62c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): source/gguf.js:780 \u00B7 source/tensorrt.js:61 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 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":"source/gguf.js"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"26305bae27fcbcd135d3877781b236ad6623dabc2a3db4874a65f7bf9e33b71e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/grapher.js:436 \u00B7 source/grapher.js:840 \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":"source/grapher.js"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4a736ffd6eb709bf4368a8f6098828f686f40d8fa8e8ba3e120eaa7f8d4691"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): source/imgdnn.js:20 \u00B7 source/tensorrt.js:29 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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":"source/imgdnn.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddb25551d563b6da98e973cde634e77a60b588332207bfba0f285bac93d8aaf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/keras.js:240 \u00B7 source/keras.js:254 \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":"source/keras.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58c2d8adb63259b1ab95766111e635a1ed43259ab1daded8fd00ee3654ce4ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/megengine.js:411 \u00B7 source/mlir.js:469 \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":"source/megengine.js"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eee692d78f4c2346bfcca68ad4a2517ad5e585270bcae1d6ae555131487c168"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5 locations): source/mindir-proto.js:805 \u00B7 source/mindir-proto.js:818 \u00B7 source/onnx-proto.js:416 \u00B7 source/onnx-proto.js:1311 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"source/mindir-proto.js"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"e301d79dc2a3da60908537e69d9b37f2e6c70431b96ca72fefc2867ca6da7434"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/mlir.js:8219 \u00B7 source/mlir.js:8274 \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":"source/mlir.js"},"region":{"startLine":8219}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65eaca8949bde9a5caf35a630d299430c7f0c1443a7b516da4d7c5d1e7bebca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): source/mlir.js:14357 \u00B7 source/mlir.js:16446 \u00B7 source/mlir.js:16544 \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":"source/mlir.js"},"region":{"startLine":14357}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc36a0978625c4f3d0372aa12b9a757bda623f8db7bef29dcacc81af6612746d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/mlir.js:15765 \u00B7 source/mlir.js:15784 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":15765}}}],"partialFingerprints":{"codehealthFindingId/v1":"184061ba8b29bc6f36e4a37c4b854e038f2668a3f53e15375c717a2dfc71773b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/mlir.js:17577 \u00B7 source/mlir.js:17631 \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":"source/mlir.js"},"region":{"startLine":17577}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a41df405e6bab2b480c64d0f8943e91d1e14bf9af89c73034ce92a0f4e41f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/mlir.js:22762 \u00B7 source/mlir.js:22821 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":22762}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ddf1dc286eb88c0df8e1bd47f3b5556d528ed6332e2b97363f68d54f8417a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/mlir.js:25117 \u00B7 source/mlir.js:27495 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":25117}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa08fe6c8896615604fa3b1f38550292197f434bed21495f59d3b2055410d081"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/mlir.js:27380 \u00B7 source/mlir.js:27403 \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":"source/mlir.js"},"region":{"startLine":27380}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e7fd80cc5e0372260b781175eca8abd054451b0e89ead9d82979caaea1de2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/mlir.js:28968 \u00B7 source/mlir.js:28988 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":28968}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7a96447f4680e309685ff12272febbe703d725b4fc4717be89c9a1ed087916"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): source/mlnet.js:529 \u00B7 source/mlnet.js:549 \u00B7 source/mlnet.js:569 \u00B7 source/mlnet.js:585 \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":"source/mlnet.js"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a38b1128197a451c430c890c91566ac765a1891087c9cedfb068e197b19386"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/mnn.js:248 \u00B7 source/mslite.js:170 \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":"source/mnn.js"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e233ab39320bcd83c4bd2d452fb2a83dbc60b158a49251e6b93f1069b72bed9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): source/ncnn.js:447 \u00B7 source/ncnn.js:477 \u00B7 source/ncnn.js:735 \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":"source/ncnn.js"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"95073cd9aa27863ccd33d3d4f40f3fd9040904b4b2583e0142bfd7c30ea62d0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/ncnn.js:532 \u00B7 source/ncnn.js:587 \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":"source/ncnn.js"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2e36bef31e24932b30cfb44a0424bcf54d01db24d26b561305706d27d8b966"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 9 locations): source/nnabla-proto.js:4963 \u00B7 source/nnabla-proto.js:5104 \u00B7 source/nnabla-proto.js:9952 \u00B7 source/nnabla-proto.js:10012 \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":"source/nnabla-proto.js"},"region":{"startLine":4963}}}],"partialFingerprints":{"codehealthFindingId/v1":"193ef1b337b4cdba6e435bd61ed3725f7df40649f67ccb7a7c40939c68bf32a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): source/om.js:294 \u00B7 source/openvino.js:823 \u2014 the two spans are one implementation copied and then locally edited \u2014 115 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":"source/om.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d821c9d503c27fd14b874b6dd32810ba67b83105195c3d530454f277745e02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/paddle-proto.js:179 \u00B7 source/paddle-proto.js:887 \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":"source/paddle-proto.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b50982540f21f799c26b9b02933f57080ae012e885bbe858b3daac2198d64b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/paddle-schema.js:162 \u00B7 source/paddle-schema.js:204 \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":"source/paddle-schema.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"9526b9ecb2956aebe44d392b04b7a20b1dbbce779c692291bc7f4fae0ad2ebf3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): source/paddle.js:609 \u00B7 source/tengine.js:168 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 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":"source/paddle.js"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"df88a4f99e9b2d0bb93d72952c36927774558e3c78e7ff7aa4e602e05f445e79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/python.js:2223 \u00B7 source/python.js:2238 \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":"source/python.js"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed160e5dc3d07be329e1b37c9605f45063cb3d311b9de3d45293dce9d859f0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): source/python.js:3996 \u00B7 source/python.js:4015 \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":"source/python.js"},"region":{"startLine":3996}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e3e15eb336e2af167942c894da546d5fcd6c18944117733e9ec60dac61fb40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): source/qnn.js:243 \u00B7 source/safetensors.js:144 \u2014 the two spans are one implementation copied and then locally edited \u2014 69 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":"source/qnn.js"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c0280067714ee966b874fb295754b6bb811c4dec868355c9e3208fb040e232"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): source/tflite.js:532 \u00B7 source/torch.js:214 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 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":"source/tflite.js"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"b093298bd4dcc6f4266defe96d4ae54a5d296d1ad268f6d052de777cf5cb8189"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 19 locations): source/armnn-schema.js:532 \u00B7 source/armnn-schema.js:754 \u00B7 source/armnn-schema.js:798 \u00B7 source/armnn-schema.js:1120 \u00B7 \u002B15 more site(s) not listed \u2014 the 19 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":"source/armnn-schema.js"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aadea3a76333a0dafb5bad14028cb428008f5bfe8b1c9f6900863aa2d019b0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): source/barracuda.js:176 \u00B7 source/tflite.js:528 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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":"source/barracuda.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"9946dbff31b75ea967ebfa8a7c4e9080ce2fd56e99ff8edcbe1a635060ea1f78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/base.js:111 \u00B7 source/base.js:133 \u2014 both copies are in the same file, so extract the block 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":"source/base.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2583bc97fd367d50845302ae77151ac348e74c23f8c7d1c0d49aac1968795f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 257 locations): source/bigdl-proto.js:54 \u00B7 source/bigdl-proto.js:216 \u00B7 source/bigdl-proto.js:379 \u00B7 source/bigdl-proto.js:391 \u00B7 \u002B253 more site(s) not listed \u2014 the 257 copies are spread across 13 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":"source/bigdl-proto.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"45273a6f77836dd84ee375f5672304f97696a146ad9375edec3081ed24007d53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 175 locations): source/bigdl-proto.js:377 \u00B7 source/caffe-proto.js:195 \u00B7 source/caffe-proto.js:230 \u00B7 source/caffe-proto.js:275 \u00B7 \u002B171 more site(s) not listed \u2014 the 175 copies are spread across 13 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":"source/bigdl-proto.js"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"3200885b5f7f4b9708e5651ffc0751521a86f89563d4aa0be43df88d5bc8137d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/bigdl-proto.js:427 \u00B7 source/keras-proto.js:71 \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":"source/bigdl-proto.js"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5024ff0f196315f2add30b60130ad0eb37d96d7c35f3cadf3fe41c033f1689"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/bigdl.js:286 \u00B7 source/hickle.js:153 \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":"source/bigdl.js"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"3672db0da15f3d3acc9f0eafa021a99e05c43799a04b995ab7dd165eb0b6651a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 80 locations): source/caffe-proto.js:1613 \u00B7 source/caffe-proto.js:1673 \u00B7 source/caffe-proto.js:1696 \u00B7 source/caffe-proto.js:1726 \u00B7 \u002B76 more site(s) not listed \u2014 the 80 copies are spread across 7 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":"source/caffe-proto.js"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a007115e6674a96e013f5bd574f510f93994b4e7adc4a79b3ad95f2c396d62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): source/caffe-proto.js:3885 \u00B7 source/nnabla-proto.js:10305 \u00B7 source/nnabla-proto.js:10358 \u2014 the 3 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":"source/caffe-proto.js"},"region":{"startLine":3885}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d8399eac0446306d109b1228ae2e0ba6277661395ef35b16720ab35684f70d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): source/caffe-proto.js:4503 \u00B7 source/caffe2-proto.js:942 \u00B7 source/mindir-proto.js:409 \u00B7 source/onnx-proto.js:352 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":4503}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfc95ff18e048f091d824ac53e359b20a31456c4827c6e1d61f5516c5a74fa6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6 locations): source/caffe-proto.js:5026 \u00B7 source/nnabla-proto.js:4572 \u00B7 source/nnabla-proto.js:4743 \u00B7 source/nnabla-proto.js:4891 \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":"source/caffe-proto.js"},"region":{"startLine":5026}}}],"partialFingerprints":{"codehealthFindingId/v1":"f652c6184f3f1af9bf67667e2e8242d6b1a5bfca96fbbf22497805ff65ea5a2d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 14 locations): source/caffe2-proto.js:191 \u00B7 source/caffe2-proto.js:322 \u00B7 source/caffe2-proto.js:694 \u00B7 source/caffe2-proto.js:1088 \u00B7 \u002B10 more site(s) not listed \u2014 the 14 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":"source/caffe2-proto.js"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f896426170f657cd6f8e12683c1a4a33569fd0997f6580155a3595a2fa3b64e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6 locations): source/caffe2-proto.js:275 \u00B7 source/caffe2-proto.js:668 \u00B7 source/caffe2-proto.js:1071 \u00B7 source/caffe2-proto.js:1130 \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":"source/caffe2-proto.js"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6e054b1b84b75df67304e07cbde171f6bbfda21d8a0b7428a390db1b846bea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): source/caffe2-proto.js:453 \u00B7 source/nnabla-proto.js:9904 \u00B7 source/nnabla-proto.js:11750 \u2014 the 3 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":"source/caffe2-proto.js"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"413e9e161504e96585cb755b4886f1caa113bda77e5b0846ddbec76a2db337fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): source/caffe2-proto.js:610 \u00B7 source/mindir-proto.js:800 \u00B7 source/onnx-proto.js:1306 \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":"source/caffe2-proto.js"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d911c1c036340f55291176f16c1a05c6c57a7d10f484e46d18aaf960b581e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 8 locations): source/caffe2-proto.js:1100 \u00B7 source/nnabla-proto.js:666 \u00B7 source/nnabla-proto.js:2522 \u00B7 source/nnabla-proto.js:6054 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 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":"source/caffe2-proto.js"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8674d9ae0c69d14241cc7429e264353983bdfd9b2c798bbeca3fb2de97f37a59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5 locations): source/circle-schema.js:2121 \u00B7 source/circle-schema.js:2304 \u00B7 source/circle-schema.js:2991 \u00B7 source/mnn-schema.js:1468 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"source/circle-schema.js"},"region":{"startLine":2121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0641d9c7598474f407a8d1190edfcd8c686adceb44ff0413d248d2b88577614"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5 locations): source/cntk-proto.js:253 \u00B7 source/om-proto.js:458 \u00B7 source/om-proto.js:596 \u00B7 source/om-proto.js:942 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"source/cntk-proto.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f1542c354886afc91f00ba0276a417c801cef7fc7b994e2bccb3c09db031e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6 locations): source/coreml-proto.js:209 \u00B7 source/coreml-proto.js:1349 \u00B7 source/coreml-proto.js:1390 \u00B7 source/coreml-proto.js:1431 \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":"source/coreml-proto.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"b885a6d497797268f1f5261a0c743abba8e73172ea2c8af42224641500a22a53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6 locations): source/coreml-proto.js:1040 \u00B7 source/coreml-proto.js:1128 \u00B7 source/coreml-proto.js:1196 \u00B7 source/coreml-proto.js:2898 \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":"source/coreml-proto.js"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"6225db7c01e81687a7eeeca26c9ee89c41667e6e6da6f5ca816d9e6c0b71b740"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6 locations): source/coreml-proto.js:1700 \u00B7 source/coreml-proto.js:12175 \u00B7 source/coreml-proto.js:14092 \u00B7 source/coreml-proto.js:15424 \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":"source/coreml-proto.js"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a473fe794f22db62b153aa656275f75abc7057be32febd4e50a77e7d6e667a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 13 locations): source/coreml-proto.js:1787 \u00B7 source/coreml-proto.js:6105 \u00B7 source/coreml-proto.js:6182 \u00B7 source/coreml-proto.js:6228 \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":"source/coreml-proto.js"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9065bf1a663251d03bd0c87ac169935a3204c7940a680099813a5eb279eace"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 17 locations): source/coreml-proto.js:2134 \u00B7 source/coreml-proto.js:2360 \u00B7 source/coreml-proto.js:2401 \u00B7 source/coreml-proto.js:2928 \u00B7 \u002B13 more site(s) not listed \u2014 the 17 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":"source/coreml-proto.js"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d2989f5528abff4ba0d93e1d73dbe5a309b36066be7ac6cf48845d0a4e1eea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 11 locations): source/coreml-proto.js:2877 \u00B7 source/coreml-proto.js:4423 \u00B7 source/coreml-proto.js:4536 \u00B7 source/coreml-proto.js:4596 \u00B7 \u002B7 more site(s) not listed \u2014 the 11 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":"source/coreml-proto.js"},"region":{"startLine":2877}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbda4d22a88002f4ff494d5d0b378e9284eea7c3b095e9d5af368c2bd60e7e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5 locations): source/coreml-proto.js:2948 \u00B7 source/coreml-proto.js:4227 \u00B7 source/coreml-proto.js:4291 \u00B7 source/coreml-proto.js:4512 \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":"source/coreml-proto.js"},"region":{"startLine":2948}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e173efef71c49c82a891ce3c36412555cfd267fa4bc81e456062691b105efe2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5 locations): source/coreml-proto.js:7646 \u00B7 source/coreml-proto.js:12049 \u00B7 source/coreml-proto.js:13708 \u00B7 source/coreml-proto.js:15152 \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":"source/coreml-proto.js"},"region":{"startLine":7646}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e252d31d994f35484f568bcf63f556787ca2bd5068fbfccce3db01da442e6f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): source/coreml-proto.js:17877 \u00B7 source/paddle-proto.js:220 \u00B7 source/paddle-proto.js:538 \u2014 the 3 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":"source/coreml-proto.js"},"region":{"startLine":17877}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a70e9523e3d47b35d610e28e346b813d7fae9dac0fa9995c6500b8b63551f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/darknet.js:130 \u00B7 source/darknet.js:163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/darknet.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"496c4a27aadd031da2fd0c632009cbee20ca21c46c34c350f52c4788c03ed8cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): source/dot.js:270 \u00B7 source/mindir.js:259 \u00B7 source/mslite.js:293 \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":"source/dot.js"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b37bd251485468a74d90e695c28010ac78108c92e17709aa15039227baa50f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/executorch-schema.js:281 \u00B7 source/executorch-schema.js:1458 \u2014 both copies are in the same file, so extract the block 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":"source/executorch-schema.js"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b48c3b83c487e24d88a32e00e2ef4420e2de8dc43eb4e5a6ba25a15af8d632"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/executorch-schema.js:946 \u00B7 source/executorch-schema.js:1500 \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":"source/executorch-schema.js"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"37aba69b6b9386f28f76de1608ec33dd245c4b1144198ecfd9d0557f47a1bb4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): source/executorch.js:326 \u00B7 source/executorch.js:719 \u00B7 source/executorch.js:943 \u00B7 source/executorch.js:1254 \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":"source/executorch.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e446ede2debeb9050cfa6690ed58f6fccbd7f099e27dc0ad5a339547d7763d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/hailo.js:205 \u00B7 source/lasagne.js:134 \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":"source/hailo.js"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"5660375d9b2e8ee9c5125b83f28c012a9c7c7a5d85b66334c676a2622a200e93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/hdf5.js:1353 \u00B7 source/hdf5.js:1379 \u2014 both copies are in the same file, so extract the block 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":"source/hdf5.js"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba415df36649940e2d08281aea95f19f441104c080f1b0462fcf375c0db6e6e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/keras.js:1238 \u00B7 source/numpy.js:145 \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":"source/keras.js"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"341f127b11089b265e30b77c5eec83d41120984ee443aede42d2c83987500ca3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/kmodel.js:450 \u00B7 source/kmodel.js:972 \u2014 both copies are in the same file, so extract the block 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":"source/kmodel.js"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd916619a08a731b88c408d755f932557f538feeddb9653ae78216fa428185a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/kmodel.js:1309 \u00B7 source/kmodel.js:1519 \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":"source/kmodel.js"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"8240386563a050754ffea2f773f1ed05c5f7c67a8ddcf162b1a0f92965760a2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): source/kmodel.js:1468 \u00B7 source/kmodel.js:1589 \u00B7 source/kmodel.js:1690 \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":"source/kmodel.js"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"9131fc4a109f0f675a01bdb41e61c6cbb47b80a21232cc60652ebed06881ba27"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/mlir.js:1373 \u00B7 source/mlir.js:1389 \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":"source/mlir.js"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"2254a7b0d980bc993ae33cf343165836630a0bca4758eff8bf5e00f561d3ba8c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/mlir.js:2549 \u00B7 source/mlir.js:2586 \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":"source/mlir.js"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ab2ca42904a58524ef1b5efdd59c89ec179776a01950cec9b08e5f925c1fea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/mlir.js:5827 \u00B7 source/mlir.js:5849 \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":"source/mlir.js"},"region":{"startLine":5827}}}],"partialFingerprints":{"codehealthFindingId/v1":"190701b8062686edc5c4d8ff2269743f34b87783dea14a57ca2532c5a5aac4ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/mlir.js:8572 \u00B7 source/mlir.js:8656 \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":"source/mlir.js"},"region":{"startLine":8572}}}],"partialFingerprints":{"codehealthFindingId/v1":"504a1218bb4726985761cb7a55b07175cd7cf45a6257032e70521f3e0cb9c741"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/mlir.js:10980 \u00B7 source/mlir.js:11049 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":10980}}}],"partialFingerprints":{"codehealthFindingId/v1":"0083bc68d19ae876ebb6ecb51e82be9068f39b785e35596161704051608f75fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/mlir.js:11378 \u00B7 source/mlir.js:11406 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":11378}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f706e17523b449e186221d86a9e062c2fa2fb94f3db1eceee64c54e52d5fd3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/mlir.js:11528 \u00B7 source/mlir.js:11576 \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":"source/mlir.js"},"region":{"startLine":11528}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d5485906fd2a4083e95994a9eb5ad5656b43fce90605d29e3d1f26ff1fc1ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): source/mlir.js:12077 \u00B7 source/mlir.js:15957 \u00B7 source/mlir.js:24331 \u2014 all 3 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":"source/mlir.js"},"region":{"startLine":12077}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbf617f628d616a44e66a2ee91269a41a1c8655e2bfcf63dc050378c059dd33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/mlir.js:17680 \u00B7 source/mlir.js:17718 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":17680}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7312afe489cb26b1aa001107fea760706b559dffc38a48f1a590d55f9894706"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/mlir.js:18244 \u00B7 source/mlir.js:18257 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":18244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f168cbae878b8a35a001cf058cd80e8da7eab8aa2680ae7cda95540c59915d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/mlir.js:18931 \u00B7 source/mlir.js:19045 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":18931}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b8fc4366bdfb940d5313b90c63f5dd1db70442c62781bd8565dba0ae67b4d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/mlir.js:19244 \u00B7 source/mlir.js:26437 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":19244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e772705ddf2167ecc286a2803dbed21e4c02ee338947c0879f3e6798795d840c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): source/mlir.js:19521 \u00B7 source/mlir.js:20525 \u00B7 source/mlir.js:20595 \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":"source/mlir.js"},"region":{"startLine":19521}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f70a8dd4223f6a44330738ef71c1696e599a86530e819e4536eb620a707ee3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): source/mlir.js:21505 \u00B7 source/mlir.js:21518 \u00B7 source/mlir.js:21533 \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":"source/mlir.js"},"region":{"startLine":21505}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5f5e6709f3e5378ddc3624eaf70008e57592a993911df8d0b62f6016594738"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/mlir.js:23822 \u00B7 source/mlir.js:23842 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":23822}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f934ac76480b9ba68dd6f0551f7363eab90e2cefdba01f2d0516091389379eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): source/mlir.js:25318 \u00B7 source/mlir.js:25332 \u00B7 source/mlir.js:25346 \u00B7 source/mlir.js:25369 \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":"source/mlir.js"},"region":{"startLine":25318}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fe04afb1cd1697b4570b30ac5fd9dbc25d7178cdb65e5303ebc77c243ab585"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/mlir.js:26864 \u00B7 source/mlir.js:26966 \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":"source/mlir.js"},"region":{"startLine":26864}}}],"partialFingerprints":{"codehealthFindingId/v1":"f551bf62c170ad27fa1cb3979325474ef5e9bcbaac392480457bfef6239a98c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/mlir.js:28326 \u00B7 source/mlir.js:28351 \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":"source/mlir.js"},"region":{"startLine":28326}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef278bd6f01525ff63510d0097087c9d773b12190e99087b8b3f5fdfe58336f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): source/mlir.js:28711 \u00B7 source/mlir.js:28818 \u00B7 source/mlir.js:28854 \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":"source/mlir.js"},"region":{"startLine":28711}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3b2f961bba95c8f475fb72da0ff6ea414a1d12ffb40cccc17f007341c43650"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/mlnet.js:680 \u00B7 source/mlnet.js:724 \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":"source/mlnet.js"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"2442e15f8b41d79c80eda3fed81d0ef0b0f7fce250822fb1eeb4594de8b69b64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/mlnet.js:1578 \u00B7 source/mlnet.js:1668 \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":"source/mlnet.js"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"b382571d7a189cfad0c53ed394c25057b880621d3a386480ccde1e1b95d62c9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 11 locations): source/mslite-schema.js:744 \u00B7 source/mslite-schema.js:1071 \u00B7 source/mslite-schema.js:1447 \u00B7 source/mslite-schema.js:1529 \u00B7 \u002B7 more site(s) not listed \u2014 all 11 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mslite-schema.js"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e06ec07d62fc820da6426fadd1dce456bc0b6a00a495078eedb7a2f06fe9e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 22 locations): source/mslite-schema.js:779 \u00B7 source/mslite-schema.js:855 \u00B7 source/mslite-schema.js:1151 \u00B7 source/mslite-schema.js:1551 \u00B7 \u002B18 more site(s) not listed \u2014 all 22 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mslite-schema.js"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0e158b41ca2c57c743a14a07edb87373da2effcbcca363f297784a05512e79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 20 locations): source/mslite-schema.js:861 \u00B7 source/mslite-schema.js:1649 \u00B7 source/mslite-schema.js:1737 \u00B7 source/mslite-schema.js:1842 \u00B7 \u002B16 more site(s) not listed \u2014 all 20 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mslite-schema.js"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"2750be75f0e8716b9e12ccd6f06aec33595d89a7d9afabbddfe0b5a873806046"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5 locations): source/mslite-schema.js:1099 \u00B7 source/mslite-schema.js:1324 \u00B7 source/mslite-schema.js:1371 \u00B7 source/mslite-schema.js:3011 \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":"source/mslite-schema.js"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"25108b42ec02d1c5fd4175ddef1fee371340725ac41c3ba727aa170943ae3949"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/mslite-schema.js:2842 \u00B7 source/mslite-schema.js:3069 \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":"source/mslite-schema.js"},"region":{"startLine":2842}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c771aa3737ddb55431a6abaffe972a55fc73ea3e138e5cb05415aca43bbe08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): source/nnabla.js:269 \u00B7 source/safetensors.js:144 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 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":"source/nnabla.js"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"235e163ec85ca7b7594413ba613ce4002720c9035dbd951ac57cb30d18e4e021"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): source/node.js:44 \u00B7 source/node.js:59 \u2014 the two spans are one implementation copied and then locally edited \u2014 82 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":"source/node.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1977b6ab09b19bd917e9b833454c81f89bc4c7ba1c55d9c86e55bf9fa66224ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/openvino.js:687 \u00B7 source/openvino.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":"source/openvino.js"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad41a063b94e3f5828654af66276e4c3d23c98209bf9c027e1675a84f95d254"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): source/paddle-proto.js:147 \u00B7 source/paddle-proto.js:485 \u00B7 source/paddle-proto.js:837 \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":"source/paddle-proto.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"8beb06bed212dbf292fea7c4c56fe2f64941b722b56db9ed31c43c4062d7f75f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/paddle.js:355 \u00B7 source/paddle.js:367 \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":"source/paddle.js"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"099d82257e11d71e95fc9b5117ce9f5da6cdd220a1c2db31e5ec1c7cf1a5defc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): source/pickle.js:247 \u00B7 source/safetensors.js:144 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 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":"source/pickle.js"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eeb54225b5961b910b63d190cf6c9ed06978752b47709232b0db0f4a95f2196"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): source/pickle.js:247 \u00B7 source/tflite.js:528 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 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":"source/pickle.js"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"436b01a0082969ea5a3faaf11357a02710918fbbd0de57dd1c6459b95c099286"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): source/protobuf.js:240 \u00B7 source/protobuf.js:252 \u2014 both copies are in the same file, so extract the block 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":"source/protobuf.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a6d0cfd41e15740c6ec770de9b2e2ed00c2c7f1778076c01c5072dff46f2c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): source/python.js:4575 \u00B7 source/python.js:4587 \u00B7 source/python.js:4599 \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":"source/python.js"},"region":{"startLine":4575}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc77365c4139561036e48f1a9a5625564e227f07e5066cb17a8f4b1750c2d88b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): source/qnn.js:243 \u00B7 source/tengine.js:168 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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":"source/qnn.js"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3905dc8792941c363ef379d135c0ad3c690b0eef9c5c49c4e84d644292ae01e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): source/safetensors.js:144 \u00B7 source/sklearn.js:253 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 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":"source/safetensors.js"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa5e3345f13940eeb1cee983378912f3c2f3255bd9ca0f9d646304417a01673"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): source/safetensors.js:144 \u00B7 source/tosa.js:298 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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":"source/safetensors.js"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa4517b01f2e35c1932a402fd4f926f28be2668f47ef9739ab9708791b1bd37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): source/sklearn.js:253 \u00B7 source/tflite.js:528 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 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":"source/sklearn.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54527a11a59201fdb0eac8c48323f9ba6e6d5638953e52ee57efc99e236516f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): source/tensorrt.js:180 \u00B7 source/weka.js:236 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 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":"source/tensorrt.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d67e442d902c7591b44cc06504ab4a8d8fc557ea81c6be6153b757583f2287d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): source/tf.js:570 \u00B7 source/tflite.js:37 \u2014 the two spans are one implementation copied and then locally edited \u2014 94 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":"source/tf.js"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4e56ea2f8e1439756ee4df651a308ce1ff21c6c9602a4eaeb54ab997261bba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): source/tflite.js:528 \u00B7 source/tnn.js:357 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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":"source/tflite.js"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fb82ff32d5303ff20a444111ebe782c9f7c306bac70d3038c2b1f63a764cc3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): source/view.js:7970 \u00B7 source/xmodel.js:339 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 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":"source/view.js"},"region":{"startLine":7970}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33b9a38c3caea5f0cb8533a8c135cec9a152de513d808f4b73ae24e82b44e68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): source/app.js:825 \u00B7 source/app.js:951 \u00B7 source/grapher.js:547 \u00B7 source/grapher.js:618 \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":"source/app.js"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fcee1008bea6ff1151a495dd84a8b6572fb8a020e679c07830fa07d265b4e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 16 locations): source/armnn-schema.js:119 \u00B7 source/armnn-schema.js:134 \u00B7 source/armnn-schema.js:149 \u00B7 source/armnn-schema.js:1463 \u00B7 \u002B12 more site(s) not listed \u2014 the 16 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":"source/armnn-schema.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c6606ae697d3489dd065009cabb9706eb2a2d50e5965250c075e9be81ea273"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 24 locations): source/armnn-schema.js:366 \u00B7 source/armnn-schema.js:417 \u00B7 source/armnn-schema.js:466 \u00B7 source/armnn-schema.js:719 \u00B7 \u002B20 more site(s) not listed \u2014 all 24 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/armnn-schema.js"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58ced1a7bd8d42e19c7d6692381866cfd8b8cbd42a0172caeed3a0b0f1a7a6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 8 locations): source/armnn-schema.js:711 \u00B7 source/armnn-schema.js:1580 \u00B7 source/armnn-schema.js:1818 \u00B7 source/circle-schema.js:1565 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 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":"source/armnn-schema.js"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa044c8a69a095e2b820a736816420a91ffe3badc70daec573b2ce136968242b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 20 locations): source/armnn-schema.js:860 \u00B7 source/armnn-schema.js:947 \u00B7 source/circle-schema.js:51 \u00B7 source/circle-schema.js:996 \u00B7 \u002B16 more site(s) not listed \u2014 the 20 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":"source/armnn-schema.js"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d2ed34d9056ba4570d334c400fb03a8d46de7159c285b5ab42373b935af9ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/armnn-schema.js:1065 \u00B7 source/armnn-schema.js:1362 \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":"source/armnn-schema.js"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fe9def5bfc53eca6cbc0264bb0cccb368b9f84c7252533ad4b45df4ac1593b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/armnn-schema.js:2852 \u00B7 source/mnn-schema.js:2992 \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":"source/armnn-schema.js"},"region":{"startLine":2852}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2ab1c15513c5d93d4855fe579629101e6cd2d584c814fd0a88f30ef16d016b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/base.js:513 \u00B7 source/node.js:27 \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":"source/base.js"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a6df732b0257b9c8347356d3ce93bcbc1e327399e3f15a117c338d801bb428"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 48 locations): source/bigdl-proto.js:216 \u00B7 source/caffe-proto.js:73 \u00B7 source/caffe-proto.js:502 \u00B7 source/caffe-proto.js:550 \u00B7 \u002B44 more site(s) not listed \u2014 the 48 copies are spread across 10 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":"source/bigdl-proto.js"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65c76f6f5419b9489940e54744aaba01a0db320b994a0f5fa996e7438f726a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 7 locations): source/caffe-proto.js:803 \u00B7 source/caffe-proto.js:2178 \u00B7 source/caffe-proto.js:4016 \u00B7 source/caffe2-proto.js:574 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 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":"source/caffe-proto.js"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c990f26b1c875cc54e8ff43dab310f591c13fe61256606e75c9d3ad52ac440a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/caffe-proto.js:871 \u00B7 source/onnx-proto.js:1666 \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":"source/caffe-proto.js"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"9541502588ef0d3b8b2363e09567080275b1fea8efb17767f736fa0acfc01009"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/caffe-proto.js:887 \u00B7 source/onnx-proto.js:1071 \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":"source/caffe-proto.js"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee63c67e28993b5c8383da5b6a32e8a5489616b35c8d5df811543606468ca676"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5 locations): source/caffe-proto.js:1085 \u00B7 source/nnabla-proto.js:569 \u00B7 source/nnabla-proto.js:2879 \u00B7 source/nnabla-proto.js:3185 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"source/caffe-proto.js"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ac2a089da172df478b51b4626d467b2d012e1fefbdc58c57b3eaeb01ee9eee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 19 locations): source/caffe-proto.js:2132 \u00B7 source/caffe-proto.js:2595 \u00B7 source/caffe-proto.js:3059 \u00B7 source/caffe-proto.js:3946 \u00B7 \u002B15 more site(s) not listed \u2014 the 19 copies are spread across 5 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":"source/caffe-proto.js"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5388ed8d29b2e3bf82538868625e3c25f397ae165cd57f12e5859ae76c96cbc8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 9 locations): source/caffe-proto.js:3950 \u00B7 source/caffe2-proto.js:1559 \u00B7 source/mindir-proto.js:587 \u00B7 source/nnabla-proto.js:1247 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":3950}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fde22c7ab8c0e240a8ff920df3df75c5dad7f5d41ac2ec57dc1535af4eedf05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/caffe2-proto.js:348 \u00B7 source/nnabla-proto.js:6133 \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":"source/caffe2-proto.js"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"453ac760248fa272891f0292d436de09538ea817e476c40faadd2976e8bcb3ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): source/caffe2-proto.js:1223 \u00B7 source/onnx-proto.js:601 \u00B7 source/onnx-proto.js:1378 \u2014 the 3 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":"source/caffe2-proto.js"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5ffe3b4cc8e39769e0e616d542b73769c90ddf5e11028bc1dc9e8d1fcbeed6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): source/catboost-schema.js:172 \u00B7 source/catboost-schema.js:247 \u00B7 source/espdl-schema.js:111 \u2014 the 3 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":"source/catboost-schema.js"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea42159020a9b9ca7b33f4170217e6e22c7449eca6581e498b16a565aab787a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5 locations): source/circle-schema.js:1967 \u00B7 source/circle-schema.js:2437 \u00B7 source/circle-schema.js:2534 \u00B7 source/circle-schema.js:2744 \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":"source/circle-schema.js"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ffe85c717fc530e59e524eb6083de414d91dacf47d7e0d3eafa8233f4bffe4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/circle.js:470 \u00B7 source/mslite.js:217 \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":"source/circle.js"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"937bdea4c3474ed17ce67de30da9d0f3975d3a08bb8a0606bb5738bd0c737623"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): source/circle.js:18 \u00B7 source/sentencepiece.js:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 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":"source/circle.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"877a98266157adee3048612d729dcf40f81fe94423fe848861980b72568dedc0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5 locations): source/cntk.js:225 \u00B7 source/executorch.js:636 \u00B7 source/executorch.js:892 \u00B7 source/mxnet.js:429 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/cntk.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"949711e35fb9d82fc0f8c6bbc28d54f2e2f13a07ad60125a34fe9bc00abf3ef8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 15 locations): source/coreml-proto.js:2020 \u00B7 source/coreml-proto.js:2610 \u00B7 source/coreml-proto.js:8501 \u00B7 source/coreml-proto.js:9057 \u00B7 \u002B11 more site(s) not listed \u2014 the 15 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml-proto.js"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6dfbdc59066d56739c80a9017bb90a43fe826f54171697cd8a68c0978d865c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): source/coreml-proto.js:3278 \u00B7 source/coreml-proto.js:8290 \u00B7 source/coreml-proto.js:18303 \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":"source/coreml-proto.js"},"region":{"startLine":3278}}}],"partialFingerprints":{"codehealthFindingId/v1":"af545b855aa2a47e532e0d8b05247753fcd9b8ff9e41bef911bca3915e723f82"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 13 locations): source/coreml-proto.js:3596 \u00B7 source/coreml-proto.js:4140 \u00B7 source/coreml-proto.js:7737 \u00B7 source/coreml-proto.js:8526 \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":"source/coreml-proto.js"},"region":{"startLine":3596}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b420ed9c59947bb201f9280d30f0049f04e3b7f48e47e91c9309b1478297dfb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): source/coreml-proto.js:4424 \u00B7 source/coreml-proto.js:5110 \u00B7 source/coreml-proto.js:5691 \u00B7 source/keras-proto.js:74 \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":"source/coreml-proto.js"},"region":{"startLine":4424}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee35f592ca6c629676986b671a7d6151957d915d2da57e3d6ba0bd521755e98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/coreml-proto.js:4675 \u00B7 source/paddle-proto.js:1383 \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":"source/coreml-proto.js"},"region":{"startLine":4675}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea630f3fe4882f78a907bbef6d3ba8fce6322f439a627393b992e544b67f41da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 7 locations): source/coreml-proto.js:8970 \u00B7 source/coreml-proto.js:9539 \u00B7 source/coreml-proto.js:9560 \u00B7 source/coreml-proto.js:10111 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 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":"source/coreml-proto.js"},"region":{"startLine":8970}}}],"partialFingerprints":{"codehealthFindingId/v1":"9400ee9a45eb123911d6e390347036a7dc6adb4d30def7fcf3b7336388107aac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): source/coreml-proto.js:9557 \u00B7 source/paddle-proto.js:382 \u00B7 source/paddle-proto.js:751 \u00B7 source/paddle-proto.js:1336 \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":"source/coreml-proto.js"},"region":{"startLine":9557}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fbf0bda319529fa5b4842d5b1734a0c7e9444d7aed222314945e124982ddd0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/coreml-proto.js:18057 \u00B7 source/coreml-proto.js:18103 \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":"source/coreml-proto.js"},"region":{"startLine":18057}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b971dc157ac9178444c572e89beefb23a4af496558c9386c3d71efd7cd3d6cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): source/coreml.js:449 \u00B7 source/coreml.js:496 \u00B7 source/coreml.js:511 \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":"source/coreml.js"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60b002d13ff34304bacc57256a7c20ed0794a1500c532b0aa91b90cc96b7c17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/dagre.js:256 \u00B7 source/dagre.js:370 \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":"source/dagre.js"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f22a7eaa5f5046c7a3740c5b88a74150e6d17da892306173a525573de961bab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/dagre.js:1438 \u00B7 source/dagre.js:1489 \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":"source/dagre.js"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"2deec3f929175670bd5dfbf4eed3f39eca1ac25d0e1cf3fa35ede313762f939b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/darknet.js:350 \u00B7 source/darknet.js:742 \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":"source/darknet.js"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d153037d60d71617eed9204d6408108ba1216e519c78bb637c97b9756f53ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/dl4j.js:73 \u00B7 source/keras.js:531 \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":"source/dl4j.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5c3193eca60d7fd495ee486e73fd7cd0c3d954b60cf4b5e20c1bfa36a5ddf0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): source/executorch-schema.js:457 \u00B7 source/executorch-schema.js:951 \u00B7 source/executorch-schema.js:1505 \u00B7 source/kann-schema.js:2 \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":"source/executorch-schema.js"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1bc378eaaf2012e358d037796f4daad1be2adcca73c454ae832d3add35370c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/executorch.js:45 \u00B7 source/mindir.js:52 \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":"source/executorch.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"34908ade3de199d6541e55c7ff0bbe3bb4b271838cbffd42872dc315e49937ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): source/flexbuffers.js:18 \u00B7 source/python.js:22558 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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":"source/flexbuffers.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ba34607ed3931d0676c0a2b5e643acb54c22dacc735a406b05fdb94a669e14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): source/gguf.js:738 \u00B7 source/tflite.js:532 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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":"source/gguf.js"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4113c22c41205765cdbcd99a8f60566e024a000d44ca8af64663f381fb3fc2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): source/gguf.js:732 \u00B7 source/tosa.js:296 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 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":"source/gguf.js"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"a680293fdefacb68b6bea0b00dd4a0b892720d721dfeb7f9c89115dc546fb3d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): source/gguf.js:735 \u00B7 source/xmodel.js:197 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 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":"source/gguf.js"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ca8e4d576051047773c88c55fd6564870e67febd4bc0afe921fec26b4f0d3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): source/json.js:7 \u00B7 source/xml.js:8 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 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":"source/json.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b31305c3e1b59e22097356048fa3b43ebe8d96014d7720ea075a2f08501cc05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/kmodel.js:341 \u00B7 source/kmodel.js:352 \u2014 both copies are in the same file, so extract the block 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":"source/kmodel.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98c00dd3ad39f3271236d5a16744d2f1ac8ffc247effb5c4b7682d767f481dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/kmodel.js:506 \u00B7 source/kmodel.js:994 \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":"source/kmodel.js"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"641c65efe318b5a613feb394060cc08c8b601e4205cd4c4bcb390738a59abe40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/litertlm-schema.js:143 \u00B7 source/litertlm-schema.js:181 \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":"source/litertlm-schema.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c3502e231a951434c80be34773443feb29d9404c2bd5dc0f682f6a936fa17b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): source/megengine-schema.js:1976 \u00B7 source/megengine-schema.js:2156 \u00B7 source/megengine-schema.js:2218 \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":"source/megengine-schema.js"},"region":{"startLine":1976}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cfcc11f3f2b817da0c5157c38f943b3d535f7ee0d47af732aee30373963ae1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 9 locations): source/mindir-proto.js:1106 \u00B7 source/paddle-proto.js:150 \u00B7 source/paddle-proto.js:236 \u00B7 source/paddle-proto.js:488 \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":"source/mindir-proto.js"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9537cb5f2e8969beb4e1bd3be39e3fc5ac25f1a081376264dcdb03e8ccb31314"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 9 locations): source/mindir-proto.js:1129 \u00B7 source/paddle-proto.js:182 \u00B7 source/paddle-proto.js:268 \u00B7 source/paddle-proto.js:511 \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":"source/mindir-proto.js"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5bb346f5a25825831cc05e40be1b12e1eb039dcb6e2b28e7c5cef5a84c0b95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): source/mindir-proto.js:1163 \u00B7 source/paddle-proto.js:360 \u00B7 source/paddle-proto.js:1224 \u00B7 source/paddle-proto.js:1551 \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":"source/mindir-proto.js"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97ab58c2c0766c9997fa2b340eaf267e2aee8386eeaf93fce265c47941fddb5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/mlir.js:6804 \u00B7 source/mlir.js:6816 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":6804}}}],"partialFingerprints":{"codehealthFindingId/v1":"a036d512d91d140db7fed94e6250026c94ed51220ae7c95deaa29a818814d3ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): source/mlir.js:11593 \u00B7 source/mlir.js:16074 \u00B7 source/mlir.js:16309 \u00B7 source/mlir.js:16805 \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":"source/mlir.js"},"region":{"startLine":11593}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a6afa38845a560b5b2a37e0804b6ad029833d87f32ce6b41650b7adeb72678"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/mlir.js:12283 \u00B7 source/mlir.js:12327 \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":"source/mlir.js"},"region":{"startLine":12283}}}],"partialFingerprints":{"codehealthFindingId/v1":"5706d4eee1ae323a8fe7565437b7d4389f2890f8436aaca98f2326cc98e5a9e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): source/mlir.js:13223 \u00B7 source/mlir.js:20982 \u00B7 source/mlir.js:21311 \u00B7 source/mlir.js:22212 \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":"source/mlir.js"},"region":{"startLine":13223}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b57686e557644a78669e39af4caa9454b709e33317d038174279bf2b7babfc4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/mlir.js:14008 \u00B7 source/mlir.js:14028 \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":"source/mlir.js"},"region":{"startLine":14008}}}],"partialFingerprints":{"codehealthFindingId/v1":"7529fb6c9f5848b81abee530a650ee4f6c99eab3ff7560b3c8fad69f82ac2630"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): source/mlir.js:15976 \u00B7 source/mlir.js:29049 \u00B7 source/mlir.js:29071 \u00B7 source/mlir.js:29087 \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":"source/mlir.js"},"region":{"startLine":15976}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b275c7f395a6ddc8d5b12ee754dce3bfc9a301ca61921b5dd86e409bea0a78f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 9 locations): source/mlir.js:16514 \u00B7 source/mlir.js:16756 \u00B7 source/mlir.js:24350 \u00B7 source/mlir.js:24394 \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":"source/mlir.js"},"region":{"startLine":16514}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18546aa8b0a91e06b3d00c2fa9f0fa4fbde694b4c97a6f397d85e229ae771e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/mlir.js:16673 \u00B7 source/mlir.js:24844 \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":"source/mlir.js"},"region":{"startLine":16673}}}],"partialFingerprints":{"codehealthFindingId/v1":"41047866ebea9447dcd440e607ffc94f124c88851fa15d9eb933c163e9134ccc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): source/mlir.js:16868 \u00B7 source/mlir.js:16884 \u00B7 source/mlir.js:22345 \u00B7 source/mlir.js:27288 \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":"source/mlir.js"},"region":{"startLine":16868}}}],"partialFingerprints":{"codehealthFindingId/v1":"e373794f0ae53f1ac420fe6223c7b9da8632b962f01e3f502f937f79c5547834"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/mlir.js:17090 \u00B7 source/mlir.js:29059 \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":"source/mlir.js"},"region":{"startLine":17090}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77faa4bab4983d24fcac32df007b479c22652dd636bc93caac2745888541065"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): source/mlir.js:17120 \u00B7 source/mlir.js:19380 \u00B7 source/mlir.js:24170 \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":"source/mlir.js"},"region":{"startLine":17120}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7190408c12636d1b7a88506595650757d2c86fb6df4caf7783bb8e9f6cd0757"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/mlir.js:18964 \u00B7 source/mlir.js:20211 \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":"source/mlir.js"},"region":{"startLine":18964}}}],"partialFingerprints":{"codehealthFindingId/v1":"826ae7f4b5aeffce9aa8cf06e0986db2d198b1626ff88f56579ae27d169968f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/mlir.js:20353 \u00B7 source/mlir.js:20419 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":20353}}}],"partialFingerprints":{"codehealthFindingId/v1":"689d99882cf1fc87339fb31e107d159f206c75becd564b5c6c67413862a0c39f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/mlir.js:20488 \u00B7 source/mlir.js:24340 \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":"source/mlir.js"},"region":{"startLine":20488}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1bed90026e7a0e17d1964d6e72ef0c0adde71e5cfaa7511326ee8925de6ee08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/mlir.js:25463 \u00B7 source/mlir.js:29052 \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":"source/mlir.js"},"region":{"startLine":25463}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbbe56225ddf525b7b24419f62bc9a8e3fe6a56ffea5d8a06730e624c4f12ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/mlir.js:26104 \u00B7 source/mlir.js:26120 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":26104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7824c654518b5c67900526635b881fc6f65156e8787626473514a5d18843e217"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/mlir.js:27187 \u00B7 source/mlir.js:27199 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":27187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afd47a7ec5e4eb55ad271c5f84a76bae37958561e894a4631a9da45a0a4a90a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/mlir.js:28088 \u00B7 source/mlir.js:28099 \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":"source/mlir.js"},"region":{"startLine":28088}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d2bffe642b98cab72a89b8445da78ac37855b1278c7357596c44a0a0b97fd3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/mslite-schema.js:2671 \u00B7 source/mslite-schema.js:3898 \u2014 both copies are in the same file, so extract the block 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":"source/mslite-schema.js"},"region":{"startLine":2671}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6838eedd47b3490484569f35e07b2d9d22438f2c6f07b50790e811bea9d50b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/mxnet.js:562 \u00B7 source/mxnet.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":"source/mxnet.js"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"f882b00e0e0ed6817484b69035655d6734d20389e10e09887a1ba653444f9388"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): source/ncnn.js:266 \u00B7 source/om.js:264 \u00B7 source/openvino.js:758 \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":"source/ncnn.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1bbed48732e0d003ddd2853dddcf70672fb74a7bfb8d18579db79a98db65ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6 locations): source/nnabla-proto.js:9967 \u00B7 source/nnabla-proto.js:10027 \u00B7 source/nnabla-proto.js:10087 \u00B7 source/nnabla-proto.js:10147 \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":"source/nnabla-proto.js"},"region":{"startLine":9967}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c0ee36aa37c3f56766595b5b7ccb2dc18d04efdcdf28dc832dd4465788f968"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): source/om-proto.js:461 \u00B7 source/om-proto.js:599 \u00B7 source/om-proto.js:945 \u00B7 source/om-proto.js:1013 \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":"source/om-proto.js"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b52714021726b6c5f5d470d8f458a4acd73c0b09e5c7852ad56990c89978807"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/onednn.js:118 \u00B7 source/onednn.js:144 \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":"source/onednn.js"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7116a89456b041eac7d5783201ab1b6e2d7bdd183370dda21cbf74114dde1e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): source/onnx.js:1623 \u00B7 source/onnx.js:1634 \u00B7 source/onnx.js:1692 \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":"source/onnx.js"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"45615ed62f81343c773dd23919b7c5161cf1a9653d392b89b42a6b4d7c800a7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 8 locations): source/paddle-proto.js:89 \u00B7 source/paddle-proto.js:153 \u00B7 source/paddle-proto.js:239 \u00B7 source/paddle-proto.js:560 \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":"source/paddle-proto.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d2dccba1b02b2997fdd83cb178c0366dc47c1150400ca1c17b68e8789d2fd2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 9 locations): source/paddle-proto.js:369 \u00B7 source/paddle-proto.js:491 \u00B7 source/paddle-proto.js:642 \u00B7 source/paddle-proto.js:738 \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":"source/paddle-proto.js"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"d131061b69e49338d09e128276efc69005548510c69ebde9c5d72f05b3f0c7c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/protobuf.js:28 \u00B7 source/protobuf.js:128 \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":"source/protobuf.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b3374a32d86b167fa681b1f010f7fc22024d5eb7d4a5d65c21f78c7029b3a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/protobuf.js:1246 \u00B7 source/python.js:3397 \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":"source/protobuf.js"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"753179dcb1d54587eb84e59b8b3a0682db50a06dfe4104dc32dfbcd4a5a2bec2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): source/python.js:4327 \u00B7 source/python.js:4468 \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":"source/python.js"},"region":{"startLine":4327}}}],"partialFingerprints":{"codehealthFindingId/v1":"41afd6a51148636f56a37f982e7d20d81150d3249e71a84d6eb40319d90ed535"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): source/sentencepiece.js:17 \u00B7 source/tflite.js:26 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 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":"source/sentencepiece.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aeb29699a4a9186ea9c7e8e5c4f12afdf11c8176a8ee5647650b09c10a86682"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): source/tosa.js:370 \u00B7 source/xmodel.js:340 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 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":"source/tosa.js"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"03020a87de327ef1febb041a9b1cb2dc2852f78edf5a39828677becde8660068"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): source/armnn-schema.js:90 \u00B7 source/circle-schema.js:880 \u00B7 source/mnn-schema.js:1836 \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":"source/armnn-schema.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e82b06bb90b27cf85ae27e7c1f70fe7d8c21dbf9eea950a8672400eb36d5426"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 25 locations): source/armnn-schema.js:413 \u00B7 source/armnn-schema.js:2106 \u00B7 source/armnn-schema.js:2299 \u00B7 source/armnn-schema.js:2624 \u00B7 \u002B21 more site(s) not listed \u2014 the 25 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":"source/armnn-schema.js"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"444f253bdc8300aeb63c8a467e3d89109977df0d11b6e1e2856c5f23457b30b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): source/armnn-schema.js:462 \u00B7 source/mnn-schema.js:1126 \u00B7 source/mnn-schema.js:1143 \u00B7 source/mnn-schema.js:1279 \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":"source/armnn-schema.js"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edd19b97a2d457ab258b37557af4f4570a63a48db84f1a9fc475b31fdee729f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): source/armnn-schema.js:623 \u00B7 source/armnn-schema.js:681 \u00B7 source/armnn-schema.js:1420 \u00B7 source/armnn-schema.js:2482 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 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":"source/armnn-schema.js"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48bdf8d9c9f1e071fe579be75d42237ce05e491bc860d8495e7b530bcc4159d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): source/armnn-schema.js:1272 \u00B7 source/armnn-schema.js:1317 \u00B7 source/armnn-schema.js:2765 \u00B7 source/circle-schema.js:1050 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 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":"source/armnn-schema.js"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba34daafbbebf991427fda52e1843d52268372cf11d6fa7b10aa118ff000dcf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): source/armnn-schema.js:1550 \u00B7 source/armnn-schema.js:2692 \u00B7 source/mnn-schema.js:482 \u00B7 source/mnn-schema.js:699 \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":"source/armnn-schema.js"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"0729a0e9d3a5180f19587f4da7164ef9f8563f037e56b699237e267e9e18044a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 10 locations): source/armnn-schema.js:1862 \u00B7 source/armnn-schema.js:2188 \u00B7 source/armnn-schema.js:2556 \u00B7 source/armnn-schema.js:2721 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 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":"source/armnn-schema.js"},"region":{"startLine":1862}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d57101ed15f061399322dbeb01347334dcc1e09598505cc9448eb6146a7b826"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): source/armnn-schema.js:1896 \u00B7 source/circle-schema.js:1124 \u00B7 source/mnn-schema.js:1626 \u00B7 source/mnn-schema.js:2755 \u2014 the 4 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":"source/armnn-schema.js"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e79871b8cb78773dc536489bca163466e65dfe8d950db36536e563ead9fd2af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5 locations): source/armnn-schema.js:2035 \u00B7 source/circle-schema.js:986 \u00B7 source/circle-schema.js:1234 \u00B7 source/mnn-schema.js:1260 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"source/armnn-schema.js"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e8d1a82998b6ffa6c3ecf002bc5bf53a4eb3220e66385e049bcb6742d5f859"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): source/armnn-schema.js:2835 \u00B7 source/circle-schema.js:1854 \u00B7 source/circle-schema.js:2420 \u2014 the 3 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":"source/armnn-schema.js"},"region":{"startLine":2835}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd9171e0ef9ef08e202607976504a36748d87e2d50ce99e89582823c1279d89"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): source/armnn-schema.js:3015 \u00B7 source/executorch-schema.js:206 \u00B7 source/executorch-schema.js:299 \u00B7 source/executorch-schema.js:1482 \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":"source/armnn-schema.js"},"region":{"startLine":3015}}}],"partialFingerprints":{"codehealthFindingId/v1":"b621f37b2f3f4b0cab31957ddec733e5c49cea5931eb3355c58edb19e94eafb9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): source/base.js:566 \u00B7 source/base.js:578 \u00B7 source/base.js:590 \u00B7 source/base.js:602 \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":"source/base.js"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f460a2ad7b8a711f615acfe75d2d30faf725aabfe7616a472d3e5bb0cb3306d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): source/base.js:688 \u00B7 source/base.js:700 \u00B7 source/base.js:712 \u00B7 source/base.js:724 \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":"source/base.js"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"345d1afae1ccb20300c64b06c669ce48a7a9851552491a74ef98ff242a94a155"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 9 locations): source/bigdl-proto.js:468 \u00B7 source/bigdl-proto.js:573 \u00B7 source/caffe-proto.js:2029 \u00B7 source/coreml-proto.js:14113 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 copies are spread across 6 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":"source/bigdl-proto.js"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f50b7f9fce5a53c11a08f5b5e08e7ff7f725c4c586a55c7d6a1ec79e07dcea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 10 locations): source/caffe-proto.js:541 \u00B7 source/caffe2-proto.js:233 \u00B7 source/coreml-proto.js:8719 \u00B7 source/coreml-proto.js:8900 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 copies are spread across 5 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":"source/caffe-proto.js"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff59e05264355974e7a771261e155d51af90d17f59287bbf8b5e7060ec2b1f43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 13 locations): source/caffe-proto.js:687 \u00B7 source/caffe-proto.js:1579 \u00B7 source/caffe2-proto.js:301 \u00B7 source/caffe2-proto.js:1015 \u00B7 \u002B9 more site(s) not listed \u2014 the 13 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"77de29af49f3c9561c18be44f6640ade2f45aae52a3d6f04c6f1c82cdd9ac1c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5 locations): source/caffe-proto.js:1064 \u00B7 source/caffe-proto.js:4483 \u00B7 source/mindir-proto.js:7 \u00B7 source/onnx-proto.js:19 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"source/caffe-proto.js"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c501478d96e5df3346b912494a94f17178fcce8c57a7a569cf7a511cebd8c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 12 locations): source/caffe-proto.js:1278 \u00B7 source/caffe-proto.js:2097 \u00B7 source/coreml-proto.js:14136 \u00B7 source/coreml-proto.js:15242 \u00B7 \u002B8 more site(s) not listed \u2014 the 12 copies are spread across 6 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":"source/caffe-proto.js"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"9934075a5ce6a5d8e4290819eebc50eb272538c0fdac1ba6c20d9aaf785b926c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 15 locations): source/caffe-proto.js:1296 \u00B7 source/caffe-proto.js:4657 \u00B7 source/caffe2-proto.js:812 \u00B7 source/mindir-proto.js:130 \u00B7 \u002B11 more site(s) not listed \u2014 the 15 copies are spread across 5 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":"source/caffe-proto.js"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"528b181be6b380a65b362641e71147a9a06af782c958d5213ef6644ec1bd9ffd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 80 locations): source/caffe-proto.js:1311 \u00B7 source/caffe-proto.js:1323 \u00B7 source/caffe-proto.js:1335 \u00B7 source/caffe-proto.js:1347 \u00B7 \u002B76 more site(s) not listed \u2014 the 80 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1588c0fbe2360fe81194f30b86fe7650acb579d53f97b812ba0f96457229c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 25 locations): source/caffe-proto.js:2074 \u00B7 source/caffe-proto.js:4900 \u00B7 source/coreml-proto.js:2240 \u00B7 source/coreml-proto.js:3556 \u00B7 \u002B21 more site(s) not listed \u2014 the 25 copies are spread across 7 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":"source/caffe-proto.js"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"e544997536755c9688bad73db80ac63d78fcf6b7fe25cac8d42f1f6f6505a7d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): source/caffe-proto.js:2508 \u00B7 source/caffe-proto.js:3264 \u00B7 source/caffe-proto.js:3848 \u00B7 source/caffe-proto.js:4121 \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":"source/caffe-proto.js"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a678b5cd2c8b4d795d43cd768a58d6e8cc6ccc47ec4196728416e66c37041a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 12 locations): source/caffe-proto.js:3712 \u00B7 source/mindir-proto.js:1192 \u00B7 source/nnabla-proto.js:202 \u00B7 source/nnabla-proto.js:4463 \u00B7 \u002B8 more site(s) not listed \u2014 the 12 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":"source/caffe-proto.js"},"region":{"startLine":3712}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c443af0c789d23492126bd42e928450546ce450b6734a95d228c858d89937e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): source/caffe-proto.js:3862 \u00B7 source/nnabla-proto.js:6072 \u00B7 source/nnabla-proto.js:10282 \u00B7 source/nnabla-proto.js:10335 \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":"source/caffe-proto.js"},"region":{"startLine":3862}}}],"partialFingerprints":{"codehealthFindingId/v1":"760d9d5fdfc05c5b940eb9d61d8e13a15e91a5bb9cb06aa8150d6b51dd0604dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 16 locations): source/caffe-proto.js:4517 \u00B7 source/caffe2-proto.js:1249 \u00B7 source/dnn-proto.js:190 \u00B7 source/mindir-proto.js:62 \u00B7 \u002B12 more site(s) not listed \u2014 the 16 copies are spread across 6 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":"source/caffe-proto.js"},"region":{"startLine":4517}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1fd5a8ad62f82b4ed1e12b289cec3f00e080a7ebba56614550e4baeaa227ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): source/caffe-proto.js:4868 \u00B7 source/mindir-proto.js:1278 \u00B7 source/nnabla-proto.js:8371 \u00B7 source/nnabla-proto.js:9389 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":4868}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87552ea20e1e018d24350cd57bd9a5744c9eeaa8a84d0c61dc98a320b764d3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 18 locations): source/caffe-proto.js:4942 \u00B7 source/caffe-proto.js:5070 \u00B7 source/coreml-proto.js:17872 \u00B7 source/coreml-proto.js:17916 \u00B7 \u002B14 more site(s) not listed \u2014 the 18 copies are spread across 8 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":"source/caffe-proto.js"},"region":{"startLine":4942}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc5b9a98f39edec99372679eda63d10aa0ea810c23056c80e4ade43ba60c011"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8 locations): source/caffe-proto.js:5070 \u00B7 source/caffe2-proto.js:1000 \u00B7 source/mindir-proto.js:458 \u00B7 source/nnabla-proto.js:3072 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 copies are spread across 5 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":"source/caffe-proto.js"},"region":{"startLine":5070}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b63ddf0dae59c0dd0d5d1b5ddec4b49f76def0c3880bb1e5c0b8d92e2c4f10"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): source/caffe2-proto.js:25 \u00B7 source/caffe2-proto.js:245 \u00B7 source/litertlm-proto.js:852 \u00B7 source/mindir-proto.js:870 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe2-proto.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec6a02b7cf92820780d52e847229f0db1b9ea2455344c861cc1212e65facde3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 10 locations): source/caffe2-proto.js:908 \u00B7 source/coreml-proto.js:8989 \u00B7 source/coreml-proto.js:13814 \u00B7 source/coreml-proto.js:13983 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 copies are spread across 6 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":"source/caffe2-proto.js"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"742e026f1afea45fe0d987fa8737147d27f5c5a512a0f27cd00ddce256ec5a36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): source/caffe2-proto.js:1180 \u00B7 source/mindir-proto.js:280 \u00B7 source/mindir-proto.js:782 \u00B7 source/onnx-proto.js:276 \u2014 the 4 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":"source/caffe2-proto.js"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c379353aace5a392b59f3dcfd8e082f6fbbb1413634d124f72040143b9c2ded7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): source/circle-schema.js:78 \u00B7 source/circle-schema.js:193 \u00B7 source/executorch-schema.js:657 \u2014 the 3 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":"source/circle-schema.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ad3701adca4e4d4ebf605b8aa031ec3fd1bc0317a27616a06351312c5c6cde"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): source/circle-schema.js:1451 \u00B7 source/circle-schema.js:1468 \u00B7 source/circle-schema.js:1487 \u00B7 source/circle-schema.js:1665 \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":"source/circle-schema.js"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f196da879e8024c9ee77b5269be7873c2f83b950a3143441f661bec12322e0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): source/circle.js:272 \u00B7 source/tengine.js:81 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"source/circle.js"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"6073b3d5f15b77cf32e1cc7b7861c564d64c956b7dfa9afdd99ac17ba3f8ca87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 18 locations): source/cntk-proto.js:74 \u00B7 source/cntk-proto.js:301 \u00B7 source/coreml-proto.js:3417 \u00B7 source/coreml-proto.js:3559 \u00B7 \u002B14 more site(s) not listed \u2014 the 18 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":"source/cntk-proto.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd465e0a2676d302e93bf62c4028af9b9c7b61eca465c96acf09801ca09d7e99"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 35 locations): source/cntk-proto.js:298 \u00B7 source/coreml-proto.js:1005 \u00B7 source/coreml-proto.js:1031 \u00B7 source/coreml-proto.js:1081 \u00B7 \u002B31 more site(s) not listed \u2014 the 35 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":"source/cntk-proto.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da57dbfab9413bd0fdfc7ecd87c941f0b3f9001f8c5cda06e71230d9a686d30"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/cntk.js:1011 \u00B7 source/mlnet.js:623 \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":"source/cntk.js"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"574343ad8a00514d58a78871b1cd73233974bc2c848fee9efdfb730ac732afc8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): source/cntk.js:576 \u00B7 source/onnx.js:1146 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"source/cntk.js"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"356803022e12bd5dce3821dd81f58898435221209bf37bfdfdcb13cfd2a4a243"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 13 locations): source/coreml-proto.js:490 \u00B7 source/coreml-proto.js:2980 \u00B7 source/coreml-proto.js:3553 \u00B7 source/coreml-proto.js:4109 \u00B7 \u002B9 more site(s) not listed \u2014 the 13 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":"source/coreml-proto.js"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff33b10040c661a016841d1f6f742ad8635e368d2be1bd03e3f2e0f1b46550b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 23 locations): source/coreml-proto.js:1836 \u00B7 source/coreml-proto.js:2514 \u00B7 source/coreml-proto.js:3452 \u00B7 source/coreml-proto.js:3600 \u00B7 \u002B19 more site(s) not listed \u2014 all 23 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml-proto.js"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2ec19b16695a3bc5809fa1956cf615252311dca61e3af9935a20979a882ff5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 14 locations): source/coreml-proto.js:2237 \u00B7 source/coreml-proto.js:9363 \u00B7 source/litertlm-proto.js:178 \u00B7 source/litertlm-proto.js:193 \u00B7 \u002B10 more site(s) not listed \u2014 the 14 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml-proto.js"},"region":{"startLine":2237}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afb50c6a64d8b05ddfcc14a2b0c7eba11ee22c9069d4f4996ea9396dc454ba1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/coreml-proto.js:2925 \u00B7 source/paddle-proto.js:357 \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":"source/coreml-proto.js"},"region":{"startLine":2925}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7bebcd14f362c3f41ad10186cefc273d64a94e145927857975bba36f60f02e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/coreml-proto.js:3301 \u00B7 source/coreml-proto.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":"source/coreml-proto.js"},"region":{"startLine":3301}}}],"partialFingerprints":{"codehealthFindingId/v1":"4842c1ada93fa07dddd0a42b3e1ccbac4fb535d98d46d7e8b03f4bc7c4f5b472"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7 locations): source/coreml-proto.js:3675 \u00B7 source/coreml-proto.js:8787 \u00B7 source/coreml-proto.js:9395 \u00B7 source/coreml-proto.js:11653 \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":"source/coreml-proto.js"},"region":{"startLine":3675}}}],"partialFingerprints":{"codehealthFindingId/v1":"27085dda4208891624c1f6142dfed4f637984dc184139f374b64fb7a773aa61c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5 locations): source/coreml-proto.js:8731 \u00B7 source/coreml-proto.js:9354 \u00B7 source/coreml-proto.js:10408 \u00B7 source/coreml-proto.js:17697 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"source/coreml-proto.js"},"region":{"startLine":8731}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a86a2afc4628edaa3d09e5848e1bd7b4f69081eb6dd7d1b5550aa8421fa940"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5 locations): source/coreml-proto.js:8784 \u00B7 source/coreml-proto.js:9392 \u00B7 source/coreml-proto.js:17741 \u00B7 source/coreml-proto.js:17759 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"source/coreml-proto.js"},"region":{"startLine":8784}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ef1f6ce58c61a2454009d40ab6e84c65867b559ee0daa05af89d3ab79e985b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7 locations): source/coreml-proto.js:8903 \u00B7 source/coreml-proto.js:13788 \u00B7 source/coreml-proto.js:13957 \u00B7 source/coreml-proto.js:14116 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 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":"source/coreml-proto.js"},"region":{"startLine":8903}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a169acfcae89fca1e05dcff647d88730d8b6bf4c1450b493c61a85654f7559a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): source/coreml-proto.js:10288 \u00B7 source/coreml-proto.js:15893 \u00B7 source/onnx-proto.js:1408 \u2014 the 3 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":"source/coreml-proto.js"},"region":{"startLine":10288}}}],"partialFingerprints":{"codehealthFindingId/v1":"632c8cff86f441fa330def3e2706361120777a7029ef5c291cffdbf923fb616e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): source/coreml-proto.js:11264 \u00B7 source/coreml-proto.js:11615 \u00B7 source/coreml-proto.js:11694 \u00B7 source/om-proto.js:1004 \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":"source/coreml-proto.js"},"region":{"startLine":11264}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0ff9546c6e824e1697c6fcb7c4beb6eb2e4dc8af6fae579a0a9b3930c19957"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): source/coreml-proto.js:11323 \u00B7 source/coreml-proto.js:11647 \u00B7 source/coreml-proto.js:11726 \u00B7 source/om-proto.js:1033 \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":"source/coreml-proto.js"},"region":{"startLine":11323}}}],"partialFingerprints":{"codehealthFindingId/v1":"3208eae4fac1f59b04d95103930d2edf2b6f2383784a6da4b985a4404fa815f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): source/coreml-proto.js:13375 \u00B7 source/mindir-proto.js:214 \u00B7 source/mindir-proto.js:1027 \u00B7 source/onnx-proto.js:1602 \u2014 the 4 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":"source/coreml-proto.js"},"region":{"startLine":13375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce915b9ba4e0ae83fa4a0baa69ac720d04042d9ed017c7c68de0e71f1666fe46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7 locations): source/coreml-proto.js:15045 \u00B7 source/nnabla-proto.js:6486 \u00B7 source/nnabla-proto.js:6588 \u00B7 source/nnabla-proto.js:6819 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 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":"source/coreml-proto.js"},"region":{"startLine":15045}}}],"partialFingerprints":{"codehealthFindingId/v1":"139caef6fab6a72cf8ab438b0abe078e1a2c22f27b3fe620ff433b22f238c296"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/coreml-proto.js:18074 \u00B7 source/om-proto.js:702 \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":"source/coreml-proto.js"},"region":{"startLine":18074}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3ef28c008beb5a99f2fdea2c20efbb2f0f7ef66f55c544e189464ac478096b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/dl4j.js:182 \u00B7 source/dl4j.js:194 \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":"source/dl4j.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"18009d6e2d90099987215cfb30920720f16952b15b636e6d29bc3ca0990d046a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/dlc.js:603 \u00B7 source/dlc.js:618 \u2014 both copies are in the same file, so extract the block 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":"source/dlc.js"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5acd9a7fc05194b1d7f34454cdfb9577155264f081ef0ecf3110e8e86092d8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8 locations): source/espdl-schema.js:204 \u00B7 source/espdl-schema.js:250 \u00B7 source/espdl-schema.js:269 \u00B7 source/executorch-schema.js:208 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 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":"source/espdl-schema.js"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"9830457c2b19a9077bbc2583be9a592bbed929c616bfae4b99eb7a48afbf4a3a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/espdl-schema.js:275 \u00B7 source/executorch-schema.js:587 \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":"source/espdl-schema.js"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c134f2943bc62b743170455876709a0b60be49862f31788ca4505e33664906"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/executorch.js:1191 \u00B7 source/mnn.js:67 \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":"source/executorch.js"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8c675c2a1716177744f209bbf92625bacbae44018da42e7e520a42568ac0db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): source/gguf.js:738 \u00B7 source/qnn.js:247 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"source/gguf.js"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede247d40a434367edcbaaac85edd2f2d07e166b95a80286021f0bbb2a5dccf4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/hdf5.js:495 \u00B7 source/hdf5.js:569 \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":"source/hdf5.js"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b16242ad5a34b13bb3b23a30b0a4cc5fef913f3d6bd8ce146c60391fae1c69f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8 locations): source/jax-schema.js:98 \u00B7 source/mslite-schema.js:1085 \u00B7 source/mslite-schema.js:2738 \u00B7 source/mslite-schema.js:2952 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 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":"source/jax-schema.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae7458d0b5587aeaf39c19d39338c1ad6ab4ad653ae52c34dfbdebc413a5b3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/keras.js:331 \u00B7 source/keras.js:360 \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":"source/keras.js"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92188f4d2f3b501ea05b9c10c240a461c2cbb0db7afac2b2d933b9ac9fcbf05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/keras.js:814 \u00B7 source/keras.js:835 \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":"source/keras.js"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"7032e17707dd5080ad2175e67d33181a0ece89ce78f6c491dce2bd3f25a85416"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): source/kmodel.js:1853 \u00B7 source/kmodel.js:1919 \u00B7 source/kmodel.js:2022 \u00B7 source/kmodel.js:2190 \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":"source/kmodel.js"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef48b591d8e1a3b5579a52ad6aa03f64651b7ef7df05f0b9bba3693f5761b750"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 9 locations): source/litertlm-proto.js:199 \u00B7 source/litertlm-proto.js:345 \u00B7 source/litertlm-proto.js:414 \u00B7 source/litertlm-proto.js:498 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 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":"source/litertlm-proto.js"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb515955c4ab8fde30569bb78cd0dfd0ac24ac212f40928348dcd5e88c1a50de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): source/litertlm-schema.js:8 \u00B7 source/litertlm-schema.js:26 \u00B7 source/litertlm-schema.js:44 \u00B7 source/litertlm-schema.js:62 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 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":"source/litertlm-schema.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a69a5524c0f44bdc70e5367bc3c9dc97adf21ad2f9ea0100e688b86004da85c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): source/megengine-schema.js:555 \u00B7 source/megengine-schema.js:1981 \u00B7 source/megengine-schema.js:2161 \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":"source/megengine-schema.js"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"176938c481cec900fee3e3f0b1abfa81a0bb9ee7a554dc8abec3f08783194c6a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/megengine-schema.js:840 \u00B7 source/megengine-schema.js:1897 \u2014 both copies are in the same file, so extract the block 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":"source/megengine-schema.js"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ef4093396c10183c4f1eae7496d67246e789a46f413e36fe5b4a200e7dc669"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/megengine-schema.js:1143 \u00B7 source/megengine-schema.js:1291 \u2014 both copies are in the same file, so extract the block 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":"source/megengine-schema.js"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"920316fe7750ffb7b5357c488207368b1ef18f05e6d936bf20bfdb8e718fc2ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mindir-proto.js:1387 \u00B7 source/nnabla-proto.js:9308 \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":"source/mindir-proto.js"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"186cbbe4eb61b170281548ac589e183e17fd4129447b5687a13839de6f429784"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:6146 \u00B7 source/mlir.js:6233 \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":"source/mlir.js"},"region":{"startLine":6146}}}],"partialFingerprints":{"codehealthFindingId/v1":"994e59bca4cfe2af468df6c92262d066387f1a6fb8e9d14136f1f38d7f5657d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): source/mlir.js:9724 \u00B7 source/mlir.js:9963 \u00B7 source/mlir.js:10008 \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":"source/mlir.js"},"region":{"startLine":9724}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa251367cae108b52a21b16a433b51ad2c600dc45427824f983f8ae50a22d7f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:12106 \u00B7 source/mlir.js:19199 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":12106}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6baec98eab47202a24fdd72286d52daa99fe283d8e6753eb84d4c05b01fb06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:12298 \u00B7 source/mlir.js:12311 \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":"source/mlir.js"},"region":{"startLine":12298}}}],"partialFingerprints":{"codehealthFindingId/v1":"5918d926c3415d370870d4925e0ffd6478d27023341fdccbce604206df122566"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:12597 \u00B7 source/mlir.js:23425 \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":"source/mlir.js"},"region":{"startLine":12597}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13c88494d470eefd09d971f5d7577c3a39a93da9e0a7a6cf56a07e10652744c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): source/mlir.js:12982 \u00B7 source/mlir.js:16516 \u00B7 source/mlir.js:16758 \u00B7 source/mlir.js:24352 \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":"source/mlir.js"},"region":{"startLine":12982}}}],"partialFingerprints":{"codehealthFindingId/v1":"418472e95d6c15129efbb3eab28d19f1252f9845f3ece8bb5b459b4365845868"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:13512 \u00B7 source/mlir.js:15469 \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":"source/mlir.js"},"region":{"startLine":13512}}}],"partialFingerprints":{"codehealthFindingId/v1":"1571b9989e2f86db60493bf3cd8a2e7256077a8fb35738ef48eaca3be45c65cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:13696 \u00B7 source/mlir.js:14128 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":13696}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffb3bd90ff5024672498cf3e45a618cc5e9654c57e132474f110364e8bbba3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:14502 \u00B7 source/mlir.js:25729 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":14502}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66dbc02185859295f26b010c141e0f5ea5f0613f09c3628a53782e08e3e473a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): source/mlir.js:15127 \u00B7 source/mlir.js:15147 \u00B7 source/mlir.js:15873 \u00B7 source/mlir.js:15903 \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":"source/mlir.js"},"region":{"startLine":15127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9f4d7142144d2ec4677bb14973e3a0c9acd8da57e1d0ae6e1d7e73b51ca3ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:16743 \u00B7 source/mlir.js:24846 \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":"source/mlir.js"},"region":{"startLine":16743}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e360c6357ef7ee3a7c1d8b2e43704e9c7565157a53d8a42b662cbaa15b714d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): source/mlir.js:17355 \u00B7 source/mlir.js:26557 \u00B7 source/mlir.js:26882 \u2014 all 3 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":"source/mlir.js"},"region":{"startLine":17355}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd8391c990e1249eb415178639d95861e3b0a02f8e7974552041ac77e77bb54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:17476 \u00B7 source/mlir.js:17617 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":17476}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee1c423a282451e57d214cde853175d4f29bf028eb031786854460e45a2b49b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): source/mlir.js:17608 \u00B7 source/mlir.js:17638 \u00B7 source/mlir.js:17722 \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":"source/mlir.js"},"region":{"startLine":17608}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae3face9379a60a3b9153991c67edd72b9e5e5a10107b5422608c58069b8cb4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:17969 \u00B7 source/mlir.js:18286 \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":"source/mlir.js"},"region":{"startLine":17969}}}],"partialFingerprints":{"codehealthFindingId/v1":"3421a79e1c0f417878ed37c5e8125a8932edc0d47d52f611ecdffc64e89031eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:18147 \u00B7 source/mlir.js:18184 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":18147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1d49bc785a1d75f63fb941a9a2042983d411cf9430bd2fd215bf23e08e8114"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:18420 \u00B7 source/mlir.js:18443 \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":"source/mlir.js"},"region":{"startLine":18420}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f8caa7579e8f668df0b5ab3ea72c53b4e2e717dec8f3dd78af6ce60658b703"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:19385 \u00B7 source/mlir.js:20327 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":19385}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9804ee6aac6cb3d2ab151b89b21fcfacb296e8fbe88c88ce9c0ea873beb3919"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5 locations): source/mlir.js:19463 \u00B7 source/mlir.js:23557 \u00B7 source/mlir.js:23962 \u00B7 source/mlir.js:27208 \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":"source/mlir.js"},"region":{"startLine":19463}}}],"partialFingerprints":{"codehealthFindingId/v1":"f609a6a411c1630547b7757ff710ad4c6a4b1e04d724b2e95ee981660c3ad487"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:20274 \u00B7 source/mlir.js:20379 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":20274}}}],"partialFingerprints":{"codehealthFindingId/v1":"1823caf3ff0f4fc2351981dfa2db689939e66bbf71f914eb720499fb13baaabb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): source/mlir.js:21125 \u00B7 source/mlir.js:21149 \u00B7 source/mlir.js:21173 \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":"source/mlir.js"},"region":{"startLine":21125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25da5a8a043eeddba2a1e78555f4d862138071d1157b801c7ee9b8101b56451"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:21652 \u00B7 source/mlir.js:27845 \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":"source/mlir.js"},"region":{"startLine":21652}}}],"partialFingerprints":{"codehealthFindingId/v1":"0294b9b44491ad7b6d0733f9f059308013b7cbc3fe83b5ca5bed488ae89e335a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): source/mlir.js:24239 \u00B7 source/mlir.js:25614 \u00B7 source/mlir.js:25950 \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":"source/mlir.js"},"region":{"startLine":24239}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d32832eb5f029410da15ef0aec982db8bd52ab1660a96999ba024534b758a2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:24346 \u00B7 source/mlir.js:28944 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":24346}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b307d1be52a8332fa68d42a8d24b224feec3fcfe7dc89c03064f793b2cc2a48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:25486 \u00B7 source/mlir.js:27071 \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":"source/mlir.js"},"region":{"startLine":25486}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be0800521bb43fb2fec3c194512023fe29dc019e8c34a50017605a12b9761c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:25689 \u00B7 source/mlir.js:28254 \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":"source/mlir.js"},"region":{"startLine":25689}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a406377cacfb04e47197180d97e5a0c26b9201de95f6cc43ab8d7e79b3683b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:27069 \u00B7 source/mlir.js:29069 \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":"source/mlir.js"},"region":{"startLine":27069}}}],"partialFingerprints":{"codehealthFindingId/v1":"423d09489b04b487e66bb11d895630dc63a3239cc4c6c78cef29ad87fd35e865"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): source/mlir.js:27703 \u00B7 source/mlir.js:27853 \u00B7 source/mlir.js:28040 \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":"source/mlir.js"},"region":{"startLine":27703}}}],"partialFingerprints":{"codehealthFindingId/v1":"49462cca2e14e3a82899a652e8dd2a8d7dab99f6f09d4a672d213b2c85566019"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): source/mlir.js:28315 \u00B7 source/mlir.js:28344 \u00B7 source/mlir.js:28370 \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":"source/mlir.js"},"region":{"startLine":28315}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fe4e3c503e9bee3ccfcd3f5728ccc41b205d8f4af19958c58c9fc1ce986629"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mlir.js:28833 \u00B7 source/mlir.js:28880 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":28833}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86a0f266673a134829b245cf8ef9ab5c6f673afe92a5a246f4f5dbef98d90d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): source/mnn-schema.js:349 \u00B7 source/mnn-schema.js:773 \u00B7 source/mnn-schema.js:1395 \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":"source/mnn-schema.js"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6d36b8196e8cd8fc0fc1d70bff1ce76837238e4c434068eb2070689abfd41e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): source/mnn-schema.js:553 \u00B7 source/mnn-schema.js:1583 \u00B7 source/mnn-schema.js:3256 \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":"source/mnn-schema.js"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a2676730e29825880cd61e5f89d1a96fcde2516a8d405d1834be538f01aa97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): source/mslite.js:234 \u00B7 source/mxnet.js:621 \u00B7 source/onednn.js:218 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mslite.js"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac80427b3283b5419a1aeaf1143e5da7ef0e71cdd09a6172b7f8a9209bfc0c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/mxnet.js:779 \u00B7 source/mxnet.js:792 \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":"source/mxnet.js"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0c755a6a5fce6b08ac4886563f8ecb1b4d7e0c68c7f41192fcd8aaa5bec3de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/ncnn.js:382 \u00B7 source/ncnn.js:555 \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":"source/ncnn.js"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fff033233bb842c8704f05b9fa32b11909adbdfa5582a29f5f710b729dddbd3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/nnabla-proto.js:836 \u00B7 source/nnabla-proto.js:9385 \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":"source/nnabla-proto.js"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"e634ae0885106e622d0d568efbec27715c99f967136672bb73c3d1ed7abb0d0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 11 locations): source/nnabla-proto.js:4640 \u00B7 source/nnabla-proto.js:4788 \u00B7 source/nnabla-proto.js:4936 \u00B7 source/nnabla-proto.js:5077 \u00B7 \u002B7 more site(s) not listed \u2014 all 11 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/nnabla-proto.js"},"region":{"startLine":4640}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffbd16711e4874570ab0efe73dfa649e394fe2d2fa93fc76beca4f9ef3db207"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7 locations): source/nnabla-proto.js:5792 \u00B7 source/nnabla-proto.js:5869 \u00B7 source/nnabla-proto.js:5939 \u00B7 source/nnabla-proto.js:6002 \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":"source/nnabla-proto.js"},"region":{"startLine":5792}}}],"partialFingerprints":{"codehealthFindingId/v1":"0082ebfead94c6da673a4c4df94eb5c327319dbfd26cf6901f5fa1b67e3b2761"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/nnabla-proto.js:10376 \u00B7 source/nnabla-proto.js:11303 \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":"source/nnabla-proto.js"},"region":{"startLine":10376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e060d70c5ddb462b67c99b74061e9332846f9602a7d0f22728ce5d7875bf7f9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/om.js:625 \u00B7 source/om.js:639 \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":"source/om.js"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"850c50d685b80a34f989d5fbc0ef47a041864daf12876e2a82eebc5cb2dd6975"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 11 locations): source/onnx-proto.js:221 \u00B7 source/onnx-proto.js:327 \u00B7 source/onnx-proto.js:465 \u00B7 source/onnx-proto.js:679 \u00B7 \u002B7 more site(s) not listed \u2014 all 11 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx-proto.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b353032982b044e7364305b1756c52e4fa78370f11f42d0f7a922346c2ef49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 9 locations): source/paddle-proto.js:113 \u00B7 source/paddle-proto.js:447 \u00B7 source/paddle-proto.js:593 \u00B7 source/paddle-proto.js:681 \u00B7 \u002B5 more site(s) not listed \u2014 all 9 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":"source/paddle-proto.js"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e40e957b363f28a04f5cdc2642ba76ef3c38b21cc4399cd88f48d8eefdff2c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/paddle-proto.js:204 \u00B7 source/paddle-proto.js:522 \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":"source/paddle-proto.js"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf8999fff8a06712e563666c4ff17ef4abe07969f9ce80deddc6c9efc7f980b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/paddle.js:1367 \u00B7 source/paddle.js:1386 \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":"source/paddle.js"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa290a47a6e6f45d48dbbf978edef4bedacc3ce3ca752091aac67fcd46c8343d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/protobuf.js:207 \u00B7 source/protobuf.js:217 \u2014 both copies are in the same file, so extract the block 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":"source/protobuf.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0a91d4701ad1bb8b3598974994b6c25683ad1e952eb147c4ce8a4d285f065b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): source/protobuf.js:504 \u00B7 source/protobuf.js:516 \u00B7 source/protobuf.js:528 \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":"source/protobuf.js"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3505659f849c4c22c799b56792ad8c0e7f413178d1a081cecd54521f4589594"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/python.js:790 \u00B7 source/python.js:800 \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":"source/python.js"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"f005e216da6b0538ba02e609e32189d4d737255a702ddb5133396a7186fc1e74"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/python.js:810 \u00B7 source/python.js:981 \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":"source/python.js"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"8651a6470ca5c8580d4a6a9b2a4e5800fe7593e3f7f1b6f275df7f0d16787197"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): source/python.js:3172 \u00B7 source/python.js:3206 \u00B7 source/python.js:8792 \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":"source/python.js"},"region":{"startLine":3172}}}],"partialFingerprints":{"codehealthFindingId/v1":"334cf2fbd0a46c8e8327cafd87a0ea47e7ba88af21d8c4f255ccb376cb325668"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): source/python.js:5393 \u00B7 source/python.js:5403 \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":"source/python.js"},"region":{"startLine":5393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0af11d0a6c939a6a6de7ba41b62cc1267bce21b1faa5258410ac8b4614b8462"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): source/tengine.js:81 \u00B7 source/tflite.js:280 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"source/tengine.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf533512f863618e8e433462e474444546c49b0022ce4a02d921b8b4181e4600"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/app.js:581 \u00B7 source/app.js:590 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/app.js"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"415a3974d86bc6519df5ac8e4fff7380426e78a01dedd50cd7abb5f5c04145c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 131 locations): source/armnn-schema.js:210 \u00B7 source/armnn-schema.js:231 \u00B7 source/armnn-schema.js:396 \u00B7 source/armnn-schema.js:447 \u00B7 \u002B127 more site(s) not listed \u2014 the 131 copies are spread across 6 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":"source/armnn-schema.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0e71b0514dfec14770bd98f7df773558506b47ca0ba8d308434242cf6a4120"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 90 locations): source/armnn-schema.js:230 \u00B7 source/armnn-schema.js:346 \u00B7 source/armnn-schema.js:378 \u00B7 source/armnn-schema.js:395 \u00B7 \u002B86 more site(s) not listed \u2014 the 90 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":"source/armnn-schema.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f289027064b9e372b5a7499fcc96c6488fa75585dd53d9071fdbd633e0a803b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 18 locations): source/armnn-schema.js:508 \u00B7 source/armnn-schema.js:2621 \u00B7 source/circle-schema.js:964 \u00B7 source/circle-schema.js:1964 \u00B7 \u002B14 more site(s) not listed \u2014 the 18 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":"source/armnn-schema.js"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f41740af4b787fe89ec94181870f49786c9db137c8f822f02c2f61da648eb7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8 locations): source/armnn-schema.js:1034 \u00B7 source/armnn-schema.js:1688 \u00B7 source/armnn-schema.js:1943 \u00B7 source/circle-schema.js:1310 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 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":"source/armnn-schema.js"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"3189d01da4fa934828ebef2fea42c9eababd3cdc764eb19078e31ee8d2c72e1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 18 locations): source/armnn-schema.js:1108 \u00B7 source/armnn-schema.js:1235 \u00B7 source/armnn-schema.js:1645 \u00B7 source/catboost-schema.js:71 \u00B7 \u002B14 more site(s) not listed \u2014 the 18 copies are spread across 6 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":"source/armnn-schema.js"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee0996bfadef14c085194c3e2fe6223100ae898b9ccfb0b4aaf9e7b77e038ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/armnn-schema.js:2264 \u00B7 source/mnn-schema.js:2701 \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":"source/armnn-schema.js"},"region":{"startLine":2264}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb7238ca3b5833a945d2ac6c41dc8965584df711c87c50ff834d5027fff7aed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6 locations): source/armnn-schema.js:2608 \u00B7 source/mnn-schema.js:557 \u00B7 source/mnn-schema.js:1038 \u00B7 source/mnn-schema.js:1587 \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":"source/armnn-schema.js"},"region":{"startLine":2608}}}],"partialFingerprints":{"codehealthFindingId/v1":"02564dbd4c851ffedfd5e63dd1960755fd0256ccfe36223e30f26612472a276d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/barracuda.js:34 \u00B7 source/megengine.js:77 \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":"source/barracuda.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a40c1af139053f28e48252ecce22712f564d5b31f5ba7b1b7cbbe7587a56784"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/barracuda.js:294 \u00B7 source/kmodel.js:1546 \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":"source/barracuda.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7cbb012478fa9025c4886a4365198f0a694410bac170c1ed1bfe56aee91e89"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 325 locations): source/bigdl-proto.js:175 \u00B7 source/bigdl-proto.js:205 \u00B7 source/bigdl-proto.js:271 \u00B7 source/bigdl-proto.js:322 \u00B7 \u002B321 more site(s) not listed \u2014 the 325 copies are spread across 13 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":"source/bigdl-proto.js"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"431aac043c7670eb7e113dfd251e99ddbb2003191df528b3940321801bd794d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7 locations): source/bigdl-proto.js:541 \u00B7 source/cntk-proto.js:248 \u00B7 source/coreml-proto.js:3034 \u00B7 source/coreml-proto.js:4187 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 5 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":"source/bigdl-proto.js"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f805d22d8b8af45e8aafc0e5364a653081010432b9038787548d63e95b20cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): source/bigdl.js:38 \u00B7 source/dnn.js:36 \u00B7 source/lasagne.js:25 \u00B7 source/onednn.js:25 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/bigdl.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d82fd9a2212fab0415115bace7563d7bee9b72ddb795f6eb3bd545978e962e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): source/caffe-proto.js:2423 \u00B7 source/caffe2-proto.js:610 \u00B7 source/mindir-proto.js:800 \u00B7 source/onnx-proto.js:1306 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":2423}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5335087af3c77362dccc8476df1c33bb79bcda5dbd23e1769cb4197f86b03db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 16 locations): source/caffe-proto.js:3323 \u00B7 source/caffe2-proto.js:1644 \u00B7 source/dnn-proto.js:108 \u00B7 source/mindir-proto.js:486 \u00B7 \u002B12 more site(s) not listed \u2014 the 16 copies are spread across 6 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":"source/caffe-proto.js"},"region":{"startLine":3323}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd7a953d8cc32f8612d5ba60c3df6141c4dc0640440a066c3f44897445e6c01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 9 locations): source/caffe-proto.js:3923 \u00B7 source/caffe2-proto.js:1526 \u00B7 source/mindir-proto.js:533 \u00B7 source/nnabla-proto.js:1139 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":3923}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf26657d4e596b19e9ab25f61f5d1e37186f32f525c512957e398dd5ca7494ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6 locations): source/caffe-proto.js:4055 \u00B7 source/caffe2-proto.js:1204 \u00B7 source/coreml-proto.js:13697 \u00B7 source/nnabla-proto.js:5913 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":4055}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c9f59a5017ba0cd9981f154b98b1c4bcf6c1f4837185ef9ee12762043fc340"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): source/caffe2-proto.js:209 \u00B7 source/caffe2-proto.js:929 \u00B7 source/nnabla-proto.js:2863 \u2014 the 3 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":"source/caffe2-proto.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b846b8511c1adde6733c616e7025ddba9766307a983e7886c4be57c340bbc3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/caffe2-proto.js:1342 \u00B7 source/caffe2-proto.js:1468 \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":"source/caffe2-proto.js"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ec839ebe2de721d529315ccbfd3667156ae0e0e5e8bce58ae002361dc41f49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 9 locations): source/catboost-schema.js:96 \u00B7 source/espdl-schema.js:95 \u00B7 source/espdl-schema.js:201 \u00B7 source/executorch-schema.js:149 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/catboost-schema.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bda58e83d90c9835c22d5daa92b299d65c435b14ce2d64e38e955fddb02b2d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 25 locations): source/catboost-schema.js:147 \u00B7 source/catboost-schema.js:161 \u00B7 source/catboost-schema.js:188 \u00B7 source/executorch-schema.js:86 \u00B7 \u002B21 more site(s) not listed \u2014 the 25 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":"source/catboost-schema.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4859c812b3f1205499f3b4e84899dfe8888632ff1f7507153238981fdf3cf901"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 42 locations): source/catboost-schema.js:220 \u00B7 source/circle-schema.js:952 \u00B7 source/circle-schema.js:969 \u00B7 source/circle-schema.js:1342 \u00B7 \u002B38 more site(s) not listed \u2014 the 42 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/catboost-schema.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd9c5d437fb88beeed2df7a7d3c8052abcc6bf2827cf2388db3f48446ce5e57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): source/circle-schema.js:58 \u00B7 source/executorch-schema.js:285 \u00B7 source/executorch-schema.js:1462 \u2014 the 3 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":"source/circle-schema.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13eed95ce3c73eb0f3246c28530fcab292e5d368839cca61b548e2201d525b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/circle-schema.js:173 \u00B7 source/executorch-schema.js:186 \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":"source/circle-schema.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2d6a32f1623107074c583bf85c1ba5b065e7489e25560268c94b3f244b23b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8 locations): source/circle-schema.js:927 \u00B7 source/circle-schema.js:1067 \u00B7 source/circle-schema.js:1126 \u00B7 source/circle-schema.js:1143 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 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":"source/circle-schema.js"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a274834d6ab5a8652a02e62c8cd93083f3d92089cac640b045a59e83ac5857"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/circle-schema.js:950 \u00B7 source/circle-schema.js:1141 \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":"source/circle-schema.js"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e4c16d474a42c2248668d6a73aa3df14d7658431e379661245566eb0ff2b25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8 locations): source/circle-schema.js:988 \u00B7 source/circle-schema.js:1871 \u00B7 source/circle-schema.js:2053 \u00B7 source/circle-schema.js:2802 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 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":"source/circle-schema.js"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"123286706e8e224105cc69b98e3962c912085c66e5a58fae947f07e961d18498"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 10 locations): source/circle-schema.js:1539 \u00B7 source/circle-schema.js:1603 \u00B7 source/circle-schema.js:2177 \u00B7 source/circle-schema.js:2662 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 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":"source/circle-schema.js"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2b7510075cea3552a7598c17cda048964cae99a0027a731f54a69e78d7ba42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7 locations): source/circle-schema.js:2162 \u00B7 source/circle-schema.js:2360 \u00B7 source/circle-schema.js:2452 \u00B7 source/circle-schema.js:2614 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 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":"source/circle-schema.js"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8515495d0143c3037bceaf503860316235e506f5a7715a134c7cc8ba5d41b35b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/circle.js:407 \u00B7 source/megengine.js:409 \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":"source/circle.js"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"babcf72969606c721b9ee9dedc435f65e22322ccbdd688639cc33f6020342aa9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): source/circle.js:274 \u00B7 source/om.js:96 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 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":"source/circle.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"0049feb2fe2bc8cd2c9d9b27af3e0223fce38108b5357b160eef9b405b3129c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 61 locations): source/cntk-proto.js:4 \u00B7 source/cntk-proto.js:214 \u00B7 source/coreml-proto.js:1499 \u00B7 source/coreml-proto.js:1540 \u00B7 \u002B57 more site(s) not listed \u2014 the 61 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/cntk-proto.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"875fd70afa3dba212c99793f31a41e7b5afbdf0699ef4f8e0f8d2afc4ebf1334"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): source/cntk.js:415 \u00B7 source/mxnet.js:532 \u00B7 source/openvino.js:616 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/cntk.js"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe08b5eadcc78a675b6a588158ad7f1b5bd8322c16afbbdfb9a017aac167720"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7 locations): source/coreml-proto.js:4609 \u00B7 source/coreml-proto.js:4791 \u00B7 source/coreml-proto.js:4837 \u00B7 source/coreml-proto.js:5122 \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":"source/coreml-proto.js"},"region":{"startLine":4609}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd52283663db27c97ae4af72ffe0aab89330be5d581639f0f09850d70a599c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/coreml-proto.js:18041 \u00B7 source/coreml-proto.js:18093 \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":"source/coreml-proto.js"},"region":{"startLine":18041}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac073b85ed435c4a14f2a322612f92473f24b089d36af342712f6e9edf13156"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/coreml.js:664 \u00B7 source/coreml.js:673 \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":"source/coreml.js"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b3a4fd0e962e93de142610c2f889ba9da080c102602d37517ee2c4c103d4ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/coreml.js:991 \u00B7 source/coreml.js:1003 \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":"source/coreml.js"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"e650611a4c13d3b31203ae48da3878f5ac982c8b22fc79cb79f7219b9dd5f8aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/dagre.js:2264 \u00B7 source/grapher.js:23 \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":"source/dagre.js"},"region":{"startLine":2264}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6cd93835180088c6b4acf5b838994e92703f0e9389e4d422e9d84e327c11e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/darknet.js:624 \u00B7 source/darknet.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":"source/darknet.js"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"9daad434204dc5922ef66054823a824d1065cd047eb416964c230e90a450d4e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): source/darknet.js:906 \u00B7 source/dl4j.js:322 \u00B7 source/mxnet.js:652 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/darknet.js"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"07884c69efcd6572dc4ca339c0a8134eb115a86eccec68740399e99d872f96f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): source/desktop.mjs:218 \u00B7 source/view.js:45 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 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":"source/desktop.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ba020d61bb8919cd6b7b3fb9c07adb82eb8ee5f6d183b199792c282f5dfbaf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): source/dlc-schema.js:50 \u00B7 source/dlc-schema.js:231 \u00B7 source/dlc-schema.js:270 \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":"source/dlc-schema.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bc8b2856a7ef08ced13db0fe5437a67cf8f928ee772b3a83eb7c90b3ed501b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): source/dot.js:53 \u00B7 source/mlnet.js:43 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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":"source/dot.js"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ef25bd27a48b833ae0b11b64af33a606f45978c5c7cb446344ac013824973a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 22 locations): source/espdl-schema.js:83 \u00B7 source/espdl-schema.js:132 \u00B7 source/espdl-schema.js:152 \u00B7 source/espdl-schema.js:170 \u00B7 \u002B18 more site(s) not listed \u2014 the 22 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":"source/espdl-schema.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7db03df9843a7b1d99e6e5e9e617dd9bc30a6baa672b37c998a1839d94b596f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/espdl-schema.js:143 \u00B7 source/espdl-schema.js:299 \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":"source/espdl-schema.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43a7034fca44ad669c5343014ca42b4a68c3d4229ca5db1f386f26b420b4c4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/espdl-schema.js:306 \u00B7 source/executorch-schema.js:451 \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":"source/espdl-schema.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9fc71e9db380dfee0b18bef7f894f41c12baf1628576a5d301fb03a209c169"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/espdl.js:27 \u00B7 source/mslite.js:33 \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":"source/espdl.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"344322c8cad3a4a3329eb3b4839d80c59c6816f914a61699bc545afd388dfe08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): source/espdl.js:351 \u00B7 source/espdl.js:360 \u00B7 source/espdl.js:369 \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":"source/espdl.js"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"d907514f05981da26f0a73ec2005972bad35b9029ce8881dc7826d6d374c99ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): source/espdl.js:99 \u00B7 source/tf.js:834 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 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":"source/espdl.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"da98d9d7d4a4a8a922021cde80b44dfff049a778d5f8302908b1bfa994e14c5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/espresso.js:318 \u00B7 source/espresso.js:332 \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":"source/espresso.js"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e6b57c8266c4be21b78e4185070d94302e29728f95a1d9b4045810c4de9bfa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/executorch-schema.js:508 \u00B7 source/mnn-schema.js:3216 \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":"source/executorch-schema.js"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"465853ad81e8d7a64a687c39569c1ff2157100831effc5d8c50057219f029406"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): source/executorch-schema.js:727 \u00B7 source/executorch-schema.js:739 \u00B7 source/executorch-schema.js:750 \u00B7 source/executorch-schema.js:791 \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":"source/executorch-schema.js"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"176f95829e374139e58f59981ef95d98f068822456da4cf0caccb5cf40f13fb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/flexbuffers.js:34 \u00B7 source/flexbuffers.js:44 \u2014 both copies are in the same file, so extract the block 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":"source/flexbuffers.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb0f1fc7daf6b6b5a01d7efc31d07abcdb94d91caba3772d9a90b7d1ef4e08e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7 locations): source/gguf.js:371 \u00B7 source/gguf.js:433 \u00B7 source/gguf.js:452 \u00B7 source/gguf.js:471 \u00B7 \u002B3 more site(s) not listed \u2014 all 7 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":"source/gguf.js"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"606ce3f5077da66f446f75b2f1aec11c720376b1684d9daa61ded2642a955198"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/jax.js:65 \u00B7 source/jax.js:74 \u2014 both copies are in the same file, so extract the block 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":"source/jax.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"707498fae866c748040e04d13297228fc5a1e0a8247b844a20b7bf392f5201b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/kmodel.js:73 \u00B7 source/kmodel.js:82 \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":"source/kmodel.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e15d0f9c915bd9bd84842093956aa8c9cfee92d0bfa8c7be7e580068293248"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): source/kmodel.js:698 \u00B7 source/kmodel.js:864 \u00B7 source/kmodel.js:879 \u00B7 source/kmodel.js:894 \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":"source/kmodel.js"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8aa20dfa6d4d074058cdac762d882e5f15c841d318b4f47737ef4cee288e2ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/litertlm-proto.js:124 \u00B7 source/paddle-proto.js:598 \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":"source/litertlm-proto.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4964c10feb5d14930fceb48a6cbe51bef1ca976f4b46f829ed91ca53df8e937"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): source/litertlm-proto.js:156 \u00B7 source/litertlm-proto.js:818 \u00B7 source/paddle-proto.js:1369 \u2014 the 3 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":"source/litertlm-proto.js"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"282b2c4c562ab75228c5083662d234e99d8385e644a500771810ecf5ff42131f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/litertlm-schema.js:131 \u00B7 source/megengine-schema.js:46 \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":"source/litertlm-schema.js"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2825f429bb0c016d563bfeaa77097395c1b442b758cabb304e11c84bd68975f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): source/megengine-schema.js:1011 \u00B7 source/megengine-schema.js:1022 \u00B7 source/megengine-schema.js:2107 \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":"source/megengine-schema.js"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1a81998c0028d4337686c9d3e53ff01523589ec3a04dd65759d7573579a576"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6 locations): source/megengine-schema.js:1045 \u00B7 source/megengine-schema.js:1146 \u00B7 source/megengine-schema.js:1157 \u00B7 source/megengine-schema.js:1294 \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":"source/megengine-schema.js"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32a821bbfd515e2f9d673185b89e9e153549211433b7094ec30f6a26fa29c4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mindir-proto.js:163 \u00B7 source/onnx-proto.js:231 \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":"source/mindir-proto.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3496f3a858b297d8bbafc5f1d57932cb22d6edf3786263c46b35a6ddce7d3b67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mindir-proto.js:759 \u00B7 source/onnx-proto.js:1265 \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":"source/mindir-proto.js"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0c7441727615b1502165ad890995cf6d9c3e949f818c79e23d1e946bd93f1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mlir.js:1997 \u00B7 source/mlir.js:19337 \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":"source/mlir.js"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"09edec9a8e19de7202e4a3c3b17d08cde8e7d0cf1f7073292b111cad4927cbbf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): source/mlir.js:3160 \u00B7 source/mlir.js:3172 \u00B7 source/mlir.js:3196 \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":"source/mlir.js"},"region":{"startLine":3160}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c7f6d96b808ef95ce21430da64425ba6eece982acb13971e74d26221df00f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mlir.js:3169 \u00B7 source/mlir.js:3193 \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":"source/mlir.js"},"region":{"startLine":3169}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ae1055f2d8e9380d1ee33a131bfc84c6a84fa54301a16a31bf01afb2e4f2d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mlir.js:3693 \u00B7 source/mlir.js:3711 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":3693}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af4fc6a81850a1f9c23684e1fb3fea6a05fe82249890444aacf6f951da3ec57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mlir.js:4096 \u00B7 source/mlir.js:4108 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":4096}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9410c045c12f8ae5cfe5e58f5b0553dad8285b39185dae637706413b6d74b34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mlir.js:11006 \u00B7 source/mlir.js:11046 \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":"source/mlir.js"},"region":{"startLine":11006}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbb492ab015ab3fa1c5d9157e1b5f80d27f792352aa223a1b631fddd7f310ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): source/mlir.js:11941 \u00B7 source/mlir.js:19598 \u00B7 source/mlir.js:19746 \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":"source/mlir.js"},"region":{"startLine":11941}}}],"partialFingerprints":{"codehealthFindingId/v1":"559ce48b73bd20586464422ee50cb16c3211e016fcd8c2bed4218e0acbf2d0a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mlir.js:11983 \u00B7 source/mlir.js:19662 \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":"source/mlir.js"},"region":{"startLine":11983}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ee90fff24b37d24b4fa264b3c3d6e3a1695379c325982f01ba3fef8b8a26e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): source/mlir.js:11994 \u00B7 source/mlir.js:12022 \u00B7 source/mlir.js:12059 \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":"source/mlir.js"},"region":{"startLine":11994}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80958681506cd55ba81af5827f9f9e2df738d3153f94a3c24eac568fcc16048"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mlir.js:12317 \u00B7 source/mlir.js:12334 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":12317}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4ad52199c0d3336dae4e08d953f69df60eb952c9da1055a2383f9983749276"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): source/mlir.js:13393 \u00B7 source/mlir.js:21504 \u00B7 source/mlir.js:21517 \u00B7 source/mlir.js:21532 \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":"source/mlir.js"},"region":{"startLine":13393}}}],"partialFingerprints":{"codehealthFindingId/v1":"1412696293712bb81fb3c7d21d3bfe7209967911ed49b11b14ec9996c9ba338d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mlir.js:13799 \u00B7 source/mlir.js:13844 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":13799}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0df8d58f1717231b6444bc5c5a0f2f03ec6a78c629f7e9beaf2c9b822b4209d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mlir.js:14031 \u00B7 source/mlir.js:14070 \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":"source/mlir.js"},"region":{"startLine":14031}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf43e8722ddc42e36cf1253549816ab0f3956fd89221e4b7c31dd4394042d759"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): source/mlir.js:14431 \u00B7 source/mlir.js:15231 \u00B7 source/mlir.js:29067 \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":"source/mlir.js"},"region":{"startLine":14431}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47b882d9154f6e8333262acc1530ddc591b99744aea48d45e0dac35533159cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mlir.js:16055 \u00B7 source/mlir.js:16289 \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":"source/mlir.js"},"region":{"startLine":16055}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4ee890982d6aa0e4a961422775c1bd4719b5e3096993617b526b63c328bbb7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mlir.js:17244 \u00B7 source/mlir.js:17268 \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":"source/mlir.js"},"region":{"startLine":17244}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f460dbda4f240d62428cbf4e773c00c07790dc3c4599c52b2ed8940571f35a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mlir.js:19848 \u00B7 source/mlir.js:25383 \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":"source/mlir.js"},"region":{"startLine":19848}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41d6f2414d95208b47cf789a562e3e1a4f976453a2f24bae0f4f3b10dafcf5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): source/mlir.js:21114 \u00B7 source/mlir.js:21135 \u00B7 source/mlir.js:21159 \u00B7 source/mlir.js:21185 \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":"source/mlir.js"},"region":{"startLine":21114}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc03b300fec393106e5be211c21b02981e00e8d4968e4fa00cb943b819d12166"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6 locations): source/mlir.js:21554 \u00B7 source/mlir.js:24816 \u00B7 source/mlir.js:26246 \u00B7 source/mlir.js:27004 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 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":"source/mlir.js"},"region":{"startLine":21554}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b4a21e03630dd4dce2a1573fce5264d13522c08693f0373ef9b7ccf459ad34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): source/mlir.js:22887 \u00B7 source/mlir.js:23344 \u00B7 source/mlir.js:24129 \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":"source/mlir.js"},"region":{"startLine":22887}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3058f8fd8f80543c5a2138d1fe6b2a7874504d00b08e294109e2d8c3af983a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mlir.js:24935 \u00B7 source/mlir.js:25001 \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":"source/mlir.js"},"region":{"startLine":24935}}}],"partialFingerprints":{"codehealthFindingId/v1":"783784b0806b507e3e605f1b7eeb03ad2a9e47c3296473420b55ee1f7d243f6a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mlir.js:25804 \u00B7 source/mlir.js:25816 \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":"source/mlir.js"},"region":{"startLine":25804}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4edd3296b0391226e9ff1e2d3c62e484a3296fa4c9001cdb6301d13f1249283"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): source/mlir.js:27731 \u00B7 source/mlir.js:27740 \u00B7 source/mlir.js:27749 \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":"source/mlir.js"},"region":{"startLine":27731}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d044f8f9f7d4f6c92d3350e895f70e408144ef26e36607be4d87a3e3ccf1f26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mlir.js:27842 \u00B7 source/mlir.js:28011 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":27842}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e81d0e82efc3846fac3453915944adf31f117dfb611146ca1c9f79163da9e3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mlnet.js:1562 \u00B7 source/mlnet.js:1680 \u2014 both copies are in the same file, so extract the block 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":"source/mlnet.js"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb9e5aa04ecce22ce1862d13ec8dd7168774cb5e1ce798fd55ef2f5510edcc9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mlnet.js:2103 \u00B7 source/mlnet.js:2130 \u2014 both copies are in the same file, so extract the block 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":"source/mlnet.js"},"region":{"startLine":2103}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a47b98629890ea2589686db7b1b62a77b1664f922aae78cfc8629647f8d602"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): source/mnn-schema.js:484 \u00B7 source/mnn-schema.js:1812 \u00B7 source/mnn-schema.js:2050 \u00B7 source/mnn-schema.js:2195 \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":"source/mnn-schema.js"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4bfa91714dcb32ea6dd5810b444a40f382a46b429d649d8656f7cd09544d1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): source/mnn-schema.js:1322 \u00B7 source/mnn-schema.js:2340 \u00B7 source/mnn-schema.js:3243 \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":"source/mnn-schema.js"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd75700bcb62bb48255b832ec69686484bff3f8d411ef4c21345384546e71d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 12 locations): source/mslite-schema.js:907 \u00B7 source/mslite-schema.js:936 \u00B7 source/mslite-schema.js:993 \u00B7 source/mslite-schema.js:1010 \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":"source/mslite-schema.js"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"37be91044fb63609eca160183969b08d7d38381865984cddf2efa439a1259e23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7 locations): source/mslite-schema.js:1212 \u00B7 source/mslite-schema.js:1249 \u00B7 source/mslite-schema.js:1284 \u00B7 source/mslite-schema.js:1822 \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":"source/mslite-schema.js"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2c8e5200df11978e58cd8764d61e77e84e154eb96ab7b9af750c1a65da78ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mslite-schema.js:1354 \u00B7 source/mslite-schema.js:4073 \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":"source/mslite-schema.js"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"75837a1ec762a5fce344cf1dbf9dd9e9535e392f1a96430c8286896a43ccf8ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/mslite-schema.js:1479 \u00B7 source/mslite-schema.js:2089 \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":"source/mslite-schema.js"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"959a5fda5eda0f25979de537e6d539b98368201d99d1dcf2fc8b0bd5473ee9e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): source/mslite-schema.js:3929 \u00B7 source/mslite-schema.js:4435 \u00B7 source/mslite-schema.js:4526 \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":"source/mslite-schema.js"},"region":{"startLine":3929}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6332560efcb274c918511707cf1bd3d66832f89fba700b9ecbf4ebed44e20f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): source/ncnn.js:616 \u00B7 source/ncnn.js:637 \u00B7 source/ncnn.js:654 \u00B7 source/ncnn.js:678 \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":"source/ncnn.js"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"59704bfd6410de5a54a3084cf4224eda9a2aa724cc0949bbda4f1805396c1c35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): source/nnabla-proto.js:3164 \u00B7 source/nnabla-proto.js:10505 \u00B7 source/onnx-proto.js:607 \u2014 the 3 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":"source/nnabla-proto.js"},"region":{"startLine":3164}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed350901f4095cd49d64c402daef5123ae72fc7eacf0754644a3c1546991a3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): source/nnabla-proto.js:4356 \u00B7 source/nnabla-proto.js:4416 \u00B7 source/nnabla-proto.js:5934 \u00B7 source/nnabla-proto.js:11059 \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":"source/nnabla-proto.js"},"region":{"startLine":4356}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b6509b193b2a89bf34dd451d86715fb663f85933f7e609fe16d2eaaf0f40a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/nnabla-proto.js:4686 \u00B7 source/nnabla-proto.js:4834 \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":"source/nnabla-proto.js"},"region":{"startLine":4686}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4333ee8a88e45f81eb62885046f456f8eed9b62c4a5f709337370a1b0057c26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8 locations): source/nnabla-proto.js:4927 \u00B7 source/nnabla-proto.js:4994 \u00B7 source/nnabla-proto.js:5068 \u00B7 source/nnabla-proto.js:10626 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 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":"source/nnabla-proto.js"},"region":{"startLine":4927}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba6fc94bd97d877d92283817b04c918d6baec6700c19b83ebadda137663223e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/nnabla-proto.js:9656 \u00B7 source/nnabla-proto.js:9737 \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":"source/nnabla-proto.js"},"region":{"startLine":9656}}}],"partialFingerprints":{"codehealthFindingId/v1":"5812ec886ae413be010f93f2824897a80c537609e047bce7d1d4a74e06a3e873"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): source/om.js:96 \u00B7 source/tflite.js:282 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 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":"source/om.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"227092e642cd5732d6f5540039c73e7f29dbc84c1b57d195cff152d8893773c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/onednn.js:178 \u00B7 source/onednn.js:187 \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":"source/onednn.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b456140999c96c0a57f70f8b67b549e0cf15e9a01b3051865d5469233b386657"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/onnx-schema.js:266 \u00B7 source/onnx-schema.js:387 \u2014 both copies are in the same file, so extract the block 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":"source/onnx-schema.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a967856c894e88fed4727bb7ac9d0ab278b839e0f82e56bd71a8aa45d4a06c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): source/onnx.js:458 \u00B7 source/onnx.js:476 \u00B7 source/onnx.js:485 \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":"source/onnx.js"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f660acd808892bfe2e6cf3fa94a0676caa339171d560dd4e65a2e01d203738"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/onnx.js:527 \u00B7 source/onnx.js:552 \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":"source/onnx.js"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"89439d9fb08d97d13929756517fc82e1c7060a358950c35c68c64abc91f06637"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/onnx.js:871 \u00B7 source/onnx.js:883 \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":"source/onnx.js"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ba4b016f3c22d9bbc847b17912ffb655180cb5bdc9d2e02dc8fccccaaceb4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/onnx.js:2834 \u00B7 source/onnx.js:2867 \u2014 both copies are in the same file, so extract the block 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":"source/onnx.js"},"region":{"startLine":2834}}}],"partialFingerprints":{"codehealthFindingId/v1":"adaff8078d68ac383f9c829c3f284752b126d1a5d90b500350f063d8c88c21a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): source/paddle-proto.js:162 \u00B7 source/paddle-proto.js:852 \u00B7 source/paddle-proto.js:983 \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":"source/paddle-proto.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"123bc23e2c269e5c91587176e094f4386b3ee3c0b9454b3a280f2211179362ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/paddle.js:958 \u00B7 source/paddle.js:973 \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":"source/paddle.js"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"01cd41221e6dc8941c7cd129238beb17d6047ca1e3aa256ecd19ba7f826cbfa1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/protobuf.js:1276 \u00B7 source/protobuf.js:1285 \u2014 both copies are in the same file, so extract the block 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":"source/protobuf.js"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7e2cd66039630dfa2f4a15ec331a3825c8c3eb8cf64eef919c4f118c086fbf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): source/python.js:719 \u00B7 source/python.js:738 \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":"source/python.js"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded5c32139661addd87525ab2c63f852e5784b8f6c4855402ac3786a66be0f9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): source/pytorch.js:1497 \u00B7 source/safetensors.js:13 \u2014 the two spans are one implementation copied and then locally edited \u2014 70 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":"source/pytorch.js"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb95d712f2817dbcf39881feec4ebb0eb38a74e61d7d70b5971b8c0e6eaf88b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): source/tosa.js:183 \u00B7 source/tosa.js:191 \u2014 the two spans are one implementation copied and then locally edited \u2014 92 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":"source/tosa.js"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"616caec5a7f93bc6f9038d589757e6d95d199eed67b72d89e4a5dd585bbdc44f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 15 locations): source/armnn-schema.js:607 \u00B7 source/armnn-schema.js:661 \u00B7 source/armnn-schema.js:1404 \u00B7 source/armnn-schema.js:2468 \u00B7 \u002B11 more site(s) not listed \u2014 the 15 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/armnn-schema.js"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a670c0d0a16c31954219354ecc21c12264878117fdc7918c6c841f384052bd4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6 locations): source/armnn-schema.js:774 \u00B7 source/armnn-schema.js:1219 \u00B7 source/armnn-schema.js:1740 \u00B7 source/mnn-schema.js:913 \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":"source/armnn-schema.js"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a40aab3d60716cad3b931e84910aefc77d87836eaf61c66092a81cd71e7583"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 14 locations): source/armnn-schema.js:1454 \u00B7 source/armnn-schema.js:1486 \u00B7 source/armnn-schema.js:1533 \u00B7 source/armnn-schema.js:1618 \u00B7 \u002B10 more site(s) not listed \u2014 the 14 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/armnn-schema.js"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9451d9b977b140703381850cc077428e8a7dce8ae3fb12d7e9821798bf92feb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 9 locations): source/armnn-schema.js:1469 \u00B7 source/armnn-schema.js:1501 \u00B7 source/armnn-schema.js:1898 \u00B7 source/armnn-schema.js:2516 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 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":"source/armnn-schema.js"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"804861042abee286f832b6560408ead32c3e3c9cff4e24193cede73b92a3b971"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/armnn-schema.js:1635 \u00B7 source/mnn-schema.js:304 \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":"source/armnn-schema.js"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"1831a4e868831cde690742b91aa955ab80668b3d568d0ea547555833733005fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 11 locations): source/armnn-schema.js:1679 \u00B7 source/circle-schema.js:1529 \u00B7 source/mnn-schema.js:1120 \u00B7 source/mnn-schema.js:1161 \u00B7 \u002B7 more site(s) not listed \u2014 the 11 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":"source/armnn-schema.js"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"28eb62a9339772027e1f28c5f42e5f7ac3de93295cad8d659544b621b0e9b7b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 10 locations): source/armnn-schema.js:1851 \u00B7 source/armnn-schema.js:2544 \u00B7 source/circle-schema.js:1498 \u00B7 source/circle-schema.js:1726 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/armnn-schema.js"},"region":{"startLine":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1643ff83de57365e5ea114bc2bfd615c9cd4554cce953d6724a95ef452846ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 15 locations): source/armnn-schema.js:1995 \u00B7 source/armnn-schema.js:2609 \u00B7 source/circle-schema.js:43 \u00B7 source/circle-schema.js:2038 \u00B7 \u002B11 more site(s) not listed \u2014 the 15 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/armnn-schema.js"},"region":{"startLine":1995}}}],"partialFingerprints":{"codehealthFindingId/v1":"260add1a15bb50dbd4594bf5d0f9481cdc3d1b88d1e920fa8a9a58f9b9eefc59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 26 locations): source/armnn-schema.js:2105 \u00B7 source/armnn-schema.js:2298 \u00B7 source/armnn-schema.js:3046 \u00B7 source/circle-schema.js:95 \u00B7 \u002B22 more site(s) not listed \u2014 the 26 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/armnn-schema.js"},"region":{"startLine":2105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e729d12d3d7c5ebc62d81dbb6be2d6f1798d7907996481be2b91d0b7215d693e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/armnn.js:2 \u00B7 source/mxnet.js:4 \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":"source/armnn.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"acea79a09b6bf794c28580780d20e891b1828fdddacb4d24cfc0621bae48033b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/barracuda.js:114 \u00B7 source/espdl.js:71 \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":"source/barracuda.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff388837c2e9d27df2f99a4d6ce027d42d541ecf2efc992009934ee6300ca97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 10 locations): source/bigdl-proto.js:447 \u00B7 source/caffe-proto.js:1070 \u00B7 source/caffe-proto.js:4489 \u00B7 source/mindir-proto.js:851 \u00B7 \u002B6 more site(s) not listed \u2014 the 6 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/bigdl-proto.js"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6473d51617578c11e922f9bb36dd5e369203edb605c8768bb55e6a32483ca51"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/browser.js:195 \u00B7 source/browser.js:212 \u2014 both copies are in the same file, so extract the block 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":"source/browser.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d0702e7283b035b25ddced1c81357b699c99c4ba72f4e25e48188441ef3e9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/browser.js:597 \u00B7 source/desktop.mjs:618 \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":"source/browser.js"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c77396c0c7d57fd1f5c23ce588338bb033d99389d60df1274001b47cabb09e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): source/caffe-proto.js:1108 \u00B7 source/onnx-proto.js:625 \u00B7 source/onnx-proto.js:1444 \u2014 the 3 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":"source/caffe-proto.js"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0635fff34a74c4b6de258cdbd1f99dc3637bc178ff3c82aa05808ed4289a36d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 112 locations): source/caffe-proto.js:1119 \u00B7 source/caffe-proto.js:1128 \u00B7 source/caffe-proto.js:1137 \u00B7 source/caffe-proto.js:1146 \u00B7 \u002B108 more site(s) not listed \u2014 the 112 copies are spread across 5 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":"source/caffe-proto.js"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"846da60ce8ed421e480b62d99dfe5addd2821c1812eaf9609db16d6c109623a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 11 locations): source/caffe-proto.js:1601 \u00B7 source/nnabla-proto.js:3109 \u00B7 source/nnabla-proto.js:4300 \u00B7 source/nnabla-proto.js:4360 \u00B7 \u002B7 more site(s) not listed \u2014 the 11 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":"source/caffe-proto.js"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"3daa44aa87336597c44d6ad2788d2f51dbc67d05e4a9f27966b667e652652240"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): source/caffe-proto.js:2392 \u00B7 source/caffe2-proto.js:588 \u00B7 source/mindir-proto.js:757 \u00B7 source/onnx-proto.js:1263 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":2392}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81aa8f1b52d33ded808b29bfa500f410f09416723cd330a2397551bb0326947"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/caffe-proto.js:2716 \u00B7 source/caffe-proto.js:3905 \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":"source/caffe-proto.js"},"region":{"startLine":2716}}}],"partialFingerprints":{"codehealthFindingId/v1":"3618d9a2d8c9bea21c44b4f516750db32ee857c3be8d98bf37e2af6908a06537"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): source/caffe-proto.js:2968 \u00B7 source/caffe-proto.js:4416 \u00B7 source/nnabla-proto.js:9910 \u00B7 source/nnabla-proto.js:11756 \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":"source/caffe-proto.js"},"region":{"startLine":2968}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1ad7fb0c15dd7f8584ab084d89842638bda49c5a1b5ee9b7cea6afee655cdb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): source/caffe-proto.js:3670 \u00B7 source/nnabla-proto.js:2178 \u00B7 source/nnabla-proto.js:2259 \u00B7 source/nnabla-proto.js:2340 \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":"source/caffe-proto.js"},"region":{"startLine":3670}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e411ed9244bb4709113a455dc59e5b46e7ed0c30d1f2666a9a3fe8c9722ef4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): source/caffe.js:425 \u00B7 source/caffe.js:445 \u00B7 source/cntk.js:369 \u00B7 source/ncnn.js:309 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"source/caffe.js"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"69df1a0f4d5fa28098541dc79e934f3e75e901beef3b8c13c15e2b165ffc46ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 12 locations): source/caffe2-proto.js:149 \u00B7 source/coreml-proto.js:8380 \u00B7 source/coreml-proto.js:8426 \u00B7 source/coreml-proto.js:9032 \u00B7 \u002B8 more site(s) not listed \u2014 the 12 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe2-proto.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a255d8b4c63fe6f1004ba4c0da990af326ea4ea3471eb367111d93b27f61ed89"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): source/caffe2-proto.js:519 \u00B7 source/mindir-proto.js:882 \u00B7 source/onnx-proto.js:1423 \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":"source/caffe2-proto.js"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"048313bc2347bc3fc9f2f5118c29fabb50f3397e1a37dbb87a25286e8bd2b1fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 9 locations): source/caffe2-proto.js:926 \u00B7 source/dnn-proto.js:112 \u00B7 source/mindir-proto.js:490 \u00B7 source/mindir-proto.js:843 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 copies are spread across 5 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":"source/caffe2-proto.js"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c971e8320009aba6803b8477aa558f909554d055f951a6567e488659062ae01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/caffe2-proto.js:1044 \u00B7 source/nnabla-proto.js:4619 \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":"source/caffe2-proto.js"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"7184bf6f9f3c1891c2fae6019512ed8de3ef4855917ff58f4177bbed4891f3c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): source/caffe2-proto.js:1588 \u00B7 source/nnabla-proto.js:1300 \u00B7 source/nnabla-proto.js:11183 \u2014 the 3 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":"source/caffe2-proto.js"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"813a303bc240cf3ff97da62fc320d4679c465aba537b97d9165955751476b26a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/catboost.js:147 \u00B7 source/catboost.js:155 \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":"source/catboost.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec11e538cbded019d794ea33c36f4f172af2d105ae0c95d0d70d25dad091383"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 15 locations): source/circle-schema.js:98 \u00B7 source/circle-schema.js:1236 \u00B7 source/circle-schema.js:3092 \u00B7 source/executorch-schema.js:150 \u00B7 \u002B11 more site(s) not listed \u2014 the 15 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":"source/circle-schema.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1773e9b41fc47028461745eee9a29066b8ef2f41317d72e7ddb15ebb940e66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): source/circle-schema.js:205 \u00B7 source/mnn-schema.js:248 \u00B7 source/mnn-schema.js:1050 \u00B7 source/mnn-schema.js:1973 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"source/circle-schema.js"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bffb76ddb29f4b5a7a9636481aa4eb1823dc4d9de37f7a1aeb1c5a8b3a15b5e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): source/circle-schema.js:916 \u00B7 source/circle-schema.js:1186 \u00B7 source/mnn-schema.js:85 \u2014 the 3 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":"source/circle-schema.js"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedb9d286ab97dbe93da8acadccda102778be22fe1b6944795b751ad3846d941"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/circle-schema.js:1003 \u00B7 source/circle-schema.js:1143 \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":"source/circle-schema.js"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca1e737c38b5237b1bb8b949a9e8413fcb9d9971ae58b6619e7c384254eb43d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6 locations): source/circle-schema.js:1101 \u00B7 source/circle-schema.js:3574 \u00B7 source/circle-schema.js:3591 \u00B7 source/executorch-schema.js:444 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/circle-schema.js"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"93632ceec8adbd90597b55f54560aed70885b41164e051a4591afbbcf921b2a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/circle-schema.js:1508 \u00B7 source/mnn-schema.js:2389 \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":"source/circle-schema.js"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b892c3013ec4a4194ddca4f3dd64ad9f1d572f95f4141d78d16c938ef49814"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6 locations): source/circle-schema.js:1853 \u00B7 source/circle-schema.js:2090 \u00B7 source/circle-schema.js:2419 \u00B7 source/mnn-schema.js:1932 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 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":"source/circle-schema.js"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"780e78ebf571dba25ab3720b654efb63c32481fd3b67f00813eecd72ab5fe4ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/circle.js:133 \u00B7 source/coreml.js:559 \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":"source/circle.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04a72930617942f35855b47a348b1c472fc661cf379c6e82bcbe94d6d142f73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): source/circle.js:307 \u00B7 source/keras.js:1116 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 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":"source/circle.js"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"091d4947f7f0c51b7774448dcedb3c8189f703645541dd3a872d2db0bc3746af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/cntk.js:630 \u00B7 source/cntk.js:839 \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":"source/cntk.js"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"e656b18433016732e579fd28cc7004e605dab61a1eb284604a7f47d9e59060be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/cntk.js:1045 \u00B7 source/cntk.js:1054 \u2014 both copies are in the same file, so extract the block 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":"source/cntk.js"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3deefc376eee27fd500b830472af63da62fb23cedbe3554c3f0cf100bdd2cac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 14 locations): source/coreml-proto.js:849 \u00B7 source/coreml-proto.js:5269 \u00B7 source/coreml-proto.js:5310 \u00B7 source/coreml-proto.js:5351 \u00B7 \u002B10 more site(s) not listed \u2014 the 14 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":"source/coreml-proto.js"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63ab83084727976d6f1019298de82a5bb85abcefca1a6c02c50447b3cac0c8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 25 locations): source/coreml-proto.js:1803 \u00B7 source/coreml-proto.js:2167 \u00B7 source/coreml-proto.js:2439 \u00B7 source/coreml-proto.js:2487 \u00B7 \u002B21 more site(s) not listed \u2014 the 25 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":"source/coreml-proto.js"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"5584525e6142c649a83d9c14fa53dd92a19d5d62ad43b733a50efb6fa21a2a2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): source/coreml-proto.js:2815 \u00B7 source/coreml-proto.js:17076 \u00B7 source/coreml-proto.js:18207 \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":"source/coreml-proto.js"},"region":{"startLine":2815}}}],"partialFingerprints":{"codehealthFindingId/v1":"86edea6360e07539db2468f5cdad45de0701a2db9c4b6cf30c95520926c9d616"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): source/coreml-proto.js:3390 \u00B7 source/coreml-proto.js:9330 \u00B7 source/coreml-proto.js:16139 \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":"source/coreml-proto.js"},"region":{"startLine":3390}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57e68fc19f994cedc141a2458c4f07baf86cd94023b324d0a7e6cf6d36fb6c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): source/coreml-proto.js:3642 \u00B7 source/coreml-proto.js:11266 \u00B7 source/coreml-proto.js:11617 \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":"source/coreml-proto.js"},"region":{"startLine":3642}}}],"partialFingerprints":{"codehealthFindingId/v1":"2698383ffaf9abafdf00bfc8a1a2d525344aada25521cfa0587744f69728de4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/coreml-proto.js:4254 \u00B7 source/coreml-proto.js:17800 \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":"source/coreml-proto.js"},"region":{"startLine":4254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a465e2d4c2c04b113c9ab15a7031415bd4a7625876ac1e4553936ede3f51b87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 15 locations): source/coreml-proto.js:4581 \u00B7 source/coreml-proto.js:4772 \u00B7 source/coreml-proto.js:4818 \u00B7 source/coreml-proto.js:5097 \u00B7 \u002B11 more site(s) not listed \u2014 the 15 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":"source/coreml-proto.js"},"region":{"startLine":4581}}}],"partialFingerprints":{"codehealthFindingId/v1":"e284a6ac6d2109ea618cf53c4f2fa6ca446fb9b8f3b94e2d0cb6e180d5de021e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): source/coreml-proto.js:9105 \u00B7 source/coreml-proto.js:11386 \u00B7 source/coreml-proto.js:12009 \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":"source/coreml-proto.js"},"region":{"startLine":9105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d11b244e81f93e54458b53816f12fcd3bdee71d994ad9d8832359f10891c7a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/coreml-proto.js:11111 \u00B7 source/coreml-proto.js:11460 \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":"source/coreml-proto.js"},"region":{"startLine":11111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5169c848f6fc5043fb70800439948c291ef0bc5086305a7705f28df96bb645ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/dagre.js:2410 \u00B7 source/dagre.js:2418 \u2014 both copies are in the same file, so extract the block 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":"source/dagre.js"},"region":{"startLine":2410}}}],"partialFingerprints":{"codehealthFindingId/v1":"511bbe367ee8ac8ec0eb158659892adb85517bebe046737271921a1f94e7dbd1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/darknet.js:221 \u00B7 source/darknet.js:252 \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":"source/darknet.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b9c17d04ea1b699bf0c8a887ba5a1247339e446a40097a3a787cc1397a00a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/darknet.js:465 \u00B7 source/darknet.js:491 \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":"source/darknet.js"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37e73745ee6bb1b7128942d7e7ec923012cf1b6e984b7379f60f55330d0fd48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8 locations): source/dlc-schema.js:82 \u00B7 source/dlc-schema.js:103 \u00B7 source/dlc-schema.js:237 \u00B7 source/dlc-schema.js:257 \u00B7 \u002B4 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":"source/dlc-schema.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cc54c88746807ff15dfa3417e1dc3a8ea50575380ec74f5924a083703e1e85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 59 locations): source/dlc-schema.js:173 \u00B7 source/dlc-schema.js:198 \u00B7 source/dlc-schema.js:222 \u00B7 source/jax-schema.js:107 \u00B7 \u002B55 more site(s) not listed \u2014 the 59 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dlc-schema.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a34cf4e533166dd058840379e3cc195b899943b38cd6a51128dc8f76d546fbd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 17 locations): source/dlc-schema.js:222 \u00B7 source/dlc-schema.js:232 \u00B7 source/dlc-schema.js:252 \u00B7 source/dlc-schema.js:271 \u00B7 \u002B13 more site(s) not listed \u2014 the 17 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dlc-schema.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dac2e3c6a4797daec3b0e170185f431ccbacd42eab3e110d65c0c81d6d91f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/dlc.js:157 \u00B7 source/dlc.js:167 \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":"source/dlc.js"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e4cbfe5be914d941ac1cf656392dc9fa68b4939f9fa389e941f506bbc81bd8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/dlc.js:320 \u00B7 source/dlc.js:340 \u2014 both copies are in the same file, so extract the block 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":"source/dlc.js"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3eb8c5d72e9f392d9d7fd6107a25c9d68b18e48d7db2f625c3c5f8c676aa7dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): source/espdl.js:5 \u00B7 source/nnef.js:4 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 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":"source/espdl.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d0dfd099313a72c5b920c589872e43ef6ba786ebc8e01609da6b7c4ffded93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 17 locations): source/executorch-schema.js:87 \u00B7 source/executorch-schema.js:245 \u00B7 source/executorch-schema.js:266 \u00B7 source/executorch-schema.js:276 \u00B7 \u002B13 more site(s) not listed \u2014 all 17 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/executorch-schema.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"144cbab805ec0edb6cf228fef5c552dd5e76bfc2028d7a1ef933ce3b5497c9a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6 locations): source/executorch-schema.js:177 \u00B7 source/executorch-schema.js:235 \u00B7 source/executorch-schema.js:354 \u00B7 source/executorch-schema.js:415 \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":"source/executorch-schema.js"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed00cc5de919cc5fcdecd33724241e5b1b38e6f1708438e42e391bf5ab0d9eff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/executorch.js:260 \u00B7 source/executorch.js:268 \u2014 both copies are in the same file, so extract the block 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":"source/executorch.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7afca4223a2eba940524b9b72ee8dd5107258c1c7a5fcb3b63506a003b0ae5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): source/executorch.js:911 \u00B7 source/executorch.js:1233 \u00B7 source/pickle.js:184 \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":"source/executorch.js"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ab6d2d9ee4762a93f5070fc16c889a6f495da90117d927ea71e3df7997559b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): source/flatbuffers.js:57 \u00B7 source/flatbuffers.js:67 \u00B7 source/flatbuffers.js:77 \u00B7 source/flatbuffers.js:87 \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":"source/flatbuffers.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"664c07c859d013b2f19426f2a9d7cc0f2a40592a9719a99c018397845a156e5f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): source/flatbuffers.js:360 \u00B7 source/flatbuffers.js:370 \u00B7 source/flatbuffers.js:380 \u00B7 source/flatbuffers.js:390 \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":"source/flatbuffers.js"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3d44c691ad199bdaf8faf88a17d8700e3a8284aecde577f7d01ed04ac88887"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/hailo.js:59 \u00B7 source/lasagne.js:39 \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":"source/hailo.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c86a52ece749cd5b64baba439309df2760144a1b3903e5924da64d556e19290"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/hdf5.js:885 \u00B7 source/hdf5.js:905 \u2014 both copies are in the same file, so extract the block 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":"source/hdf5.js"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f25e31edb22c2c072f519af2d7bb9064c1e4901205dc23dd04a9358339ea4c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/hickle.js:92 \u00B7 source/kmodel.js:132 \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":"source/hickle.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec04818166710d869b7f94ff9eb3ba9ac4725333a0b922acebad62921ff71f2b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 10 locations): source/jax-schema.js:10 \u00B7 source/jax-schema.js:75 \u00B7 source/jax-schema.js:149 \u00B7 source/jax-schema.js:175 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 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":"source/jax-schema.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bda4f779ffe0bc14ed4ab081c820ecc1e9953e4ea214c90cdb9cfb6b6d26c63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): source/keras.js:1116 \u00B7 source/tflite.js:315 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 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":"source/keras.js"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3fb602d593039ea31f907f0aeac3b4d90a41e039272143a6f4a7d496dab1d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): source/kmodel.js:311 \u00B7 source/kmodel.js:319 \u00B7 source/kmodel.js:402 \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":"source/kmodel.js"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"524fcd1cf5ad3ff9762ec5353dbdab20da73327a72ac42d9cd66ce5245a7c1c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/kmodel.js:386 \u00B7 source/kmodel.js:394 \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":"source/kmodel.js"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e98ad1b95acc5a74c9fed24cf8f5ccffdcccece2b6d0f2295225f2fc73bb92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/kmodel.js:578 \u00B7 source/kmodel.js:786 \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":"source/kmodel.js"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9933a648b9bcaf20e3c7cdd569d32dcc76a6067197c85555d75d1f033211775"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/kmodel.js:1973 \u00B7 source/kmodel.js:2032 \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":"source/kmodel.js"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3e169d2730596540c179f26d1eb0decea79d71c2bd718e9fb75911aa92b31e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/lasagne.js:86 \u00B7 source/paddle.js:444 \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":"source/lasagne.js"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"70356d3b1381492451db4453b09279690325dc4d63fe45d443927b5dd08b9ede"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/litertlm-schema.js:111 \u00B7 source/megengine-schema.js:37 \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":"source/litertlm-schema.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f6211884a11a569ebf191b274a5ddecf320d4f7299971a44042ba56917cd18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6 locations): source/megengine-schema.js:57 \u00B7 source/megengine-schema.js:2141 \u00B7 source/paddle-schema.js:230 \u00B7 source/paddle-schema.js:343 \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":"source/megengine-schema.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e55e27917460e828719984d97a837c001f25303d136d4bc891efb7ae1e13e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 71 locations): source/megengine-schema.js:584 \u00B7 source/megengine-schema.js:602 \u00B7 source/megengine-schema.js:620 \u00B7 source/megengine-schema.js:636 \u00B7 \u002B67 more site(s) not listed \u2014 all 71 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/megengine-schema.js"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"3853b24566a32463bcb192ba331f500a829e0bfc5c9496f7d2136d9b310d3470"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8 locations): source/megengine-schema.js:1089 \u00B7 source/megengine-schema.js:1100 \u00B7 source/megengine-schema.js:1129 \u00B7 source/megengine-schema.js:1257 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 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":"source/megengine-schema.js"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba052cc0def7b0a8c50b5004609f51f5ef783195c53b126218098fb052c01ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/megengine-schema.js:1798 \u00B7 source/megengine-schema.js:1813 \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":"source/megengine-schema.js"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00848f676647fdf42e75000546b265be4a48aa6462f51ad8331e908374c45fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6 locations): source/megengine-schema.js:2053 \u00B7 source/megengine-schema.js:2204 \u00B7 source/megengine-schema.js:2357 \u00B7 source/megengine-schema.js:2382 \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":"source/megengine-schema.js"},"region":{"startLine":2053}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a7c7f348721abfeb5bb0ef956542cc8c8c32ff4fbd1cc2c2ef3b35b05b550f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): source/megengine-schema.js:2410 \u00B7 source/paddle-schema.js:169 \u00B7 source/paddle-schema.js:211 \u2014 the 3 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":"source/megengine-schema.js"},"region":{"startLine":2410}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d8343823070f03cb69c469d374357462904c76baa7dc502deb110245132412"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/mlir.js:9443 \u00B7 source/mlir.js:9502 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":9443}}}],"partialFingerprints":{"codehealthFindingId/v1":"1675bb9163de85c8116932f8d7df9161dd191dca969c68c31eb69aab00c7ffb1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): source/mlir.js:11892 \u00B7 source/mlir.js:11960 \u00B7 source/mlir.js:19601 \u00B7 source/mlir.js:19657 \u2014 all 4 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":"source/mlir.js"},"region":{"startLine":11892}}}],"partialFingerprints":{"codehealthFindingId/v1":"7554b8f815fb4bdf439e6217c7abca1ef312d338f6b592d4f8bf4d9c0b36f1df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/mlir.js:13378 \u00B7 source/mlir.js:16723 \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":"source/mlir.js"},"region":{"startLine":13378}}}],"partialFingerprints":{"codehealthFindingId/v1":"627ced520c2b7de82ab949eb5c519596174d8864a6ab446fcf66535b517f8707"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): source/mlir.js:13663 \u00B7 source/mlir.js:20207 \u00B7 source/mlir.js:24168 \u00B7 source/mlir.js:24408 \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":"source/mlir.js"},"region":{"startLine":13663}}}],"partialFingerprints":{"codehealthFindingId/v1":"7392dbf43e1c3883fea25156d5f04198a3ba1f926890e7534e5759b3d8371f90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/mlir.js:13684 \u00B7 source/mlir.js:24859 \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":"source/mlir.js"},"region":{"startLine":13684}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae49feaaac0652433083d301f2946a74f6a3ff5d060dfdaba3e337801367eaab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): source/mlir.js:13782 \u00B7 source/mlir.js:13795 \u00B7 source/mlir.js:13878 \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":"source/mlir.js"},"region":{"startLine":13782}}}],"partialFingerprints":{"codehealthFindingId/v1":"908ec9782a649d3f0fec3be5982dcf05a8f1c60ddfa9e69e63ee8541de8260ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/mlir.js:14617 \u00B7 source/mlir.js:15660 \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":"source/mlir.js"},"region":{"startLine":14617}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc8c39d301bb19d4ad7355999e8f9c9d10f63793bd942ef8bd9c6264e45cf90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/mlir.js:14893 \u00B7 source/mlir.js:25708 \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":"source/mlir.js"},"region":{"startLine":14893}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58b435069ecc873b2a603861979d15528f47d6a53a7b21599d28a4e4ccf20d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/mlir.js:18354 \u00B7 source/mlir.js:25702 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":18354}}}],"partialFingerprints":{"codehealthFindingId/v1":"e768bf5ea7327d20321dcbe8d27f5da9fd0b318dcd42f6d115f1e2599fb635dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/mlir.js:19438 \u00B7 source/mlir.js:24930 \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":"source/mlir.js"},"region":{"startLine":19438}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bd6019e9c0bf68ce13634828b225c859c564efd9da49c3a9ebdb6fafa0627f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/mlir.js:22152 \u00B7 source/mlir.js:22161 \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":"source/mlir.js"},"region":{"startLine":22152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d078f85a42a9df5dfc242296931435b5345d39a4215af9166a5f28c18c347f73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/mlir.js:23479 \u00B7 source/mlir.js:23544 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":23479}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f56662c15d02e4df93bf17cbdb40b7a87742a5d84d014a07f75c4f6a1b1b9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/mlir.js:24214 \u00B7 source/mlir.js:25438 \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":"source/mlir.js"},"region":{"startLine":24214}}}],"partialFingerprints":{"codehealthFindingId/v1":"a738cecfdb7e71d9341bdccfcaf4974be3a39eaa7e92b54f5fa3c2f9a2d7fc30"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/mlir.js:24611 \u00B7 source/mlir.js:24619 \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":"source/mlir.js"},"region":{"startLine":24611}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f44fdc6fe534e7d7071ca590f706e351f727aab95d367af99d166ab252d827"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6 locations): source/mlir.js:24815 \u00B7 source/mlir.js:26245 \u00B7 source/mlir.js:27003 \u00B7 source/mlir.js:27321 \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":"source/mlir.js"},"region":{"startLine":24815}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f9fdaf70e4803fdd3c0bc828b42790a45b88cadc53372b940c69bf6b71734b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/mlnet.js:474 \u00B7 source/mlnet.js:484 \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":"source/mlnet.js"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2eac56fa4afb6831791985a222cc65233c46195c62315bcab7acc88b6c8df6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/mnn.js:321 \u00B7 source/om.js:328 \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":"source/mnn.js"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb235cdd70650ed0533076d8cfa27be08d46c978604f1721208ed41b73bbabea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): source/mslite-schema.js:824 \u00B7 source/mslite-schema.js:845 \u00B7 source/mslite-schema.js:1513 \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":"source/mslite-schema.js"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"856133af476f23f8c77de0bdfc792ed359a1c1441cf4d732a3e281c38925628c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/mslite-schema.js:1631 \u00B7 source/mslite-schema.js:3915 \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":"source/mslite-schema.js"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"99afede03f1a0ae19cc8549b625cce3ef6798c3ac815b31655cfea81ef5f53a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): source/mslite-schema.js:2105 \u00B7 source/mslite-schema.js:2188 \u00B7 source/mslite-schema.js:3076 \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":"source/mslite-schema.js"},"region":{"startLine":2105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0cfb04fa351c6daba8b99f69bbc780decff62dc64e890160c037ae787bd9169"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/mslite-schema.js:3352 \u00B7 source/mslite-schema.js:3753 \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":"source/mslite-schema.js"},"region":{"startLine":3352}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e38167a20c2964cee4838174cc750ebdab3f888048140e3129a37cc772967d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/nnabla-proto.js:238 \u00B7 source/nnabla-proto.js: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":"source/nnabla-proto.js"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f259734649265209bcfaf25b5a7078c730ac3d0d406f1d183b4fc8ef552b53f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/nnabla-proto.js:11529 \u00B7 source/nnabla-proto.js:11664 \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":"source/nnabla-proto.js"},"region":{"startLine":11529}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bb9b9f5c8dd0887e80677b12090fbfdc8d1b9e57c65f4947c4337be9c6eb85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6 locations): source/onnx-schema.js:185 \u00B7 source/onnx-schema.js:289 \u00B7 source/onnx-schema.js:343 \u00B7 source/onnx-schema.js:363 \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":"source/onnx-schema.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"6462fed638daab96239fc9a1a5f810a80b03d35044714965f8bd5c25fa5b5150"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/onnx.js:179 \u00B7 source/onnx.js:187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a65064f9ae3f825d7cda45a59d7ce01b2b38ce0a5c11d463592121d75f8940a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/onnx.js:1668 \u00B7 source/onnx.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":"source/onnx.js"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dce268873cf7ede8fbded9653d6a66df2f91c564fbfb17d22297e1281a03e6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/onnx.js:2149 \u00B7 source/onnx.js:2671 \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":"source/onnx.js"},"region":{"startLine":2149}}}],"partialFingerprints":{"codehealthFindingId/v1":"de93f621e0facf9f84140ed5b5f9276e56cc2cbadf797cc86098ccfb5b77feb9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/openvino.js:368 \u00B7 source/openvino.js:376 \u2014 both copies are in the same file, so extract the block 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":"source/openvino.js"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41dcd8b7850219d1fa8a8f24b977aef09ca19d79ad1a953db921ed17d1f79f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/openvino.js:392 \u00B7 source/openvino.js:406 \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":"source/openvino.js"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1db17779d61d8df12307feb732f78135d837672a51512c6194fb98b6b278654"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/protobuf.js:539 \u00B7 source/protobuf.js:613 \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":"source/protobuf.js"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e7910c391757ba1b5641e67e305e86fc5e1c28d42bd4e89feaba6441314f1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/python.js:757 \u00B7 source/python.js:943 \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":"source/python.js"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"8315c7113583c87cdf49153f139631aef97ce6dfb58dbf4f3bc6e7c85bcbdd6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/python.js:936 \u00B7 source/python.js:974 \u2014 both copies are in the same file, so extract the block 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":"source/python.js"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"63220f54ca1fe9f510c8f1f529f8f8512f6b4e803c677eddb55d203b9315b339"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/python.js:1362 \u00B7 source/python.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":"source/python.js"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e21d92e92ba2dfb54cbaeb301cb9ba7e8c89022ab1e424faeb300c4fbd60862"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): source/python.js:3466 \u00B7 source/python.js:3478 \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":"source/python.js"},"region":{"startLine":3466}}}],"partialFingerprints":{"codehealthFindingId/v1":"44eb5c223ba6fdfdb9ef58066fc690ac8593121e55df32bdfdaaedd26f406aef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): source/python.js:5384 \u00B7 source/python.js:5393 \u00B7 source/python.js:5403 \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":"source/python.js"},"region":{"startLine":5384}}}],"partialFingerprints":{"codehealthFindingId/v1":"073d049f31d1b1c2dd2eb7a179671698e3f6fdeec0a10e0770578dfce2c607ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): source/tflite.js:283 \u00B7 source/tosa.js:178 \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":"source/tflite.js"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33b8a6396a3bf6fa88d29d5493e148baa996e5ffb015b68330759e9707e6aec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): source/xgboost.js:38 \u00B7 source/xgboost.js:45 \u2014 the two spans are one implementation copied and then locally edited \u2014 70 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":"source/xgboost.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"413f029694f51cca70039564395d484bc94ad9b22e490736216c5fd1c35cba8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/acuity.js:292 \u00B7 source/acuity.js:302 \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":"source/acuity.js"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d0a7db3b325f31e74b739a21eb84ad14e78ce96260eb74dde4599f636a6c26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/app.js:863 \u00B7 source/app.js:879 \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":"source/app.js"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"d080ff8c47b794a6921d4b79bc983c4dd2b56cc33d36432841949c0d0014e492"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 35 locations): source/armnn-schema.js:325 \u00B7 source/armnn-schema.js:523 \u00B7 source/armnn-schema.js:745 \u00B7 source/armnn-schema.js:789 \u00B7 \u002B31 more site(s) not listed \u2014 the 35 copies are spread across 5 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":"source/armnn-schema.js"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5718177112f41a93dc7db40534969d62307a9435cabc10aeaad024a310d0eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 18 locations): source/armnn-schema.js:581 \u00B7 source/armnn-schema.js:892 \u00B7 source/armnn-schema.js:1378 \u00B7 source/armnn-schema.js:1794 \u00B7 \u002B14 more site(s) not listed \u2014 the 18 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":"source/armnn-schema.js"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae13f6aee794fe8548dbda575ad647c0d854ada426799e6480311e365887181d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 17 locations): source/armnn-schema.js:590 \u00B7 source/armnn-schema.js:901 \u00B7 source/armnn-schema.js:1387 \u00B7 source/armnn-schema.js:1805 \u00B7 \u002B13 more site(s) not listed \u2014 the 17 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":"source/armnn-schema.js"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c96d278cbadc25ae254ed11a1bd7ab9f7688c20e07bd62b444a3862850bbc6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): source/armnn-schema.js:1757 \u00B7 source/circle-schema.js:3466 \u00B7 source/circle-schema.js:3564 \u00B7 source/mnn-schema.js:641 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/armnn-schema.js"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"4448416b76fa2f82ef45a7de05d4534c2160450ee881b07275ed2b8bd963f80a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): source/armnn-schema.js:2754 \u00B7 source/mslite-schema.js:1813 \u00B7 source/mslite-schema.js:2871 \u00B7 source/mslite-schema.js:2942 \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":"source/armnn-schema.js"},"region":{"startLine":2754}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8602d02fd8ff0a8070f915e8ead82ce7f64cf6641cbaa1f623b00302c8c8c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): source/base.js:143 \u00B7 source/base.js:199 \u00B7 source/base.js:249 \u00B7 source/base.js:296 \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":"source/base.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d69f9d9c463fc321fadf0a11c507aeb1478682d6632ebeef0a8adaf95f0ab7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/browser.js:80 \u00B7 source/desktop.mjs:117 \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":"source/browser.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"131330b55fa8f42fbd0027d03f4dd575bbfddd117f4d5eb61df721382ca789ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/browser.js:797 \u00B7 source/protobuf.js:628 \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":"source/browser.js"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0d472f73a6145dc316a7ed82394ff47a9c643746b3c39975ca3b02f5ff4ed1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/browser.js:806 \u00B7 source/node.js:79 \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":"source/browser.js"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cf1b156dbec1476cc723a4438e83b26432b87d534115501361da76b30b40c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): source/caffe-proto.js:349 \u00B7 source/caffe-proto.js:768 \u00B7 source/caffe-proto.js:775 \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":"source/caffe-proto.js"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b4b06bb429a1266f6705baec999b83165716a6b5bafa9608aa09a24a9ad069"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 13 locations): source/caffe-proto.js:1967 \u00B7 source/caffe-proto.js:2619 \u00B7 source/caffe-proto.js:3420 \u00B7 source/caffe-proto.js:3973 \u00B7 \u002B9 more site(s) not listed \u2014 the 13 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":"source/caffe-proto.js"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c01b8f3008d21fe258d91b3b1eac54726eac8227a5f61da1beac5af955dbfc8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 10 locations): source/caffe-proto.js:2038 \u00B7 source/caffe-proto.js:2402 \u00B7 source/coreml-proto.js:8728 \u00B7 source/coreml-proto.js:15453 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 copies are spread across 5 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":"source/caffe-proto.js"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1c9f1061d820514dcf64b8ffa6b0b54c7525f4fcc4658b1e55d355d1ffa5a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): source/caffe.js:114 \u00B7 source/coreml.js:88 \u00B7 source/coreml.js:151 \u2014 the 3 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":"source/caffe.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"855e3c37d4bd29ed396cf9bd345e6afb4408100829cd439a38bb21cf4d1b82d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): source/caffe2.js:266 \u00B7 source/dl4j.js:76 \u00B7 source/keras.js:534 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe2.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"95775ad767cba327c951732425c86a0b1bb27a062978be374fa4cf8774c2ffea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): source/catboost-schema.js:254 \u00B7 source/executorch-schema.js:959 \u00B7 source/executorch-schema.js:1513 \u00B7 source/mnn-schema.js:3381 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/catboost-schema.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9db7421dd4515b1a0eae25610347affa627f3c71437752b2123d8e14379427"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6 locations): source/circle-schema.js:277 \u00B7 source/mnn-schema.js:58 \u00B7 source/mnn-schema.js:643 \u00B7 source/mnn-schema.js:817 \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":"source/circle-schema.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf769007442abb53ebb33781c71da697aca6aac7343ff78fe93f99bc73ef2739"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): source/circle-schema.js:1680 \u00B7 source/circle-schema.js:3300 \u00B7 source/mnn-schema.js:2381 \u2014 the 3 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":"source/circle-schema.js"},"region":{"startLine":1680}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9144d127b00ab61417ce354d19d4c217e6c7077839846bd46e944490887acf0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): source/circle-schema.js:3302 \u00B7 source/mnn-schema.js:1409 \u00B7 source/mnn-schema.js:1619 \u2014 the 3 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":"source/circle-schema.js"},"region":{"startLine":3302}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b6f5422c54ac219b479c203b8c61fe2bc4e223bfdbfa467b5d5365e5b17eb4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): source/circle-schema.js:3646 \u00B7 source/espdl-schema.js:118 \u00B7 source/executorch-schema.js:465 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/circle-schema.js"},"region":{"startLine":3646}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0fe56cbc9bb0bc2a070c309702806cd3dd65980c80d6d98b5ac89c66c902d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): source/circle.js:38 \u00B7 source/kann.js:19 \u00B7 source/mnn.js:23 \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":"source/circle.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"22658b2f73492a22dc31df7e3236a7f83de5bf3c8f808b996577d80e71bc83f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 33 locations): source/cntk-proto.js:316 \u00B7 source/coreml-proto.js:604 \u00B7 source/coreml-proto.js:1813 \u00B7 source/coreml-proto.js:2171 \u00B7 \u002B29 more site(s) not listed \u2014 the 33 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":"source/cntk-proto.js"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"37408c7ca1f75f80c76a28ebe8821ec7c337f7c6009a1e52ffc3f66f33f930f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/cntk.js:25 \u00B7 source/mediapipe.js:19 \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":"source/cntk.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec9365b71c2879b37c5b8162c9effb1050bcb97c8a6f71a4de527c11f70ba32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8 locations): source/coreml-proto.js:1854 \u00B7 source/coreml-proto.js:7698 \u00B7 source/coreml-proto.js:7759 \u00B7 source/coreml-proto.js:9173 \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":"source/coreml-proto.js"},"region":{"startLine":1854}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ad4130705e2ded049aa11689b99d95574b4b2e7d01087d3c37be64a3ca47a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): source/coreml-proto.js:4181 \u00B7 source/coreml-proto.js:4245 \u00B7 source/coreml-proto.js:4309 \u00B7 source/coreml-proto.js:4460 \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":"source/coreml-proto.js"},"region":{"startLine":4181}}}],"partialFingerprints":{"codehealthFindingId/v1":"859c1871b8da768cc2cb0114fd67b7331e7f0fc48f1ef310ab381a838bf8e369"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): source/coreml-proto.js:4323 \u00B7 source/coreml-proto.js:4477 \u00B7 source/coreml-proto.js:4680 \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":"source/coreml-proto.js"},"region":{"startLine":4323}}}],"partialFingerprints":{"codehealthFindingId/v1":"76016a983d304f2acacb4589b1a1aa1c4a879600fa0a8bf44906bb6ec7744d5b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): source/coreml-proto.js:4349 \u00B7 source/coreml-proto.js:4506 \u00B7 source/coreml-proto.js:4706 \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":"source/coreml-proto.js"},"region":{"startLine":4349}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4f092faf50f7c714f41a0dd06258d6cc008a26b5b2cfe37af92ad7a8945e40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/coreml-proto.js:4474 \u00B7 source/paddle-proto.js:1388 \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":"source/coreml-proto.js"},"region":{"startLine":4474}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e72570e966b5ed8e8418d7c095ef9f4c95ff6aa916d4cb919dd73e6068501f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6 locations): source/coreml-proto.js:5041 \u00B7 source/coreml-proto.js:5207 \u00B7 source/coreml-proto.js:5216 \u00B7 source/paddle-proto.js:807 \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":"source/coreml-proto.js"},"region":{"startLine":5041}}}],"partialFingerprints":{"codehealthFindingId/v1":"239644dae88306f7f3d60268d9a9d0ef41eb851c25db62489a1674bb26e0861e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 9 locations): source/coreml-proto.js:9921 \u00B7 source/coreml-proto.js:13829 \u00B7 source/coreml-proto.js:13882 \u00B7 source/coreml-proto.js:13998 \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":"source/coreml-proto.js"},"region":{"startLine":9921}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26b5837fb22d636aa784111a9d3109c5b681c9f3c4198556f5b5abe1e153f6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/coreml-proto.js:15111 \u00B7 source/coreml-proto.js:15998 \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":"source/coreml-proto.js"},"region":{"startLine":15111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2afec70f04c693bdd6e29c3b7b08ec491ada66da5142e2fe8571263f50093d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/coreml-proto.js:18124 \u00B7 source/paddle-proto.js:1607 \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":"source/coreml-proto.js"},"region":{"startLine":18124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2cf0f97d5ec4fe116cf902165d198cd61c2d9c85d560985c38a36599e03b6ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/coreml.js:689 \u00B7 source/om.js:218 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41815a39578167e40e0066aca13527d097d1f5c072ae58817cb6d7b085e9710"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/dagre.js:1759 \u00B7 source/dagre.js:1778 \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":"source/dagre.js"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"543d6c98aa44f38b05da03e01b815605786e84e3a7de38428d9eb9ae0093c6da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): source/darknet.js:276 \u00B7 source/darknet.js:301 \u00B7 source/darknet.js:336 \u2014 all 3 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":"source/darknet.js"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ca31e07d4669fe2d0330542f19cf660e687a18ace286b50a999b04792f423d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/dlc-schema.js:114 \u00B7 source/dlc-schema.js:248 \u2014 both copies are in the same file, so extract the block 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":"source/dlc-schema.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5551371c2bfbc310dee59dd4e6c2a3194a8f639742d50d545eea4ca846a8dc7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): source/dnn-proto.js:346 \u00B7 source/mindir-proto.js:163 \u00B7 source/onnx-proto.js:231 \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":"source/dnn-proto.js"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12972ef3a7a7c89f80de40feabd709a4f103d464d8118f8d0ea06c4afc54dd2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/dot.js:230 \u00B7 source/executorch.js:879 \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":"source/dot.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abe690f39ee31c30399a32d36c5661e20e1522eb97220c280a7ff2a8fd4fb59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/espdl-schema.js:125 \u00B7 source/onnx-schema.js:337 \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":"source/espdl-schema.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a534884e56dda8356668ecf65808f4e0db38af37fb517e7d41439b3f51ebf7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): source/executorch-schema.js:230 \u00B7 source/mnn-schema.js:546 \u00B7 source/mnn-schema.js:763 \u00B7 source/mnn-schema.js:1576 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"source/executorch-schema.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4806fdee23268c641e918ebcbb9d63f331d0d6f3154ac26f18ed7e446cbf0c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/executorch.js:596 \u00B7 source/executorch.js:603 \u2014 both copies are in the same file, so extract the block 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":"source/executorch.js"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d17f8ae713e4178f96fa1e62d8de6c21183beba501f4fab3ce531f4b3f0a14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/executorch.js:1206 \u00B7 source/mlir.js:205 \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":"source/executorch.js"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74674ea0ec21f903610c70d6a7f50ab1b20d895696aac13e4a30a3c112875eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/executorch.js:1268 \u00B7 source/megengine.js:619 \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":"source/executorch.js"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d72d08ab2354413380764b87003fa8c8e01ffcba37df38a8e1c070ac426a29"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/flux.js:19 \u00B7 source/openvino.js:132 \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":"source/flux.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b82af621509dacf1576c465396a5f68200d48df26ea98646e294cded4b8f938"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/gguf.js:319 \u00B7 source/gguf.js:326 \u2014 both copies are in the same file, so extract the block 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":"source/gguf.js"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"c103dd23767de43bffebe2976415ad70561ef264efb7d90fa1d2253d535c8291"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/kmodel.js:601 \u00B7 source/kmodel.js:664 \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":"source/kmodel.js"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"e823b9c2561070b037b1169d54288ea203252fefbac5862f01174478e3508056"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): source/kmodel.js:712 \u00B7 source/kmodel.js:800 \u00B7 source/kmodel.js:914 \u00B7 source/kmodel.js:933 \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":"source/kmodel.js"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"05674bfa063601fba7fb25c3c0965f87112d485521673c971e117b6099ec5dc9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6 locations): source/kmodel.js:1906 \u00B7 source/kmodel.js:1916 \u00B7 source/kmodel.js:1952 \u00B7 source/kmodel.js:1983 \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":"source/kmodel.js"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a8862bddcc846e944373a57011a40562ccdb9ce0c65fce72be3ff2d99d3ee6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/kmodel.js:1939 \u00B7 source/kmodel.js:2033 \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":"source/kmodel.js"},"region":{"startLine":1939}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f14ade9be0ffe847aef63acaee11b69098e13c8acbc146b854612f90a15eb5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): source/lasagne.js:33 \u00B7 source/mindir.js:60 \u00B7 source/om.js:50 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/lasagne.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3eee0c226e5a22329b8a8928f36468d5fbd3f2b24d54d904829002f9031aa8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): source/litertlm-proto.js:64 \u00B7 source/litertlm-proto.js:482 \u00B7 source/litertlm-proto.js:893 \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":"source/litertlm-proto.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b68df333a25d4253dae79e24c5e6d6568531352253618f58bfb4282c907f98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): source/litertlm-proto.js:594 \u00B7 source/litertlm-proto.js:662 \u00B7 source/litertlm-proto.js:696 \u00B7 source/litertlm-proto.js:927 \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":"source/litertlm-proto.js"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"8092fd9e1a92fdc0d363645059b8b05d176413e6b29c2510bb8d1e17364834b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 53 locations): source/litertlm-schema.js:178 \u00B7 source/megengine-schema.js:583 \u00B7 source/megengine-schema.js:601 \u00B7 source/megengine-schema.js:619 \u00B7 \u002B49 more site(s) not listed \u2014 the 53 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":"source/litertlm-schema.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b77958b122d648624e47645f1854e624b57febc535085a7f4ed6cc60af82e8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): source/megengine-schema.js:758 \u00B7 source/megengine-schema.js:1462 \u00B7 source/megengine-schema.js:1514 \u00B7 source/megengine-schema.js:1529 \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":"source/megengine-schema.js"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"2faaeca72726cbf07fc863812583b9e56bae73473d03cc28240a9675349ffc69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/megengine.js:108 \u00B7 source/megengine.js:115 \u2014 both copies are in the same file, so extract the block 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":"source/megengine.js"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea42b4ffa292a4441396641fe6a46727e2e715bb2ecbaf82ef1e978ebcd5413"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/message.js:81 \u00B7 source/message.js:88 \u2014 both copies are in the same file, so extract the block 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":"source/message.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53cfd0dc60a7ee083d905776cc9dc12666f759f2569ba0d4ecb95af6af4e900"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): source/message.js:8 \u00B7 source/pytorch.js:1268 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"source/message.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"24962d8dbe71650c4ac52103307d04904c9fb3fc048dbd73e988ca95d9538629"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mindir-proto.js:500 \u00B7 source/nnabla-proto.js:1013 \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":"source/mindir-proto.js"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba5558152236fa20dc008a45e9c83042251b3d1083a4acb54c9bba6b1806e11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mindir-proto.js:543 \u00B7 source/mindir-proto.js:599 \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":"source/mindir-proto.js"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3a27232a0a104bf714fe0e951c1dd651fc1865a1c1141446bb69b1f0f25300"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): source/mindir-proto.js:737 \u00B7 source/nnabla-proto.js:2178 \u00B7 source/nnabla-proto.js:2259 \u00B7 source/nnabla-proto.js:2340 \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":"source/mindir-proto.js"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1d7638f628ac7e1293a780dc9ac36031b0057044f303ddfa19ffbe5a33da1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mindir.js:78 \u00B7 source/mindir.js:89 \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":"source/mindir.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"80297714a92c437fa2bd273d0d2fb94f56301a02e25914e83fb4cd13c892cd44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mlir.js:876 \u00B7 source/mlir.js:884 \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":"source/mlir.js"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"35df90832b63d8c4f289c42a996053f982223a974e57e9d1e4e17dfb595beb42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mlir.js:3003 \u00B7 source/mlir.js:4496 \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":"source/mlir.js"},"region":{"startLine":3003}}}],"partialFingerprints":{"codehealthFindingId/v1":"23529f22c3cf89e251a3f05ef3f0fc85d54f50292f84b968de542370ad80e58e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mlir.js:3572 \u00B7 source/mlir.js:3881 \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":"source/mlir.js"},"region":{"startLine":3572}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3316646b982c21b76c575ba19a1d6ac776d97bfae2779db57a27fcf6577454a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mlir.js:4204 \u00B7 source/mlir.js:4234 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":4204}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ae38a083f621b9a5df25a839edad91e74df929add1721121b8df598b1f83b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mlir.js:8184 \u00B7 source/mlir.js:8212 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":8184}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a486fc42900ae46b9e910cca5e076cc221d0e88521c70fcdd765b58636f03fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mlir.js:10232 \u00B7 source/mlir.js:10255 \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":"source/mlir.js"},"region":{"startLine":10232}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d86dbdd8c51c6ad7e7d774bb3f261260806d6319f1c245de67564e3f8b4cfc2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): source/mlir.js:10644 \u00B7 source/mlir.js:10652 \u00B7 source/mlir.js:10660 \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":"source/mlir.js"},"region":{"startLine":10644}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b1a9f94efc935d97e2bf10942a3e1960f2e35839cb1dfdcc281d429a12f068"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mlir.js:11189 \u00B7 source/mlir.js:11200 \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":"source/mlir.js"},"region":{"startLine":11189}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea73372da6f4e41f4d9925a010b1b50a25468d42580da504b6a2506dc7dcc7c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mlir.js:12182 \u00B7 source/mlir.js:12202 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":12182}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e275a3bac7906d8cdc22132c565fb54bcd5e00455c0cabd6d3245e4c5d43e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mlir.js:12505 \u00B7 source/mlir.js:12706 \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":"source/mlir.js"},"region":{"startLine":12505}}}],"partialFingerprints":{"codehealthFindingId/v1":"f818c2c534a250df0f00506577334412780e36a864a8873f244baba5eae4a655"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): source/mlir.js:12560 \u00B7 source/mlir.js:23450 \u00B7 source/mlir.js:23469 \u00B7 source/mlir.js:23491 \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":"source/mlir.js"},"region":{"startLine":12560}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9a1ff52ab219580065d0ec948991bc2e3a6cdd945bf06bbe1d5f15a2fbc2d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): source/mlir.js:14850 \u00B7 source/mlir.js:19426 \u00B7 source/mlir.js:25696 \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":"source/mlir.js"},"region":{"startLine":14850}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f43c76f0d511a1d0a91be905b3cb505c613a6d664f670441502a55ce0435fde"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mlir.js:14860 \u00B7 source/mlir.js:15001 \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":"source/mlir.js"},"region":{"startLine":14860}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6b461ff3ae4c4f2c11cc5246eab55fd53bdf81ee406fbb317f92fc9c5fcfcd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mlir.js:24135 \u00B7 source/mlir.js:25435 \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":"source/mlir.js"},"region":{"startLine":24135}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fea195fbfd4c67b9dc5a2c944f2f7e5fddf8074a40a5c44d94f3ff60d17fc32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mlir.js:24520 \u00B7 source/mlir.js:24540 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":24520}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7871019d0d3952cd85d37d823f7c80353ce71fd34ab141d25c7edd1a3d2bd7d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): source/mlir.js:15 \u00B7 source/xgboost.js:15 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 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":"source/mlir.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a08609f989f1c956210e06905df752f9851a5a2620e597da573f8bf1f4893a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6 locations): source/mnn-schema.js:113 \u00B7 source/mnn-schema.js:137 \u00B7 source/mnn-schema.js:2656 \u00B7 source/mnn-schema.js:2907 \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":"source/mnn-schema.js"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1a0f8642530362e48c93cdfe873671f6e838ff906c5d560ddbf978d2efe219"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): source/mnn-schema.js:249 \u00B7 source/mnn-schema.js:768 \u00B7 source/mnn-schema.js:1051 \u00B7 source/mnn-schema.js:1231 \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":"source/mnn-schema.js"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee24f1b45f57f56156d555568728b7ef96aa4d2b3d37aca1e07ddecf8e83e3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mnn-schema.js:2780 \u00B7 source/mnn-schema.js:2992 \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":"source/mnn-schema.js"},"region":{"startLine":2780}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ff4adbd8d9d4b0517de2808278d08760b20533ce88575f7441e28d9fbf9335"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mnn.js:176 \u00B7 source/mnn.js:200 \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":"source/mnn.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ceaa721f7f6ce32e75a615badf1a03b1c0c883553e85baa4adbbf14714d4e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): source/mslite-schema.js:898 \u00B7 source/mslite-schema.js:967 \u00B7 source/mslite-schema.js:985 \u00B7 source/mslite-schema.js:1672 \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":"source/mslite-schema.js"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"c776f176d74993d1de471337f1aec681f720d99c2ef0edc84cf9c94dbf8bb0c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): source/mslite-schema.js:1305 \u00B7 source/mslite-schema.js:1363 \u00B7 source/paddle-schema.js:270 \u2014 the 3 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":"source/mslite-schema.js"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cfcbffb0c153cc039e98b8d37206104130a7575bfc3ac1df8d00fd3b690bc2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mslite-schema.js:3111 \u00B7 source/mslite-schema.js:3726 \u2014 both copies are in the same file, so extract the block 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":"source/mslite-schema.js"},"region":{"startLine":3111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b374219385bfe1741a1cb9167fddaa55665e76982a4ba235c562890f02cb72"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mslite.js:80 \u00B7 source/mslite.js:92 \u2014 both copies are in the same file, so extract the block 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":"source/mslite.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f18f4f8d4f25f1394c90caef82fec354fa3b4846bfeee52143f488ead702eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mxnet.js:548 \u00B7 source/mxnet.js:578 \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":"source/mxnet.js"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5297b4e44f41316c4b3a2d8418794c2b77bc008bf44567e2506042a0130bef6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/mxnet.js:736 \u00B7 source/mxnet.js:750 \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":"source/mxnet.js"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"863a113db8a926b4689c00573a6a78a38064891d43666557ddc14a0b34beafb0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/ncnn.js:520 \u00B7 source/ncnn.js:599 \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":"source/ncnn.js"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b6fac3fd5bd131b5e7c6af21bb7535c18a746e8ceeff31fa50a1423d62746c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/ncnn.js:712 \u00B7 source/ncnn.js:731 \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":"source/ncnn.js"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"85884d2dddbe646c591bab023d1e5dab45fd3dd437f773226c6bbac66416329e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): source/nnabla-proto.js:3108 \u00B7 source/nnabla-proto.js:4299 \u00B7 source/nnabla-proto.js:5867 \u00B7 source/nnabla-proto.js:6355 \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":"source/nnabla-proto.js"},"region":{"startLine":3108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a52c9558020ddd34d507f9bb10a9f502018350996fc432f40b6a540fc7eb70d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/nnabla-proto.js:11182 \u00B7 source/nnabla-proto.js:11302 \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":"source/nnabla-proto.js"},"region":{"startLine":11182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31195a479c42023ea8cb106799051902d02064eedb4924aed307bd6a2046865"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): source/om-proto.js:165 \u00B7 source/paddle-proto.js:209 \u00B7 source/paddle-proto.js:527 \u2014 the 3 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":"source/om-proto.js"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62f3e6bd4e1b5b933e42d3223170eeba48620e90a497cb9edfe1ed024aa3661"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/om-proto.js:593 \u00B7 source/om-proto.js:661 \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":"source/om-proto.js"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5dd5c85a8e5dd54008a0091b3a25ba3f7203b873eadd5a30e5347b87a151c08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/onnx.js:1099 \u00B7 source/onnx.js:1230 \u2014 both copies are in the same file, so extract the block 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":"source/onnx.js"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca711371b19bc6d5aa0e2b86c561b6aa374855a325f557ae1acb57723214e44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/onnx.js:1779 \u00B7 source/onnx.js:2789 \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":"source/onnx.js"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba04771dbfa82be04fe981daf5bf3e1ab8445458ac564c063d220cc9075d66b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/openvino.js:66 \u00B7 source/openvino.js:74 \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":"source/openvino.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae668f5e6a83ce820fc38b22aadc4717c09784381c9e9864da948691331da7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/paddle-schema.js:271 \u00B7 source/paddle-schema.js:421 \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":"source/paddle-schema.js"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"67960a72e294868ae97f58ff3bd38e935e274130f92cca7c457f4b15cbc02ed4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/paddle-schema.js:475 \u00B7 source/paddle-schema.js:495 \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":"source/paddle-schema.js"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f17e30cc913d20a4f58a179e881601b1233d7420670ebcd35e52b65ff2ca46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/paddle.js:558 \u00B7 source/paddle.js:565 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9fa00b9b88d7b72dc1e40d893be1ae642498f331f12bd9458c72925fbcd880"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/protobuf.js:1162 \u00B7 source/protobuf.js:1195 \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":"source/protobuf.js"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb293887a456fc5fcf46f62ce2d887224e04d23c84f7fdd51ca3786e5000463b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/python.js:865 \u00B7 source/python.js:1613 \u2014 both copies are in the same file, so extract the block 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":"source/python.js"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc59625cf8a7d5a2199c3cbdb00fda45e225a0b39df4c4324a3d613b92e79bb7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/python.js:6660 \u00B7 source/python.js:6680 \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":"source/python.js"},"region":{"startLine":6660}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a27c34d0e02a04d7e27803666e9997bf779bf5e82173ca4dc5c4fae1dcfc7a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/python.js:7527 \u00B7 source/python.js:7534 \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":"source/python.js"},"region":{"startLine":7527}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba94674c743be5b6c52662d4732b4aa8fca63b152f0f87d8cf608871d8783ad0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): source/python.js:7810 \u00B7 source/python.js:7817 \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":"source/python.js"},"region":{"startLine":7810}}}],"partialFingerprints":{"codehealthFindingId/v1":"522723127ba887d2c7875e9db1b09c13e75e1942017b1162794444be0ae06b69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): source/sentencepiece.js:25 \u00B7 source/tf.js:582 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 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":"source/sentencepiece.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86d83aab0ea9d3bfdd972d6d36548f07b99aeadd8b0f73bd5d4e0cb26ef8800"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): source/tar.js:128 \u00B7 source/tar.js:139 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 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":"source/tar.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0706a37faf9c8dc168be07224ca2872bc5e26ff6e8a140948db8e2024f64c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): source/uff.js:104 \u00B7 source/uff.js:115 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 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":"source/uff.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bba3dd0d698399b6be409c19be6821442809ad3d8768f009db3dcec455dfd1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): tools/espdl-script.js:66 \u00B7 tools/tosa-script.js:179 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 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":"tools/espdl-script.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"187d2e5ce299dcacec5ffe6f1596b697e88d248d170a61d21ae50991abc4cca1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): tools/megengine-script.js:106 \u00B7 tools/tosa-script.js:179 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 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":"tools/megengine-script.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bd17b8f88382809103318f26ec70bb2dc2efcbd670615f33792ea6ff2967c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/acuity.js:130 \u00B7 source/acuity.js:147 \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":"source/acuity.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2d1befeda07ee2ecd1757a4f6d92eba7a90e0cd0a5c38c37639a8921936842"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/acuity.js:441 \u00B7 source/acuity.js:447 \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":"source/acuity.js"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6813c73e2049b1366b36907f08bb863f1aeb28e29394331928a7aa09d77c2d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/app.js:622 \u00B7 source/app.js:628 \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":"source/app.js"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80c15c3a1e00270afc9257f07070c91b974ea78714545c2ad0ecaaabce242a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 23 locations): source/armnn.js:251 \u00B7 source/executorch.js:310 \u00B7 source/jax.js:106 \u00B7 source/jax.js:112 \u00B7 \u002B19 more site(s) not listed \u2014 the 23 copies are spread across 8 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":"source/armnn.js"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f67010195aa3bc0bf410fb53d74ffac6a8aedd1f4c69edaccca368839a76d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/barracuda.js:218 \u00B7 source/mlnet.js:1276 \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":"source/barracuda.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fd3a3dace3a81a90a151f0675da9c72e2ec6989da64756f7c35b72f5efd6a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 17 locations): source/barracuda.js:225 \u00B7 source/kmodel.js:607 \u00B7 source/kmodel.js:613 \u00B7 source/kmodel.js:692 \u00B7 \u002B13 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":"source/barracuda.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2bdbad98df5d75425cb39553aca015ea081e29651d36e6d19e6e7e33cc3a75"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/base.js:1010 \u00B7 source/base.js:1212 \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":"source/base.js"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"408b322099ff49f4ee36fc2f792d761e67d724d768d72d151b6950336ec7b338"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): source/caffe.js:80 \u00B7 source/caffe.js:118 \u00B7 source/cntk.js:28 \u00B7 source/cntk.js:43 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db85269f3d26813f6023580e7e889a196e3036f0e3e35130d6f87abcbcd5f2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): source/caffe2.js:4 \u00B7 source/nnef.js:4 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 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":"source/caffe2.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"327b64f49b26b759b36189393f18148f326de1159d1e8b434c1d115df50a1a78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): source/catboost.js:77 \u00B7 source/catboost.js:83 \u00B7 source/catboost.js:89 \u00B7 source/catboost.js:95 \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":"source/catboost.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0e4c804b6698c5be62df6a3d0ec49801ebb47076f7bd183cb711c323b972a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/circle-schema.js:1197 \u00B7 source/circle-schema.js:1203 \u2014 both copies are in the same file, so extract the block 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":"source/circle-schema.js"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"e818a30942b28c34ab7dde1638c943f712e0a52a3abee882bc997b8e9545e839"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): source/circle-schema.js:3470 \u00B7 source/mnn-schema.js:115 \u00B7 source/mnn-schema.js:2745 \u2014 the 3 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":"source/circle-schema.js"},"region":{"startLine":3470}}}],"partialFingerprints":{"codehealthFindingId/v1":"11aca18ada54dd81311377436855029d2d621515b65ea0b87a538f6577755094"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 56 locations): source/coreml-proto.js:428 \u00B7 source/coreml-proto.js:1796 \u00B7 source/coreml-proto.js:3695 \u00B7 source/coreml-proto.js:3827 \u00B7 \u002B52 more site(s) not listed \u2014 the 56 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":"source/coreml-proto.js"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2a85353a3e0811ea70c49cfa3ef687f63d57771924dce30de2a962edf97887"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): source/coreml-proto.js:15451 \u00B7 source/coreml-proto.js:15526 \u00B7 source/nnabla-proto.js:8386 \u2014 the 3 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":"source/coreml-proto.js"},"region":{"startLine":15451}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcec291c20ff8686d6a119b909dd828c799466404f9dbc327d3bdb2ce48f4f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): source/coreml.js:586 \u00B7 source/coreml.js:592 \u00B7 source/coreml.js:599 \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":"source/coreml.js"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b91b2c68e0b2fe415ee2cfc1aa1e4a54e521bc6da7cd7eb86ca6502da0ff77"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/coreml.js:910 \u00B7 source/coreml.js:916 \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":"source/coreml.js"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2564ec6984f09df29e703d654e2c50ea766019fabf36b68f298756a567fc7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): source/darknet.js:609 \u00B7 source/darknet.js:623 \u00B7 source/darknet.js:633 \u00B7 source/darknet.js:643 \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":"source/darknet.js"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8d84aca4babe73da10ccfe6e987a5491f737db6a1ab36d19e62bea57514449"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): source/darknet.js:4 \u00B7 source/nnef.js:4 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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":"source/darknet.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b27721629d8718b530f27b93e2769a64c938ba78cdea7cc0416bc1e4242354"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 74 locations): source/dlc-schema.js:4 \u00B7 source/dlc-schema.js:17 \u00B7 source/dlc-schema.js:43 \u00B7 source/dlc-schema.js:147 \u00B7 \u002B70 more site(s) not listed \u2014 the 74 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dlc-schema.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"451348aaf0acc5823bb9120d31d2d621db5d9f70bf2c5fe960231a99c25d9113"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): source/dlc-schema.js:93 \u00B7 source/onnx-schema.js:184 \u00B7 source/onnx-schema.js:288 \u00B7 source/onnx-schema.js:362 \u00B7 \u002B2 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":"source/dlc-schema.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f3b238dff0a7f7333754a24eb780cfebd4eba5a7e10925d40eaf7f7ef583d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): source/dlc-schema.js:205 \u00B7 source/onnx-schema.js:84 \u00B7 source/onnx-schema.js:94 \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":"source/dlc-schema.js"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4947c7f548c92b6e723f3b785e29938227d575b0a556165a6216f2d45da44c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): source/dlc.js:382 \u00B7 source/dlc.js:430 \u00B7 source/dlc.js:529 \u00B7 source/dlc.js:587 \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":"source/dlc.js"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ea51d692d719ea18105d30bacaf9d19fccc053fb13f6b3b254648c791bc631"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/dot.js:238 \u00B7 source/executorch.js:600 \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":"source/dot.js"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5b91177d1152e9c811fc03e3b5829da4bea14b020e019fac0f9f7c47eb2f06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 9 locations): source/espdl-schema.js:65 \u00B7 source/kann-schema.js:33 \u00B7 source/kann-schema.js:44 \u00B7 source/kann-schema.js:60 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 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":"source/espdl-schema.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"225c96e8f24638e0cd8b8e0bad00100e62769dc3aa97aa1bdf58002e506ad842"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/executorch.js:272 \u00B7 source/executorch.js:856 \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":"source/executorch.js"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67a3cc8c22e30670c77a9645d4f16d2078ba1f07434a1af9203afc41b322d49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/flatbuffers.js:241 \u00B7 source/flatbuffers.js:251 \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":"source/flatbuffers.js"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6149efa85daad374c4085ede364e5ec78b1c40571fff572c5330d3603cc233b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/flux.js:4 \u00B7 source/keras.js:6 \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":"source/flux.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e753ac5d2146310fcb005fddda70dd37c2058886b9f2f47611f904d3507bd5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/grapher.js:290 \u00B7 source/grapher.js:313 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/grapher.js"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b361658ce0b7bfde269bd2ff268068277f5f1df6af17a49d4437132aeacab266"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/grapher.js:950 \u00B7 source/grapher.js:962 \u2014 both copies are in the same file, so extract the block 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":"source/grapher.js"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0987ebc6bf7c8f8e402938e532199c4494769cc2d5f7bc9c40de4f6570f874"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): source/jax-schema.js:192 \u00B7 source/mslite-schema.js:4565 \u00B7 source/onnx-schema.js:430 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/jax-schema.js"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edb0c647866c5e8528773c1a3e17225f85dfa93a08336a22186eb4aa43681f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/kann-schema.js:63 \u00B7 source/mnn-schema.js:2671 \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":"source/kann-schema.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc66fc3ad9ad1380a24694de800a8422b105d5a1eda3594c76e7419f19918a50"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/kmodel.js:402 \u00B7 source/kmodel.js:411 \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":"source/kmodel.js"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea41bdc820a9325693d7a6eede64df49194495d64b1c1d08955d052da9b3b5f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/kmodel.js:553 \u00B7 source/kmodel.js:1069 \u2014 both copies are in the same file, so extract the block 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":"source/kmodel.js"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cccbc722504864c58ed2d7740eaa33e7d5c547955af5402d026ab6c6828bd9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): source/kmodel.js:587 \u00B7 source/kmodel.js:701 \u00B7 source/kmodel.js:867 \u00B7 source/kmodel.js:882 \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":"source/kmodel.js"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"63274e36251d5ebf806bac94edefa7cb23290c39f1c14efaeb94bdb949538410"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7 locations): source/kmodel.js:671 \u00B7 source/kmodel.js:677 \u00B7 source/kmodel.js:685 \u00B7 source/kmodel.js:722 \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":"source/kmodel.js"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ee15f500f17288c1eca05f9b97c16826cea204451a2b7d0a0c39cb92666e53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): source/kmodel.js:689 \u00B7 source/kmodel.js:709 \u00B7 source/kmodel.js:886 \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":"source/kmodel.js"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef079763d593292036078c09cdbb6736693b2260fe1ddde25a88ef2867d3359"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8 locations): source/kmodel.js:723 \u00B7 source/kmodel.js:736 \u00B7 source/kmodel.js:808 \u00B7 source/kmodel.js:852 \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":"source/kmodel.js"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1a30f03e0f5a2c70339bdaf4f18ef62309f0a02f0068464c4872e40291ff67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/kmodel.js:1752 \u00B7 source/kmodel.js:2059 \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":"source/kmodel.js"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"421d2f5a8a5bf54a3f64bf2157a6c2d263af0a38ae7bc69946e8fad8407ec394"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 17 locations): source/megengine-schema.js:34 \u00B7 source/megengine-schema.js:851 \u00B7 source/megengine-schema.js:861 \u00B7 source/megengine-schema.js:897 \u00B7 \u002B13 more site(s) not listed \u2014 all 17 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":"source/megengine-schema.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9777c40636e3c5dd8bb2e5d885ffa09febfbc5010349b40d1b9801e1fe3d38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): source/megengine-schema.js:1630 \u00B7 source/megengine-schema.js:1755 \u00B7 source/megengine-schema.js:1767 \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":"source/megengine-schema.js"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7e3e9605f3a5696523f192ba323c641ef7ccc0d4302f67ed14f0cd6f8d9b8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): source/megengine-schema.js:1683 \u00B7 source/megengine-schema.js:1693 \u00B7 source/megengine-schema.js:1703 \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":"source/megengine-schema.js"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"5844b8482bc9ae66439e33209c8580986bd8ebb8f3a61e818648081df2004a33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): source/megengine-schema.js:2035 \u00B7 source/megengine-schema.js:2082 \u00B7 source/megengine-schema.js:2112 \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":"source/megengine-schema.js"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdf9abeaa0fcb5b07ecd5aedf92885847c33871351c87b2678e95b34e0388c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/message.js:69 \u00B7 source/message.js:75 \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":"source/message.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"34363ba4144493ab49734a5e322079f4dedaf25222d1780d6643e1ae82e7d8dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/mlir.js:275 \u00B7 source/mlir.js:312 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1e6da32eb9eb74374add6b776f65b7cb8c9808ea0925e900420575687e89d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): source/mlir.js:12337 \u00B7 source/mlir.js:16399 \u00B7 source/mlir.js:16463 \u00B7 source/mlir.js:20930 \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":"source/mlir.js"},"region":{"startLine":12337}}}],"partialFingerprints":{"codehealthFindingId/v1":"42dc4db86735db9fa369754ed0a585da5f66855ee700ec8ce7d34b3ae3d5b7d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/mlir.js:15646 \u00B7 source/mlir.js:15666 \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":"source/mlir.js"},"region":{"startLine":15646}}}],"partialFingerprints":{"codehealthFindingId/v1":"023b597e752622bea33aa01847acd808ec2886a0d1e3403cc648d0895f90cab9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/mlir.js:20464 \u00B7 source/mlir.js:28786 \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":"source/mlir.js"},"region":{"startLine":20464}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d131d220599f57807713e28ee32eb3b7f48de0e1799eb3fb61fe526ec4b2d1d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/mlir.js:21142 \u00B7 source/mlir.js:21192 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":21142}}}],"partialFingerprints":{"codehealthFindingId/v1":"630e0ff3704ff6e3f577e99e1c39da3fd9f40793761108308072a4d74a619174"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/mlir.js:25263 \u00B7 source/mlir.js:25394 \u2014 both copies are in the same file, so extract the block 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":"source/mlir.js"},"region":{"startLine":25263}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c80989dc225cb3cf1034c4fe57ad1568b08e12b6b8f9a7cb9dd0cfd6f7a37ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): source/mslite-schema.js:2659 \u00B7 source/mslite-schema.js:2867 \u00B7 source/mslite-schema.js:2938 \u00B7 source/mslite-schema.js:4054 \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":"source/mslite-schema.js"},"region":{"startLine":2659}}}],"partialFingerprints":{"codehealthFindingId/v1":"468f495aa6d52d5bca69eeb0dd46839013bfb8541671d2fc9b46d93b15ce12f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/mxnet.js:727 \u00B7 source/mxnet.js:741 \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":"source/mxnet.js"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ae5ec91fdd84704ee77a09effd69eb3b2413f8807d6608f465891f45bdd38f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/ncnn.js:212 \u00B7 source/onednn.js:55 \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":"source/ncnn.js"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"54df6c1d6b51cbd5b644d443a62da49759c303925a8a224fe816e1a9dd8e6ba6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/numpy.js:182 \u00B7 source/numpy.js:231 \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":"source/numpy.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7f9c060956e55892e3e6209b3df0e138d53d1668338a55de1548e045a22b86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/onnx.js:322 \u00B7 source/onnx.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":"source/onnx.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7018c52a2bae3eb9afb5079f5df38b23e5de5d74d1e460aa5499f4e46b5f75"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/onnx.js:329 \u00B7 source/onnx.js:340 \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":"source/onnx.js"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f5fc865439a52e17484d4c16a1e3f5b96c7786c3a721187cb592dff4ac3604"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/onnx.js:1012 \u00B7 source/onnx.js:1046 \u2014 both copies are in the same file, so extract the block 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":"source/onnx.js"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e0b289e5e307c165ddb527693458e7ba603d64d8dd25d57ad8223958e86833"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): source/paddle-schema.js:75 \u00B7 source/paddle-schema.js:154 \u00B7 source/paddle-schema.js:221 \u00B7 source/paddle-schema.js:321 \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":"source/paddle-schema.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc261b0bc0be95973b764b9ccc2d48cc4de5410fc4fe62c3cf3015e2b15d325"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/paddle-schema.js:239 \u00B7 source/paddle-schema.js:352 \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":"source/paddle-schema.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99cb54c226b19e09aa6ec58c8c2e5d991cbdbb2097b25aa0866dd36e5b14a05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): source/paddle-schema.js:368 \u00B7 source/paddle-schema.js:438 \u00B7 source/paddle-schema.js:463 \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":"source/paddle-schema.js"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc61fc3ad3cf316a643b38d27e897712801543f6d2d44a460205c215f9b93ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/protobuf.js:226 \u00B7 source/protobuf.js:263 \u2014 both copies are in the same file, so extract the block 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":"source/protobuf.js"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c498f1b10e651a7605c8ada1ae087c331c1ce1406a1b4ef69f17b53a97bd45"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): source/python.js:3269 \u00B7 source/python.js:3282 \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":"source/python.js"},"region":{"startLine":3269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d8e25e25c1deeeacc2e211271c328892317f9410c0ac4635266f1306241ce9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): source/tvm.js:122 \u00B7 source/tvm.js:154 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 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":"source/tvm.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa96685069cbb4fd0deab0dd730c865345379830db19f496db885687b3c4a508"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/acuity.js:272 \u00B7 source/acuity.js: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":"source/acuity.js"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6907b5f3daaf3a45f5cfc84d9c9d07d0c26866b466d81d5d4bb90fe92dc04c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/acuity.js:512 \u00B7 source/acuity.js:530 \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":"source/acuity.js"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1891624193c214d3e54cedb7fde2b89f995f8aa5e1a8914f1659984c58b1983"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 131 locations): source/armnn-schema.js:601 \u00B7 source/armnn-schema.js:651 \u00B7 source/armnn-schema.js:656 \u00B7 source/armnn-schema.js:1246 \u00B7 \u002B127 more site(s) not listed \u2014 the 8 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":"source/armnn-schema.js"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7fdda41ce1f878ab121587b19d52ec02ce7780a621c8216b634bb557427730"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 97 locations): source/armnn-schema.js:1025 \u00B7 source/armnn-schema.js:1254 \u00B7 source/armnn-schema.js:1295 \u00B7 source/armnn-schema.js:1676 \u00B7 \u002B93 more site(s) not listed \u2014 the 8 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":"source/armnn-schema.js"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"e696cd43d80499af8d15e1b654050fe5cf279f8b5af57f2b40bcd43501dde576"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 15 locations): source/armnn-schema.js:1263 \u00B7 source/armnn-schema.js:1304 \u00B7 source/armnn-schema.js:1686 \u00B7 source/circle-schema.js:1335 \u00B7 \u002B11 more site(s) not listed \u2014 the 4 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":"source/armnn-schema.js"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4aeccdc0d4cdb0eafec98802df80ccce81b39e58d8df37a541f7965f61f60f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 15 locations): source/armnn-schema.js:1924 \u00B7 source/catboost-schema.js:185 \u00B7 source/executorch-schema.js:722 \u00B7 source/executorch-schema.js:887 \u00B7 \u002B11 more site(s) not listed \u2014 the 5 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":"source/armnn-schema.js"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"859118a7764a1eefc507f99b9e83423c0737397776893d7ebf41a8aa9e78386b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 11 locations): source/armnn-schema.js:1937 \u00B7 source/circle-schema.js:117 \u00B7 source/mnn-schema.js:66 \u00B7 source/mnn-schema.js:222 \u00B7 \u002B7 more site(s) not listed \u2014 the 4 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":"source/armnn-schema.js"},"region":{"startLine":1937}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba997915a830ab996ff9ae3f123d700f854bfe1ffce65f7423d9d1e0c09fbba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 15 locations): source/armnn-schema.js:2087 \u00B7 source/armnn-schema.js:2275 \u00B7 source/dlc-schema.js:61 \u00B7 source/megengine-schema.js:1958 \u00B7 \u002B11 more site(s) not listed \u2014 the 5 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":"source/armnn-schema.js"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"184c47f7f5205f8979ed27e2c52753479a54f83aa268d5bc656c68dfebfad7af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/barracuda.js:201 \u00B7 source/barracuda.js:209 \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":"source/barracuda.js"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3ee243b3fe09c6a49f511375c9239ecf85b5edafbacf4667b8f89fa43a3e0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): source/base.js:375 \u00B7 source/base.js:381 \u00B7 source/base.js:397 \u00B7 source/base.js:413 \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":"source/base.js"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"e392323451afed410bfb4c14043a8a9a3f0900f33cb48a494087f576462c588d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/caffe.js:418 \u00B7 source/cntk.js:344 \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":"source/caffe.js"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d736e4463986e92bfed5b546d68e95d9bcf15938dff671a2189377f62ea870"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/caffe2.js:160 \u00B7 source/caffe2.js:175 \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":"source/caffe2.js"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6102c84721b08ffd90b8ef67ae84031abe21c1798c04538249fbc59024eff1ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/catboost-schema.js:78 \u00B7 source/catboost-schema.js:91 \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":"source/catboost-schema.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"899ddc08305dc893084d2cd99ab34e85b3b1b26dec053a435061d141f9a709a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): source/catboost-schema.js:242 \u00B7 source/executorch-schema.js:527 \u00B7 source/mnn-schema.js:49 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/catboost-schema.js"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12c756dba8b39518592d2a4139858ffbd7fcb6245f9b83a9963133682944759"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 15 locations): source/circle-schema.js:1174 \u00B7 source/circle-schema.js:1180 \u00B7 source/jax-schema.js:139 \u00B7 source/mnn-schema.js:3390 \u00B7 \u002B11 more site(s) not listed \u2014 the 5 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":"source/circle-schema.js"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d61e86d32cfe740273521fa0047b262677c97cb5c7155ca4cd338d800d36a6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): source/circle-schema.js:1497 \u00B7 source/mnn-schema.js:2881 \u00B7 source/mslite-schema.js:2662 \u00B7 source/mslite-schema.js:3861 \u00B7 \u002B1 more site(s) not listed \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/circle-schema.js"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efa47687c1339b2c88717257e8151a93dc3a168ab2057a4ebad587ef76aa0c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): source/circle-schema.js:1654 \u00B7 source/circle-schema.js:2079 \u00B7 source/circle-schema.js:2410 \u00B7 source/jax-schema.js:140 \u00B7 \u002B1 more site(s) not listed \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/circle-schema.js"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"3142bb3a53e50adae092b603dd4deafeb5a96bf9c95ef7ba11fcf32e64ac590a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 10 locations): source/circle-schema.js:3516 \u00B7 source/mnn-schema.js:302 \u00B7 source/mnn-schema.js:422 \u00B7 source/mnn-schema.js:722 \u00B7 \u002B6 more site(s) not listed \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/circle-schema.js"},"region":{"startLine":3516}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc37fa9d21c48ed451a99737d965953a91331f5804099445d41092aceb45484"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/circle-schema.js:3617 \u00B7 source/espdl-schema.js:124 \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":"source/circle-schema.js"},"region":{"startLine":3617}}}],"partialFingerprints":{"codehealthFindingId/v1":"62493b4e30f363e75ee57a89c9382a4576a538c84ff12a3b035a91483f29ad7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): source/coreml-proto.js:2965 \u00B7 source/coreml-proto.js:3527 \u00B7 source/coreml-proto.js:16969 \u00B7 source/coreml-proto.js:17682 \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":"source/coreml-proto.js"},"region":{"startLine":2965}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffb5855e218bb4c9dc96ccd8b0f403057b8c21aed2d9c1b4ade5884064a3622"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): source/coreml-proto.js:4262 \u00B7 source/coreml-proto.js:4326 \u00B7 source/coreml-proto.js:4480 \u00B7 source/coreml-proto.js:4683 \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":"source/coreml-proto.js"},"region":{"startLine":4262}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1b2a6b82449cd12b531811d2a738486fcbf2cf9cc1427deb9254a115ce725a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/coreml.js:861 \u00B7 source/coreml.js:869 \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":"source/coreml.js"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8de514b3df0cc134d017de66419eb3c9fb15e4400dd41ddd8ed24367538bc8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/darknet.js:725 \u00B7 source/darknet.js:738 \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":"source/darknet.js"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc8cad8abf8a499b4ca1dde18ceb5cb399ed911761449888aa1280ba12351fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 8 locations): source/dlc-schema.js:123 \u00B7 source/jax-schema.js:80 \u00B7 source/mslite-schema.js:4420 \u00B7 source/onnx-schema.js:138 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dlc-schema.js"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c7a692096d41c25b361808f39ad0b94778d5805b1a48ea775e59d43eab07cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/dlc.js:335 \u00B7 source/dlc.js:354 \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":"source/dlc.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c5678533dbc19e3e9e9751f82c8411bc5bd12be15541537b9d13717ea8b553"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): source/espdl-schema.js:158 \u00B7 source/espdl-schema.js:216 \u00B7 source/espdl-schema.js:294 \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":"source/espdl-schema.js"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"8484624ceee998e736bbea240f4fb8030b07f0c940055aa6b4aaafa341e12c5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/executorch-schema.js:316 \u00B7 source/megengine-schema.js:2344 \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":"source/executorch-schema.js"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"8182cb914a2493162a1bbe9bd2bbbc1e814f2cc67c40b89c8f4baa75afff44ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/executorch-schema.js:349 \u00B7 source/mnn-schema.js:3327 \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":"source/executorch-schema.js"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bddc4b8c82041391bdee8e3c8f07bf4a8eac3f6d75f9cdb76a859aa823d432"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): source/executorch-schema.js:541 \u00B7 source/executorch-schema.js:698 \u00B7 source/executorch-schema.js:851 \u00B7 source/executorch-schema.js:875 \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":"source/executorch-schema.js"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5420626094922b3a54b7610c10bb9db4cdea03206201c268f640acfb78f8b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): source/executorch-schema.js:696 \u00B7 source/executorch-schema.js:849 \u00B7 source/executorch-schema.js:1366 \u00B7 source/mnn-schema.js:1226 \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":"source/executorch-schema.js"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"709eee15aafef9cfcf21b118fcbf92adca4c6fcffb2bca5c7c68b75d84b06bb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): source/executorch.js:85 \u00B7 source/executorch.js:829 \u00B7 source/executorch.js:835 \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":"source/executorch.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8291e4f286a677516bf78a45b44884f61a8e8985f4c069c2b15d2e4088039eae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/kann.js:104 \u00B7 source/kann.js:109 \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":"source/kann.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c3241849c6c935ef67197b139250b315db94e7dc9071ea584745db5e671acf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): source/kmodel.js:296 \u00B7 source/kmodel.js:398 \u00B7 source/kmodel.js:407 \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":"source/kmodel.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"78227c72da83059a11b7ab9be2110ff31570ad349bce477224adef4809b280c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/kmodel.js:442 \u00B7 source/kmodel.js:964 \u2014 both copies are in the same file, so extract the block 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":"source/kmodel.js"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e565c7634d981bc4c81a4b060b1772e3f753fd64cc7bac3e28d7a7309cf6488"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/kmodel.js:466 \u00B7 source/kmodel.js:1360 \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":"source/kmodel.js"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dafd6c9986dba258f900b942efd45174a15914600c39b80f5956aa3bb094041"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/kmodel.js:486 \u00B7 source/kmodel.js:498 \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":"source/kmodel.js"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"480f78b3f1f23909372d0ab1fca126f9f74c8818da756244f94ce94cb8e3b9f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/kmodel.js:1061 \u00B7 source/kmodel.js:1068 \u2014 both copies are in the same file, so extract the block 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":"source/kmodel.js"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"f036bdeb5c901e777ee56c7cbefc0daf95399ac85f982a31ad1a3961d9571e4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): source/megengine-schema.js:2209 \u00B7 source/megengine-schema.js:2341 \u00B7 source/megengine-schema.js:2374 \u00B7 source/paddle-schema.js:44 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"source/megengine-schema.js"},"region":{"startLine":2209}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bbd70948eab8992139d8a6bfa17adcbb0676c56d0ea34e7f12e107edf89f3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/megengine.js:480 \u00B7 source/megengine.js:496 \u2014 both copies are in the same file, so extract the block 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":"source/megengine.js"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"139f9a05dcafc548745b7170a0ed52346d91f5453080cfa79ae1ef3b764b2532"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/mlir.js:2028 \u00B7 source/mlir.js:2083 \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":"source/mlir.js"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0161bd8744c36e7eb800b5a5095161795f8f0c35e34e61a35d6d739df9f87f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/mlir.js:4643 \u00B7 source/mlir.js:4651 \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":"source/mlir.js"},"region":{"startLine":4643}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e48485ecff3609e30739789dd2b7117f3728517b588bbe210091ec54459bd4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): source/mlir.js:10476 \u00B7 source/mlir.js:10529 \u00B7 source/mlir.js:10537 \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":"source/mlir.js"},"region":{"startLine":10476}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeba7ad7775b04df9b49ec17bdb911ee679a61bd08cc7a873c94416bfca311b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): source/mlir.js:23058 \u00B7 source/mlir.js:23182 \u00B7 source/mlir.js:23322 \u2014 all 3 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":"source/mlir.js"},"region":{"startLine":23058}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7c34bbf25204ecded6c875cecb7d389466c872cf54c46728cbc333ddf35fbb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): source/mlnet.js:1627 \u00B7 source/mlnet.js:1632 \u00B7 source/mlnet.js:1665 \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":"source/mlnet.js"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"53db115823e261f756b3fa0cbb3ad242c205bb77ca95fd6d7fd270d67389bdf9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): source/mnn-schema.js:170 \u00B7 source/mnn-schema.js:1614 \u00B7 source/mnn-schema.js:1897 \u00B7 source/mnn-schema.js:2739 \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":"source/mnn-schema.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f04bd2d11ffa2c836f1b423f901974c0a8c4d8561ca32f18a790deab88d6cb4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): source/mnn-schema.js:192 \u00B7 source/mnn-schema.js:1624 \u00B7 source/mnn-schema.js:1909 \u00B7 source/mnn-schema.js:2753 \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":"source/mnn-schema.js"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1764ea92679211f9815c0b205ddd9d09f4b4070d6b157599c1f11da893e7036c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): source/mnn-schema.js:270 \u00B7 source/mnn-schema.js:411 \u00B7 source/mnn-schema.js:1227 \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":"source/mnn-schema.js"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3a05b328d30dc916a8c4cdc925c7957ec1da38f168f566d344c460d42097cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): source/mnn-schema.js:291 \u00B7 source/mnn-schema.js:424 \u00B7 source/mnn-schema.js:1237 \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":"source/mnn-schema.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39fc3d8f059d0e93a520db3f9b8ab122c9410100abd1cec51613786a4d910e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): source/mnn-schema.js:326 \u00B7 source/mnn-schema.js:866 \u00B7 source/mnn-schema.js:940 \u00B7 source/mnn-schema.js:3355 \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":"source/mnn-schema.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7eb043c5d17e6abd7214d9f4274be3bb253162477285d4abfd7032120789c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): source/mnn-schema.js:344 \u00B7 source/mnn-schema.js:878 \u00B7 source/mnn-schema.js:959 \u00B7 source/mnn-schema.js:3365 \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":"source/mnn-schema.js"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"e105bef63d26bb3358ab2d080cc923a1baa2ca6c03e5ddbc851bcc24b631468d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): source/mnn-schema.js:421 \u00B7 source/mnn-schema.js:1859 \u00B7 source/mslite-schema.js:4462 \u00B7 source/paddle-schema.js:406 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mnn-schema.js"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aba8353e17f98a829cff194a3637a1a28b57af1457b6dba81f178cb92bb31e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): source/mnn-schema.js:674 \u00B7 source/mnn-schema.js:910 \u00B7 source/mnn-schema.js:2314 \u00B7 source/mnn-schema.js:2778 \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":"source/mnn-schema.js"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"301f9a7c8557138e9f0e1737a5aaecf271f7601e0b57b88aacebe6329f624b82"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/mnn-schema.js:1832 \u00B7 source/mnn-schema.js:2451 \u2014 both copies are in the same file, so extract the block 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":"source/mnn-schema.js"},"region":{"startLine":1832}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70435345964f120069f45576a6116504e598eb0a9faf998c58a4bb96f490410"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/mnn-schema.js:3330 \u00B7 source/mslite-schema.js:4535 \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":"source/mnn-schema.js"},"region":{"startLine":3330}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4899d8c12de45090a47d79546fb3ca7ca6657393483b5a59a081683c763be4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): source/mslite-schema.js:1226 \u00B7 source/mslite-schema.js:1298 \u00B7 source/mslite-schema.js:1426 \u00B7 source/mslite-schema.js:3811 \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":"source/mslite-schema.js"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d9a7502d754a0a69cddbe00250e134c54a7cf4b1df610d1afa7e28ac650b40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): source/mslite-schema.js:1243 \u00B7 source/mslite-schema.js:1316 \u00B7 source/mslite-schema.js:1441 \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":"source/mslite-schema.js"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"1297d57e75320a5dffc82476316f2c3bfad7882bb9304c76d4bf0f95d0a227d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/mslite-schema.js:1321 \u00B7 source/mslite-schema.js:3883 \u2014 both copies are in the same file, so extract the block 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":"source/mslite-schema.js"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"218399d81b47f4a28bdd230974a3c791a3530cff0df5e1f825dd32a48c290d95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/mslite-schema.js:1423 \u00B7 source/mslite-schema.js:3810 \u2014 both copies are in the same file, so extract the block 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":"source/mslite-schema.js"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfe8f67a89d8c8db3a1a11892926edd02bb0dbddf1d04cbb6a8f5b20f2e6796"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/mslite-schema.js:1438 \u00B7 source/mslite-schema.js:3820 \u2014 both copies are in the same file, so extract the block 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":"source/mslite-schema.js"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cd7db7ee940122c032f276e6ba2ce0cb1130924ac14cba0ef938958ca3d8b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): source/mslite-schema.js:1820 \u00B7 source/mslite-schema.js:2128 \u00B7 source/mslite-schema.js:2160 \u00B7 source/mslite-schema.js:4096 \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":"source/mslite-schema.js"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"779867bacb3bec458a8d4cc2e74beff6396db465aaee815d1a408be1fd17db65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/mslite-schema.js:3884 \u00B7 source/mslite-schema.js:3996 \u2014 both copies are in the same file, so extract the block 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":"source/mslite-schema.js"},"region":{"startLine":3884}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfaad7f7fa2d88623a55d8910a746052c9515ba9a4ca5580cbdf7c2e6b6f194"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6 locations): source/ncnn.js:377 \u00B7 source/ncnn.js:438 \u00B7 source/ncnn.js:506 \u00B7 source/ncnn.js:727 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 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":"source/ncnn.js"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"544710f3f583866b007a8aff8d8fcf9d9dbf29b20c73a18b24f79c6aba27ec68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): source/ncnn.js:403 \u00B7 source/ncnn.js:445 \u00B7 source/ncnn.js:492 \u00B7 source/ncnn.js:756 \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":"source/ncnn.js"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e0a31f26e6b43649a3c7582c6ef076ef1bcfb6bea9eae87c32dae4fcf02ac7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/ncnn.js:606 \u00B7 source/ncnn.js:644 \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":"source/ncnn.js"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b012943290253fd0084bb76df5c3c24d4292df347d12f80cb26c911bab07e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/onnx.js:1201 \u00B7 source/onnx.js:1207 \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":"source/onnx.js"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a771da0c9e582bc56e33d6f29698f83b22c842f89a5e944aedadcfcd025be4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/paddle-schema.js:326 \u00B7 source/paddle-schema.js:341 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle-schema.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"d668b50988509761fc2e10ff61bc534da12c40c6d996691db7b4ca381f2c7788"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/paddle.js:109 \u00B7 source/paddle.js:119 \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":"source/paddle.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5248b5385d5bf49fc83ee7f84b055da4d964225004c4100055bc553b71ed811b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): source/protobuf.js:940 \u00B7 source/protobuf.js:973 \u2014 both copies are in the same file, so extract the block 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":"source/protobuf.js"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c9a15e14e600761ad3ae978af75b202beae740f99c9c4725b1b2719da30d50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDirective (cyclomatic 315, cognitive 744): parseDirective has cyclomatic complexity 315 and cognitive complexity 744; 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":"source/mlir.js"},"region":{"startLine":9649}}}],"partialFingerprints":{"codehealthFindingId/v1":"8219c02ce6286cb5776c1136aa0b2b3fdc77f10ae51de541eec6492d2d031d68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 265, cognitive 348): constructor has cyclomatic complexity 265 and cognitive complexity 348; 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":"source/ncnn.js"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9c97f2aec5ab6aacb5a9c4b18eba1e612f1661d8e78d1efc8360a6904cc2b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 248, cognitive 454): constructor has cyclomatic complexity 248 and cognitive complexity 454; 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":"source/pytorch.js"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"512f43506823d5d16904484514da482bd8fa11165d8c2f8c84789fd2db3cb813"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 206, cognitive 448): parseOperation has cyclomatic complexity 206 and cognitive complexity 448; 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":"source/mlir.js"},"region":{"startLine":17902}}}],"partialFingerprints":{"codehealthFindingId/v1":"4048c6f490c595f40a1041c1ffd9ad35bf342f3a1c7b68ef147f5c1597093981"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateValue (cyclomatic 200, cognitive 435): evaluateValue has cyclomatic complexity 200 and cognitive complexity 435; 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":"tools/tablegen.js"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb1d31e19039b61c7d695fafd795f3dda721d209dbb8d5ed526a2e009eb7458"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 136, cognitive 256): constructor has cyclomatic complexity 136 and cognitive complexity 256; 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":"source/gguf.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98572c4f2ed1351cdb5f374166b67b72559173a5ef20026a861f54889fb2948"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseExpression (cyclomatic 130, cognitive 244): _parseExpression has cyclomatic complexity 130 and cognitive complexity 244; 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":"source/python.js"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb9d50b50a318dcb1b51219696028ead75ee89ff9fc5b9e3888c7e303f7bc61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function next (cyclomatic 124, cognitive 167): next has cyclomatic complexity 124 and cognitive complexity 167; 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":"source/protobuf.js"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3b99106cf285e9122ce8c660ac8d931f2432b661bb72f6463f70620a696bb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 123, cognitive 81): parseOperation has cyclomatic complexity 123 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":15989}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c848f4c6132c6771c00b83771f4cb4f966a04829c0ecd4517d65d6593b10d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 121, cognitive 242): constructor has cyclomatic complexity 121 and cognitive complexity 242; 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":"source/darknet.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2946c0b9583088f3f36c7bb5dda90ebc61be1dda7962028233af6f3012923f2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 119, cognitive 243): constructor has cyclomatic complexity 119 and cognitive complexity 243; 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":"source/mlir.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b83d0c0b3b6a2221c03584ee025c065e1b44a79ca4085cb1706eb8c95189386"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 116, cognitive 238): parseOperation has cyclomatic complexity 116 and cognitive complexity 238; 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":"source/mlir.js"},"region":{"startLine":24920}}}],"partialFingerprints":{"codehealthFindingId/v1":"3350aabbd71ba710a9f202967209c91335f0dba9259971a337ce714e3d6f699a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 113, cognitive 141): constructor has cyclomatic complexity 113 and cognitive complexity 141; 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":"source/openvino.js"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f6ea57ed89e85210459cc38368c0a8281b72e8cf54e9dd79e6b2036ce93876"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 112, cognitive 266): parseOperation has cyclomatic complexity 112 and cognitive complexity 266; 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":"source/mlir.js"},"region":{"startLine":13672}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce865dd58bf33d59870472fb922ec15fadc471f8a77c7c71ddc4ec5f66a5065c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferResultTypes (cyclomatic 111, cognitive 385): inferResultTypes has cyclomatic complexity 111 and cognitive complexity 385; 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":"source/mlir.js"},"region":{"startLine":9360}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5920480f1d167c4d4ee413c56e9c267ac772712d27680394c67f5b584089a86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function schema (cyclomatic 111, cognitive 270): schema has cyclomatic complexity 111 and cognitive complexity 270; 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":"tools/mlir-script.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06500f2176dc51c0453a8158cad34a32dd8b7f62cbbc3eb0b94f934e8d84093"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getEnumCases (cyclomatic 109, cognitive 318): getEnumCases has cyclomatic complexity 109 and cognitive complexity 318; 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":"tools/tablegen.js"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"66833199f0fc163e6d1a63ebb721c027c1e8e82119113c5284d0fa07a11c7f64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 106, cognitive 174): constructor has cyclomatic complexity 106 and cognitive complexity 174; 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":"source/keras.js"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed441aa40294ae755a6ecf0f28011bc45f2f31828740fd8ade7b37d42032c33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 104, cognitive 98): load has cyclomatic complexity 104 and cognitive complexity 98; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":3902}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d85e5b392aca34389eabd8515f4609b23b245adc410eed591a04eb4d3d12fa2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 99, cognitive 281): read has cyclomatic complexity 99 and cognitive complexity 281; 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":"source/xml.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d261a305fe9225da40c2a75912a3dc419ae8432d050aef7bd27ac51f46a039bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _add (cyclomatic 99, cognitive 100): _add has cyclomatic complexity 99 and cognitive complexity 100; 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":"source/view.js"},"region":{"startLine":2825}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60d80e68cff351c32810b0e41473350d0c5b28744cb8bf38d45074dc8d1cc8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseStatement (cyclomatic 94, cognitive 133): _parseStatement has cyclomatic complexity 94 and cognitive complexity 133; 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":"source/python.js"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee955b7e0ded2d8c20d190a352ea8b452a71181081c54a80a4cfe374b65abbb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 88, cognitive 208): open has cyclomatic complexity 88 and cognitive complexity 208; 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":"source/keras.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0719805d2454b5b19b69bcee0ec9aebb7a3789aad3ce0f676d2c9168c69b4b43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _decodeData (cyclomatic 81, cognitive 111): _decodeData has cyclomatic complexity 81 and cognitive complexity 111; 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":"source/base.js"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d008e876d4fe5dc632233101b37da5db8d9564d5360be630b5c3013608794b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractTraitsFromList (cyclomatic 80, cognitive 188): extractTraitsFromList has cyclomatic complexity 80 and cognitive complexity 188; 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":"tools/mlir-script.js"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35b1a830d53f7e560601e1b95b8d5c0b46470c7abfc221ea9ab53cffab9700a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 80, cognitive 147): match has cyclomatic complexity 80 and cognitive complexity 147; 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":"source/tf.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"901e19aa03a4ac64eac0d558bbdde29f75aaa518865cc2d786a35278a45ef5dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateTorchScript (cyclomatic 80, cognitive 100): updateTorchScript has cyclomatic complexity 80 and cognitive complexity 100; 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":"source/tf.js"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8035d8cac2044c7b5d9d987092b0297de9edf4e5381b08b4b5c51666667b31b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 78, cognitive 166): constructor has cyclomatic complexity 78 and cognitive complexity 166; 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":"source/pytorch.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5125e0761d658453be5f21c62b2e2a0266dfdf2def4e19ddead9f33d78fe4b12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 75, cognitive 205): constructor has cyclomatic complexity 75 and cognitive complexity 205; 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":"source/keras.js"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"731a39f03019b23fab3b493f2f4de4a1279b1747a75afe577bfc77e84af6644c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 73, cognitive 146): constructor has cyclomatic complexity 73 and cognitive complexity 146; 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":"source/mlir.js"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b5e792b5922986af6b599e342541cc3bb7857b103315dd6f7f26f5e6a52520"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 72, cognitive 100): constructor has cyclomatic complexity 72 and cognitive complexity 100; 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":"source/tnn.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff42fd388e729d0644b092b71fcfe6ad04b3056170dbff046c1bb0ec1542628"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function peek (cyclomatic 71, cognitive 224): peek has cyclomatic complexity 71 and cognitive complexity 224; 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":"source/view.js"},"region":{"startLine":6783}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7defe30569dd6ee41f7d71ff2c88af1e0844a696662b2a592d4713a9e449be2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _tokenizeInline (cyclomatic 70, cognitive 158): _tokenizeInline has cyclomatic complexity 70 and cognitive complexity 158; 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":"source/view.js"},"region":{"startLine":5955}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf730c18d5dbb4b545f4b1a1c50da7da5a74d03c8a1754d6c8f10594e4cc661"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _format (cyclomatic 69, cognitive 74): _format has cyclomatic complexity 69 and cognitive complexity 74; 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":"source/view.js"},"region":{"startLine":5526}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98f9d8ab9cf0354150a0e64b8cc6a231394b188fcbe33d78933e32b8f45561a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function order (cyclomatic 66, cognitive 194): order has cyclomatic complexity 66 and cognitive complexity 194; 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":"source/dagre.js"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"c834cdff113877a6075033b1b74bf659ff09b54b279c63d703606404f0611f36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 63, cognitive 155): constructor has cyclomatic complexity 63 and cognitive complexity 155; 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":"source/mxnet.js"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4fd131caf6db57cfaef7e4d3cc8a04b0f3eddc9142d98f71b37294915bcbad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 63, cognitive 93): constructor has cyclomatic complexity 63 and cognitive complexity 93; 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":"source/onnx.js"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67d7c34021b1fa9c6ef5a8b2bff12ec6b5facc3fdee671bf86ecae8ee9e06ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 62, cognitive 143): read has cyclomatic complexity 62 and cognitive complexity 143; 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":"source/kmodel.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e2f88c628a8fe73d65caa4538b198014f976e9bc8cfe510a85ea2795bb02c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function weights (cyclomatic 62, cognitive 115): weights has cyclomatic complexity 62 and cognitive complexity 115; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pickle.js"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a3f9ab4ea0543c363b2f93e80d2338b8e824b70934a7d1303bf66a57effa17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 61, cognitive 147): constructor has cyclomatic complexity 61 and cognitive complexity 147; 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":"source/mxnet.js"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa59f1f10409c9aa460fbdbeaa4d057c6feb25c424678c3ef815bfec54a8fea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 60, cognitive 81): decodeJson has cyclomatic complexity 60 and cognitive complexity 81; 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":"source/tf-proto.js"},"region":{"startLine":12220}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efa5b5b0099763d750bfc1cc96f4db388825491ef3ef72255be8292a2d9da94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _tokenize (cyclomatic 58, cognitive 157): _tokenize has cyclomatic complexity 58 and cognitive complexity 157; 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":"source/view.js"},"region":{"startLine":5749}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a8186758b5f26032340167e99350dea036bb4666548cca4c6bf3d021f7427b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _number (cyclomatic 58, cognitive 104): _number has cyclomatic complexity 58 and cognitive complexity 104; 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":"source/python.js"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fc9b99c0f5d9df6b00b609ff7b054664feabb2311c774c255e0a34aed13974"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateTensor (cyclomatic 58, cognitive 63): validateTensor has cyclomatic complexity 58 and cognitive complexity 63; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/worker.js"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"003a8ed2e8b92012662a3a81bdd20361aaf7a4276fff875cf773d129ffcf9b4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 57, cognitive 21): constructor has cyclomatic complexity 57 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":2714}}}],"partialFingerprints":{"codehealthFindingId/v1":"1648d3014a306819b1dcd45320baa06752b60ad135ea393466f8c6d9d6f99ef2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 56, cognitive 33): open has cyclomatic complexity 56 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/text.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"584f3309f5de052a4b7fe1c40bf9f91f401cc550a0cc2baa735e0b40983d30e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDirective (cyclomatic 55, cognitive 91): parseDirective has cyclomatic complexity 55 and cognitive complexity 91; 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":"source/mlir.js"},"region":{"startLine":8473}}}],"partialFingerprints":{"codehealthFindingId/v1":"89db70eecaed8e2dfcc924f115bb388f57776b7907753e707d53c2a4e0cc5f75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function weights (cyclomatic 54, cognitive 96): weights has cyclomatic complexity 54 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":"source/pytorch.js"},"region":{"startLine":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"7201be19966879086fa28fc737f29830d53504379250fd56b01daf8afc400b2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 54, cognitive 75): constructor has cyclomatic complexity 54 and cognitive complexity 75; 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":"source/om.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5db36c6c3adc73325e12074fc59c9179af97b4293a5a4b1458b27a8231dac6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 53, cognitive 117): read has cyclomatic complexity 53 and cognitive complexity 117; 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":"source/onnx.js"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"006ac8e1210f9ab4512954bf308d717dc273891af18918e97930a66fa2b9d9a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function graph (cyclomatic 53, cognitive 58): graph has cyclomatic complexity 53 and cognitive complexity 58; 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":"source/tf.js"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"808b87d7a720737ff62279c16a2ba7853ee70c739aec44886aac94b4a96092c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parsePrimaryValue (cyclomatic 51, cognitive 99): _parsePrimaryValue has cyclomatic complexity 51 and cognitive complexity 99; 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":"tools/tablegen.js"},"region":{"startLine":3273}}}],"partialFingerprints":{"codehealthFindingId/v1":"a165632b6fc56d03f34e14c713cffa737adc8b184914f9e127d55adc8393c443"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 51, cognitive 77): open has cyclomatic complexity 51 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx.js"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"984311fc5dce3530af11304ae357e67dfa56e905c8e8613c21524a7cc14640a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 50, cognitive 110): constructor has cyclomatic complexity 50 and cognitive complexity 110; 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":"source/dot.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4fab71ff6f3174fd32396e7eaa273e5d5495c453bede561288048b2146bfab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expression (cyclomatic 50, cognitive 86): expression has cyclomatic complexity 50 and cognitive complexity 86; 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":"source/python.js"},"region":{"startLine":22217}}}],"partialFingerprints":{"codehealthFindingId/v1":"8950ca0841a11efebf37f03c069013388f12244412ff3125345c1937e3ac2d5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lex (cyclomatic 50, cognitive 55): lex has cyclomatic complexity 50 and cognitive complexity 55; 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":"source/python.js"},"region":{"startLine":11513}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6faa2950d3f300a35a33e5563c72095a4cc47f17a852a78277e461ed2f70d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readType (cyclomatic 50, cognitive 13): readType has cyclomatic complexity 50 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":11839}}}],"partialFingerprints":{"codehealthFindingId/v1":"25267af148a037e4538394e4e3bdcb892712cade2fc0577e489e35923acac0d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 49, cognitive 66): (anonymous) has cyclomatic complexity 49 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":"source/python.js"},"region":{"startLine":15407}}}],"partialFingerprints":{"codehealthFindingId/v1":"8137c741fc0af86a54bbb6d7d1e2fdad6f9a54e4e701224205f2e1f837d3fcdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 48, cognitive 112): constructor has cyclomatic complexity 48 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":"source/paddle.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dded2c108ee5b8a6796aa4b488f1b1462857cc9c8d518edfa3bea5ead9f327d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 48, cognitive 93): parseOperation has cyclomatic complexity 48 and cognitive complexity 93; 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":"source/mlir.js"},"region":{"startLine":25944}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d5546c918578a333a153fc20bdd77749f945581f7cc5c85035bd1495750269"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _context (cyclomatic 48, cognitive 59): _context has cyclomatic complexity 48 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":"source/base.js"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"292c6f853a648238458f7456223008783c133e1eb04868f2a37d2004fd915a06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statement (cyclomatic 47, cognitive 93): statement has cyclomatic complexity 47 and cognitive complexity 93; 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":"source/python.js"},"region":{"startLine":22083}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc20d07ac5146efe192270c1463becf2c9c58144de893eb354296eff978e5975"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 47, cognitive 83): constructor has cyclomatic complexity 47 and cognitive complexity 83; 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":"source/rknn.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e326ab50cbf1cfe27ec5ee6e28fae34a0c4b7d187ec47d6802d6a9818c75617"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 47, cognitive 81): constructor has cyclomatic complexity 47 and cognitive complexity 81; 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":"source/caffe.js"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8442d7e2efe9e6af6796542725e33be6332cd5cf013f3345be1fbbc295a757"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function model (cyclomatic 47, cognitive 30): model has cyclomatic complexity 47 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc035cda22eb7a004bd51045b8d85fafdd48e9e81c1122db1a3cf403e58c340"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAttribute (cyclomatic 47, cognitive 23): parseAttribute has cyclomatic complexity 47 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":3735}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e69704accb6035b976fa92628f7696bb1a055e59fdb4a4a6d291356e8e6f10d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readAttribute (cyclomatic 46, cognitive 41): readAttribute has cyclomatic complexity 46 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":19653}}}],"partialFingerprints":{"codehealthFindingId/v1":"78df94f5347f7c5301ce1d12aa04580e40534986ac1e770e56fd5023b90d415a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 45, cognitive 72): constructor has cyclomatic complexity 45 and cognitive complexity 72; 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":"source/tosa.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ace936831320293009d7f4afdf89d847b119f3cbf2daced3336f96b34b5e9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 44, cognitive 38): constructor has cyclomatic complexity 44 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf.js"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"05043e71309f38368503c1908e9252447b09f36aec9985bf010be06dd741efbd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _internalSubset (cyclomatic 43, cognitive 133): _internalSubset has cyclomatic complexity 43 and cognitive complexity 133; 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":"source/xml.js"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a500a8ec727a04aad586785d6c542a319b0fa9adc622bd528d7e92d79a14f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 43, cognitive 122): parseOperation has cyclomatic complexity 43 and cognitive complexity 122; 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":"source/mlir.js"},"region":{"startLine":23610}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e5a1cab0d8571e24b9a3656d527da280ba43b08186e75c064268e882694f25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toConstraintString (cyclomatic 43, cognitive 79): toConstraintString has cyclomatic complexity 43 and cognitive complexity 79; 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":"tools/mlir-script.js"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6f130f138c3fd2943c633b9d24a1a6ce4d511a39fa79b80f271948ccfe4c3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateGraph (cyclomatic 42, cognitive 95): validateGraph has cyclomatic complexity 42 and cognitive complexity 95; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/worker.js"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e5a7b9399dc11d7d0fd386d04171350060e6f11b3a2a746cce190953b6c731"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _tokenize (cyclomatic 42, cognitive 58): _tokenize has cyclomatic complexity 42 and cognitive complexity 58; 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":"source/python.js"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a81359c670e6d0c3e542415f8f5bf8016059f2b0fcabd3acbb33673591eee8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _string (cyclomatic 42, cognitive 57): _string has cyclomatic complexity 42 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":"source/python.js"},"region":{"startLine":2262}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0925c6f0b0e6cfa4780fb0e84bb22a37506562a2b28063cb28df27094ed56d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constant (cyclomatic 42, cognitive 52): constant has cyclomatic complexity 42 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/openvino.js"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2bae5cdb88dee4cf878616bd0dc28dc8b01ac2c946af6ed9084102cba87376"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 41, cognitive 161): constructor has cyclomatic complexity 41 and cognitive complexity 161; 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":"source/onnx.js"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0914c795e10ecebe57cd2088fd48ba72c93aa032eb1e52fcbeab2b28fdd51c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 41, cognitive 88): constructor has cyclomatic complexity 41 and cognitive complexity 88; 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":"source/circle.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"844fb04c649ba42c637fa3bd7843124b5b49727f3388340765f1a92e8eee313c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 41, cognitive 88): constructor has cyclomatic complexity 41 and cognitive complexity 88; 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":"source/tflite.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"4851ff98c115be1d1445bc42f349694f55003585c8185f74cbe091dc9bf1c8f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 41, cognitive 73): constructor has cyclomatic complexity 41 and cognitive complexity 73; 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":"source/sklearn.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b99d3bace60e175de4511bb8524d058dcc12661375a9eecdbf6cf13d86371f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refresh (cyclomatic 41, cognitive 72): refresh has cyclomatic complexity 41 and cognitive complexity 72; 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":"source/view.js"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"3086011b030b64503b2d984898b2e135825d36b45485ef84c7d879d6ede20c5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toString (cyclomatic 41, cognitive 55): toString has cyclomatic complexity 41 and cognitive complexity 55; 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":"source/view.js"},"region":{"startLine":5275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9550920bbcfcabf232f02bb7ecff1e8782fc71773bd7c7b28edacfb53d99fc36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readType (cyclomatic 41, cognitive 13): readType has cyclomatic complexity 41 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":19534}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76169aba748ae05b09a2f39c0f1cb07ded54bfdfd8b1d2a6c81f038b2c235c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 40, cognitive 80): constructor has cyclomatic complexity 40 and cognitive complexity 80; 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":"source/tvm.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"01cf311cf5c3301fef306186178668c59e3af89075d5d73948985b3ffd110641"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 40, cognitive 79): constructor has cyclomatic complexity 40 and cognitive complexity 79; 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":"source/onednn.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d9566bcaf91435f58c32e5ed278f7aaa86b29286ba2889739e02110cc2b70e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _buildTable (cyclomatic 40, cognitive 64): _buildTable has cyclomatic complexity 40 and cognitive complexity 64; 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":"tools/flatc.js"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b433d482c54c0c29e76c6e53e7efac7496dd94331e6b47e4d550aeb33a94644"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lexToken (cyclomatic 40, cognitive 33): lexToken has cyclomatic complexity 40 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":2504}}}],"partialFingerprints":{"codehealthFindingId/v1":"171e7f77e309f48f48a214473af5f7547e035eddc4937cf9a9ba2161007ee3c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 39, cognitive 99): constructor has cyclomatic complexity 39 and cognitive complexity 99; 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":"source/megengine.js"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d690689ac799fe1bfa82ba22088357f08d51b6e825e51e84ab42632f2c3de1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _render (cyclomatic 39, cognitive 90): _render has cyclomatic complexity 39 and cognitive complexity 90; 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":"source/view.js"},"region":{"startLine":6198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b9abcde0c349d4e44437a52fa528f7db3d33c21b9cb4b9d826cdf99d4520a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _node (cyclomatic 39, cognitive 88): _node has cyclomatic complexity 39 and cognitive complexity 88; 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":"source/view.js"},"region":{"startLine":4962}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10a12e66e136eeacea9ed4f0b5165e4b05a8d63a7d317c2a05d87964ebf2a6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 39, cognitive 35): (anonymous) has cyclomatic complexity 39 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf.js"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76ef38ef7220a39598acf709c8b4e9e7529e5b9662aa0f534c0c895ad9df90d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dataType (cyclomatic 39, cognitive 17): dataType has cyclomatic complexity 39 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a74db3af22d8f50e9cf5c5f5a6b2840c753c3c21414c24d88ac3b04f66781bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 38, cognitive 79): parse has cyclomatic complexity 38 and cognitive complexity 79; 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":"source/mxnet.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"151d02d37563b4bff310adb0f4f1253c114bf2b62271bdf36fa42ca01d254bbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 38, cognitive 61): read has cyclomatic complexity 38 and cognitive complexity 61; 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":"source/om.js"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7034b346413b736d140891565ba909dd32feead720e32766d8a0d42b3a7be6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function add (cyclomatic 37, cognitive 97): add has cyclomatic complexity 37 and cognitive complexity 97; 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":"source/view.js"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48263b86e74bb78a4804bf492f474fda7cf8603feac7ab0e2c5b92ea67aff17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _instantiateMulticlassDef (cyclomatic 37, cognitive 65): _instantiateMulticlassDef has cyclomatic complexity 37 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":"tools/tablegen.js"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"820042728c0108ea4a15fa9e1577981d161d0ce0fc5b81e742a816e26cf17307"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 37, cognitive 63): read has cyclomatic complexity 37 and cognitive complexity 63; 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":"source/espresso.js"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6354c5da538dbe0e17d074bc36c0099c76d689d1bc8d2a74f312297645a1bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _buildDecodeJsonFunction (cyclomatic 37, cognitive 52): _buildDecodeJsonFunction has cyclomatic complexity 37 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/protoc.js"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1fb4fb25efbb54f0adb9d1379c7bef18b7860f1d726aa8e4dfa80fa7ee22af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 37, cognitive 46): constructor has cyclomatic complexity 37 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dl4j.js"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d65b360e85ccba6e11906aedff17b18af6d43107b5b42e914bf52e2f434c332"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 37, cognitive 35): constructor has cyclomatic complexity 37 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pickle.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f828a409e3bddc3207bce505e39bbf3e49663d6f55553ad09f369770a61e8d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function value (cyclomatic 37, cognitive 9): value has cyclomatic complexity 37 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":5262}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c4ab249f1d7e31391f66de0fc7a51b25d948d54dad94f68ad9095b9e593d8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 36, cognitive 105): parseOperation has cyclomatic complexity 36 and cognitive complexity 105; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":28680}}}],"partialFingerprints":{"codehealthFindingId/v1":"9020c7ec0a241f8d739419d1eba068fdd89b3ade7b88d06bcfd286e20210210e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 36, cognitive 84): match has cyclomatic complexity 36 and cognitive complexity 84; 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":"source/ncnn.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"be58fee9cb008f03ea1eddf7d65971bbf9ca7787086a7d04a74bce859fc8d8d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 36, cognitive 77): constructor has cyclomatic complexity 36 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf.js"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"52dc08c86859b082579e3208634c614ec3ca58cc0047d40185855360df9f1aa8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _resolveInit (cyclomatic 36, cognitive 74): _resolveInit has cyclomatic complexity 36 and cognitive complexity 74; 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":"tools/tablegen.js"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f99373650b3440d7aa4944b02208f47f61272e0cab662d2332b96e6d7f1893a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 36, cognitive 61): constructor has cyclomatic complexity 36 and cognitive complexity 61; 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":"source/kmodel.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc004359d7f57afd2190cfeb891f2a0e6535ae3683aa8eb14a0b413f1f00a0bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 36, cognitive 55): constructor has cyclomatic complexity 36 and cognitive complexity 55; 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":"source/caffe.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b72caa8a6202fc5cef76498189d2722334ad91699e3d8396c8c9c79097a9d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 36, cognitive 44): render has cyclomatic complexity 36 and cognitive complexity 44; 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":"source/view.js"},"region":{"startLine":3679}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a124860814fc7c0c3e7a828e952d12d492ab948165ee4bf4d3fab9a4dcf5b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseNonFunctionType (cyclomatic 36, cognitive 10): parseNonFunctionType has cyclomatic complexity 36 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":3492}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78d2f5d7a4c3a21e12a1fab526a62fca3cdfb360d2d5acdb9305dec361d4170"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 35, cognitive 56): constructor has cyclomatic complexity 35 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe2.js"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"70df4ad3eda78fdd57e3f4e68d1cc90890a2b35157eb1cccec266dc9151e0ccf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _evaluateDefvar (cyclomatic 35, cognitive 48): _evaluateDefvar has cyclomatic complexity 35 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":2795}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ee47f686f83dc3900a4b25c91180322696c941f9399d12d58fb24605cf3e73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 35, cognitive 41): constructor has cyclomatic complexity 35 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":"source/onnx.js"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11ce2bd648f0bd8be993e1f18c65edb4fd211bb53e81d6ca6519c6feaf3540a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 35, cognitive 36): constructor has cyclomatic complexity 35 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":"source/bigdl.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93d1073ef8870d0c7366f4d9d3257be1d827b32d140bf70419c5d0e0a55602d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readAttribute (cyclomatic 35, cognitive 23): readAttribute has cyclomatic complexity 35 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":11956}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc1964005c33c399bd25fcffbc33b7969ae7832cddca91d8f39d273046e7c83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 34, cognitive 165): main has cyclomatic complexity 34 and cognitive complexity 165; 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":"tools/tosa-script.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eda97fa74ff4fda5eacbbd02921b8a8d3f494e0b3ecff41818581209964af0d"}},{"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":"source/python.js"},"region":{"startLine":14863}}}],"partialFingerprints":{"codehealthFindingId/v1":"203f1dbef59eebc1394aaeedc3d61ec12570a287057cdd05efe0e882bf02cd7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function optimizeBlock (cyclomatic 34, cognitive 53): optimizeBlock has cyclomatic complexity 34 and cognitive complexity 53; 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":"source/python.js"},"region":{"startLine":7692}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b456f6c1483a3e78ccb24820755b52aa667e106500b3765fbe847aaeb5811e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 34, cognitive 52): constructor has cyclomatic complexity 34 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/openvino.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"166a26b2b52bdcdb6124b3bb63d0ef2fbddd7187a9dd2d7a05d44ca177705980"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAttributeDict (cyclomatic 34, cognitive 47): parseAttributeDict has cyclomatic complexity 34 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":7966}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df77a2d5e8298b1813bcc5fe929ddd8dc2f97d825844dd07a7170c12181f073"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deserialize_input (cyclomatic 34, cognitive 37): deserialize_input has cyclomatic complexity 34 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":"source/python.js"},"region":{"startLine":20265}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a21051fc754cf94ab00e3f36c279431a45c4447f0ec372765f331a10e6c71a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _attribute (cyclomatic 34, cognitive 34): _attribute has cyclomatic complexity 34 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx.js"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"8705961cc9796068eee26a64096b7add01f258f52d837316e0426841ef92f35c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 34, cognitive 34): decodeJson has cyclomatic complexity 34 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":9091}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27e846cee80b3e23060a1c180d1178c093255181349e2424056d57e915be9c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _operator (cyclomatic 34, cognitive 30): _operator has cyclomatic complexity 34 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":2209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8688bdf95775b0ab5f4b999c303237782c1da77906ece4bba8d35a7abf4aeb2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 33, cognitive 76): parseOperation has cyclomatic complexity 33 and cognitive complexity 76; 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":"source/mlir.js"},"region":{"startLine":24415}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e64d287c4176e562b3d424b7967189b07a74de278e1aacf4b59293da7cae13"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 33, cognitive 62): constructor has cyclomatic complexity 33 and cognitive complexity 62; 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":"source/mnn.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10eba6a4716271bbdfd662bc2d83182d0b9c013242375a410619e742fd8606a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 33, cognitive 60): constructor has cyclomatic complexity 33 and cognitive complexity 60; 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":"source/espdl.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc902536c0a1585b506ecde50df8cefd9f00e20745c9a4115a730a84b4dd399"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 33, cognitive 52): (anonymous) has cyclomatic complexity 33 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":7175}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4465e5616e58bd743ebebec15a0c94054f35f9d3015ce375fba27cabd019b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layout (cyclomatic 33, cognitive 40): layout has cyclomatic complexity 33 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/grapher.js"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a68c764c8603e86c293fb326de7366114a9de7701387a389942e0ed67687b8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function type (cyclomatic 33, cognitive 33): type has cyclomatic complexity 33 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":"source/hdf5.js"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f30d4263d90c0e36eff99f8b7a2368983abb7a8e9f4406e5d67759e983a5761"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 33, cognitive 22): (anonymous) has cyclomatic complexity 33 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"227552a43b14755a9f4ac58122b49355496fc5e8e3b60a9ea8cbb9c08b7566b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 32, cognitive 65): parseOperation has cyclomatic complexity 32 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":"source/mlir.js"},"region":{"startLine":24733}}}],"partialFingerprints":{"codehealthFindingId/v1":"414fd2101dc3065751cfdb8259400c2e037e7302a8a7ccfca56893b4ec13633a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function animateTransition (cyclomatic 32, cognitive 60): animateTransition has cyclomatic complexity 32 and cognitive complexity 60; 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":"source/view.js"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35ed9bf04595633cb32e00791eebeec98d04de28aad5bdd64b6054d442c03ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 32, cognitive 42): match has cyclomatic complexity 32 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":"source/coreml.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeed4d6a69a5eb2daf80bfa447a10f8b4ad8b23f2ea5bc59636be568a9cc653c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 32, cognitive 38): match has cyclomatic complexity 32 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/transformers.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cbd76f49ae53af44d760c21aece26c870fbf7ff575cae590fcc4edf87e9e6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function weights (cyclomatic 32, cognitive 36): weights has cyclomatic complexity 32 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":"source/coreml.js"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"6417477418bade9d8eaf4a04f0c081c9061d804c4262594ec8a5615de5e36586"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 32, cognitive 33): match has cyclomatic complexity 32 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":"source/keras.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4f69d629973131e538b3eef20d60859da9c0d94bd3ffba61077836931ab058"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sympify (cyclomatic 32, cognitive 29): sympify has cyclomatic complexity 32 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":5956}}}],"partialFingerprints":{"codehealthFindingId/v1":"2550bd7001091fdbf0d7d6f590a28a50ca3a1321f5b787af05dcb13530ace69d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitApplySpecialForm (cyclomatic 32, cognitive 22): emitApplySpecialForm has cyclomatic complexity 32 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":17444}}}],"partialFingerprints":{"codehealthFindingId/v1":"57092290bd261b7c7171f5ffcfecaae86ad0e02f37f8199a373dffb9076a547a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkIsAttr (cyclomatic 32, cognitive 20): checkIsAttr has cyclomatic complexity 32 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/mlir-script.js"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7fc18b55d5ea383937a57e43802678049a367a994dc90f863d6b866bdedaa9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _unescape (cyclomatic 31, cognitive 61): _unescape has cyclomatic complexity 31 and cognitive complexity 61; 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":"source/python.js"},"region":{"startLine":3361}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2b97a3ff5715882baf9f0754ab6588778b8d3577ea3f9280acfe5f53715c66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 31, cognitive 58): constructor has cyclomatic complexity 31 and cognitive complexity 58; 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":"source/cntk.js"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"deebc4ec6a78ddf1bf9a97fdfcc3412cc6e89c59d2f2b39ce0d3ebb333e9a187"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 31, cognitive 44): constructor has cyclomatic complexity 31 and cognitive complexity 44; 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":"source/darknet.js"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"b911bdfde56cfb928cc6bc20117542cce4908e0224f6fb5b9882069e8d9df89c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 31, cognitive 36): match has cyclomatic complexity 31 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":"source/tf.js"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"d218c6169decad2e71b0797746a414e3bb48be4300229d47df70aef4fd493810"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseShapedFunctionType (cyclomatic 30, cognitive 114): parseShapedFunctionType has cyclomatic complexity 30 and cognitive complexity 114; 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":"source/mlir.js"},"region":{"startLine":14972}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff072e856fc6ccc23f0ef95ba7a4b31b8c23eaff3595336cc3beb52ac0a18526"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLLVMInvokeOp (cyclomatic 30, cognitive 74): parseLLVMInvokeOp has cyclomatic complexity 30 and cognitive complexity 74; 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":"source/mlir.js"},"region":{"startLine":23181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d518e049d08ff3cba0490ded19de85d7ba5897eb940e4e3c9c2ecf9be719cf92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 30, cognitive 69): render has cyclomatic complexity 30 and cognitive complexity 69; 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":"source/view.js"},"region":{"startLine":4752}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a7f5b75bd07a1abe2d5d521bcfe1cef9183909b9973249a4e6543ba0d95024"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decode (cyclomatic 30, cognitive 52): decode has cyclomatic complexity 30 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/text.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cae65d68d94ff77894938b9e2546ce984c1ae9b6a3361d668740b1216a4e88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function subscriptToType (cyclomatic 30, cognitive 43): subscriptToType has cyclomatic complexity 30 and cognitive complexity 43; 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":"source/python.js"},"region":{"startLine":11982}}}],"partialFingerprints":{"codehealthFindingId/v1":"be65ac738a7e3e56dcb0af31c5de81733f843e0bad66f5b79451880dfb0eda31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 30, cognitive 33): constructor has cyclomatic complexity 30 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":"source/view.js"},"region":{"startLine":3878}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe877c68589f55ad4233cccd577da4a90bb9bb627e74fa267433c104b4b110c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBlockArgRegion (cyclomatic 30, cognitive 32): parseBlockArgRegion has cyclomatic complexity 30 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":21908}}}],"partialFingerprints":{"codehealthFindingId/v1":"f715f0f902f7def09c64ccff3ccb05353bac66f1778e9ffc3bf0db1a76d0c315"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLoopNestOp (cyclomatic 29, cognitive 83): parseLoopNestOp has cyclomatic complexity 29 and cognitive complexity 83; 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":"source/mlir.js"},"region":{"startLine":21487}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff671bd7dafa3883069ad1fbf8fa67533b38bd327a9c862d6f29f4ff02d7a5bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 29, cognitive 82): read has cyclomatic complexity 29 and cognitive complexity 82; 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":"source/json.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb47571ae876b0997e0800b5e2815a05a67475437cfabcd65ac783eb0b77a1e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 29, cognitive 77): parseOperation has cyclomatic complexity 29 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":16526}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b182c0e00d85aec8666495e80ba26cb1cf0f9de7923376b48d051e625d6f48c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 29, cognitive 69): parse has cyclomatic complexity 29 and cognitive complexity 69; 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":"tools/flatc.js"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d10ca1f9a311cb74cb2c7a340cdb15a2dd8401c4ff559ca3a6c5dc1a31725c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 63): (anonymous) has cyclomatic complexity 29 and cognitive complexity 63; 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":"source/python.js"},"region":{"startLine":15081}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01bc8a5ffc39cb0574c719a1317f9aec93bc665dae660f72a63d4722d0894e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 29, cognitive 60): open has cyclomatic complexity 29 and cognitive complexity 60; 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":"source/zip.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b106424beebcccff1268d7340709e6a54a230a601c5a5308f89d904720569341"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 29, cognitive 57): constructor has cyclomatic complexity 29 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":"source/circle.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d864a487afb590eb2330d07590529631394e962b4ed2b2d8afef8ac382b9ef5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 29, cognitive 57): constructor has cyclomatic complexity 29 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":"source/tflite.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e7874cd90f80726b71ae8e5345dcd94a070e747df9004d7919e939c415a5f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 29, cognitive 54): constructor has cyclomatic complexity 29 and cognitive complexity 54; 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":"source/tengine.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edd2765545b7774c732d10856ec845d66db8270959f6e00d62c2b85fa354bbc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function program (cyclomatic 29, cognitive 53): program has cyclomatic complexity 29 and cognitive complexity 53; 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":"source/coreml.js"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"5251ebda2aae3a95451bdd17a6e1780af4232c0a4c21adb2904533b81824ded1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 29, cognitive 39): read has cyclomatic complexity 29 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dlc.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"b266041a97e08ace27ad0c5bbd86d5bdeebb11164d46ef8f87b752a04258e3f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 29, cognitive 39): constructor has cyclomatic complexity 29 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.js"},"region":{"startLine":2286}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a4da47c9c42f01b496e4e5dd62c35a2d0f8292b8167254acaf668aa14f8243"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 29, cognitive 35): constructor has cyclomatic complexity 29 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tnn.js"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"69510b13f21d79912f8a5ea849263aca75652a5054c4830c6ce54aea0eb75089"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 29, cognitive 34): constructor has cyclomatic complexity 29 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/barracuda.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf359552efee238f992500fc3faa1673990dafdfa518ede08c9bc44a130ee909"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processParent (cyclomatic 29, cognitive 31): processParent has cyclomatic complexity 29 and cognitive complexity 31; 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":"tools/tablegen.js"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"99da4ae535d773fe99d096a8a5ff773c0318c70a597149eddb1ac922c702b057"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convertValue (cyclomatic 29, cognitive 16): convertValue has cyclomatic complexity 29 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1b2ba246c26bd376ec3bd09b5111f0062fc021103c02642af2794721b05ec2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lexBareIdentifierOrKeyword (cyclomatic 29, cognitive 10): lexBareIdentifierOrKeyword has cyclomatic complexity 29 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":2749}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe300b2d03c0a958a129622e2e9ed4958434cf52f65581450f4e15bd0f59404c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseParallelExecutionBody (cyclomatic 28, cognitive 78): parseParallelExecutionBody has cyclomatic complexity 28 and cognitive complexity 78; 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":"source/mlir.js"},"region":{"startLine":15866}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69467fc24e971ec7248eed8354ecba0e139a6c4166671ae331d998035c7c860"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 28, cognitive 76): read has cyclomatic complexity 28 and cognitive complexity 76; 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":"source/pytorch.js"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4dc5f0e1eb977d855e6841b7f8554fceca9df0f5d98b88c76143cd08f656aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function metrics (cyclomatic 28, cognitive 69): metrics has cyclomatic complexity 28 and cognitive complexity 69; 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":"source/view.js"},"region":{"startLine":6655}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41396287744eae4e957c611b0e5b1504c821e8a911781376545a327e2a8da82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 57): (anonymous) has cyclomatic complexity 28 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":"source/acuity.js"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"79357af27a98a80fd8566b14960148d313c11575a8b12570480f3a72d1571b9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 28, cognitive 54): constructor has cyclomatic complexity 28 and cognitive complexity 54; 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":"source/executorch.js"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3b90252b53a51dcab88d4ad8038ac9d96cfa4e507774b0ef677a18afbd6ace"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSchema (cyclomatic 28, cognitive 44): buildSchema has cyclomatic complexity 28 and cognitive complexity 44; 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":"tools/tf-script.js"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6cc72b698951d1884e87798fbb486b4c35389362dff2b5bab07d619ea38d6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 43): (anonymous) has cyclomatic complexity 28 and cognitive complexity 43; 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":"source/python.js"},"region":{"startLine":14989}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f2dc39f02d5cc4f56042a12d4acbf04f293dfb56f5e0efaef257cfc7c1be7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 28, cognitive 42): constructor has cyclomatic complexity 28 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":"source/onnx.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ef4a336294508b87452d8f4eda5e5bb3968c753c2208c6490a2738bfc59b22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRegion (cyclomatic 28, cognitive 40): parseRegion has cyclomatic complexity 28 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":5363}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d9d078ea3b3b0a6841e1350d7284a4663bb7773c51b87e4c734960b19d0446"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 28, cognitive 39): validate has cyclomatic complexity 28 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/worker.js"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef3ab18df80fe73ecb7a77dd14a47bc29bb7f3b98ca3d7a9b5dcee5bf8a04fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 28, cognitive 36): parseOperation has cyclomatic complexity 28 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":"source/mlir.js"},"region":{"startLine":25391}}}],"partialFingerprints":{"codehealthFindingId/v1":"071a8e214b87572f44d6add9a827a0aaf18524f0a00fa4ef366a052e7e7821b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 34): (anonymous) has cyclomatic complexity 28 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":15290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d321fd19664d0d4ee212276e04783ea4487af81f4e7e57d79bea15ce4572d34c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 28, cognitive 21): constructor has cyclomatic complexity 28 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":4059}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27f171efa0810cc5862d3d72eb9c4e738533560cef27ad5dbd0afe399278bab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __name__ (cyclomatic 28, cognitive 11): __name__ has cyclomatic complexity 28 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":2813}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7173843ad840be5df22fc5f0c464eef57380423e8da01faceea8f0115985f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOpWithoutRegions (cyclomatic 27, cognitive 49): parseOpWithoutRegions has cyclomatic complexity 27 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":7857}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b9a6fd5453c2c4f0774125e4719ce56ea0f4d7655208d3ccd727fb290489c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 27, cognitive 45): constructor has cyclomatic complexity 27 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":"source/mindir.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cef75a6d63f9908c2922eebfccf76265c03adb784460c3ba81e6e3198dcfc97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 27, cognitive 40): constructor has cyclomatic complexity 27 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mindir.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d290a97f7a75ba79cd61da707db6c358e8750dfca391e84a7c440d28086294"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFakeAndRealType (cyclomatic 27, cognitive 40): parseFakeAndRealType has cyclomatic complexity 27 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":11602}}}],"partialFingerprints":{"codehealthFindingId/v1":"859045ac7f546247483d324e46983107745e771881729e0fbc3853cb50607983"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _readBson (cyclomatic 27, cognitive 35): _readBson has cyclomatic complexity 27 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/json.js"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97814ab6edb021f3acfa1cbdf3e0f56235a2f19197b0814fc7f9c16bdab5849"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 27, cognitive 35): constructor has cyclomatic complexity 27 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee3fbda8e8e9cb9ef7c9a8cdd33a63753be01a3b0425323fe73f0ed9c4abfca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _tokenize (cyclomatic 27, cognitive 28): _tokenize has cyclomatic complexity 27 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"21526d6597d3e8c2d80bb25ed45d2a0faded1727246df7aae6bc04a36c2df26d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 26): (anonymous) has cyclomatic complexity 27 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":15536}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5fe7c524a7f67fc791a3b4a4db2d11024c50369cacded0ee05e681b087c83f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readAPFloatWithKnownSemantics (cyclomatic 27, cognitive 21): readAPFloatWithKnownSemantics has cyclomatic complexity 27 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":6882}}}],"partialFingerprints":{"codehealthFindingId/v1":"774909ba69d9c2e88f8af920b28e3f813afb5b7f0689f99ab8f09629f39efc72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 26, cognitive 66): constructor has cyclomatic complexity 26 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":"source/cntk.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"8492b7e0208d89a779e2c91306c50b7cad4726cecf7eddcc95986a6175d1f92a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadGraph (cyclomatic 26, cognitive 66): loadGraph has cyclomatic complexity 26 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":"source/megengine.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a7ad3c2253b29b3feb5d02873f7bb28d0a50fd657c3a7603ce4d33a5590f62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function register (cyclomatic 26, cognitive 64): register has cyclomatic complexity 26 and cognitive complexity 64; 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":"source/view.js"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"758a016ada90b2281deb814fa14dbb743f3bc93e1b4470c7cf6ac8a01f9727cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importClass (cyclomatic 26, cognitive 56): importClass has cyclomatic complexity 26 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":13748}}}],"partialFingerprints":{"codehealthFindingId/v1":"87af9ff2b52288a26682125d490b2c7d832f37ff17e9669c25c0261ac5ef3baa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function graph (cyclomatic 26, cognitive 50): graph has cyclomatic complexity 26 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.js"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6846f01d691c42136cf66110421fc175e3c829b9d24fef938a3087d472d415"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function test (cyclomatic 26, cognitive 48): test has cyclomatic complexity 26 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/mlir-script.js"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"921dd5bc107b452fe69acc947681bd370bb43a1b1bda87abb379b3acc0236be5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 26, cognitive 44): main has cyclomatic complexity 26 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/models.js"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"9326bd4069cde3eb28dffab80d3c627600686f4c813ba010b5c5cf6a182250e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 26, cognitive 42): constructor has cyclomatic complexity 26 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":"source/dlc.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"219c691bbe67f5cfe6ff2a27b816a1e10f20f79982a755782d4b5c11dda3ce1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitIfElseBlocks (cyclomatic 26, cognitive 41): emitIfElseBlocks has cyclomatic complexity 26 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":"source/python.js"},"region":{"startLine":17066}}}],"partialFingerprints":{"codehealthFindingId/v1":"842fb99ecf9ab7a2db5c2baa2f7a8dbb358fda282bab84b737a5d85772728f6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBlockArgClause (cyclomatic 26, cognitive 40): parseBlockArgClause has cyclomatic complexity 26 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":21804}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bd42f72f2d43bc60a5919dfe598bbed8fbfcaee9fcc89b7e841c10516d98f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 26, cognitive 39): constructor has cyclomatic complexity 26 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/xmodel.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2f85831241fd71fdca084ada760e9fc8c78516f01458862e9882be28ff7f13"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 26, cognitive 38): constructor has cyclomatic complexity 26 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx.js"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1884744ae47c9c4f1f91edc54e6350715fa359522814628c92d7806761f9cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 26, cognitive 31): open has cyclomatic complexity 26 and cognitive complexity 31; 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":"source/json.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"990c8aba9a7930289289fcebab8800f94dfe15708d103c35553fa8f198e03976"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createAttribute (cyclomatic 26, cognitive 30): createAttribute has cyclomatic complexity 26 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":"source/onnx.js"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"8055b19f940c1959c5227a214a99a0bb8d1cfcbfcf8a87baf9c5b67270641962"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function value (cyclomatic 26, cognitive 30): value has cyclomatic complexity 26 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":"source/python.js"},"region":{"startLine":4626}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc55b9efadc9c598e322f4a90da7fc9558acf5bb2478a2a2d66370a70b09bbdf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 26, cognitive 25): parseOperation has cyclomatic complexity 26 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":13314}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e51b2da3b3a411b442110e99511432380973b87bc68f50c831cc1b0df8fe35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function next (cyclomatic 25, cognitive 58): next has cyclomatic complexity 25 and cognitive complexity 58; 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":"tools/protoc.js"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"073c99d876c38e48369404d840af809babfb7c3da3e4d174df0014293d21aacf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 25, cognitive 47): constructor has cyclomatic complexity 25 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.js"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1b957cf31403971051c87921463cf56ac65410ac4947e0c2d653bcace25f8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 25, cognitive 47): open has cyclomatic complexity 25 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":5327}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8564b078442f6679656ba547a473cd75260b6813791d79fd2a4564195d19690"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 25, cognitive 44): render has cyclomatic complexity 25 and cognitive complexity 44; 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":"source/view.js"},"region":{"startLine":4508}}}],"partialFingerprints":{"codehealthFindingId/v1":"523125fb04418e1e497d1e70d4134f0218a70c6c48c56d3bf2a1d19ea16eb19f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 25, cognitive 43): constructor has cyclomatic complexity 25 and cognitive complexity 43; 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":"source/rknn.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d7464370924dca31d6c148c6b681a2973050a1cea3edf3e6005de32cca58fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 25, cognitive 42): constructor has cyclomatic complexity 25 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":2779}}}],"partialFingerprints":{"codehealthFindingId/v1":"903794164b757475bb53d3e47090dc7358486449636da96e5a4aa03c6ce7d38b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convertElement (cyclomatic 25, cognitive 41): convertElement has cyclomatic complexity 25 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":"source/mlir.js"},"region":{"startLine":6510}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d224eddcd4b17432afbed6c67d975208698d3c6148bd5b4e4ab47f03365daa9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCoIterateOp (cyclomatic 25, cognitive 38): parseCoIterateOp has cyclomatic complexity 25 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":20406}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3adfc4d3247e04d3ae64cda04abe88a87b5e7d446bc58b410507f0b437ca11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function LoadModelFromString (cyclomatic 25, cognitive 36): LoadModelFromString has cyclomatic complexity 25 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":"source/python.js"},"region":{"startLine":2998}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac70179ca02db21b2efa88c99ba7500bb11be2f113f20745a72d5366c2aed4be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferResultTypes (cyclomatic 25, cognitive 35): inferResultTypes has cyclomatic complexity 25 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":26483}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c51c102e7e70ff052516242b93d7bf95fff0edb3be66ede5194af5e6d464164"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 25, cognitive 32): constructor has cyclomatic complexity 25 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/torch.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fbb63330530c635108b02b146ed279c086304e78ecafda665567f2c692cf2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lexPrefixedIdentifier (cyclomatic 25, cognitive 31): lexPrefixedIdentifier has cyclomatic complexity 25 and cognitive complexity 31; 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":"source/mlir.js"},"region":{"startLine":2785}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e6cfb7e2ce86ce49d23ee3f67ddc698010c7265e3b6235e4400be0bb1583e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attr (cyclomatic 25, cognitive 31): attr has cyclomatic complexity 25 and cognitive complexity 31; 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":"source/python.js"},"region":{"startLine":15669}}}],"partialFingerprints":{"codehealthFindingId/v1":"60440231664dc56c77b903a6af8944a9bee682f4694fdc71979635958629c0f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expand (cyclomatic 25, cognitive 30): expand has cyclomatic complexity 25 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":"source/view.js"},"region":{"startLine":4122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd31a9fcc7882b825f742a40a778207d9768f15983c4450bf88ceed303f8904"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 25, cognitive 30): render has cyclomatic complexity 25 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":"source/view.js"},"region":{"startLine":4669}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d5084df6176efb341ecba36191a04e0fdb02eb78b935f1ba1b442f80ad9fc8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 25, cognitive 29): read has cyclomatic complexity 25 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":"source/hdf5.js"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2761b24b0328129a39222bf61ff372756ea6442c9ecbd2aef834989036bd208"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseAttribute (cyclomatic 25, cognitive 28): _parseAttribute has cyclomatic complexity 25 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx.js"},"region":{"startLine":2269}}}],"partialFingerprints":{"codehealthFindingId/v1":"517267a85cc4711fa3d994f85a569c1c4febe2e5772a9c0d1c4730932d62f7d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 25, cognitive 27): parseOperation has cyclomatic complexity 25 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":"source/mlir.js"},"region":{"startLine":10563}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acc384ba950decba30fffcf2ca041c3ad9e461ceb4fd1df77a0c82339b85e23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 25, cognitive 27): constructor has cyclomatic complexity 25 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":"source/mlnet.js"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fc72d1595e26f680a52b0fb14874e2fbf39d71523acdbb6a23ab460426fb09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 25, cognitive 22): constructor has cyclomatic complexity 25 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/uff.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0a1b01121dda8ea4d3c99d9eefe723a558e68b491fffa7f94b8f073760e112"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseTemplateArgList (cyclomatic 24, cognitive 100): _parseTemplateArgList has cyclomatic complexity 24 and cognitive complexity 100; 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":"tools/tablegen.js"},"region":{"startLine":3103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1103cc63c941c340aad8d7ae3103aefafe09b3b4d149b6f8f4ec2c3f4bdc40f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 24, cognitive 55): open has cyclomatic complexity 24 and cognitive complexity 55; 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":"source/protobuf.js"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"3917acf8e49b8e6dd918e2a034e73aa2ee266973a1169532c57ab37314954284"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getOperation (cyclomatic 24, cognitive 53): getOperation has cyclomatic complexity 24 and cognitive complexity 53; 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":"source/mlir.js"},"region":{"startLine":9096}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fe45bea5634a12e276dd4b6386f52c32ba3b728db97299e89a7532927ec760"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 24, cognitive 48): constructor has cyclomatic complexity 24 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mediapipe.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b17cf503d81a25d25a5acca2294337eadb8a67c99024af4984be92c3d8d3e0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findTarget (cyclomatic 24, cognitive 48): findTarget has cyclomatic complexity 24 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":2205}}}],"partialFingerprints":{"codehealthFindingId/v1":"54518fd90e73b5e1ae02fb82f147bb0d5b4e5b6f240ad98df8f956ffb74e6ee1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 24, cognitive 39): match has cyclomatic complexity 24 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/openvino.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5605a4e9dea581f938d8e0ac5f17afbc2048bbea1f9ecf87543adc74ccfe9ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 24, cognitive 38): constructor has cyclomatic complexity 24 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pickle.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c359428a5e867ce027f40c5b57e0754477c6e09e12a2f99b4438eb6f7eaee72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 24, cognitive 37): constructor has cyclomatic complexity 24 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":"source/tf.js"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9c3361abf789e7111eff28206ce01f75d1093213bb6aadcfd68e42751f4cff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 24, cognitive 14): match has cyclomatic complexity 24 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"de15b1d42cbc0ed4ff243809e3739e58ac10a2a405a91f3a863fa9338c12dc8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 23, cognitive 75): constructor has cyclomatic complexity 23 and cognitive complexity 75; 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":"source/om.js"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6cd6905d0922ed5301defbd5ba4858681b6590fa497e04a102e3e76946d35e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseForeachListValue (cyclomatic 23, cognitive 51): _parseForeachListValue has cyclomatic complexity 23 and cognitive complexity 51; 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":"tools/tablegen.js"},"region":{"startLine":2372}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5454e0616d149fa13e9d42704442b50346320f755a2a2fb2280a98b5b374f64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _buildStruct (cyclomatic 23, cognitive 50): _buildStruct has cyclomatic complexity 23 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/flatc.js"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"415314c825e07b71a4e80bb493856f971afd9cf092eba7d808892493a61b9ef5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 23, cognitive 44): read has cyclomatic complexity 23 and cognitive complexity 44; 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":"source/tengine.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d654425062b4114942be1bb49ee7e0e9841ea10ee0ac99c43bda89581d38941"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 23, cognitive 43): constructor has cyclomatic complexity 23 and cognitive complexity 43; 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":"source/espdl.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"941dc0d879a65ac4ad8f70193679e32ea094292a3aa398c1faaf87904e0eea63"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 23, cognitive 42): constructor has cyclomatic complexity 23 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":"source/mediapipe.js"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc7a0eb608e31bc2cf9e6ececa1d48fbc92a670e898e1b3145bfa9fc813d6d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseRecordBody (cyclomatic 23, cognitive 35): _parseRecordBody has cyclomatic complexity 23 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":3020}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31b24a51754b758202bbcd753e8a866b6ac6c5fb6173afe543129602db5536d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lexNumber (cyclomatic 23, cognitive 34): lexNumber has cyclomatic complexity 23 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":2660}}}],"partialFingerprints":{"codehealthFindingId/v1":"92001ae5ef58bf54b438a406ae24fde99089717b8a9d8092ca45f2837bb735e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 23, cognitive 32): match has cyclomatic complexity 23 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe2.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ba75391021324bba8fb73861e4f5dd4385b10e02829a0107a4ed7fdcb0f788"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 23, cognitive 30): start has cyclomatic complexity 23 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":"source/browser.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29292b69eeedb6996c0d6705ec01e8f50300fd7a961adc1fa6e1043c689a78d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 23, cognitive 30): constructor has cyclomatic complexity 23 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":"source/dnn.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae48d244494ae23fd1f0fee4e959e0933ed89d3a62cecb6b32346401fc11b4c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _number (cyclomatic 23, cognitive 28): _number has cyclomatic complexity 23 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/json.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d61e0d2328c7db695eaa5a1b0a19fa322e06fd4a902ed9f5152b4b8f2167f39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 23, cognitive 27): constructor has cyclomatic complexity 23 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":"source/cntk.js"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4ff27bb54d4012584699a1ecca6059f0c56a746bad964a8d7c8950b0b1c76b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseEnum (cyclomatic 23, cognitive 27): _parseEnum has cyclomatic complexity 23 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":"source/mlir.js"},"region":{"startLine":8222}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e006fc0d5c942ac6ea495874434ca0fe7e66d4c2d21870c047056a9ab178789"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function XGBoosterLoadModel (cyclomatic 23, cognitive 27): XGBoosterLoadModel has cyclomatic complexity 23 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":"source/python.js"},"region":{"startLine":4731}}}],"partialFingerprints":{"codehealthFindingId/v1":"657faf9d0fdeadb00280c9566dc0457e6ca56236e396691eacb5ee50fc46c519"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 18): (anonymous) has cyclomatic complexity 23 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":5372}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6441103bb53938f1d94246921293d23e828f734f98c9d9843e31897dd3c295"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _tokenize (cyclomatic 23, cognitive 14): _tokenize has cyclomatic complexity 23 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/flatc.js"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f1c4947fa5a01b70bd9739ad9c75718931cf618c1cf0bcdc1478926573e3b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 22, cognitive 65): parseOperation has cyclomatic complexity 22 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":"source/mlir.js"},"region":{"startLine":28814}}}],"partialFingerprints":{"codehealthFindingId/v1":"0893fe5c451c4fc5a035f8506d431b12debbcef19a1fdfef591ae47c5a16bd2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRegions (cyclomatic 22, cognitive 61): parseRegions has cyclomatic complexity 22 and cognitive complexity 61; 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":"source/mlir.js"},"region":{"startLine":7684}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39683ab9fb6bc6df6ef46e46c2b2ed5f6d5c374401566b48b5840101f019a10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function position (cyclomatic 22, cognitive 51): position has cyclomatic complexity 22 and cognitive complexity 51; 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":"source/dagre.js"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e7e8788f0e6fafeef5e805ee1eb8f8d712da71b7f313827cfae8d97f977618"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dict (cyclomatic 22, cognitive 47): dict has cyclomatic complexity 22 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/numpy.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"01707cd0bf41d4137a79e2badff5587e8d3428a5e8374ea7f370b2c40dc104e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 22, cognitive 44): constructor has cyclomatic complexity 22 and cognitive complexity 44; 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":"source/armnn.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"725e84d42751c7cbf67dcfa9171c77954127bbbaf3deb7f03ba31282234b0c8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 22, cognitive 44): open has cyclomatic complexity 22 and cognitive complexity 44; 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":"source/caffe2.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9ca27cf7a0efd5289cf350932c3cbdc9a89504aa2e777fde09977a08b833c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 22, cognitive 44): constructor has cyclomatic complexity 22 and cognitive complexity 44; 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":"source/dlc.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3e950015ba5461d8b2c53703487f0f22dc8bd8c614959814df71bde95d6d3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function subgraphOuterRefs (cyclomatic 22, cognitive 44): subgraphOuterRefs has cyclomatic complexity 22 and cognitive complexity 44; 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":"source/view.js"},"region":{"startLine":2076}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50497d3b8bb3dfa3c5111477134e3764b54e6ebe2f65bbb0bbfc7e07af2b008"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _params4 (cyclomatic 22, cognitive 43): _params4 has cyclomatic complexity 22 and cognitive complexity 43; 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":"source/dlc.js"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dba156b793cd0a862ebca378342d35d6f3d95765ac9d2b49201eff9fbe7b206"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseAttributeValue (cyclomatic 22, cognitive 41): _parseAttributeValue has cyclomatic complexity 22 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":"source/onnx.js"},"region":{"startLine":2340}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbadc34354239197c9c8f2860472121af4a1533e04181c9e58e15db776155fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 22, cognitive 40): parseOperation has cyclomatic complexity 22 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":20608}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a377e334f37e212e964fe666e7cbdfa0c886e4519760992a6eafae33f765a47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function build (cyclomatic 22, cognitive 36): build has cyclomatic complexity 22 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":"source/gguf.js"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e700507cc75c3c143086bb5781235600a356b99361b0621e7b506865e51ca57a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseGeneric (cyclomatic 22, cognitive 36): _parseGeneric has cyclomatic complexity 22 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":"source/mlir.js"},"region":{"startLine":8277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06fed93fa1a147520eb5c162943cdcb8162eeee4aab119ad5dcfc5100dc362e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 35): (anonymous) has cyclomatic complexity 22 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/cntk.js"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab964345ccbedac1601bb51972d0a03a86f283f56eca7e1156d689c7d2facb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 22, cognitive 35): constructor has cyclomatic complexity 22 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/uff.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d92ee082a91914729169ad731ed8bad14315a950e40922113eddfa9217aafc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDialectSymbolBody (cyclomatic 22, cognitive 31): parseDialectSymbolBody has cyclomatic complexity 22 and cognitive complexity 31; 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":"source/mlir.js"},"region":{"startLine":4275}}}],"partialFingerprints":{"codehealthFindingId/v1":"718788a17e8457fe5f69c63e2ac77ffce325d55128461b9bfebc15133ec9ecbb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deserialize_node (cyclomatic 22, cognitive 29): deserialize_node has cyclomatic complexity 22 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":"source/python.js"},"region":{"startLine":19972}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8ce2d8c22f44ee2bd2e558acad5da86e2a0f25deda5939a8707922e723ed2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inflateRaw (cyclomatic 22, cognitive 29): inflateRaw has cyclomatic complexity 22 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":"source/zip.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1de1a6a580fe31503a7ea6b7fcb1b8aed51e1003235cda21e64bd10d86d33c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getAttr (cyclomatic 22, cognitive 27): getAttr has cyclomatic complexity 22 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":"source/mlir.js"},"region":{"startLine":6485}}}],"partialFingerprints":{"codehealthFindingId/v1":"322517a8ba01eb2096c2a371c7d9a3a50a405c4a55cb9ee2f70dae309eda161a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openJson (cyclomatic 22, cognitive 27): openJson has cyclomatic complexity 22 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":"source/tf.js"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"f280d47f24905bb4988544acc08c8134fd0385194998750fb6e6812c52ed0ba5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 22, cognitive 24): decodeJson has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2265513e21540cafe20353bcf5e8761f8ec7645abf1c64b5aa3024dd910fa3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scrollTo (cyclomatic 22, cognitive 24): scrollTo has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":2701}}}],"partialFingerprints":{"codehealthFindingId/v1":"43eee95d60eb8aa41e81fdc3eb13025ecd4bb1f929ee3fab08910e320f6d075c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printAffineExprInternal (cyclomatic 22, cognitive 23): printAffineExprInternal has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b5e6f2acd04fbdd6ea2958b418e7f684d4ea5353b691d794056459ea4bad1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMmaProperties (cyclomatic 22, cognitive 20): parseMmaProperties has cyclomatic complexity 22 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":21211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3671aa34e27377076467079bdb788ddd24d5be8a0fdf70941ade07bf9b8f419"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function categories (cyclomatic 22, cognitive 14): categories has cyclomatic complexity 22 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tosa-script.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edd2644fb069bbc22db1a40c5993b13b30179afb38b188c19d67d735ea854b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 21, cognitive 58): constructor has cyclomatic complexity 21 and cognitive complexity 58; 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":"source/tf.js"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"5757bf1205ab35883ae7f6b66058939970794811ce75d27ea79557b80dc4dece"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function metrics (cyclomatic 21, cognitive 56): metrics has cyclomatic complexity 21 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":6606}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff932828aa54994f87323e33eee2b15c7b336787723303604d51a1c10354007"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 21, cognitive 50): open has cyclomatic complexity 21 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50797f56bd598a5ef24e8750d82521a0bd5d8223c186835de6f98d72b3f0fb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function value (cyclomatic 21, cognitive 49): value has cyclomatic complexity 21 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":1730}}}],"partialFingerprints":{"codehealthFindingId/v1":"138d5ec241db174a8d498ac007d183a2c29e4498048af7c62f82f9a9305e1f4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCommonStructuredOpParts (cyclomatic 21, cognitive 46): parseCommonStructuredOpParts has cyclomatic complexity 21 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":16164}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ffa257d09c8bef8f833899a8a20ae7c613190936f14e2d65c1e2fbe8fad947"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseArguments (cyclomatic 21, cognitive 44): _parseArguments has cyclomatic complexity 21 and cognitive complexity 44; 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":"source/python.js"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f67773c4ecc075c2d5f82fe6cc43e42bb2e739e3ccb65ddbf64f485b1fb6ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 21, cognitive 37): open has cyclomatic complexity 21 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":"source/view.js"},"region":{"startLine":7335}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f7a714ac7786f262821356e08b37beef0510bb5fae18949657b6d0fdcb9992"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseLiteral (cyclomatic 21, cognitive 35): _parseLiteral has cyclomatic complexity 21 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx.js"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7caadf130ee8be0d733fec741beec84ef0e06bf49a1ae79a582a271444b57b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mark (cyclomatic 21, cognitive 35): mark has cyclomatic complexity 21 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":6836}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c0401b28a0b743f03bf02e71be8c65299375b11845cd92b64eb58277b573ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 21, cognitive 34): constructor has cyclomatic complexity 21 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/kann.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ac876b269c616c48928e9cf7f5de9567d6298b9f1be8389140fb7a22239941"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 21, cognitive 32): constructor has cyclomatic complexity 21 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/acuity.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecf7fa6f312273ecc986b48698e3aa8339f9eabea893aa978b5684bb7e56468"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 21, cognitive 32): open has cyclomatic complexity 21 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tosa.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0a028e900cbce7d3e17ed6364dee2abd08614043d10399ec5be2f3251b5a1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 21, cognitive 31): open has cyclomatic complexity 21 and cognitive complexity 31; 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":"source/ncnn.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7b9423df27b110c203f5d552459aebe08c67ba44579621c0f28681fcb86eb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 21, cognitive 30): constructor has cyclomatic complexity 21 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":"source/message.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae630f9332f8c9d33b5dc53c30175c8e56a23b98989fa83deb8fe4566b703fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 21, cognitive 29): read has cyclomatic complexity 21 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":"source/darknet.js"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"467b0794de0809f8df3bf588c55b7b1c8108f1335ef243256e7f06bdceeed85d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 21, cognitive 28): start has cyclomatic complexity 21 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/base.js"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab6e79020b2597a1b3bf4eacb7458a793e1749cc5f6db3913c58da836103492"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 21, cognitive 26): constructor has cyclomatic complexity 21 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/qnn.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b566323fb97defb6405ba1c028e341aa4f4867c001971af07a5e7f49f60c4da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 21, cognitive 22): decodeJson has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx-proto.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac25b1be3ce18a3342b8e92fd0f5354b2d21dafa98b57b81754837b2a045877"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 21, cognitive 18): constructor has cyclomatic complexity 21 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/hailo.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad411160ad3510c650676f9a03cab2381b3eb80c7bf5e7220a31843fedeac0fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseTensor (cyclomatic 21, cognitive 12): _parseTensor has cyclomatic complexity 21 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx.js"},"region":{"startLine":2465}}}],"partialFingerprints":{"codehealthFindingId/v1":"84aa4654fe8fa3689dcd16cd248b29180cbd4a9325a60cbe05e343c9b49975af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 20, cognitive 50): main has cyclomatic complexity 20 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/mslite-script.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d4e789cb09f66876f6560c61b6a6d962dd5ad896d42e2d3188b02c9672e2d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildLayerGraph (cyclomatic 20, cognitive 49): buildLayerGraph has cyclomatic complexity 20 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dagre.js"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fc4c375a96293f619951b006d2eb5af01f1225829a77f283f2789cbe0c3edc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLLVMCallOp (cyclomatic 20, cognitive 48): parseLLVMCallOp has cyclomatic complexity 20 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":23056}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd440b7e9aab72306480ec73b893766149893e7bb1fe9c452b0c240500d504d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 20, cognitive 46): open has cyclomatic complexity 20 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/flatbuffers.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"87637020aab5651547b8033c7e89e9a15878284322006a89247436bf7917e183"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tags (cyclomatic 20, cognitive 45): tags has cyclomatic complexity 20 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":"source/view.js"},"region":{"startLine":7106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5067c50341fd46d0f70094efb89bd284897c7aa45b92729fb9a0d50cfb1c4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeMessage (cyclomatic 20, cognitive 44): decodeMessage has cyclomatic complexity 20 and cognitive complexity 44; 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":"source/protobuf.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"90deeca678d703d277e9e2a96d5327c696367ffefb013ac1fbd0fabccef99897"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 20, cognitive 43): main has cyclomatic complexity 20 and cognitive complexity 43; 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":"tools/espdl-script.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c0ef2c8fbd7cc31c94b2620799f67a1f645e1d467cfeb6ea4f1d9dd3dd6fc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseReduceOp (cyclomatic 20, cognitive 41): parseReduceOp has cyclomatic complexity 20 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":"source/mlir.js"},"region":{"startLine":11499}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f27f9924abb89b2bcd533f1f5b050f13e2473c134d04ce5d5dde14d8ae72da0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 20, cognitive 38): constructor has cyclomatic complexity 20 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/hdf5.js"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"f371f6bc4a5ac1f616c3a7c23cd71a0c09658abb4c077b6ec4ddaceea09aa73b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _update (cyclomatic 20, cognitive 36): _update has cyclomatic complexity 20 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":"source/view.js"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27a1a32370c9178d83231ec3e1d440ba3bac23e95eee0a9eb177f9e8cff7f0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseListArgument (cyclomatic 20, cognitive 33): parseListArgument has cyclomatic complexity 20 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":"source/mlir.js"},"region":{"startLine":8368}}}],"partialFingerprints":{"codehealthFindingId/v1":"8085b08a79d0072e223500aced52cd9d6d12389a6aa09ce6c0d5873732227131"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitIsInstance (cyclomatic 20, cognitive 32): emitIsInstance has cyclomatic complexity 20 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":16882}}}],"partialFingerprints":{"codehealthFindingId/v1":"1702e806aef1ee8b43d946e386fe0ac918562a2c23741507e49ff7286f43b006"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lexString (cyclomatic 20, cognitive 29): lexString has cyclomatic complexity 20 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":"source/mlir.js"},"region":{"startLine":2702}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e34e1b2bc728bb6a4fc8a95cfa0a615ec64ffcdfe20a0ade8cfb5b57248218"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _processingInstruction (cyclomatic 20, cognitive 29): _processingInstruction has cyclomatic complexity 20 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":"source/xml.js"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a07ef68942246f33bb41a53472d9c27b49baa5ded164abcef31645a9f985835"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function map (cyclomatic 20, cognitive 28): map has cyclomatic complexity 20 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/circle.js"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4991a245930cd59dd8eac18a35f7ae45e02fc28d7775a20cdf2d6dc7b074dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function map (cyclomatic 20, cognitive 28): map has cyclomatic complexity 20 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tflite.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"84741a9ce01c9b5ac4f96e873c3803b174a98bcd305e4117d12814da200ed4f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitListLiteral (cyclomatic 20, cognitive 24): emitListLiteral has cyclomatic complexity 20 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":17744}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c42925dba277351ef5b5e73cd48fe4de955ef62c78f880682ba046f0cd57ae9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __str__ (cyclomatic 20, cognitive 23): __str__ has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":6483}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0747f20071f7e0d88c2838352d593963bbd070fad0179c31af7319534f4458"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _next (cyclomatic 20, cognitive 23): _next has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/xml.js"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"733409ad35c2993166d2450f2405ce98119df9bb259d9b1ad1222684efd2f726"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 20, cognitive 22): constructor has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/rknn.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"560c1a2b6517c2e3d0fe4f84b4976b1c71cdcee1be343b0728434d2396e52e72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 20, cognitive 21): constructor has cyclomatic complexity 20 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":"source/lasagne.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac92674f56a38669fc433103c0ee3bf802ca69b8d7ad89b6132456ac4afa84a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitSimpleExpr (cyclomatic 20, cognitive 21): emitSimpleExpr has cyclomatic complexity 20 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":"source/python.js"},"region":{"startLine":17552}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4a6bdbf6087c23f08f243e75616b39032decf6990b80ed1d8a226ca6427ab5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function map (cyclomatic 20, cognitive 20): map has cyclomatic complexity 20 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/executorch.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f435be58b2f58e93842f68e854d4c9489e6a1613640c428b44f5525dd147cbb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 20, cognitive 20): decodeJson has cyclomatic complexity 20 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":8791}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a1a0655d631b26caddf8bed54937345a9454d6fa996f9d8bd8cfbaba4e5882"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function typed (cyclomatic 20, cognitive 17): typed has cyclomatic complexity 20 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":4570}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed10d9e767c72a74092c113a22e7a0681a5ac513b742424186b8f8effbad9a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function encode (cyclomatic 20, cognitive 17): encode has cyclomatic complexity 20 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":5615}}}],"partialFingerprints":{"codehealthFindingId/v1":"9955173f14a27c097e08ae1c84d34015e7de2cca38d2978787e4f7418c6c62f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function featureType (cyclomatic 20, cognitive 12): featureType has cyclomatic complexity 20 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2eec29936b35fe999c603e059884d30b2fe2b35bb46126872f057e4139fd85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 20, cognitive 12): match has cyclomatic complexity 20 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/uff.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5175f79779aaf599156cfcfcf5d3cc76285d277282175e02c95e6f0edebf60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 19, cognitive 58): constructor has cyclomatic complexity 19 and cognitive complexity 58; 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":"source/zip.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d83f9e6361e692033fde1c4c75b4977bc4c0f6b341eb041baa02eeb1329d01a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 19, cognitive 47): main has cyclomatic complexity 19 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/circle-script.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b29c9efe92f241fab3d75d33789aee0d793e30a1be18c4c50871e558d7fd5e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 19, cognitive 47): main has cyclomatic complexity 19 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tflite-script.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e4ae346d329b8d66516f96d347f0a4e5978be91233f7faf5f929b183053a01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDynamicIndexList (cyclomatic 19, cognitive 46): parseDynamicIndexList has cyclomatic complexity 19 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":10740}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd62228340c62a1f8cac20637569b761273efa4047f4e2780bf30e2267833c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 19, cognitive 46): parseOperation has cyclomatic complexity 19 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":28075}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bb8e8989170e0d51ff22f3e0b5f9dad5e9d96a72bdb557d985768ef9020040"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 19, cognitive 41): constructor has cyclomatic complexity 19 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":"source/ncnn.js"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"570dc5fc24ca8aad9873e247f6a9845c60aaaada8547e64245fcec9c94609ad5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getValueAsDef (cyclomatic 19, cognitive 39): getValueAsDef has cyclomatic complexity 19 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"583b7517774e068527226480d0ed4ae9ff169ebdd79a067e7a713a312913724a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addSubClass (cyclomatic 19, cognitive 35): addSubClass has cyclomatic complexity 19 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"900e0d39fb08f4764c03df8c91f69241a194402a6c538bad32cb639a08aa94c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openProgram (cyclomatic 19, cognitive 34): openProgram has cyclomatic complexity 19 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ce1af0bed8042876e8c124aa2c5f4edce006927239e538652480ac4888ce23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function op (cyclomatic 19, cognitive 31): op has cyclomatic complexity 19 and cognitive complexity 31; 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":"source/paddle.js"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abfa0514f24eea30cabcd0c320b5d46cadff8e6feec28434ec8c936b76d028b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 19, cognitive 30): open has cyclomatic complexity 19 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":"source/pytorch.js"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"83856dc6536e69d0286c2803c001950d502e366d7335d4f42951471f48273814"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBlock (cyclomatic 19, cognitive 29): parseBlock has cyclomatic complexity 19 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":"source/mlir.js"},"region":{"startLine":5319}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd17da4e96278d1cc4049cc2279548faa122f0efbfa16fc753e8d0086be45bc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapTypeToAliasTypeSetImpl (cyclomatic 19, cognitive 28): mapTypeToAliasTypeSetImpl has cyclomatic complexity 19 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":7502}}}],"partialFingerprints":{"codehealthFindingId/v1":"3919a2c45d7c2e99575934cfc4a8ad66e6c26c568415a2c8b241762288e78799"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 26): (anonymous) has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe2.js"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"836cd1f9f029d67a856a232d49a47253d900e37608e98ef9947ae0ed1da6b26b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getInsertExtractValueElementType (cyclomatic 19, cognitive 26): getInsertExtractValueElementType has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":22500}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba86823d0582160076b27da1677a7de7c5baba76ad6b3f738016268df17a29b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function str (cyclomatic 19, cognitive 26): str has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":11789}}}],"partialFingerprints":{"codehealthFindingId/v1":"c611eb1696df46f28ed65d25bb4fc49b6369663b1b97b00fb3b1075bb4aa31b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 19, cognitive 25): parseOperation has cyclomatic complexity 19 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":12708}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe9fe8843859a4fa99ec64452481c2a489e3ef57c8635b44bb0aed28f8c23f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePropertiesFromKeyValueList (cyclomatic 19, cognitive 24): parsePropertiesFromKeyValueList has cyclomatic complexity 19 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":9602}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed14f3986af5ddb05bcd4a8a5457c3461a9881a845bccff37672fab82076d2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLLVMLoadOp (cyclomatic 19, cognitive 24): parseLLVMLoadOp has cyclomatic complexity 19 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":22757}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a10ab3b0f4dd61e55298862bddc1d34e601db428d5427652d18121266e08afe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 19, cognitive 20): open has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"352490a133956befa96dc7eb5614da6537040ea210cdb6b720b02c6c5b987cd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deserialize_graph (cyclomatic 19, cognitive 18): deserialize_graph has cyclomatic complexity 19 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":19897}}}],"partialFingerprints":{"codehealthFindingId/v1":"384a6ab0c13f69c359c5afb26b5162dbf7e91db1195e45a6be466f03e0e5f70a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 19, cognitive 18): decodeJson has cyclomatic complexity 19 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":8073}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9092c99bf2a656ad6702852d1dcbe4ad9da049dd68d77a9683db7647c2257b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 19, cognitive 16): match has cyclomatic complexity 19 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7310bef4b57b3ca315ba5934c8487e6b4a70ac8df09cdced2b161f4808d05b9e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getAttr (cyclomatic 19, cognitive 13): getAttr has cyclomatic complexity 19 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a82b6a46c1d9272d2b3a767c34d64440e380bad0812523afc7a4fc1dff3031"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function equals (cyclomatic 19, cognitive 11): equals has cyclomatic complexity 19 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":13435}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a93a43cf09dc278a907fdfe17bbe6ebdc3298863458db0638ea244f9bb166c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildBlockGraph (cyclomatic 18, cognitive 59): buildBlockGraph has cyclomatic complexity 18 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":"source/dagre.js"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadd817278cb5938f5442c56699dca5f7abe710812bdb5e5e5510e1d09df4628"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function data (cyclomatic 18, cognitive 57): data has cyclomatic complexity 18 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":"source/hdf5.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1fda9be00438b86a95f4f33f0e07db5ce6da7b9f930a5a1587c4ec4fc60771"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decode (cyclomatic 18, cognitive 56): decode has cyclomatic complexity 18 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/protobuf.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"932d49f6582ed1cdcb501e90d4faa5bbd5afefc9db631e0f8ccbf4d6263b03e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 18, cognitive 42): main has cyclomatic complexity 18 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":"tools/megengine-script.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87aa4ef0338cdb2be2b06c27b4b5f6bc81e8be695c457f6a7ad288cf73c24b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 18, cognitive 39): parseOperation has cyclomatic complexity 18 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":19856}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4c9598a3c4731623b929727d1e7557e8a60b0ae47b485931e887515e888913"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 18, cognitive 39): parseOperation has cyclomatic complexity 18 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":27458}}}],"partialFingerprints":{"codehealthFindingId/v1":"44795e45eaff9ebb6368b8d818210b9fa8da0e7bdbfe2fb75e3adb030a189519"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tick (cyclomatic 18, cognitive 39): tick has cyclomatic complexity 18 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"999fe467b577dcbf10191b129b8243b14401550c55503479df3c000aeeb6089c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _evaluateSimpleExpr (cyclomatic 18, cognitive 35): _evaluateSimpleExpr has cyclomatic complexity 18 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":2757}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b79353e51553a141d5be699dd6d062b8d00592c5bfea3f6deea76a158c295c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenize (cyclomatic 18, cognitive 33): tokenize has cyclomatic complexity 18 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":"source/mlir.js"},"region":{"startLine":8104}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8fec363660f4801e136ffa5eb7fedfdc6aa5fd40c96c3c4fab6eb22650c6d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSwitchOpCases (cyclomatic 18, cognitive 32): parseSwitchOpCases has cyclomatic complexity 18 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":17828}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf43a4c9aa3b0f680308a8d5001f01bec9d27c6fc21e825446e2b60415647cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSwitchOpCases (cyclomatic 18, cognitive 32): parseSwitchOpCases has cyclomatic complexity 18 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":18765}}}],"partialFingerprints":{"codehealthFindingId/v1":"e299bbc9b80e9ba5c74e563ffd57269eeeb3039f469a4bdc175d72a04239bd33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 18, cognitive 29): read has cyclomatic complexity 18 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":"source/executorch.js"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e842b6a9b4f3a80c43adc32a63d32b6470424af2002afdcf75f6e349d7553e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTokens (cyclomatic 18, cognitive 29): parseTokens has cyclomatic complexity 18 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":"source/mlir.js"},"region":{"startLine":8161}}}],"partialFingerprints":{"codehealthFindingId/v1":"33110117df7508cbfe04e1f949281ef67ebfdcdaf460d4a3553221ac4270177a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function process_node (cyclomatic 18, cognitive 28): process_node has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/keras.js"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"e318b1b7c2d3ae87606e52d3dd43f05ee8ff910e1063c27386841bb7e395cee7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 28): (anonymous) has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":16241}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba6635aa406702b9cb9e1ac9fe62759fa08f28c8254a7519977bb285e760a76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 18, cognitive 28): constructor has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":3951}}}],"partialFingerprints":{"codehealthFindingId/v1":"09aa2b104c0dbdf390809570174d17a4ded486bb9329731e66710c9497a97922"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseIterateOp (cyclomatic 18, cognitive 26): parseIterateOp has cyclomatic complexity 18 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":20338}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cbf2da9826544628b62d097d3d0b6594a09e3b37c02b2a08aecec5265902f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 18, cognitive 26): parseOperation has cyclomatic complexity 18 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":21100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6add1b453c6f4bbf8dd4b42d49cc3dec596ba4bd306a62b6ea7b2957882ea058"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function node (cyclomatic 18, cognitive 24): node has cyclomatic complexity 18 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b5f4ed35bc8afbce9fa38f539b0faca540a932434098f6e14d4a1402f162d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function print (cyclomatic 18, cognitive 24): print has cyclomatic complexity 18 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":13086}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d758f45a2220ea25084af0450fc35991239c55eb03fdc7951071e952a2ba443"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 18, cognitive 23): constructor has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tosa.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6039650197f8f58b304bdf17c4e4f9411b40a9e22323ee550d3bf63d0c4ad1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkValueIsAttr (cyclomatic 18, cognitive 23): checkValueIsAttr has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/mlir-script.js"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ac1bfd4d1b1d03f04727c3d48274130ddb98b39135e0fe585b568bf24db72a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _instantiateMulticlass (cyclomatic 18, cognitive 23): _instantiateMulticlass has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"73179ce4cda0d8f58200823bc1790d79d9f260913bb8344a1756f236789d0227"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function call (cyclomatic 18, cognitive 22): call has cyclomatic complexity 18 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":22010}}}],"partialFingerprints":{"codehealthFindingId/v1":"890b4657aa2d1338a46b987659ffdcae80e30d7d07af10cdcad6f2ed3e475fe4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 18, cognitive 21): parseOperation 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":"source/mlir.js"},"region":{"startLine":12092}}}],"partialFingerprints":{"codehealthFindingId/v1":"04002c4f49e86a4104e69bb494f5176f5b3988472f9910b37c21d43831793aea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 20): (anonymous) has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":6990}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2510eea64f1a7cdfc7bc1821f1b742ede711cb90e4320cc28d673b94b9ab2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 18, cognitive 19): decodeJson has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx-proto.js"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"4974a25d91ec3e00969ffdc3e115c66534b059f011b74dad071bb41506c70f25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 18, cognitive 18): decodeJson has cyclomatic complexity 18 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":"source/tf-proto.js"},"region":{"startLine":4884}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e188d91d7bbba82fd2d5a1b0041f80271e719ebadc4caca6f39bc769bc10ca1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 18, cognitive 18): read has cyclomatic complexity 18 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":"source/view.js"},"region":{"startLine":7028}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d6277a0978d61026869e79316f2a5d75c9983374f8f8306440d82b44a29fd0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function map (cyclomatic 18, cognitive 17): map has cyclomatic complexity 18 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/openvino.js"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca08426415568906ea942fd1c6fb17df36cb445ac70cdac5d0a5e38cb241bb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 18, cognitive 17): decodeJson has cyclomatic complexity 18 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":11090}}}],"partialFingerprints":{"codehealthFindingId/v1":"233a272ef403d241e721751f773d94862d7f6409a7d805bbd93e29c91f0d6ad3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDispatchEntryPoints (cyclomatic 17, cognitive 43): parseDispatchEntryPoints has cyclomatic complexity 17 and cognitive complexity 43; 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":"source/mlir.js"},"region":{"startLine":13474}}}],"partialFingerprints":{"codehealthFindingId/v1":"db94e77b909d1438fed4993816a0e9f18ee056b1613d25a6422b32577cc5f454"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openShards (cyclomatic 17, cognitive 42): openShards 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":"source/tf.js"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"948c0e371f0016e170fafb2fe100881ac5258ccfa1d77c95658faf8557457323"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseBlock (cyclomatic 17, cognitive 40): _parseBlock has cyclomatic complexity 17 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dot.js"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28af94029af4a26a3c2c825bc4bb68681d37efd75d464237284feace4deca98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSwitchOpCases (cyclomatic 17, cognitive 38): parseSwitchOpCases has cyclomatic complexity 17 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":22630}}}],"partialFingerprints":{"codehealthFindingId/v1":"25696314d6f859c1b38173e84ab4397aed79f0800ecea029e721bc9992c1c701"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _value (cyclomatic 17, cognitive 35): _value has cyclomatic complexity 17 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":4920}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe800d2f8d3b8e4ecf79fb3919af5269bf50d8f42fb5a8e6a4a61a17ea823c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePackedOrDynamicIndexList (cyclomatic 17, cognitive 31): parsePackedOrDynamicIndexList has cyclomatic complexity 17 and cognitive complexity 31; 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":"source/mlir.js"},"region":{"startLine":25748}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3977774be68e65603794227a9a3b13316be85b831945c722864261de50a5f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateClassifierOutput (cyclomatic 17, cognitive 27): updateClassifierOutput has cyclomatic complexity 17 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":"source/coreml.js"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e9859b41d4b1a0e26dff856fc574540313e535761a7015524db5d41a5aa34b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _skipType (cyclomatic 17, cognitive 27): _skipType has cyclomatic complexity 17 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":"source/protobuf.js"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12881d45da0c21eb17fde166247926c41682c91046769a759658dc1b356e4c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function update (cyclomatic 17, cognitive 27): update has cyclomatic complexity 17 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":"source/view.js"},"region":{"startLine":3556}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecbcff48ad3ae0e8e70ef9f711343e4cc72639af811e21653db1f3812b4830d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generate (cyclomatic 17, cognitive 26): generate has cyclomatic complexity 17 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/gguf-script.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d306507a1a4720eef78a073b102dd65cb2fde5c76385945c9601016acc37f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseModel (cyclomatic 17, cognitive 25): _parseModel has cyclomatic complexity 17 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":"source/onnx.js"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1e184d503af3cb47a27d6def39dd6afb78d0cb26dd11b2e826b4e2b813d9bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _stringify (cyclomatic 17, cognitive 24): _stringify has cyclomatic complexity 17 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/base.js"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f821206d9781a586df5b91b9058b0210b875d71e032362780dd40563c49a6142"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseGangClause (cyclomatic 17, cognitive 24): parseGangClause has cyclomatic complexity 17 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":27868}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac079e2f463dfa7b29942586264a3f19042abd61c60d4706036b6e03e0a830a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _buildDecodeFunction (cyclomatic 17, cognitive 23): _buildDecodeFunction has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/protoc.js"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda42a913ca728cf737cde4ff53035cc18661cf5603996a1512c190dcbe428d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function update (cyclomatic 17, cognitive 22): update has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.js"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90c140411b8cd794d0d07c80b01c11a77d8d2bf2ab6404ae7e4d63dbc9f30be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 17, cognitive 22): constructor has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba56985bccb49c175f5227bc339d83a295985fc93fab4244324bf49d17103e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _model4 (cyclomatic 17, cognitive 21): _model4 has cyclomatic complexity 17 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":"source/dlc.js"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"29478d286f3ab59896293d1f290ab5ba7c2b81a7bd1e4be3e35e922cd412cf3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function LEGACY_convertModule (cyclomatic 17, cognitive 21): LEGACY_convertModule has cyclomatic complexity 17 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":"source/python.js"},"region":{"startLine":14267}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabc3b80f24f6d9a26e627b4d1136a756f617e3f3d5774fee3f17c78058384c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function signature (cyclomatic 17, cognitive 21): signature has cyclomatic complexity 17 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":"source/rknn.js"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"4410616d2099f3a53f1892f19012d15d2a9a63f7a7922a04fb1bbe4a6e20937d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 17, cognitive 20): constructor has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dl4j.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"30be8f38e076a38606b1380ffac8a263512dfeb0daf39a6cbd8b8ab45f731901"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgumentTokens (cyclomatic 17, cognitive 20): parseArgumentTokens has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":8335}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0914f30accf2b684cf2647ee9f33bbe494eb50201ca281b13612c1b62f58275"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 17, cognitive 19): decodeJson has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch-proto.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"66eabe6dc738f4032e995cbf8ffc1d4cba40c8530ce0bc9daa050a7dab86ff30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unpack (cyclomatic 17, cognitive 17): unpack has cyclomatic complexity 17 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":"source/pytorch.js"},"region":{"startLine":2061}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c14ac2f2e7f2af32a16d173990a24bc11f855d5dffd5d749796c548840f0bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 17, cognitive 17): decodeJson has cyclomatic complexity 17 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":"source/tf-proto.js"},"region":{"startLine":3740}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5947eda4ef5f75f0a9db9d2591dd82a5552aef69b9989e436e06500cf2f108"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 17, cognitive 16): constructor has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/browser.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13e9ba02854a8e707c89970aedb673e3efd51bcb349025e1c9d4441e210af08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 17, cognitive 16): decodeJson has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":10379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2124d6d16ed9b1c3d92241cb6e9420aca71e1544a5730816c569b6063c27aee8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isObject (cyclomatic 17, cognitive 13): isObject has cyclomatic complexity 17 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":2908}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e820d768aede317c94f618da7687c87b22d4d1ba702c2dd53097c8b03a0158"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseReplicateOp (cyclomatic 16, cognitive 49): parseReplicateOp has cyclomatic complexity 16 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":23973}}}],"partialFingerprints":{"codehealthFindingId/v1":"4875b80ce75c9fc754b48609a28db6268068275ab971a0159c9254ab1a5e321b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _uint32 (cyclomatic 16, cognitive 45): _uint32 has cyclomatic complexity 16 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":"source/protobuf.js"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1841207a4bd1e655db5dafa72b1904d4373752c2fc1afdbd642164e1f19725"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseSuite (cyclomatic 16, cognitive 35): _parseSuite has cyclomatic complexity 16 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2bac67e1f634e9e41a7f8c52c268fd4bb50e3eb66b800220309d30985d6d6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 16, cognitive 31): parseOperation has cyclomatic complexity 16 and cognitive complexity 31; 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":"source/mlir.js"},"region":{"startLine":16768}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb79b8d6fdb05a785ed4320f409953bba8ce3e52f7d8cb138e6bf6b2f6aa7c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function define (cyclomatic 16, cognitive 30): define has cyclomatic complexity 16 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":"source/python.js"},"region":{"startLine":18039}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c769fa312c1488bb285bde3a4e889b46d813731db2c29a965ba2968f2322b8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 16, cognitive 28): constructor has cyclomatic complexity 16 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/hdf5.js"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ed0136ba419ee0a3563969dd0d5bb8784a687a99cb36858f5047f9f1d6b74c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseNameOrFileLineColRange (cyclomatic 16, cognitive 28): parseNameOrFileLineColRange has cyclomatic complexity 16 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":3156}}}],"partialFingerprints":{"codehealthFindingId/v1":"121010a83d91c65be01b0fa7e34fe9cfda1ab254fa074c728d86e3f86e8d5ee6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 16, cognitive 28): parseOperation has cyclomatic complexity 16 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":17125}}}],"partialFingerprints":{"codehealthFindingId/v1":"42594cfb6760e556a88c980aa786875775038f24ce6771360e674a99d6ec1ace"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function build (cyclomatic 16, cognitive 28): build has cyclomatic complexity 16 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":3199}}}],"partialFingerprints":{"codehealthFindingId/v1":"78446b979809c28bc3c8622dd7e72044d02d34d7beb243d445279a332f61c502"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePackOp (cyclomatic 16, cognitive 27): parsePackOp has cyclomatic complexity 16 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":"source/mlir.js"},"region":{"startLine":16344}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f52d9c94249094acc3f25bfab6b9c9d232453a18c95cda29f36dc65325343a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _updateMenu (cyclomatic 16, cognitive 26): _updateMenu has cyclomatic complexity 16 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/app.js"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d53b406d2a9a2358e19b2832e75d15f883c480bf752f847afc2b010840dab2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 16, cognitive 25): constructor has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/executorch.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"131853913060977b9b63f61f61751a31db11d081aa39705df4b99f2c9d93b873"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 16, cognitive 25): parseOperation has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":12507}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd18779cffdacc96e7f808deb1933ca2744f94eb49fd63a52e0e1313a13f1f4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 16, cognitive 25): constructor has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b237ae10486c1dc374c6d0080d8f380975b1ccfdd2b2299ce71198d9d9c8d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 16, cognitive 25): match has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tnn.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4922314e90461a409d5855149917196cb24376ab536f938a21b5e3d791938d59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveBlock (cyclomatic 16, cognitive 23): resolveBlock has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/gguf.js"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93545987e6254348c0a4efb9fbb1f329c33b44ac1efe2b6c186dee23ea8e627"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _resolveMulticlassForeach (cyclomatic 16, cognitive 23): _resolveMulticlassForeach has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":2011}}}],"partialFingerprints":{"codehealthFindingId/v1":"777b578e2c9202d90ad0d999e573b1e9625274c64c10e2a10dde5b593bbaa6ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _resolveForeachLoop (cyclomatic 16, cognitive 23): _resolveForeachLoop has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":2688}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edf023556ddf8cba67b90e8e054ae1ebefbf7795fee9b79cdc7aa03675ac554"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 16, cognitive 22): read has cyclomatic complexity 16 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":7190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f45ad20513cbc4b7607f717d529126db72a4e0f88cf964b48a01862085f95e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseExecuteOpCommon (cyclomatic 16, cognitive 20): parseExecuteOpCommon has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":24634}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa4f288e5d3a2ca29ca1a4f653e29b990fd6cc1afbdb05b24f3cfeba52e2e69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layout (cyclomatic 16, cognitive 18): layout has cyclomatic complexity 16 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":"source/dagre.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9b29b3402d13a462e1f44e99f13979a0af413db79554679a325d85131a61ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 16, cognitive 17): constructor has cyclomatic complexity 16 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":"source/sklearn.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf385cf31e07b04d21f1039424b83406342ba959389f6bd78180508f4eccf05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 16, cognitive 17): render has cyclomatic complexity 16 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":"source/view.js"},"region":{"startLine":4610}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f2d9b81f8e72e63041cff50e1be4b4ca8fe32a1468c179cdd4c6e7d8017ed1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 15): (anonymous) has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":10189}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafc732f233499b3a6411cd5e10372228c601793ab71d1517601d5fb76098dd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transformExits (cyclomatic 16, cognitive 15): transformExits has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":18659}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2a3618c54ab4985b41a7b0140aeef9155cde653d5eaa23b6a59e0fa33ff49d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function map (cyclomatic 16, cognitive 15): map has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.js"},"region":{"startLine":2426}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ccfe9282ff2d05af5dd1b3f404f5c81e4fb55f7fef1dd8d008be0308a9c5c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseFile (cyclomatic 16, cognitive 15): _parseFile has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2bb3fad28d42130226de91d6312d0910a40e757141512a29d7363160e9d8cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 16, cognitive 14): match has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94cc796cd3700d11665ace135f6512bbef79adf71097f0034b81f30f66785ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectRegions (cyclomatic 15, cognitive 52): collectRegions has cyclomatic complexity 15 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"1306ba98c5e9b5933cd8cf51d69b46b043fe28e83edeb313b1671cb1cdbf3dab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFlowFuncOp (cyclomatic 15, cognitive 50): parseFlowFuncOp has cyclomatic complexity 15 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":14853}}}],"partialFingerprints":{"codehealthFindingId/v1":"07577545e1fb41df245c370beb17a1f9ca4e5865e9c61f7a1497668adc7fa497"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseIndirectBrOpSucessors (cyclomatic 15, cognitive 50): parseIndirectBrOpSucessors has cyclomatic complexity 15 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":22996}}}],"partialFingerprints":{"codehealthFindingId/v1":"2262354a69ee8cf0bb2a73edc9a443357be0da00ff0c8b75a208052817c1ab5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findType1Conflicts (cyclomatic 15, cognitive 48): findType1Conflicts has cyclomatic complexity 15 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dagre.js"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"61eead51443282ad010e5339cc017322cca0a495b2af52e7c1f6f027935880f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parse (cyclomatic 15, cognitive 47): _parse has cyclomatic complexity 15 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":6426}}}],"partialFingerprints":{"codehealthFindingId/v1":"f766d0b1f694b293a4143e07c74ecfd6f900bad97b63ce29c2a076f519188701"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initCutValues (cyclomatic 15, cognitive 41): initCutValues has cyclomatic complexity 15 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":"source/dagre.js"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b1a21839dcefff77d0910e6bce731531027750fddc2da86ef0b4f8e9ffc246"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _updatePath (cyclomatic 15, cognitive 34): _updatePath has cyclomatic complexity 15 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"5305f4c50d16038aa3863bf3050b59938261506898cd3a15f07b9d3f7401ca2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 15, cognitive 33): constructor has cyclomatic complexity 15 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx.js"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fae0bacfdc084fc1b7db8c69d6ae84ef9327be5d43569f9073d2fca60ebc4a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAssumeIntOp (cyclomatic 15, cognitive 31): parseAssumeIntOp has cyclomatic complexity 15 and cognitive complexity 31; 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":"source/mlir.js"},"region":{"startLine":14654}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a32da8cc0d3274ab9d0c5c330009949963b52f221fb34b479bdf77105cefc2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 30): (anonymous) 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":"source/python.js"},"region":{"startLine":7842}}}],"partialFingerprints":{"codehealthFindingId/v1":"3901af8c1c1af0857a511851ec9bf6065886463b1ac0c95e6106aac15df59915"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getFloat8e4m3 (cyclomatic 15, cognitive 29): getFloat8e4m3 has cyclomatic complexity 15 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":"source/base.js"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04449392790ef424ffe7750fe92e3d1dab325d512b38254fcdd1bb781887ced"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 15, cognitive 28): constructor has cyclomatic complexity 15 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe2.js"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45ff9c67addbe5b2be5658cd8c697630a51ca01311fddb7bde38b8d93d4201e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 15, cognitive 28): parse has cyclomatic complexity 15 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"6904d50a5f35b3686969cadfc6b043a6b4829b303e386a4a3c28f8a4bd0fcb5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getOutputAttr (cyclomatic 15, cognitive 28): getOutputAttr has cyclomatic complexity 15 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"188c0278422ca8b0ef1ea38d7b7768f3f848fdea3b09795ad46aeacb79683757"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 15, cognitive 26): start has cyclomatic complexity 15 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cad14f395828ab32c1a1718c5155a6c608720fe95381b838780b8b5863ad53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function download (cyclomatic 15, cognitive 26): download has cyclomatic complexity 15 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/worker.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72f67f0d6137fcf8735f7338562e86ff6b0f2cb4eec03f30c390ff3d4022aa4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 15, cognitive 25): parseOperation has cyclomatic complexity 15 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":"source/mlir.js"},"region":{"startLine":19153}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e0507448330380285d679b09b899cab4c188ce585b7afb7de5341a67efe7cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 15, cognitive 25): parseOperation has cyclomatic complexity 15 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":"source/mlir.js"},"region":{"startLine":24175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f263a74856f9652849bc1cd2a3ef8c6b57e4ecb10e906f4342464d4f53716fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _skipWhitespace (cyclomatic 15, cognitive 25): _skipWhitespace has cyclomatic complexity 15 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":"tools/tablegen.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb36a3e5f4d8053e78111d4339137fa001dd703f57c67da39dda91c98231c0e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildFfn (cyclomatic 15, cognitive 24): buildFfn has cyclomatic complexity 15 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/gguf.js"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"010752e951c714d7abe887522614d102c1ba9d77142660d1204dfd4ef1c84867"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 15, cognitive 24): parseOperation has cyclomatic complexity 15 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":16685}}}],"partialFingerprints":{"codehealthFindingId/v1":"1371ede73b0442a46d780cb14f17e7ec331d519b9933e820de72479b176130e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ConstantPropagation (cyclomatic 15, cognitive 24): ConstantPropagation has cyclomatic complexity 15 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":7441}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6413fa3e52f39cc74b47195a9e5d07cb620a297bf6473ed6c6a7902d6063289"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getFloat8e5m2 (cyclomatic 15, cognitive 23): getFloat8e5m2 has cyclomatic complexity 15 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/base.js"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fe1fb387bded774808d47a7e6411a283c3d2571821adbb566877275bb079f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitDictLiteral (cyclomatic 15, cognitive 23): emitDictLiteral has cyclomatic complexity 15 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":17670}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd238dcef50d3c87d4a06c0f4571c5be818a34bac0a8ed16ca1514cc5f10d19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 15, cognitive 23): resolve has cyclomatic complexity 15 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":21953}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e91b94e4dca373148813444d460fb6bf0454ce56b1444aea568d95f9b003de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _readCodeBlock (cyclomatic 15, cognitive 23): _readCodeBlock has cyclomatic complexity 15 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"970bf15e63e374a51c2b725f2687505fc1070e66da38551ff1f0050b9f73173d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 15, cognitive 22): constructor has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onednn.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f40e241d1de1daf0dfae0d08ed1d57ae5f46faee15600dd3822660647456e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 15, cognitive 21): parseOperation has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":5023}}}],"partialFingerprints":{"codehealthFindingId/v1":"193464bdd66ef0d43ee1be78df3c873ec754ba84287e64c05b4b96f07725e901"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function skip (cyclomatic 15, cognitive 21): skip has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/protobuf.js"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1d7217f38a9efd0545fc57a04a4c4da9de2c4154bfc91234217331bbd2f24b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 21): (anonymous) has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":16299}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b3ff5c1a683557d1af7b433e44771f0bf2bd6ef6111f06baad6d0f59a81942"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseDefTemplate (cyclomatic 15, cognitive 21): _parseDefTemplate has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":2579}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7582f41ded0af1c51ab2232b9447cf8c44a63c72383e966a9f66c696ad25fd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _substituteValue (cyclomatic 15, cognitive 21): _substituteValue has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":2940}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9f48b2f51a1caf32a3233e9b5c798dd2fcff27f24b6927d6e60553617fc2e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _keydown (cyclomatic 15, cognitive 20): _keydown has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a55c937cb72e61d34d01e0cfdfce6e433d4e6f06ffb74897adc7cde6888781"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 15, cognitive 18): constructor has cyclomatic complexity 15 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":"source/onnx.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9993d2130afaaa7a97d5817c322710678f5e23d4e2230626b1dbc5d9282963f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 17): (anonymous) 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":"source/caffe.js"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"4551471ca4776fb794d199411ef8f8e15e8c9d487872d2c4788a45a8e8978386"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tolist (cyclomatic 15, cognitive 17): tolist 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":"source/python.js"},"region":{"startLine":3260}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe31b4c82db7a18c14a174203a61a123d081fb4fff6c21063f19168d3bc5be77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 15, cognitive 17): constructor 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":"source/tf.js"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d76a41b253bebae950ad64b220ff025ef364f088c732b8b01e1ccbea2dc3b87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 16): (anonymous) has cyclomatic complexity 15 and cognitive complexity 16; 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":"source/python.js"},"region":{"startLine":7076}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe31414fbcd0744e9ba49eb71b89cb5e15c0d560ecfedf54924ff28370d5da0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tensor (cyclomatic 15, cognitive 16): tensor has cyclomatic complexity 15 and cognitive complexity 16; 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":"source/view.js"},"region":{"startLine":5651}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af7cc15a15ed6a7a28bea67e63fcb29948b2f6e0ae2eef7c2b88218714dc06b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 15, cognitive 15): decodeJson has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":12967}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b83a823256aa8f473507b94b7dc5bb1af21ed643ef12d4a10c18e3fbb670a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 15): (anonymous) has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":5384}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1bd82b2a40c8c372c39a8ceabe95e01e7a2396ad30c56d30c9b2635228fb725"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _instantiateClassTemplate (cyclomatic 15, cognitive 15): _instantiateClassTemplate has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"786f758246077f2432c18d5b7fba035a9967a7aa8e7e6f59960e6d6e43c3cfd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/index.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b57ab8efa3f084220f83a0f376d5d2fef5a21dd315fbdc6b82f387113c7010"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _openModelJson (cyclomatic 15, cognitive 14): _openModelJson has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/keras.js"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d3cf74ae410178861aac97d3cd9f9f60391de3c1f4f8d6631c0ed84aa467dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function argumentType (cyclomatic 15, cognitive 14): argumentType has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c0bd283c58cbc3c9a1b7d1906410133298c517ebf5b33b6d7fa32f88abdb96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":9593}}}],"partialFingerprints":{"codehealthFindingId/v1":"6339fc0f402ca8740b4b041f8ba2a22c3c537c6602e831f14e87a6a40583764d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 15, cognitive 14): match has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/xgboost.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b46f29c90cde77a29325029cd8ff68d8af302c3a2b8879ee25d9293018fa1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 15, cognitive 10): constructor has cyclomatic complexity 15 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dnn.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f0c163867b2e3ba91d0c76dd6a9b89864a0ee0f3d28a76245bcc95b211b917"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exception (cyclomatic 14, cognitive 44): exception has cyclomatic complexity 14 and cognitive complexity 44; 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":"source/browser.js"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9737614c20213570b4549a9c64d62ae6f63b3e15af65151ebc64e02b89e40f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLLVMCallIntrinsicOp (cyclomatic 14, cognitive 41): parseLLVMCallIntrinsicOp has cyclomatic complexity 14 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":"source/mlir.js"},"region":{"startLine":23134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9fc8ff07181b2583b82c8d7220e4bf66f68e7a8832a5d46c2080a436249e93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 40): constructor has cyclomatic complexity 14 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlnet.js"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dde38448c906bd169685958fcd1b745c5d22cc8e27dbac5ac72e362559050ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseExtractOp (cyclomatic 14, cognitive 39): parseExtractOp has cyclomatic complexity 14 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":12837}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9591db6a2f131fe4b8ba4e21b2c89a45d12190e31e559a2bf4c84ea5251557"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 14, cognitive 37): parseOperation has cyclomatic complexity 14 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":"source/mlir.js"},"region":{"startLine":24051}}}],"partialFingerprints":{"codehealthFindingId/v1":"64329a90a53383dfc24603b769a2d8da76f442f060c5c77894de889da8b09d04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeEmptyRanks (cyclomatic 14, cognitive 35): removeEmptyRanks has cyclomatic complexity 14 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dagre.js"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"20323f1cf4130d8af62716d52ccd496fb2dc769d0b380b11531a2104cccac57b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function horizontalCompaction (cyclomatic 14, cognitive 33): horizontalCompaction has cyclomatic complexity 14 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":"source/dagre.js"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c67627bc369ec728d367483bfefcd1fee2c9ea19431114283e03fb582e1cb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 32): constructor has cyclomatic complexity 14 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/hailo.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1ec7768f2d60fc0211c2700f9727f3d93f3d3c65818b27aa15c2a021bed9b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 14, cognitive 32): read has cyclomatic complexity 14 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tnn.js"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a7e9385db40b5c7814dff47e7ae9b4ae7c9c6f7ff8301206182494e5d10e65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visible (cyclomatic 14, cognitive 31): visible has cyclomatic complexity 14 and cognitive complexity 31; 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":"source/tf.js"},"region":{"startLine":1705}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4450bd23a8a4a419fd6b02dd24d5225278d36450456f36063264e59ff9af79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseParallelOp (cyclomatic 14, cognitive 30): parseParallelOp has cyclomatic complexity 14 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":"source/mlir.js"},"region":{"startLine":12381}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af0fbd33bfee4cc9d1760c0a46a5f09c7e64a43ca8f86903a27c6448b646045"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseResourceRegion (cyclomatic 14, cognitive 30): parseResourceRegion has cyclomatic complexity 14 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":"source/mlir.js"},"region":{"startLine":15343}}}],"partialFingerprints":{"codehealthFindingId/v1":"7590180126fc5c47c5cc5bd8b6d451f1f859aa7c8287d66d32b1e2df70e11dec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addTunnels (cyclomatic 14, cognitive 30): addTunnels has cyclomatic complexity 14 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":"source/view.js"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efb1e1928b34436c120ca748f55e243a1e38c04857c9a56d4d5ee2f5f8cf5d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function infer (cyclomatic 14, cognitive 29): infer has cyclomatic complexity 14 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":"source/acuity.js"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7f17f694ae185058d31b42355a2cb3aec9b981156618882529b7368366d041"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function metrics (cyclomatic 14, cognitive 26): metrics has cyclomatic complexity 14 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":6575}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e565f38978dbb395596112719bfccd34035ad982c6ab76c3086a8265fd2bc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 25): (anonymous) has cyclomatic complexity 14 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/keras.js"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d295d168d56e0d5c5a2f7eb8990fed6749239290fda9c5890de396a4075f7d88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseEncodedShapedResultList (cyclomatic 14, cognitive 25): parseEncodedShapedResultList has cyclomatic complexity 14 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":15509}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db13a52717bfe5018c51ffcb817863b410dd84a8d45ef5afc441fdd8f8a127f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseUnpackOp (cyclomatic 14, cognitive 25): parseUnpackOp has cyclomatic complexity 14 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":16417}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb79846883454b7a48790d58926fe0feab9dcc61edcec20b67eb041af016dabc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sortSubgraph (cyclomatic 14, cognitive 23): sortSubgraph has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dagre.js"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a9bb298b2476f6ea6aa79dce3b41a3c6fdd767ea52b106cbeffa0995d6099a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function test (cyclomatic 14, cognitive 22): test has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.js"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f511d7979848a0c0b26c4d080ada67f59d93bad086da0a1180a408e15476c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 14, cognitive 21): match has cyclomatic complexity 14 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":"source/megengine.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa4366c63dbb9460c71be059765808faea302ff23c06e8d8d6857fdcfcdf6a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 14, cognitive 21): read has cyclomatic complexity 14 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":"source/rknn.js"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"615e2d619d55677900b8e155aea26dd9299cee993c91d1b7980ef34f587e3c51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function values (cyclomatic 14, cognitive 20): values has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/circle.js"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6fee931c48218e0036ad2d8cfe0e8d6e97ea014a8ef0e3903edbd1c391b55d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 20): constructor has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/gguf.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5941b15a6b48b57b3b32bb555b938c51f3ac5136b16ebb67c017e93b20e3800d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 20): (anonymous) has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/megengine.js"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81e498b0cb0fe43ff3d14b1c68378c44d0cbd52c35d759e3253e7082e3fe5d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 20): constructor has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mxnet.js"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"da167c3e0970df706a61c6119c7e731f6d5fe18cc1252e31cdd5f87e4cc71b4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 20): (anonymous) has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":9304}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac89ac03741dd4cc6872cb09127dbb2adf904ad054a89b82d433bae8aa4bbc10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function values (cyclomatic 14, cognitive 20): values has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tflite.js"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"9726017ab90d9e11f0dafc45c663107e579549d0e046aad3d300c1901e2af874"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseDefm (cyclomatic 14, cognitive 20): _parseDefm has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eedd680ed6004f3542af7fdd771f88773604626a74f7f953b994830067e6f7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 19): constructor has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/lasagne.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"820fdd1d6e11a9578d420b0b8e966c5afdb0c0f63ea664c835252340a32a91bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCommaSeparatedList (cyclomatic 14, cognitive 19): parseCommaSeparatedList has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":3645}}}],"partialFingerprints":{"codehealthFindingId/v1":"854f4d3cc7002c953ecceb0e740b7a86ab8c5862bd3eb69c2fd7892d07353569"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 19): constructor has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mslite.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"249f72ab5fdae079817bad80f535606d8dd40176adab7863e8c9c575b72f5c9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSingleConstant (cyclomatic 14, cognitive 19): parseSingleConstant has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":6233}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c9e3a9eb1cbb26b4ec47b84ba86a5e308cf0d46cf54012b080945bb634a90b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateTunnels (cyclomatic 14, cognitive 19): updateTunnels has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e618e9d349103881690861ecfde8213df6d444cb164d1caa07a9211dd66bd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _attributeDefinition (cyclomatic 14, cognitive 19): _attributeDefinition has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/xml.js"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5145c36d799c10420fe0386cca9780502082c636b8991b2644bdc41db712ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _buildType (cyclomatic 14, cognitive 19): _buildType has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/protoc.js"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5ece9c84e916bd687dbe98752b9d8ff566d5119de68557bfc0c90cc7df52d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMFMAOp (cyclomatic 14, cognitive 18): parseMFMAOp has cyclomatic complexity 14 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":"source/mlir.js"},"region":{"startLine":20877}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27a6f0a910db37db994a1f7ac5d6395c4de2fed66712b3dd981be24f7f6ef10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setSugaredVar (cyclomatic 14, cognitive 18): setSugaredVar has cyclomatic complexity 14 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":"source/python.js"},"region":{"startLine":14475}}}],"partialFingerprints":{"codehealthFindingId/v1":"a270b1c0640aa98be8f5b017cc18d37f3ff66d34af330cfc774f45cf011c3463"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseGenericOperationAfterOpName (cyclomatic 14, cognitive 17): parseGenericOperationAfterOpName has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":5177}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6b6641bcb3cf8336c2a439be150558edd8325309060818c4e70b02c59365b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWindowAttributes (cyclomatic 14, cognitive 17): parseWindowAttributes has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":11282}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1e22f60637e4b171c6fd91df5a3106f09b43d5ba7207632accb339b10f5832"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filter (cyclomatic 14, cognitive 17): filter has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7373ee706ecabf94aff21dd866cb5a1a59d12fd08c0bcf6b07a10fa9a4e353a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _readNumber (cyclomatic 14, cognitive 17): _readNumber has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a537f586bcff915d392a0a1aef1dfae8b9aedc479a5bbe29375b0d9ee53bad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDecOrHexAttr (cyclomatic 14, cognitive 16): parseDecOrHexAttr has cyclomatic complexity 14 and cognitive complexity 16; 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":"source/mlir.js"},"region":{"startLine":3707}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf778a9ee0400aa696aa5105aff313fe9461c62661dbb55e55f6570fa2feef6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 16): constructor has cyclomatic complexity 14 and cognitive complexity 16; 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":"source/mxnet.js"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"058e06dc92c0debf0d3809286ff7affd7ae5ccb316a77b2dbcc122c7181bf8f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createType (cyclomatic 14, cognitive 15): createType has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx.js"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99ec67915f31d7cb127b7573dc2721507366082c1274ed5cc019ab0b4b7704d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 14): constructor has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/espdl.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63867856f384ea61fa325d2bcc2fbf2ee8323443f81767cb1f4b2b7b3ddcad1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":9638}}}],"partialFingerprints":{"codehealthFindingId/v1":"009c5fea98897b1e72c23a1500a2a35dbe85fadd0dbc956e77b5e5cecb5920c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 14): constructor has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":13295}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75a5db1e957cb8ea36268a5c56dfc9f64a1a6ab299f6f1a4165e54833164fee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 14, cognitive 14): decodeJson has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch-proto.js"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"1242de35c95a019cc971779e0835e31c6e56732ced05dc2e814d922fb89310fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function content (cyclomatic 14, cognitive 14): content has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":4252}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5098e933af35bebe69e78df5f557440f14fcdefff284b074e1c9be38279b4ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _resolveTemplateValue (cyclomatic 14, cognitive 14): _resolveTemplateValue has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c7969d34c84193bbeb289f901505dddf5d117fcea30f7c99a237fc2f475e0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 14, cognitive 13): decodeJson has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch-proto.js"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"5405978a511f3bd6c85628c2045b17a64cc8adac058f52d8aa9ceb5c73e2d2a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 14, cognitive 13): decodeJson has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":2836}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcb57980a16c72e51201dc7d16e0d14372bfd13e1eadfd359861e97dbc6d834"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 14, cognitive 13): decodeJson has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":10131}}}],"partialFingerprints":{"codehealthFindingId/v1":"02968eaa1d78b32b012d429c4cf7702b2d4860a32dfa75999367eeb7afe06e06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 14, cognitive 12): main has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/protoc.js"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"6703cc6f722dad413521938c514a7e220c71e87df421490178ce62df42f0e60e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function empty (cyclomatic 14, cognitive 11): empty has cyclomatic complexity 14 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/base.js"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3d4d6a28b75c7745f7a254c5ac91274731b116359dd32eda484f547a825b28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 11): constructor has cyclomatic complexity 14 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/kmodel.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc4cd0bc2c564c0ca9169c0ee3ad7c2296b444041cb33ee2cf21d483930193e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 11): constructor has cyclomatic complexity 14 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/protoc.js"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"605cbaf1609ddf7167a93755329f358dcabd83babd2a06c3cd5a89f6e01edee8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 10): constructor has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"3433ac257bfcd744feb8a9adb1ffad73bfa60122be084b0d116d17dc4ce5ab9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openSavedModel (cyclomatic 14, cognitive 10): openSavedModel has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf.js"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"375ec978116ba212cbdc6ce6b1f04398f7e46b1732dc53b9fb649fc11ab8f42f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseNumber (cyclomatic 14, cognitive 10): _parseNumber has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/protoc.js"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3732a0b5afb0212dc47a33a43eddc16894dd3b34de371feb414e649594582f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 9): (anonymous) has cyclomatic complexity 14 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":15374}}}],"partialFingerprints":{"codehealthFindingId/v1":"2552fa5bdc60c8e9c34cc400adda66c3423b4b227481de500208f7a552caf2aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _renderInline (cyclomatic 14, cognitive 9): _renderInline has cyclomatic complexity 14 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":6303}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f27fc03ac214628db5a7e54e1c509d9129fbaf92971ba7c831dfaf13c09d8b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 13, cognitive 43): parse has cyclomatic complexity 13 and cognitive complexity 43; 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":"source/mlir.js"},"region":{"startLine":17507}}}],"partialFingerprints":{"codehealthFindingId/v1":"467b733fa2040a18bb406bab2f2a8670ec840cbd41287432c2f5b3e10c5c6c79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _lzf (cyclomatic 13, cognitive 33): _lzf 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":"source/hdf5.js"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"2518cc9ae9620902263188323d416afeec40e9121cec393e954e5be432956915"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exception (cyclomatic 13, cognitive 31): exception has cyclomatic complexity 13 and cognitive complexity 31; 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":"source/desktop.mjs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"3474502c64ae1510edfd8de39c4125cd2c605acc6c62296ecdf0ca585039cbd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getAllOprAndTensor (cyclomatic 13, cognitive 31): getAllOprAndTensor has cyclomatic complexity 13 and cognitive complexity 31; 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":"source/megengine.js"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8895f23f2d97445747cbea0a1ff0169437c1f3d49aa1a3e6f1250e3794dad25d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseType (cyclomatic 13, cognitive 28): parseType has cyclomatic complexity 13 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":28208}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab3e4e609088b5748bad39cab6a339e7ed9cb63d7e626b1630b66f59afc647a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractTraitsFromParents (cyclomatic 13, cognitive 28): extractTraitsFromParents has cyclomatic complexity 13 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/mlir-script.js"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3a588657d2fe127a0ef8b90bf33dc4809f41221e32c8fdbcc87227ac6b9f07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 13, cognitive 27): read has cyclomatic complexity 13 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":"source/hailo.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2be272f072a6e11b092dd2e40e53fda2fbe1499d6b9d94c389e04d374f987f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseShapedTypeList (cyclomatic 13, cognitive 27): parseShapedTypeList has cyclomatic complexity 13 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":"source/mlir.js"},"region":{"startLine":15266}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a80bd1f1914d98a6f1dfd94ebc114ef67ee8cf638670c27a246d38c164e98b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __setstate__ (cyclomatic 13, cognitive 27): __setstate__ has cyclomatic complexity 13 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":"source/python.js"},"region":{"startLine":3500}}}],"partialFingerprints":{"codehealthFindingId/v1":"597a89fc76ea3319cf2008685bac312bb8f2b683f78c7dfbe6a0fc952a19c185"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function target (cyclomatic 13, cognitive 26): target has cyclomatic complexity 13 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":22393}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7970c8b6a8d6d84f875d734872d7cec330e325ae0f120abbe30773b285d1ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 13, cognitive 24): constructor has cyclomatic complexity 13 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/armnn.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b44bf20be083d33186b91c680f5c879a46f525230a874cdf0f606147b9b16f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function coordinateSystem_undo (cyclomatic 13, cognitive 24): coordinateSystem_undo has cyclomatic complexity 13 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dagre.js"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"0157e0c6b97508d2a140ff074b2efd86922a576ae7a6c66e643225591aa0780c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 13, cognitive 24): read has cyclomatic complexity 13 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f058d59b5bd6fe6fe2179a2d6fedb444f0739d47405eb90fab470dd0974a9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 13, cognitive 24): constructor has cyclomatic complexity 13 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.js"},"region":{"startLine":2497}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9333fd0d062ae9522abe02c10c3ac1d492d2bd159dcaadcfb853874bf3430b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 13, cognitive 24): constructor has cyclomatic complexity 13 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/xmodel.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b45718a02ddba7b03af8c7184311d2abf21a15ff522a66d101cd997da886318"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _openContext (cyclomatic 13, cognitive 23): _openContext has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":7711}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf056ce7f8e936752f194a07b301719c921035177c066cb55cc04f73b0aab77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectModules (cyclomatic 13, cognitive 22): collectModules has cyclomatic complexity 13 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6a9c104f7704f320f9883621990115ab667dab5aa40860eedcb80a8ae6a4b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createModel (cyclomatic 13, cognitive 22): createModel has cyclomatic complexity 13 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mxnet.js"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2bbcc0aae72bdf1f658f0bac250498b478b9cb751fffcfb4ad86fe6054d3ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _update (cyclomatic 13, cognitive 22): _update has cyclomatic complexity 13 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":5079}}}],"partialFingerprints":{"codehealthFindingId/v1":"1145d31de2fc1adfa360df3b9d57a0756b692dc99900cfcbbcd41192295c1e36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 13, cognitive 21): open has cyclomatic complexity 13 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":"source/litertlm.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f853697d74a36e26547ae58fc24869aa197b51b56703c70e7fd872fccc4e9a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMemRefType (cyclomatic 13, cognitive 21): parseMemRefType has cyclomatic complexity 13 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":"source/mlir.js"},"region":{"startLine":3363}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb102f46498fabce6961c2e9be9d591bf996691643fc9d5bed93b938d09a3677"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convertObject (cyclomatic 13, cognitive 21): convertObject has cyclomatic complexity 13 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":"source/python.js"},"region":{"startLine":14175}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc19a45c86522108c93b3d09f140262d7f9d1b43310f4080ded0613f0897e87c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setAttr (cyclomatic 13, cognitive 21): setAttr has cyclomatic complexity 13 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":"source/python.js"},"region":{"startLine":15732}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e28d65fa68eb7be7de85eb685d8d6a0ebbb3bbd729ec99347b331e98775bef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDependVarList (cyclomatic 13, cognitive 20): parseDependVarList has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":22128}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b54a956a64453e636371d024ea76d305132a93003f52c6452937a76a1e34c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 20): (anonymous) has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":15215}}}],"partialFingerprints":{"codehealthFindingId/v1":"56985dcca1535890596da654e5f13e698019cdfcf30ab95c7aa88a3e18607a5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function update (cyclomatic 13, cognitive 20): update has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/models.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd4edbd3af99c87139b2cc11a19047fda8e15670aa2aa3bce85ecb38246dc1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _instantiateDef (cyclomatic 13, cognitive 20): _instantiateDef has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e255d36c4cf8e4a28df46df7b8f1c580759a52b58938cd7292a30428ddcda4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 13, cognitive 19): constructor has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe001374dc5e4d6b4f68eeaca1b07464b7ed9d31b152089f2842af7ab5ffff74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseExtendedSymbol (cyclomatic 13, cognitive 19): parseExtendedSymbol has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":3585}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbff1edf8bf80ded5e6f3b3745a7f47aac0a4017bcdd326d6149c5f08f34a71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function find (cyclomatic 13, cognitive 19): find has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/protoc.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ebe356cf786027fc6b10ce4bde5730b4b2284258253dec7644d190ebef9139"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseDefmTemplate (cyclomatic 13, cognitive 19): _parseDefmTemplate has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":2234}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa29c3dd2cce436fd392ee5492b57a4724d623fa997a48257b3062f52f962d42"}},{"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":"source/circle.js"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"62329d73edee94b31571d1c915ab7fcac983ec9f55a63e81b3d9ba40f174ef9e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 13, cognitive 18): constructor 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":"source/coreml.js"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f1c09c2eea4e42bd0f2eef36164e180c56a6957581dffa05160f57d164772a"}},{"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":"source/tflite.js"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"e763e0fd51021865fa7adf193884da1748f70e97802054202eb761adf5df2600"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flatbuffers (cyclomatic 13, cognitive 18): flatbuffers 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":"source/view.js"},"region":{"startLine":7608}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b8ad36959d68b4431089719a833c18b86a11780b0cf55449d514d132a91a11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _name (cyclomatic 13, cognitive 18): _name 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":"source/xml.js"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c544e3b00c42ab32ab6f607b193c820b1c6f0e9e042a0558a62d1614848e111"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWaitClause (cyclomatic 13, cognitive 17): parseWaitClause has cyclomatic complexity 13 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":"source/mlir.js"},"region":{"startLine":27763}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bae53d0d7aa3fc84e0b45a98aa226ecf41c7be9b5b19a20125126f4928ab45e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 13, cognitive 17): decodeJson has cyclomatic complexity 13 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":"source/tf-proto.js"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4f2e1c2dfb935c734d484200f547d8b3c0f7250cc26c2cecbf02758147c5a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _list (cyclomatic 13, cognitive 17): _list has cyclomatic complexity 13 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":"source/view.js"},"region":{"startLine":6533}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a0eb24bc6f3dc77b2c5e495ef27166fd3bdd6beda85ec9d5206b28c20904b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 13, cognitive 16): constructor has cyclomatic complexity 13 and cognitive complexity 16; 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":"source/xmodel.js"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"362bcae2107dd6554512359f8269159d56df9a10800ff9235a4288aaa4b01b99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOptionalInteger (cyclomatic 13, cognitive 15): parseOptionalInteger has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":4196}}}],"partialFingerprints":{"codehealthFindingId/v1":"1599fb264373e0caa94d2898798a73218898b18da8563c92c5f61433e9bf22ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 13, cognitive 14): constructor has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mediapipe.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5899ae207af66eb48b3eb02d1be8baae6a62bee184957980445d4918f9c50175"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 13, cognitive 14): constructor has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pickle.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"448de845fdebcfd38e601d86c67d22b0f5017cd78df7a9826cf9b42df8db02eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 13, cognitive 14): decodeJson has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f296f5eee9ea12519aebf5a478a391026aabe03316a07b6c14a72c6e3e64c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 13, cognitive 14): decodeJson has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":6638}}}],"partialFingerprints":{"codehealthFindingId/v1":"d653a9975f83e0a23f29a98b823a3623309b8211ba48400dfe204fe4cd1e0551"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseMulticlass (cyclomatic 13, cognitive 14): _parseMulticlass has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae7a1c944ff8693b3b7e4b3e9d1b531cdba406b06011341b6c84a2922b68a2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseValue (cyclomatic 13, cognitive 14): _parseValue has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":3208}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1823f82de96ef9e099e93c4dd65b339c2738cdd8bdf1f965de82796c604502"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkModel (cyclomatic 13, cognitive 13): walkModel has cyclomatic complexity 13 and cognitive complexity 13; 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":"source/coreml.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de0c431d9e412c93ed23d999ce2efd0236cd34cc3bd9f5fb153c141ea30ef3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _tensor (cyclomatic 13, cognitive 13): _tensor has cyclomatic complexity 13 and cognitive complexity 13; 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":"source/onnx.js"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"002616a4ab44d48dd974984a4050937fd0f6a4d9ddede5ddfbac9a535547f06d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) has cyclomatic complexity 13 and cognitive complexity 13; 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":"source/view.js"},"region":{"startLine":5347}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a80684c0d866f6d8c7ff5fcc08af101d83bc1575573cbff360a2df52ccc2223"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 13, cognitive 12): constructor has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe2.js"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"a571e14bf10e4cc7b17d59de385183c0e9fb9cb551cd7e58a6fb408ff0654acd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function build (cyclomatic 13, cognitive 12): build has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/grapher.js"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0a1ab2fae8ea534e3dfdfa7c8bf6131f64ed54c404dcf1d565aa61bd14729a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 13, cognitive 12): open has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/hailo.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"615145d3c26868173e8029daf3ad9098315747a9524d10a749e2166b3d2acdde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 13, cognitive 12): decodeJson has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx-proto.js"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aeadff1ff3a391108065e401d913e829842d33e549477e7bf39e13ad22dad3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 13, cognitive 12): decodeJson has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx-proto.js"},"region":{"startLine":2463}}}],"partialFingerprints":{"codehealthFindingId/v1":"1758fa1c8c00a7aeac3750a093abeb20669e087fc78fb85e3b7d8c75e5373f7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 13, cognitive 12): decodeJson has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch-proto.js"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"233ac7aae462bde329db94d450263119532cd7f3e114d3b8b817f1b1d423080e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 13, cognitive 12): decodeJson has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":9908}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fa9595435c0e81b5c1f511c99b6d329b28611cd5e6538d75d6f6fa3b2ac9c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decode (cyclomatic 13, cognitive 9): decode has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mindir-proto.js"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b8daecce0d8f9774eb252dc31a4ce427a8bdb99735dd18d1700f62d9c87bb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isTensor (cyclomatic 13, cognitive 9): isTensor has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pickle.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"397ce7526fedf591328bee2b8352691d808855f004e6900f808184d4884d5094"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFunctionArgumentList (cyclomatic 12, cognitive 33): parseFunctionArgumentList has cyclomatic complexity 12 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":"source/mlir.js"},"region":{"startLine":5936}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d9a0e3c144aac23444b06bd15d577e7c613e25ee98591c73a6172b5b221832"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updatePreprocessing (cyclomatic 12, cognitive 32): updatePreprocessing has cyclomatic complexity 12 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff8899342988997c9995d55155d8ac2530d6a26739a278577dd15c0c134a797"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDispatchFunctionSignature (cyclomatic 12, cognitive 32): parseDispatchFunctionSignature has cyclomatic complexity 12 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":15627}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d7c45a9411c7afc8034515f522b4a2a57ed84ca642eca4375ca095cafc8675"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseGraphOp (cyclomatic 12, cognitive 31): parseGraphOp has cyclomatic complexity 12 and cognitive complexity 31; 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":"source/mlir.js"},"region":{"startLine":24275}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00058218ccb4837727432bf2995346de4c8d4749dd2ad27313e864faa9f1b3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseUtilFuncOp (cyclomatic 12, cognitive 29): parseUtilFuncOp has cyclomatic complexity 12 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":"source/mlir.js"},"region":{"startLine":14585}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa33e6194a2a846423821583e6a318f5a2eca13c3de1460d8286f985cfe8991"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 12, cognitive 29): resolve has cyclomatic complexity 12 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":"tools/flatc.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca124568d38a032dbbc9666b55580ade23082a89b1e022ae2747f7f13df600c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseShapedFunctionType (cyclomatic 12, cognitive 27): parseShapedFunctionType has cyclomatic complexity 12 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":"source/mlir.js"},"region":{"startLine":13434}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcef359500fe0e7116b46bbc6bf3c479c6600d86019dc493736649839b2c677"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTransferOp (cyclomatic 12, cognitive 26): parseTransferOp has cyclomatic complexity 12 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":12897}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b86df349fa54fb992750ce6677b79113c775722bbf021026840c068b8cb3c89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 12, cognitive 26): constructor has cyclomatic complexity 12 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/ncnn.js"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2f1920a23354f9027207de0eef17db831b5bd18f8972d5720384eed9ad5804"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _decodeValues (cyclomatic 12, cognitive 24): _decodeValues has cyclomatic complexity 12 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/base.js"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffb550839d25adb864cb558859e63f38b5fa60f04b19554866a75aabe0d0485"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BatchNormalization (cyclomatic 12, cognitive 24): BatchNormalization has cyclomatic complexity 12 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/cntk.js"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"77449f8267cb8c44e85c4797a141eb5bbbe8b4d881c274def40a6373f0916dbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 12, cognitive 24): parseOperation has cyclomatic complexity 12 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":26802}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb57d70c0c8689980d3d15adc45032dc13f53161a0b487fdb7d705708a1346a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _buildDecodeTextFunction (cyclomatic 12, cognitive 24): _buildDecodeTextFunction has cyclomatic complexity 12 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/protoc.js"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3785e1be9f844d4dd50704cf33aa574d7d66bd1e3f8fe89bc3eb14927c371c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function registerSection (cyclomatic 12, cognitive 22): registerSection has cyclomatic complexity 12 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/gguf.js"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cfd908a3c641e3649ed946c5f5966bbad8ecc208e80c8ac00d40e34f4d3e4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 12, cognitive 22): constructor has cyclomatic complexity 12 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/hdf5.js"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a800519de292e332fdf56401cecc2f28b90c3ad615d86a2f2c03ed0157f74a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseUniformType (cyclomatic 12, cognitive 22): parseUniformType has cyclomatic complexity 12 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":16969}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7d9f9ea0e2fdaedd63151e3da692ea7257111d63acb91b97d2ff8b7dd999fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 12, cognitive 22): parseOperation has cyclomatic complexity 12 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":19273}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d9692e8de2c48da40a2d31393c7a17ecbfbaea9288ce64bc2a4e0e14b635e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitSubscript (cyclomatic 12, cognitive 22): emitSubscript has cyclomatic complexity 12 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":17968}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7769d5dda8ecb1814adf291b9bf7a1fec4b623045af0ba0dae7fb01c1a17655"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseSlice (cyclomatic 12, cognitive 21): _parseSlice has cyclomatic complexity 12 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":"source/python.js"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"04829b903c4db16ff1bf2e97b777d7ce17b3731039e6ceaa9dd6d8cc03fd3c2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 12, cognitive 20): open has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/circle.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aee317cfd66546cd34470e5f61b661b57d412be745bf4d91a92d61819163455"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 20): (anonymous) has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4e20658c075ab62180727e7a5e8d6e58d3803dc9f6d9f18e1de1082abf73f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _open (cyclomatic 12, cognitive 20): _open has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/desktop.mjs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b678cf93a68b1f6241df63abf44d57c988a5a41dd751ff86bfbfce22072fceb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function markReturnNode (cyclomatic 12, cognitive 20): markReturnNode has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":6789}}}],"partialFingerprints":{"codehealthFindingId/v1":"71934bbc6c16640a0ec6ec21a89858f2177d028d69212e0170e99b533a17999f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 12, cognitive 20): open has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tflite.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f95d8b62a2de437a3aa718f08eb0577b84c6d4380bbd7077b9d1c865ade8802"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 12, cognitive 19): match has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/darknet.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a38ff7bbfd295c8bf175debe218102da3089a6799f6caef772788ff5b48ab0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseEnumFlags (cyclomatic 12, cognitive 19): parseEnumFlags has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":11086}}}],"partialFingerprints":{"codehealthFindingId/v1":"4530767dbc5ac8f165ffcbed950530c6b2c6c4a0532d265d9ee91cedada7ab0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 12, cognitive 19): parseOperation has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":11738}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f896512fa580176e6b982a8a278babfaaf3edfc362e0862bddd7af43f192dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTensorLoadStoreOp (cyclomatic 12, cognitive 19): parseTensorLoadStoreOp has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":15061}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8df905aef0fc171ad3db9932d68848aa71b89010cb7e9b6f2a02d4fd7777a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 12, cognitive 19): open has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.js"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0a399940d0a53d2494d4027f95f479362c27cd51b1d87d90c001b25044b816"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildBlockLayers (cyclomatic 12, cognitive 17): buildBlockLayers has cyclomatic complexity 12 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":"source/gguf.js"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"55483bf161b7fb3f881f4aaea6c8a37d4c671015520864013455730847498168"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _evaluateCondition (cyclomatic 12, cognitive 17): _evaluateCondition has cyclomatic complexity 12 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":"tools/tablegen.js"},"region":{"startLine":2731}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7ed236fab480a851eb77e383f4a1fc3fdd052518cd3149fe507c7a3b10c0a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sectionFlat (cyclomatic 12, cognitive 16): sectionFlat has cyclomatic complexity 12 and cognitive complexity 16; 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":"source/gguf.js"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"d015a0b66599d295939883e109470e0137d0260917e7401f7e01b4a8a2689963"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deserialize (cyclomatic 12, cognitive 16): deserialize has cyclomatic complexity 12 and cognitive complexity 16; 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":"source/hickle.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c936a9fde0f21f4cf2803123748d2908718ea2d4f28743806d78d7f6e12d83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function list (cyclomatic 12, cognitive 16): list has cyclomatic complexity 12 and cognitive complexity 16; 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":"source/numpy.js"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"7709b24fd65b3e73209b200872d0078577367a52af28e003ec1ef202f43e5580"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 12, cognitive 16): match has cyclomatic complexity 12 and cognitive complexity 16; 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":"source/onnx.js"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e70569ec51cb1d3187537fdcaab861989b8542b2d6768726cb68465b17e2cf0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 12, cognitive 16): match has cyclomatic complexity 12 and cognitive complexity 16; 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":"source/tf.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fb62659e6597f7262ddbb55f36feb954a8e65a9acafc5f4368fd2ab1110c27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 12, cognitive 16): match has cyclomatic complexity 12 and cognitive complexity 16; 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":"source/view.js"},"region":{"startLine":7568}}}],"partialFingerprints":{"codehealthFindingId/v1":"d651e81a2733eeee724fd80c9a4da35e680af61f8892775bba3177b9c30053bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 12, cognitive 15): constructor has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe.js"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b5b4745816bb1aba4a01d9d3ccf2cb00058b6ed609c802f1d944eb81d502b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initializer (cyclomatic 12, cognitive 15): initializer has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f206fdf1833e8d4f95fde025906ecd3e994d848b18a45f5936498af60698de7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 12, cognitive 15): open has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dlc.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0cb61e6b8b3b90c2dcd63c8f350690f9fc74aad211413babfa8b98e6aed67b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 12, cognitive 15): open has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/openvino.js"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb9f982b30bf7ab177210017d53965eeff05b650a84378a6b5003759dbd78bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generate_getitems (cyclomatic 12, cognitive 15): generate_getitems has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":20414}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e096bff92b2fdc5b6788455f2cfa4e51ad09e9dedffa4ab99dcedaf0043b133"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restore (cyclomatic 12, cognitive 15): restore has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":2431}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d697416a40e1217bcad0542d8ae26e39c6ee377814ea89242d2d0a7d9e925a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _attributeValue (cyclomatic 12, cognitive 15): _attributeValue has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/xml.js"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"5157e643ed21ba02e0fc2bb29a2aa3eb3ec857c2e17472ed258af0d351afd20f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 12, cognitive 14): constructor has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/hdf5.js"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"11edcdaffdd4bbbb7f54cc2c3cc998cf2c2217f758a94f1bc6c158acfdfdc624"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSugaredVar (cyclomatic 12, cognitive 14): getSugaredVar has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":14508}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b195069067f95f1801040e8963ef78f07191e9539611bad1497f707f0fba0d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitStatements (cyclomatic 12, cognitive 14): emitStatements has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":16732}}}],"partialFingerprints":{"codehealthFindingId/v1":"feaf84be7cbc5fd97520c9676ce204cdd12dd9ca97d95184d55464982de24d97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 12, cognitive 14): decodeJson has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":4307}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad14ffd4f2888b902610b5a4f80207b3852697a36304e2fa073b8ea0f2fd1db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 12, cognitive 13): constructor has cyclomatic complexity 12 and cognitive complexity 13; 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":"source/espdl.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87bdc6204151d022e118792adda4438a23b8ead20e8800c601a6c2dfbc416b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function valueType (cyclomatic 12, cognitive 13): valueType has cyclomatic complexity 12 and cognitive complexity 13; 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":"source/mlir.js"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"483119567c1ff0d3f00caa7bc3ee93e88cfc708901af379a789141b200a8c6af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTensorType (cyclomatic 12, cognitive 13): parseTensorType has cyclomatic complexity 12 and cognitive complexity 13; 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":"source/mlir.js"},"region":{"startLine":3330}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c2347bdb67aaad4039d92cdeaa5f56fe3db5b44b1903414d2b6e3014e8f0f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 12, cognitive 13): decodeJson has cyclomatic complexity 12 and cognitive complexity 13; 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":"source/tf-proto.js"},"region":{"startLine":4630}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b4ae60a50c38e18b6a1233c54e72171464cf115c8e6d76691b3a8a43adee6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseType (cyclomatic 12, cognitive 13): _parseType has cyclomatic complexity 12 and cognitive complexity 13; 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":"tools/tablegen.js"},"region":{"startLine":3079}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e298ea9b397b6e5c2d48b7762850656d1f8dacaa8da4d747e6982f737e0c9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 12, cognitive 12): constructor has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/app.js"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c34ab3ade1b76188e8170794f1d393c16ca86af98cdcca43ec7d5c1a278c851"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatTreeDef (cyclomatic 12, cognitive 12): formatTreeDef has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/megengine.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"705ede5675499da647bf63a3ab6f73a3d217741f7cacb917c0d9c9fec7936d47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create_name (cyclomatic 12, cognitive 12): create_name has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":8807}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d31c549aba5e67baf5e433dfad9db7ed05afc3abbb5d95305c85428d901bbb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _process_sym_expr (cyclomatic 12, cognitive 12): _process_sym_expr has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":20552}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60a6ab563a4d83bf30e703df1238c5a7e748f5fb5d9619d6a12775be4fec303"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 12, cognitive 12): decodeJson has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch-proto.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7179e766fc1b26753f7697482e7fd319e2a52e451dc1ffbe618af472d6dd99ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 12, cognitive 12): main has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/flatc.js"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"252eee44ccdec295cec7e65d8c98e84c7780184e92b713523b9aa4cf608c561e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 12, cognitive 11): constructor has cyclomatic complexity 12 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/catboost.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5a1e81f03d4fee76ae9171af3ce5d2ba3f4d278c4621a53b00d20832839017"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOperation (cyclomatic 12, cognitive 11): parseOperation has cyclomatic complexity 12 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":22719}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b8c6d1801727cbe548b351d7f9b83c0b5debfffe5f5e9887aa47f40afdd1f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 12, cognitive 11): decodeJson has cyclomatic complexity 12 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch-proto.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"900888cce0b2341fd814d1938db695a0917894485c084d910e8be8368a5f5508"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function accept (cyclomatic 12, cognitive 11): accept has cyclomatic complexity 12 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":7819}}}],"partialFingerprints":{"codehealthFindingId/v1":"3133451adc9d24b51f82eeac53f65414d465161fc4ce125dea4142264a724623"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _terminal (cyclomatic 12, cognitive 11): _terminal has cyclomatic complexity 12 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/xml.js"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8f086c9cf8368c731556f369bd0cc7ccc058f28697c89ca5817c8e38afd9e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 12, cognitive 9): match has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pickle.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a99d16f9d7b1707cbaf4c246bd6d1f31fd1d5ba55e3f6c1bf8cb1cc0b366fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function name (cyclomatic 12, cognitive 9): name has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":2782}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97d2e3f26ff79ea27bc025b4bb6479dc18cd3efc699b2b83dadfcd4086cd592"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read_weights_hdf5 (cyclomatic 11, cognitive 39): read_weights_hdf5 has cyclomatic complexity 11 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/keras.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"b816ec562eb93e83cffa9498dfbe84df17f61952bbb244c530cbf75166af8fee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 11, cognitive 39): walk has cyclomatic complexity 11 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":4994}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c086bd80471bf8df65d16ac134f3f234e6cb2390e69fc381da031b4cb98289b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseParamValue (cyclomatic 11, cognitive 34): parseParamValue has cyclomatic complexity 11 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":14145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0140aba7ed1f219c03dae32c3ef9139299b57d0a43ad18dc7d313dd82f730a31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOptionalDynamicIndexList (cyclomatic 11, cognitive 28): parseOptionalDynamicIndexList has cyclomatic complexity 11 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":17410}}}],"partialFingerprints":{"codehealthFindingId/v1":"15734fd0ec6ebe8f3795d39318bb2783370da6459fab4e83af9dfe7c23804ed2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseGraph (cyclomatic 11, cognitive 27): _parseGraph has cyclomatic complexity 11 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":"source/onnx.js"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2dfc694118bd9ce6710de83f421acd6866ce8959f13a85fefb59d0c5cd8fc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 11, cognitive 27): resolve has cyclomatic complexity 11 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":"tools/flatc.js"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba732d0d37db20857bf57df26183ba875aaf5c86db7ca57b9122565ded38bcc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 26): (anonymous) has cyclomatic complexity 11 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":16349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd88f303a3d842ae253937bb976b17dfe54b7fe57be48e1e1ac8fa9a1124829"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parentDummyChains (cyclomatic 11, cognitive 24): parentDummyChains has cyclomatic complexity 11 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dagre.js"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bde28a42124d702ecfd394b977880d525e70c523eb453ad54b9be3d4110dfe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function crossCount (cyclomatic 11, cognitive 24): crossCount has cyclomatic complexity 11 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dagre.js"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"97048fd2cf0b6e2eb8c3fff9f7ee526fb86a31c3049b5917de0baca01a64dd64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTargetConditionObjects (cyclomatic 11, cognitive 24): parseTargetConditionObjects has cyclomatic complexity 11 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":14219}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0c1a7fcedccdeafdfec4ee12c30539ddab2531aa153bd1a8e1e45cf5b440df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 11, cognitive 24): open has cyclomatic complexity 11 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx.js"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b44b51636cdc8878bdb27ec1d334945a98526b2d08ed5fa86a4468b2122057"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWorkgroupCountRegion (cyclomatic 11, cognitive 23): parseWorkgroupCountRegion has cyclomatic complexity 11 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":15595}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9464ae13abf2da2c4ff064040177a2544ec522b29e016d4916e04a47b65ceb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveOperands (cyclomatic 11, cognitive 21): resolveOperands has cyclomatic complexity 11 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":"source/mlir.js"},"region":{"startLine":6274}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c1030f7b3c06f798fb246b67a765d1e32c2bb694b84eb98fe5786a827ffecc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWorkgroupCountRegion (cyclomatic 11, cognitive 21): parseWorkgroupCountRegion has cyclomatic complexity 11 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":"source/mlir.js"},"region":{"startLine":13581}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fab382024f317c1fd2d1a2a2a14fd09a35c870b3110fe6969c319b828b7116"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 21): (anonymous) has cyclomatic complexity 11 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":"source/python.js"},"region":{"startLine":10228}}}],"partialFingerprints":{"codehealthFindingId/v1":"9083745bdd3f402b6f5d296635ebde295dd7fb90f20637fb19c96b1e12a237b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitWith (cyclomatic 11, cognitive 21): emitWith has cyclomatic complexity 11 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":"source/python.js"},"region":{"startLine":16761}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4694fc9f72141ca3b0ffba0353855ce4f965d6518e9a3eaa76b52da4242336"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _signature (cyclomatic 11, cognitive 20): _signature has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dlc.js"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea50aee8ff3c8ec9e3a079341aab04d707127ec596cd15e0e99c086a8c2d347c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 11, cognitive 20): constructor has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/espdl.js"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e5a92ce76ba0ccd5276f93bf75647722b1ca71c040b49ca3418c7e52abc344"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTFGOperation (cyclomatic 11, cognitive 20): parseTFGOperation has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":24106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4451c9a3cceaace1df51df8c9ce08e4f3673203a6e400dd18758b42d0ee5488a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitCondExpr (cyclomatic 11, cognitive 20): emitCondExpr has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":16975}}}],"partialFingerprints":{"codehealthFindingId/v1":"563c4f25a6c597e0f390227e925001fb56cb428e7e039d93ced8de1469c425a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _openShards (cyclomatic 11, cognitive 19): _openShards has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/keras.js"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6988b7c70e690fe090c2d70a43a32bceac0e837f9879c4386f93dd2eea359c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOpBundles (cyclomatic 11, cognitive 19): parseOpBundles has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":22567}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c5d4a6c05700e781352ba3371f2aa9363f612626bd69684e4bed94010b9845"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDispatchWorkgroupsOp (cyclomatic 11, cognitive 18): parseDispatchWorkgroupsOp has cyclomatic complexity 11 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":"source/mlir.js"},"region":{"startLine":14928}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc005016db107b3f0841256fc653dc2294e934f6b3c0c0f8a40382840eca8c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferResultTypes (cyclomatic 11, cognitive 18): inferResultTypes has cyclomatic complexity 11 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":"source/mlir.js"},"region":{"startLine":18726}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e243c662340bea80984213b6f8cb3787f5a9d7eedfb07fa8ca88a82af83194"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferResultTypes (cyclomatic 11, cognitive 17): inferResultTypes 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":"source/mlir.js"},"region":{"startLine":19093}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba19d422566f806f58dd3fe127de023c971b075c6968f941d9b1d4f20b4a731"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseShapedResultList (cyclomatic 11, cognitive 16): parseShapedResultList has cyclomatic complexity 11 and cognitive complexity 16; 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":"source/mlir.js"},"region":{"startLine":6033}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ddbc1842778841c37bdefa33a91f87f6132ee7d7b25e4233880b74ba12b58b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseElement (cyclomatic 11, cognitive 16): parseElement has cyclomatic complexity 11 and cognitive complexity 16; 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":"source/mlir.js"},"region":{"startLine":8715}}}],"partialFingerprints":{"codehealthFindingId/v1":"12df19f9f2b6462dc057cc178bde54fc6410dcf6a6f9e334e3d7243d453bb165"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 11, cognitive 16): match has cyclomatic complexity 11 and cognitive complexity 16; 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":"source/sklearn.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbf772c66404dcb6fc7369bbd4440fe214abce884beeadabc8845f057572179"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseRecordBodyFields (cyclomatic 11, cognitive 16): _parseRecordBodyFields has cyclomatic complexity 11 and cognitive complexity 16; 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":"tools/tablegen.js"},"region":{"startLine":2647}}}],"partialFingerprints":{"codehealthFindingId/v1":"330cb6494b6994766f39e27f9d81565a0521863095fc8b1edacade28f20f453b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 11, cognitive 15): open has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9257358c7efadc34c4bcfa17c5fbab085e5939f58a359518c7c6bf70d7a1506e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 11, cognitive 15): constructor has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe.js"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"00636e11b55783119551620e81828401e65a35ed681ef1eab247d85a9a43102f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _update (cyclomatic 11, cognitive 15): _update has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":3396}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0635f364fbf5a3e596bc3534eb9dab2d95d99512465bf8ccfbd5245c494d25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 11, cognitive 15): create has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/zip.js"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"a162a1d8e8d0746b5ab1c2ca75edad802ff32764e203a84e2f6ace26a769b518"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deserialize_type (cyclomatic 11, cognitive 14): deserialize_type has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/kmodel.js"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f846843612030a345efb51d18e7f409fce954e3d8861b17724052fa6d1b5c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSSAUse (cyclomatic 11, cognitive 14): resolveSSAUse has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":5283}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e4548901928fbb36229b11a35db1cb17c3ed49c6aa40890908662933549205"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOptionalKeyword (cyclomatic 11, cognitive 14): parseOptionalKeyword has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":5487}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c5e4c13b33854ce0b5e509250f59eeb1117213572f274456bac5baf5fce46e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 11, cognitive 14): read has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":7496}}}],"partialFingerprints":{"codehealthFindingId/v1":"529645a18e641354ea6dbf664f20c4cade1cc78435bf8e8a0284dcd32fbcf845"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseInsertExtractValueElementType (cyclomatic 11, cognitive 14): parseInsertExtractValueElementType has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":22541}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4118bb2a65f877e014cf0cd2f5a0f6255dff97e4d790d74f630ddb3b6a3962"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 11, cognitive 14): open has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"e776b012e58f653a10451c673d0d113a4ed0fdde6449be9300b2c488c1f3f84d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 11, cognitive 14): parse has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"f863c35e9774962ae84a54b7001aadbac13d7944a7fdc8a1dad3e3d1769d972c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refineAndSetUnionTypeHintOrPopulateCandidatesVector (cyclomatic 11, cognitive 14): refineAndSetUnionTypeHintOrPopulateCandidatesVector has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":17166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61c6a94cda9677bfbe5b21dfe7a56a0cd51d516e5301dc8ec2a402a71c60e03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _updateRecents (cyclomatic 11, cognitive 13): _updateRecents has cyclomatic complexity 11 and cognitive complexity 13; 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":"source/app.js"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"f375a5db217c9c03dbe92646cd2c0e9f40c965516f1f34edb21193710b65a1e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _skipComment (cyclomatic 11, cognitive 12): _skipComment has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dot.js"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"2393c67e31408b5693d4605f11dd0f7f188bd9aca5647a0c2ef6095219898122"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 11, cognitive 12): constructor has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/hailo.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"815ff09941a70ddafc3a3e145fffffc291d18f55781bc8ed1faecbae9334a625"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 11, cognitive 12): constructor has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/om.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"088ae9703a15328737c0c4bda0957488115a7dbe65f70d0631e4be8040abde9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toTensor (cyclomatic 11, cognitive 12): toTensor has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.js"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc22c3183afac563f9d3669130df3239ef13daf775945225b55042acc5b56db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 11, cognitive 12): decodeJson has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":9764}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa512a8a9cee30b465da89039241277a243e1f80e6771d9e6aed496b1d77e98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openEventFile (cyclomatic 11, cognitive 12): openEventFile has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"127111a6cda90f594f7d401258cf0b9fe4cb5a2ad484818e975077e406050833"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function show (cyclomatic 11, cognitive 12): show has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b092605f2458d27e6b6a39181dac05620b9ab7d8e684eed9bda8db5b7ef2161"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 11, cognitive 12): render has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":4430}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe2cd35772d060494b2c7e8674748233071403efd7b7b5dc4212be646264951"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateValue (cyclomatic 11, cognitive 12): validateValue has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/worker.js"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47dd57c451c2f77247eef4497293aff83e73af254aa86a6f636aa52fe0c1e60"}},{"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":"source/acuity.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"95358f6119ee867ee5119cf16fb6caa85055fcc0f85cff1eafa285ec24ff7d22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAffineOperandExpr (cyclomatic 11, cognitive 11): parseAffineOperandExpr 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":"source/mlir.js"},"region":{"startLine":4765}}}],"partialFingerprints":{"codehealthFindingId/v1":"06af927bb97306dbc1d02625e302d7f70be526cdefc4869e6fe3d3087085ab59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseFunction (cyclomatic 11, cognitive 11): _parseFunction 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":"source/onnx.js"},"region":{"startLine":2514}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07a66f243e00b0cef9e3d649ae7d8fc24a8540e623a5915412d8b4264e1e7e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 11, cognitive 11): decodeJson 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":"source/tf-proto.js"},"region":{"startLine":2979}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ae646f63b11e73dda1989c4180ce79c45d30f43877dafbc8d55ced876edec2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 11, cognitive 11): decodeJson 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":"source/tf-proto.js"},"region":{"startLine":7657}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9be8a808887b79d6153ac722e5d30c2e3f2680bc25c106c05b28c69c1e1cc7a"}},{"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":"source/view.js"},"region":{"startLine":5427}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96c3c2ac1535efd4520f1f8421434ca06361c40c9137b76188c947e622699a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compare (cyclomatic 11, cognitive 10): compare has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.js"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b9b7d317ef86745a31e279ac5e6c0ff8c83724e7b2ea88505c6e9d4de1a39c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _update (cyclomatic 11, cognitive 10): _update has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/base.js"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"24061acc9158b0c0c2f1fbf7d0ca07c1de8b2493a420e358851ea4e20afb5407"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 11, cognitive 10): constructor has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"d087325cd439e0d1116844ddce2d85de9f5b3ac298f97b3c6c53bde1402238c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseShuffleType (cyclomatic 11, cognitive 10): parseShuffleType has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":22608}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3e401d0702ddd7ad99e88aecfa3e7e3e8ba2f77a4418ba6ef74f5d92b3f0fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 11, cognitive 10): decodeJson has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx-proto.js"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"41eab6731a74421b097845cf27abd83c63a11a9c17a202899833254a318dde4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeJson (cyclomatic 11, cognitive 10): decodeJson has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx-proto.js"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94e6c42383b246d1233e75ac4ca5570668fe4ecd1826d3ceb8ac3782d1177a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function uint32 (cyclomatic 11, cognitive 10): uint32 has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/protobuf.js"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"500cfb98b270341e287aeb2231a4f87e8d3f31a911dbfc0f4bd53db53c2ee79d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":10266}}}],"partialFingerprints":{"codehealthFindingId/v1":"36aaf2db0d130e8679901a5ebc412baaadaee2093d3f9f422a7bc20bb65cb24c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 11, cognitive 10): constructor has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/uff.js"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e5e8552063959483c5c5af5c134374a68be466c288b89e15d7fec251c46c54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toggle (cyclomatic 11, cognitive 10): toggle has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"176c3f542521272c7d02ae0f38273bf30525aa0275377f937732542604f42143"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/python.js"},"region":{"startLine":10150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01e412076254abe38fc167deea8c247e88d98bd0dbe26b67f3e7ec097b0e378"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 11, cognitive 9): match has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/qnn.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3854705fe13f661df7fc2997e0608476089bad8082374998d5efad1785b4c6aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match (cyclomatic 11, cognitive 9): match has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tflite.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d21117e58c5474dc120c0a0b8cab8563f2432c19cb440b8bea8bb00cc6e612f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convertAttrList (cyclomatic 11, cognitive 9): convertAttrList has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tf-script.js"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"4001e3fdda0a6d4203f1df0b12f4f3e42a16da271d1ba015aa29fd984cbe75c8"}},{"ruleId":"R3","level":"warning","message":{"text":"source/coreml-proto.js: 17014 lines of code: source/coreml-proto.js has 17014 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":"source/coreml-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a6aae7098c2c775e92469deccc9273a2f4798fa5268dea1f4b32eda65ef8cf"}},{"ruleId":"R3","level":"warning","message":{"text":"source/tf-proto.js: 12514 lines of code: source/tf-proto.js has 12514 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":"source/tf-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8be4d74768d8863ba0c665372254e6aa5c68984205f11470165d4511714863"}},{"ruleId":"R3","level":"warning","message":{"text":"source/nnabla-proto.js: 11537 lines of code: source/nnabla-proto.js has 11537 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":"source/nnabla-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d456e354cb60b88aedbdc2fb4290a0923c25204772d5ccf797c993285acfcc8"}},{"ruleId":"R3","level":"warning","message":{"text":"source/view.js: 7634 lines of code: source/view.js has 7634 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":"source/view.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd4df048ac7a0c0c262e65527774b2017c196ae78a5b97a99247b8e6e39b27a"}},{"ruleId":"R3","level":"warning","message":{"text":"source/caffe-proto.js: 4927 lines of code: source/caffe-proto.js has 4927 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":"source/caffe-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a936ac7eb287ef35bac66a54793d8c7f71b416a364dd5b0e336e83e789fe38cf"}},{"ruleId":"R3","level":"warning","message":{"text":"source/mslite-schema.js: 3884 lines of code: source/mslite-schema.js has 3884 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":"source/mslite-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"866127f93b2d238edf7ec96743d0e26c1d7802838f2e6b593bc754d51a8f09c5"}},{"ruleId":"R3","level":"warning","message":{"text":"source/tflite-schema.js: 3422 lines of code: source/tflite-schema.js has 3422 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":"source/tflite-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc79d867e16580c3bcc6a2538bfb0467ba0e1e81af4744710c4cc99647f8add"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/tablegen.js: 3374 lines of code: tools/tablegen.js has 3374 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":"tools/tablegen.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8414a0f14b73c5faa81018dd886fbb83c85228753efaf97945049e9589b471d6"}},{"ruleId":"R3","level":"warning","message":{"text":"source/circle-schema.js: 3112 lines of code: source/circle-schema.js has 3112 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":"source/circle-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d068318745c481ab4707a4ac628d6404a4a4c2e8dbadbb1682407c7852d3515e"}},{"ruleId":"R3","level":"warning","message":{"text":"source/mnn-schema.js: 3016 lines of code: source/mnn-schema.js has 3016 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":"source/mnn-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec005315b31697b3c5e052f7c41e8177623375a950c8064a3f6f205a4dff142"}},{"ruleId":"R3","level":"warning","message":{"text":"source/onnx.js: 2711 lines of code: source/onnx.js has 2711 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":"source/onnx.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"176b15d00d79d4088573552eccb2fd11f40be1eaa9c1ba9e4ff814da4ff6e339"}},{"ruleId":"R3","level":"warning","message":{"text":"source/pytorch.js: 2683 lines of code: source/pytorch.js has 2683 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":"source/pytorch.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dea809a3a822f82cb51cdc98a33629ec535ebd534a45f33a22be1d25e7387af"}},{"ruleId":"R3","level":"warning","message":{"text":"source/armnn-schema.js: 2643 lines of code: source/armnn-schema.js has 2643 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":"source/armnn-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4668b91bee988f5fab747d666aa185fdf96fd4a65ef248fcb240fbaf21402f"}},{"ruleId":"R3","level":"warning","message":{"text":"source/onnx-proto.js: 2540 lines of code: source/onnx-proto.js has 2540 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":"source/onnx-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8821159c3503f2da500e4f5e2143f515367e67522e29a479818a404d726e6a16"}},{"ruleId":"R3","level":"warning","message":{"text":"source/dagre.js: 2396 lines of code: source/dagre.js has 2396 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":"source/dagre.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd292dee49d921fcf2b87c698ec6ebef2db6b68ef7ecd48618cf37e7b5e2fda"}},{"ruleId":"R3","level":"warning","message":{"text":"source/tf.js: 2147 lines of code: source/tf.js has 2147 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":"source/tf.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26427329e38b32b95e4b8ff2f2f674d6044fa9731c19ef9b5b5ffab7b82ca110"}},{"ruleId":"R3","level":"warning","message":{"text":"source/kmodel.js: 2136 lines of code: source/kmodel.js has 2136 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":"source/kmodel.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ea43bf15668ab9df37b57806401ed08c198027dc353e17f7bb73cc1ed87f94"}},{"ruleId":"R3","level":"warning","message":{"text":"source/megengine-schema.js: 2074 lines of code: source/megengine-schema.js has 2074 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":"source/megengine-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa4875b35466992d657ea716eb8f914b33fac18735b757c565d356d10152f0c"}},{"ruleId":"R3","level":"warning","message":{"text":"source/mlnet.js: 2039 lines of code: source/mlnet.js has 2039 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":"source/mlnet.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"947e5a8703cfd76f55cfe940af63a30297c7df6655793c13e5ba7c300649ed95"}},{"ruleId":"R3","level":"warning","message":{"text":"source/tosa-schema.js: 1923 lines of code: source/tosa-schema.js has 1923 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":"source/tosa-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2693d8dedd42b694eeb58f81fb09a2f82a91a9a9ca839407c358a282142677c"}},{"ruleId":"R3","level":"warning","message":{"text":"source/hdf5.js: 1691 lines of code: source/hdf5.js has 1691 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":"source/hdf5.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1409afa52ed1af12623511282bb241c955d12ad099c84c10eac7a22b97ef23d1"}},{"ruleId":"R3","level":"warning","message":{"text":"source/caffe2-proto.js: 1644 lines of code: source/caffe2-proto.js has 1644 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":"source/caffe2-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e535868556443b7007e545b76a4fdae9b95225ae3942b8e1efa887bc3a5759"}},{"ruleId":"R3","level":"warning","message":{"text":"source/xml.js: 1583 lines of code: source/xml.js has 1583 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":"source/xml.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91e3999218d1ad4b59631fca61c7abeac7eebdb510a65c5965a4392d2af582d"}},{"ruleId":"R3","level":"warning","message":{"text":"source/paddle-proto.js: 1548 lines of code: source/paddle-proto.js has 1548 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":"source/paddle-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2fcdb94e6baff0f08e98a233d6fb3a717981ebe9a49bc668a112aa69bf4450"}},{"ruleId":"R3","level":"warning","message":{"text":"source/xmodel-proto.js: 1503 lines of code: source/xmodel-proto.js has 1503 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":"source/xmodel-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7b67aff692b4f679745188f6c993fe7d2b6b179c9f233e61595ebf41f79c22"}},{"ruleId":"R3","level":"warning","message":{"text":"source/coreml.js: 1496 lines of code: source/coreml.js has 1496 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":"source/coreml.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d426d3be3c4e377be7b8a4ee9cce01b3e06c819aebd71389e7d155424233496"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/protoc.js: 1481 lines of code: tools/protoc.js has 1481 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":"tools/protoc.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d6ef4895f0c9cca1ec592884bfb83f2c4fafcefddcb306cc21b06f6c1f81cd"}},{"ruleId":"R3","level":"warning","message":{"text":"source/keras.js: 1445 lines of code: source/keras.js has 1445 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":"source/keras.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bbc3a7f01e5fe2e44738b83450267af611274fcad54b1c5d95530416659059"}},{"ruleId":"R3","level":"warning","message":{"text":"source/base.js: 1406 lines of code: source/base.js has 1406 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":"source/base.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32afc399b2f9908176a827f1ef4e9f93185bd06f8f05c72c96f18153915a95fa"}},{"ruleId":"R3","level":"warning","message":{"text":"source/gguf.js: 1393 lines of code: source/gguf.js has 1393 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":"source/gguf.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f039c2737368620762691025ece62785c9fe5345c8f93c81c0eaef28e91808"}},{"ruleId":"R3","level":"warning","message":{"text":"source/mindir-proto.js: 1384 lines of code: source/mindir-proto.js has 1384 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":"source/mindir-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca2c79c472c770f5aedc5debc1e846c51e5ad7b65f933ddcc889b69f06d5178"}},{"ruleId":"R3","level":"warning","message":{"text":"source/paddle.js: 1349 lines of code: source/paddle.js has 1349 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":"source/paddle.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad6a34503bd850897717e565aba723892583aaa94626553e82abe8b9d16d83e"}},{"ruleId":"R3","level":"warning","message":{"text":"source/protobuf.js: 1300 lines of code: source/protobuf.js has 1300 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":"source/protobuf.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0e23e9ebe6ac37718bde2aaf46f9230fdaf506fda11397ee5e2d79322c0bf3"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/flatc.js: 1293 lines of code: tools/flatc.js has 1293 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":"tools/flatc.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b21d93b2149dc5d5e317f41ae2cecb191582bd0c0e6e78f2ac9c264e809a3b"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/mlir-script.js: 1263 lines of code: tools/mlir-script.js has 1263 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":"tools/mlir-script.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7daf90a0c1b3af77705d63c9721f4c582699ed17bfcd537df0ba196886e80788"}},{"ruleId":"R3","level":"warning","message":{"text":"source/executorch-schema.js: 1262 lines of code: source/executorch-schema.js has 1262 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":"source/executorch-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"719873a06b8f431ac0aebbaa4ccb70d2fd7ea0fa6202409f1409183c5dc503a9"}},{"ruleId":"R3","level":"warning","message":{"text":"source/executorch.js: 1202 lines of code: source/executorch.js has 1202 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":"source/executorch.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85714af6910ba40fa10c9bfe5f4074f4836b77e556d3ef999d5f974be0bcc07b"}},{"ruleId":"R3","level":"warning","message":{"text":"source/ncnn.js: 1171 lines of code: source/ncnn.js has 1171 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":"source/ncnn.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e2ffa7b78894d0806644bf0d5a6554d5dfb56796082044146830761f5edfc4"}},{"ruleId":"R3","level":"warning","message":{"text":"source/cntk.js: 1067 lines of code: source/cntk.js has 1067 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":"source/cntk.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28eb4e7d2af4f56f712083870e5f8d185be21ce6bfeb35ea7e45ae3fbd9a5c0b"}},{"ruleId":"R3","level":"warning","message":{"text":"source/app.js: 1021 lines of code: source/app.js has 1021 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":"source/app.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01dc4e256be83f351dbf95a6f4978fd19e3ed2a47026455ea9b5364dfccfe0e"}},{"ruleId":"R3","level":"warning","message":{"text":"source/grapher.js: 1008 lines of code: source/grapher.js has 1008 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":"source/grapher.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c23340e0a0db8eaba65f30d2d4f8f335c7ef07d4b7229c197b00d5a5d92de70"}},{"ruleId":"R3","level":"warning","message":{"text":"source/om-proto.js: 993 lines of code: source/om-proto.js has 993 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":"source/om-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57041065243c9af7cb149818f1f528c5c67406e0bd77552b39206ace146179fa"}},{"ruleId":"R3","level":"warning","message":{"text":"source/darknet.js: 984 lines of code: source/darknet.js has 984 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":"source/darknet.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"536fb37ba4b62ed391c71dd9d408cdb23c96afed088cff71873c2ecd12c0a27d"}},{"ruleId":"R3","level":"warning","message":{"text":"source/litertlm-proto.js: 984 lines of code: source/litertlm-proto.js has 984 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":"source/litertlm-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d86dbf9ef50114d44d576d7725eb2755f20e98c7a9506b5144abaf4eda57d0"}},{"ruleId":"R3","level":"warning","message":{"text":"source/uff-proto.js: 880 lines of code: source/uff-proto.js has 880 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":"source/uff-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3814ef824ee7ee0685b0441f2310c9a28310d73e92b7bb04e18d3e6fa1a0cf"}},{"ruleId":"R3","level":"warning","message":{"text":"source/torch.js: 868 lines of code: source/torch.js has 868 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":"source/torch.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca0bfb8a2cb9c3dd951fab1869fb73e9891458ff0d5aad2cb349a643fc3b73b"}},{"ruleId":"R3","level":"warning","message":{"text":"source/pytorch-proto.js: 866 lines of code: source/pytorch-proto.js has 866 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":"source/pytorch-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c50aa8df7395d3b1b28ed8f5da4fedcd933e8db74f7aeb37bdb52e33d171f65"}},{"ruleId":"R3","level":"warning","message":{"text":"source/zip.js: 851 lines of code: source/zip.js has 851 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":"source/zip.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"221d99d163ab1c5686e40dce6e7e63948e89fd248300b00478b7c0d81277e274"}},{"ruleId":"R3","level":"warning","message":{"text":"source/browser.js: 848 lines of code: source/browser.js has 848 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":"source/browser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b578e22fa631daa7f6c94662d8500ee025bd6f75bdff054e00cd7a79e390ed3f"}},{"ruleId":"R3","level":"warning","message":{"text":"source/openvino.js: 839 lines of code: source/openvino.js has 839 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":"source/openvino.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d48641364f8d638a7527b5feb1e60c8ba08497d401dfe4ef6cbb5e98b1d018"}},{"ruleId":"R3","level":"warning","message":{"text":"source/mxnet.js: 776 lines of code: source/mxnet.js has 776 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":"source/mxnet.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1686b9067d7990280b71003e1d595cc04ec91db748c3bb461725465d8030238d"}},{"ruleId":"R3","level":"warning","message":{"text":"source/om.js: 771 lines of code: source/om.js has 771 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":"source/om.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb759b5f962b1b42609b25be666f473f1f3f7289aa49cb4f9596a82d8805d2f1"}},{"ruleId":"R3","level":"warning","message":{"text":"package.js: 768 lines of code: package.js has 768 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":"package.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb7095df8c679e6e08fee7a7b5b9e447f9aed3fd9925b23e53a5afc354b0f24"}},{"ruleId":"R3","level":"warning","message":{"text":"source/acuity.js: 664 lines of code: source/acuity.js has 664 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":"source/acuity.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e03cd87b71db3ffbd5f15498c2b16044321777c22876bb54c08383be93a4320"}},{"ruleId":"R3","level":"warning","message":{"text":"source/desktop.mjs: 648 lines of code: source/desktop.mjs has 648 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":"source/desktop.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"338b8ae1968d519ea3553cc046aee3f9d0b52f80ec21a1df68019235f35d8584"}},{"ruleId":"R3","level":"warning","message":{"text":"source/dlc.js: 642 lines of code: source/dlc.js has 642 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":"source/dlc.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f904dd5c6e3d236cbf6964ba5535fff98d9d3e156949753882c98fa82df8f0b"}},{"ruleId":"R3","level":"warning","message":{"text":"source/tengine.js: 636 lines of code: source/tengine.js has 636 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":"source/tengine.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5faa40f5f63eb8a317df10c3c482e170507eee1dfb7ffe9bbae5b7fda076a66"}},{"ruleId":"R3","level":"warning","message":{"text":"source/rknn.js: 632 lines of code: source/rknn.js has 632 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":"source/rknn.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9404133e3be0b5844e4dbc7672e8400d013cc0d79f6e6d1c63a311bd26b7bab"}},{"ruleId":"R3","level":"warning","message":{"text":"source/dot.js: 614 lines of code: source/dot.js has 614 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":"source/dot.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"645b76b8a9aaaf86774994224eaea39c3fdce90dfac2538890d07ff187342a60"}},{"ruleId":"R3","level":"warning","message":{"text":"source/megengine.js: 605 lines of code: source/megengine.js has 605 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":"source/megengine.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ec921248a7d74d74307fd3a737b7166340dfbb56aa8314a9f9fddc25dbe5b9"}},{"ruleId":"R3","level":"warning","message":{"text":"source/tnn.js: 598 lines of code: source/tnn.js has 598 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":"source/tnn.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6a116e4d6c4f3be9895389ebd1b31e1b24202d88f1832c0bc3d237de40c43f"}},{"ruleId":"R3","level":"warning","message":{"text":"source/bigdl-proto.js: 578 lines of code: source/bigdl-proto.js has 578 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":"source/bigdl-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e467c40e96fda16172f2caed0baedb49d931a7ead69741f4aa5c4b34d5f6d5f6"}},{"ruleId":"R3","level":"warning","message":{"text":"source/json.js: 576 lines of code: source/json.js has 576 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":"source/json.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdcafd399219db9e0367e823fbd4abe397aa1810de49dca8c9498665d5c5d31"}},{"ruleId":"R3","level":"warning","message":{"text":"source/caffe.js: 558 lines of code: source/caffe.js has 558 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":"source/caffe.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfdeb092db21e585d69d833284e9fe05ae482093303119a537ddcc48e00257f"}},{"ruleId":"R3","level":"warning","message":{"text":"source/sentencepiece-proto.js: 551 lines of code: source/sentencepiece-proto.js has 551 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":"source/sentencepiece-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9733f4f3e73902c6b6a812e7f438f24f53517dc33d73c918ff2ca6232ba8461c"}},{"ruleId":"R3","level":"warning","message":{"text":"source/tflite.js: 529 lines of code: source/tflite.js has 529 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":"source/tflite.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c562d7652ab44ba9ee7206b69bd6dfd1ffb78a845ced45e2273a29f7d0b8eaa"}},{"ruleId":"R3","level":"warning","message":{"text":"source/circle.js: 517 lines of code: source/circle.js has 517 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":"source/circle.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16eb3355d700665d6af93eb36a0519a50ff9615bfd24ab2af984f4f90f434169"}},{"ruleId":"R3","level":"warning","message":{"text":"source/caffe2.js: 468 lines of code: source/caffe2.js has 468 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":"source/caffe2.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca0c09080c55cc3134665f91ed5d2b1dd91c670846142e2942399bd62a8fa6c"}},{"ruleId":"R3","level":"warning","message":{"text":"source/flatbuffers.js: 452 lines of code: source/flatbuffers.js has 452 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":"source/flatbuffers.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b010724da86306d6f28dddb59f429b3878937210f66adcad3ca8a5864b4b50"}},{"ruleId":"R3","level":"warning","message":{"text":"source/espresso.js: 428 lines of code: source/espresso.js has 428 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":"source/espresso.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c722416e56263bd88aa038e2fcc9f178b6d557b7d921613ece6a168b392482"}},{"ruleId":"R3","level":"warning","message":{"text":"source/paddle-schema.js: 428 lines of code: source/paddle-schema.js has 428 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":"source/paddle-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f630779bf49839e054fae40233ae74c76dd026ab8a82bd789baa35d7eb0385"}},{"ruleId":"R3","level":"warning","message":{"text":"source/pickle.js: 403 lines of code: source/pickle.js has 403 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":"source/pickle.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a431a6faac47ae2892ca31dc91f4bed6f44b0f9ed33df789d3513b94641e5ade"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlir.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8149e9d984c5ef26b9dc08ee895d7c59eccd31bec65d27683f12bda22a74679"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b62610562dcfb6fb6322a4a487c452f7208186d33c9da8036fc61ce65ca443"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"221b178ba9a0cdef71865df292309f21952c55ed8e87c1477b59d786fc1f352e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/nnabla-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"225aeed0afeb357036c401991090526b526a36d96394e844b7dbcbcf1ff44308"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f10e3ecaaf9a11947c26deb0b730736c0e0ceb4661827134e318daae3fbba2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mslite-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fd0ea713a094e2442e030cb39ae0a9743c5824e4fe9a2f2bb4f7b29244a715"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tflite-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"488f827ccd64e9c3c1359a82a04fd97be52787d6d579e34e5b9e5a8f278e959d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/circle-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a6b5aa09733505580a4073734de03b4a6aa06a0ddafcfdf30b4ffb7bcb8ec1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mnn-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71212bc1ce3126e3d06da6e04384b425c26a260c837b40815dae27230ceca9df"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/armnn-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e146f2c3502b7bcac68f13dc990342f097ca5b4c70f3090c16d5abb1dba0e5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04b2e579190d895904d59ab1a3b096c80c6275427c218eee51a25d54deb13c0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f49ec3eaf0d74b84d72e61b913f2412186a7890a062b658b6d55965975a2f4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9988add58a60d6e67a7a4538a5b599d6490bf53ba9e8caf8bb4209e07c21efdb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/megengine-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f629e63f9ce89a7714858bf4f0d6883cd478c222ceee3b321d60adf0fc0184"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mlnet.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"757479c9f1e1a952d250da7a0a4d10a0e246d8b54bd222f2f0fa025410366be6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tosa-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef7a36aeffed456b23014fa136473307320da7099af0ac0f42fd65f295ebddc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/kmodel.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17433b718118a84ae1df4804c137b8fa674034125f25c474ff49ab9926d070a3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e8c4c7c9f10c4167cbb4d6490e4644fd6e9ef0fc7d0ab72bf17b752038f106"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe2-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c207c3e28aa8a8c3a44f9e3cc58d0c4f36de83f01af017ff1006a03d2ca0138"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00f9231f2e6c46100d65032dafd75409f7053272e5f33037eca121703c908c2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/xmodel-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1cd6dbd08a8de6498ae0018005fa749cba4839c5e6492827b23368fb154b8b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/coreml.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7524ca0d3ecd48b6a74cb33195803c5539ea5839a2c4d9dba7d59ca1a51a962"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/executorch-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd3a8d666a3c0ff1aaee670406de398ea78a8de5708446e5e5acf798a4f2c6e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/keras.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16065b9b1942fb2bab12fb2b229cf4d0cb4c4064b7797c3f83503efbb75c7b0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mindir-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9cece73d949a0c3a3b83800dfe2b2e891516532aa0c6572e9fda3615eeb08f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/gguf.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"639d87fefd5835e5754d6b4018736aaeca30cfc4eb5f333e55a861fe47845364"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"373b4260554ed420506143b88139fd979e2ecfb30b6441818d605db0bb717570"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/executorch.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce7c08194d520416ba2d5dc75681c1d09cba4b9c52ac2c129f60a8e7770cc30"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/ncnn.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0438edcd09d7d1fb114961b2a74a5e4ea4f30b957e3a0ec4b8ccdc8e78f26a46"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/cntk.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b1f4799a9feebab4ab2dc0fee81678d2d4c6a9dfe341d955533f5cc050577c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/litertlm-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6471a7aee28ec13f21477b4598ec0eef7b2d6fa56fa3d26c7be9049ffedc280d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/om-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a493d91a3d3f9c88f6590ef7a90642a3358fd985e3703a8d8da8f3129fc190"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/darknet.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbaa1938a4e33fdc22ef78241df17a48dc2315e23893dbc54fecb7a89c215f4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2746f69573e021e8193978db32424f91934028b0b3b7b2ff0a086cff3ceff4a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/uff-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc35ed2bf06717517c5c7665c9826f6f64d5b0f493814b98a944c3a62e6ed25b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/torch.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2026d13ed4030eb63a6c9576ef886a64c8cc4f828117d1a2e8a6f7add62b20f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/browser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"223dc2a9d33b4ee3d382df2745cd4ac25adf682cb3d9a4e08f8ddc601f845cf2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/openvino.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8293b6bf8532d6e3f52fb4e5333481187cf42d2e541a1ceaf6ef620fe9fad9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/om.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f3e41eed6a15b62e5e66cedcd61dc21c4f1f965767717082ca023ed6c249ee"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mxnet.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0dfce484090be56e085b3422a9846ee5ebf791b3a7a638f40f08343ecb068a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/acuity.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cc826f181f56f1cc6c4ef51c0529f05aabe27755a0bdef0c3280019b3bfba3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/desktop.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f81c3f36c101e7b4927134ae8d20a6a74e0c69e9a4d508ea1efdfe327bbeea"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tengine.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eca7fdedc12d7470137f1191994ee588fe65d175e0ab759d3d1611cf571d473"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dlc.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c635fddb5d8fafe702d88d2714f74b61b56ac5aafc762cafc8cf5e885de3d3ad"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/rknn.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5010f362448d92098686fccf0c0bcc222184430b3330cb30a393c68d29bca2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dot.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e7c25625c0876ba670780d6f01caac21816b0392b91c9ea9cf2737d64549df"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/megengine.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dfda712ed0ef0c1a416920ec12091b4d364c73f24e5ac416fc3509cdada1c0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tnn.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"463ef9704551ac466f3110e07c3ac75285602a22a4880d327e91531d66020faf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/bigdl-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"265a747c7e6b479ad392ab206d8fd8b7cf4ab6aec9f8f1cd2a78c80316fcb9d5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49d445bea2ebcfa6659e6a84aac1b3908fbb7a5bae56f698886af6eadca9e1a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/sentencepiece-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3f619eb7354aa0b9554aa10565fa910a9bbc0488644787ea2bb09338bec28b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tflite.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e38d16d1b579459b04b90e8d9fc9b3f3f06d4a0e4fb0a27dffc50a07b85383"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/circle.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc860318e38eee59e281bc2ca2649a1a8bee62686f81ddf6a461cc57fd361311"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/paddle-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6e3e8a34a127c90b7433542495fd31b8a0ca02327411b68d7896439370ad7f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/caffe2.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdaa456104e764e1ea1431fcb92793f17e68908ce101173c0a1bc638c27aca6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/espresso.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40c82932a1af2326e793313e9015a8d403be8fceaa9b2156960ce6a0c716273"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/barracuda.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d879dec4c87966e1019cb89ef83ce2bb0d5d18b55045331b9c213c9d3c422b5a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onnx-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63d630a68bacd0ca7f492e550592729da5d00346d8d7cb23ed4af0ea008bddb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pickle.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"859a35ba52857dd5d54ff3515d52c1187a04ecbd2f920650843352b429b63d15"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dl4j.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5365519f6ad34656500706e90e04439a5b21a299bc093676ad7d8f8253ae0fbf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tosa.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6c0ae38c47dca202d734f961f1cd7a170ebf5c849f82d67c73e2fe467cac9b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/espdl.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf4a0624ade2501e8a18a47bb44b5fcc03b461c3974ea6f621ea17e5aa959f9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mnn.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c4d08dd4db3361bf956131b1e38e8bd48a194414629c8bb72c49e902652db7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tvm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"472d22e5c420a129ec2a6bb78a134d1086b51892cd922c6d6ab1cfa151e726e9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/xmodel.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"928447b8c66795c50189b066b28624a9a22696d1955a30f83ccf075122c9ed98"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dnn-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2bf47c02a0a76214c5d8cce64338d6a5cb433b9cd7bba4f9b1c7492d84feac"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/hailo.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2231b729ab4e86dbc1b92d0da9fa7492a3aa79ea216595147fa7d71f176049"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/pytorch-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5198206a5cb7e5a91d397083d6b4939a85e1037f821e5c184f795be472f79fe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/cntk-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9dee0415788464a8c5832a58548f9698fc27c28aab86153ee38625f35fa9fb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/espdl-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1fab19e202b21caacce615c645f4eefd9239b101e5f86f9b0f945a1fa43027"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mslite.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04cf8ff408c5a350ea703145e02cd779a9fa48116c1444a50c4cae910e79673"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/qnn.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b237a1fe4d74f225117a75c51edf13af1caea1836a5dab6a08f0f731b17f8c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/bigdl.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f5ec3a5d19bfc7e72b0fa454f88f50cf708ac2e57b565f6c24bd2c6749fa8b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/nnabla.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"797216a5ca3639d911adce8b07dade383f746db7d9966387257cc954539706e5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/armnn.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a97e6b2a560849dfe1e278c66c2214c8543647d6113eb52c963631ab8f61f8c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/sklearn.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb421bb9360b707bdb4d7f80688439cf526e8968a6fcaa2b110c828853c52d7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/onednn.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcddfaa85e841812f79831bb4e175555569a66b1fb544ebcb192172468dc6faf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mindir.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aed665d4f2cc3c6870f6ebfd47b86b4ada89985a1c500199865d67ae353fd7b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/mediapipe.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"040f837d742b42dce7f9579de5f29983c3d7704fb90915d3adc3cfcdd0df65b7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dlc-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be5f1c9c4389cd6fe1c91240370c02b1d4dfbabe9df54ae3aab08f031b1067e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/uff.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f93bbe0a09369e83d156f9463acf4671a0c611f382ebf9119a8da3d31c03ccd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/numpy.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6accfb9f664895075f25936b8b769c86c49887ce6b818c89262f41df5ca61fab"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/catboost-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdf274b03d2e1593cb6e76ed6c4c44ab6e086fe471c762cd743a0b3ccd16bfc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/rknn-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"089fdcadeb31dbe03d6a0043061b775de7a17263ca6302dac4b69480a0c33af1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/weka.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4facc1d8578ffbef08c9b34c57e4e00a0b950b51262aa81befb10b6884839ab2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/dnn.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9cf01eee2ba451fab127d1e59e259de09d3684d2f47a67dea63a0501d0d47b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/safetensors.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b69744c906d7aaf8ae1223187b4b4f3b509d6f7cf91125e3e44ee5e3b9b5500"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/jax-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef7fc5137350c0eeab4fe915fb7bcd82ccb7ec52e7f7d70412d4a908b40757b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/flax.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cd9d4bf694d9535966ecad5107033e8b7721a3386eb070a3e8dd1b9810147e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/litertlm-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12f230ccd79d10b7fa4381c8055a9d53a82809934fd4693ddaf178e22da46d3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/kann.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46efcfab61a15fb49fa932b1e8da834b841b0facf7076cc91bcd6bc3ee7143e0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tensorrt.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aaafed5868f999eaf224c5582af22693f21f32284e5a9480d8f7558f22487a7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/flexbuffers.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee73b2572d91ec1af355ac0023164f1ab3dc2d3a7cab18ae630bd3c4932ac42"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/transformers.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf95c62e5c3b434e51f0db9c294a774061aaedf2e75d452d4b14781f55e5815"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/lasagne.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fa7556ea808ab66576b2435ec76bf8f29e2d8ea997723b2849aaedc4ebecfa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/catboost.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b0d9401c5c4d1d03363a8ab56c6659332198ef499166ee10e4017cd882acab"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/keras-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"971487de374f043d8dfd609317b22f176f1484e24122c2cfa5f8ba63ae007e1d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/message.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0771da2ea15d9fbba1d44d32aedb56a53454c1457e8368405d9341791ad10f75"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/hickle.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c792588383c0f62246206a643d1e96e5db8d3950d58d7543ac55c187bf635e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/xgboost.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc6c309bd0abeb46482ae4fb6d749008b361321e383c72458c5de65371c6b7c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/lightgbm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"054402d58ed854b9a313ab7cef15cc253fbec6aef2511361fbcd3f70c6cd86db"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/jax.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05dab3528bb29fb037e0c052b3222cba91a5d7689a70f507149bc2ac20f4e12f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/litertlm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa8fc825d8032b218d4ada942835be758786eb180d5512159ec6227894049c5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/kann-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec3abfb8aae7a40da9c002b2a22c7614063a6c5c8be605e5d8a41cad3c3e352"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/sentencepiece.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9223beedba330b8c0e8ca8bed38dbc443d7ddc0833e2139e0d7c700b1884e5d9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/nnef.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2a258075e8ee3338a9181a540d6c441ac66e6401251727091760e1d19dade3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/flux.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"551dd3c6e47257a2aa9b3f7af0a678588d88d1cc0346d14d765a7bc613e9634b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/imgdnn.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb501b9bacfb936da403dad4e794c74dcffc906614804a2e1aae5e7bf9a45730"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/worker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"428bb570a627865fe9b81ddcd94a05b99dc70205411d6ab2189e3a76e34db64c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/nnc.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"421ee7adef33fb3391fd426f8528feecb5ea8296a7b53017c868e301840829f6"}},{"ruleId":"R6","level":"warning","message":{"text":"No typecheck script: test \u2713 \u00B7 lint \u2713 \u00B7 typecheck \u2717 \u2014 read from this repository\u0027s package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: \u0060test\u0060 for the suite, \u0060lint\u0060 or \u0060prettier\u0060 for linting, \u0060typecheck\u0060/\u0060type-check\u0060/\u0060tsc\u0060 for type checking. \u2717 therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline \u2014 a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A \u2713 means the wiring is DECLARED \u2014 a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"912edc7f1fd20bf80ef68c3293e3048565115e48707dc5f9d492201598794658"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18441 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/coreml-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6bd646b9241c4c700a1d7d9152011db77a1fc1a02cae865081c51ea2db7224"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~13369 LoC): no import path from any entry point (79 application, 2 tooling, 8 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (tools/tf-script.js) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/tf-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e187b725cd9778766c7cab966b28cdc33d6f1098dee79f1a309769750523acef"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12407 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/nnabla-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7443f5b74cb89ec5723f6a1a47c4d4ef7aca39433bc062c727874b58770fc55c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5221 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/caffe-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb48654ca3ec21fad4cb7190d63b6180c428af96ccb17fe228401fa998cbaec2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~4600 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/mslite-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef51d5b51fea64f0d42cc049e2a66b8cd411f9836dc8c75c86fcaea2a13c210"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3675 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/circle-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b041fc676f1b6301d341dbc31f252cf32a81bb1b5e6a27c7566400f0f87fc1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3495 LoC): no import path from any entry point (79 application, 2 tooling, 8 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (tools/mlir-script.js) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/tablegen.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd386b765271b735b9d4c7dc6576227ef9c89d93402c360a010f82e342803533"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3418 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/mnn-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb2acd5eef2e71b64580ab5eb1101d3c9f26c36930f4ab92ab453569d7af5df"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3085 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/armnn-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"933b3dcdf49adea19a66b4b4608a591281bd5c446c21a5580ac7ab183290c7c5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~2429 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/megengine-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b46e5ea202b1f9785f54a25cf0a2557496cbdd4302a9242486e47e336656c2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~2282 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/tosa-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72df6ca504f9f9e1ac3b7257c443302b269767c2dece6f871a217b715e69d763"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1751 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/caffe2-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecf6f55662de21bf26ad49c213f20bb9b8d0e5083ee899fcd31f2edd8c0629b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1651 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/paddle-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e870264a9f91818203e4ee2f79f18f87ed940fa6080c5a26bd1f460ff24c1d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1636 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/xmodel-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d3a225630636ae171066c725aee15e1c6e2b5d631440530a012e556d773d15"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1530 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/executorch-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15add85342a8a6bcdac82ce0e4883510d1167ae081c03613089810f8daf84e23"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1465 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/mindir-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b211c5da6ebabc046a3d965fdc955d87c8b84b58d6497b56d45c32f6d6e66d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1275 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"tools/mlir-script.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"830fd367b625154cae5b6caf7b07c4ecc24436dff895358dda7abb1a36386abd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1057 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/litertlm-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e07b4ae54ed81612a7d934783db8eb34bb11cc0d45af5480848058d26173d95"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1055 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/om-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4ef96875692be2162bf8c8524629d03262d2ad6d3dc20080314e94fa08cd9b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~976 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/pytorch-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0018720447ec76aa8f546e81e432d222a4cd562083629e11dc5f14b9a67a89"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~958 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/uff-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d8cbcfbae576c4bc87f9ca74e83f49b04ce8ff56f635e2498c9f974bbda8fe"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~916 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/browser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"271c86331274c7697496042be9af3ec28626782a92193b0a121a9755bd95ba4c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~630 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/bigdl-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74eb8a9ebb6313540ac92c1fbb81c66da76608107d27d982397f12f3e4d75b6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~572 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/sentencepiece-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d5319dfc1e137ca2a12fce3ee4b79753d08b94778e5fc09ea81d265f1a1bf0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~522 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/paddle-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"529e05dfefcfaec56c8745b89054eeb74427bd4d3e3a974f15e4cb76eedb7f34"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~366 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"tools/tf-script.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3cfd2cb5b2f56444304738113fe66c0fa55493c42d7b6f3a6c86d5faa873fc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~353 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/dnn-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4713433e208628a595e72c4388f9a5b95de9b9e6378791c43d6534cb0bdc23"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~350 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/pytorch-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8b7d6b1e3f6f0d10cccf04c2a1cbcfbdc8aceacc3d35ce91625d3d90993767"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~346 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/cntk-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af338d0f9b6c21da5596bb8b9109b7060cb3b203baeffc01667869f40bc8d7c7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~329 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/espdl-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d52f85d67f415fcfc222443ca4c402ab11361bf39bc1d722e6df651a9a44bf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~310 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"tools/gguf-script.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0246cd9ef632eb8ddc2c64056b0a9666ef76f8a7f2a972d1fa8915088b7fefdc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~283 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/dlc-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb9332078d23c49d243c0b474d8d394802d43925d9c33963b0c6d1ca8a48490"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~266 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/catboost-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e923c590424f4837d30b424d3b4a521983be463d14f8d6ad5e0576f354d7cc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~258 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/rknn-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86db8a10366dbfa2e4cafe0b1c6a77cf10ab7d98e1131e216371e5c5e95430f5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~227 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/jax-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a7eece62beb1aa92c05556e6dceb8f9e76900d3e72b09dcb9463ba50d72f39"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~206 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/litertlm-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f450693a4d1075b491f947d2a22e45944b12a65a27460802c974bb7486ddaa0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~187 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"tools/tosa-script.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11974f2a2b2b9a929efd62092fd71cebc90add9946aa814e6ee2714260a167fb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~174 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/keras-proto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10293ca5bd0fe345e6618b0d32fdf8fdc2d1cac7799aaa1121314d079a3f2f40"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~113 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"tools/megengine-script.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee84000581fec1a72e6e6583df7f3244897cebe78e4f330623ee64d70296487d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~101 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/kann-schema.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a539132a7e862e4a491b1eea4be250049f27c7e56cc2ca46b6a107a11ce57a5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~87 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"tools/circle-script.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bec055fa3956e59108a0614131c21f95de9f6ce24822d9842b3e6feb953ccb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~87 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"tools/tflite-script.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d602e92bc2d7c19da7dfebe4d1ba242974e7f97708e5dfaeb291c7ca99413c17"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~83 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"tools/mslite-script.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96e5be99bd7bce51a43ec3b7d13996ef9295ca0308fffdcfbaf2478bf7a58be"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~77 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"tools/espdl-script.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e11f98b0037eb5c3fb3e26cc7ae05978a2dc286ba7daa24e958060fc817ab9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"source/nnc.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e301fa0fdecfb6799fcc5b1fc4ada6ad3bb27a82f363a3a6f2028193578f351"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (79 application, 2 tooling, 8 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":"tools/caffe-script.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"807b9f05736df92388d41b3cb8572e90375e0ac0bab72676f0f81fe4232b9e4b"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@electron/notarize\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"71a207af01182d14e0761f292564435b506a1de2e86738b344fc6ea4e68abe70"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!name \u0026\u0026 initializer \u0026\u0026 initializer.name\u0060 appears character-identically in 2 files \u2014 source/mxnet.js, source/tvm.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":"source/mxnet.js"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d7e38daa30a0796c3e1c5282988f6f1100c85101f9a67d73bba11f8f3386c4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!tags.has(key) || tags.get(key) === value\u0060 appears character-identically in 2 files \u2014 source/caffe2.js, source/onnx.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":"source/caffe2.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"739992fefc6ab98c94d89b3756ec428a2f749fff98251f88e5f23675b7a61313"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!this._buffer || length !== this._buffer.length\u0060 appears character-identically in 2 files \u2014 source/browser.js, source/node.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":"source/browser.js"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f423a6ad033daa1c96e8017b4b6a8b268b7c3af626a887559c8fbf6065d52ae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!this._buffer || this._position \u003C this._offset || this._position \u002B length \u003E this._offset \u002B this._buffer.length\u0060 appears character-identically in 3 files \u2014 source/browser.js, source/node.js, source/protobuf.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":"source/browser.js"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"727392325053702985875df0d7f627ab77d111bae61f85ce640f680c35e62e15"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!this._data || this._data.byteLength \u003C 4\u0060 appears character-identically in 2 files \u2014 source/circle.js, source/tflite.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":"source/circle.js"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cac097eb723711569274d6c986e9683b437c968fb3abcd65bc7cb3a728a99fd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!this.dimensions || this.dimensions.length === 0\u0060 appears character-identically in 9 files \u2014 source/armnn.js, source/circle.js, source/dnn.js, source/espdl.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":"source/armnn.js"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39e274e48468665118d9e29a3fe92d6b560ad9e1ab691289feb6cb0558c5987"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Array.isArray(this.dimensions) \u0026\u0026 this.dimensions.length \u003E 0\u0060 appears character-identically in 9 files \u2014 source/caffe2.js, source/coreml.js, source/dlc.js, source/espresso.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":"source/caffe2.js"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"929a9c3cc5828b937708ce2c5417292f1e1caf265bf776dca9906d5d33244682"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Array.isArray(this.type.outputs) \u0026\u0026 outputs.length === this.type.outputs.length\u0060 appears character-identically in 2 files \u2014 source/dlc.js, source/qnn.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":"source/dlc.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd36e058301035ee3801cbd017a1aa90cbe886f7021a2f30c5198ece03556e8c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Array.isArray(value) \u0026\u0026 Array.isArray(defaultValue)\u0060 appears character-identically in 5 files \u2014 source/caffe.js, source/cntk.js, source/mxnet.js, source/openvino.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":"source/caffe.js"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"b097b762aa6714ad11071617c734e7a9870441c06fe521cb0bf103031b25e44b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arg.type === \u0027def\u0027 \u0026\u0026 typeof arg.value === \u0027string\u0027\u0060 appears character-identically in 2 files \u2014 tools/mlir-script.js, tools/tablegen.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":"tools/mlir-script.js"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d9785bedc14c71b9148792cb2d1f526aedaca03a991567bd9a227c62ce996b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arg_node \u0026\u0026 (!arg_node.inputs || arg_node.inputs.length === 0) \u0026\u0026 (arg_node.outputs \u0026\u0026 arg_node.outputs.length === 1)\u0060 appears character-identically in 2 files \u2014 source/mxnet.js, source/tvm.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":"source/mxnet.js"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"d660a2b6a702b833b643ef55ea7b9f33858a4b9f8ee62b13969735e84943fafe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arg_node \u0026\u0026 arg_node.name \u0026\u0026 (!arg_node.inputs || arg_node.inputs.length === 0) \u0026\u0026 (arg_node.outputs \u0026\u0026 arg_node.outputs.length === 1)\u0060 appears character-identically in 2 files \u2014 source/mxnet.js, source/tvm.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":"source/mxnet.js"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5801913b4a8153e597d4e8893a9c9a4c9155c28ef5cd68f848e0817c1764ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060buffer \u0026\u0026 buffer.data \u0026\u0026 buffer.data.length \u003E 0\u0060 appears character-identically in 2 files \u2014 source/circle.js, source/tflite.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":"source/circle.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2ee23b805a53a542b4879b38f12cbc3f575c749b55e6adab017361378b2421"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060buffer \u0026\u0026 buffer.offset !== 0n \u0026\u0026 buffer.size !== 0n\u0060 appears character-identically in 2 files \u2014 source/circle.js, source/tflite.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":"source/circle.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bd13f61916bd2363ab3754f836f31cf420dd4912df98f01ba902f2f4f4943f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c !== \u0027 \u0027 \u0026\u0026 c !== \u0027\\n\u0027 \u0026\u0026 c !== \u0027\\r\u0027 \u0026\u0026 c !== \u0027\\t\u0027\u0060 appears character-identically in 2 files \u2014 source/json.js, source/xml.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":"source/json.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e96f501e47e665bf5311c5947bf12f5675eed75dabd144dafe104f98bd3c6ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060count \u003C 0 || count \u003E Math.floor((data.byteLength - 4) / 4)\u0060 appears character-identically in 2 files \u2014 source/circle.js, source/tflite.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":"source/circle.js"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"508ad627123a6141d0a81ee0b87c344a6588e1f5845b0d89885a56a28246d33b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dataType === \u0027string\u0027 || dataType === \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 source/flax.js, source/keras.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":"source/flax.js"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ee42d3be9601414f9953a77a1ba056d80a9303db4dea6a2622549a2af21fa4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060defaultValue.length \u003E 1 \u0026\u0026 defaultValue[defaultValue.length - 1] === null\u0060 appears character-identically in 3 files \u2014 source/cntk.js, source/mxnet.js, source/openvino.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":"source/cntk.js"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6ffd948a15555d018c26a3945741aaf452c52c785d6a3ad8a3f81e11e9d3c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entries instanceof Map \u0026\u0026 entries.size \u003E 0\u0060 appears character-identically in 3 files \u2014 source/mlnet.js, source/numpy.js, source/pytorch.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":"source/mlnet.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f902d2f99628ae06adced52efec8103cf2416590c3758b68dbb8c26fb74e74"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entries.length !== 1 \u0026\u0026 entries[0] !== \u0027version\u0027 \u0026\u0026 entries[1] !== 1\u0060 appears character-identically in 2 files \u2014 source/pickle.js, source/pytorch.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":"source/pickle.js"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb56182a8408cc15140fa1fdcad10c9568de3a9808b861c38f3db88627fbb7eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event instanceof window.ErrorEvent \u0026\u0026 event.error \u0026\u0026 event.error instanceof Error\u0060 appears character-identically in 2 files \u2014 source/browser.js, source/index.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":"source/browser.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"807bb20a3e992a203c78067335b551661ba7cf94ad1094e36c36f15ac80f7e85"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060id !== \u0027\u0027 || inputDef.option !== \u0027optional\u0027\u0060 appears character-identically in 3 files \u2014 source/caffe2.js, source/tengine.js, source/tnn.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":"source/caffe2.js"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cf2ac05f0e12b46dadd8e15d286b9c59e4cb7e980b5496ad40218d2ddc6c2f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inner === 2 \u0026\u0026 !Array.isArray(value) \u0026\u0026 Object(value) === (value) \u0026\u0026 Object.keys(value).length === 0\u0060 appears character-identically in 2 files \u2014 source/onnx.js, source/tf.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":"source/onnx.js"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92d7d6c146a469ed8f6bef3396327095da8852e865796cddd83d12a13c228d4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inputIndex \u003C inputs.length || inputDef.option !== \u0027optional\u0027\u0060 appears character-identically in 4 files \u2014 source/caffe.js, source/caffe2.js, source/tengine.js, source/tnn.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":"source/caffe.js"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"63be396afe50fa721853a3284f862803952f6f4b866b9d5300a502bd1796469e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_variable || (buffer \u0026\u0026 buffer.data \u0026\u0026 buffer.data.length \u003E 0) || (buffer \u0026\u0026 buffer.offset !== 0n \u0026\u0026 buffer.size !== 0n)\u0060 appears character-identically in 2 files \u2014 source/circle.js, source/tflite.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":"source/circle.js"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a8b15ba46f4067a2071181949e7e81539fa9c3b6ee114e300ec0cba6a33088"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060json \u0026\u0026 json.country \u0026\u0026 countries.indexOf(json.country) === -1\u0060 appears character-identically in 2 files \u2014 source/browser.js, source/desktop.mjs. 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":"source/browser.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fcb18d34f326fb1a565a441298679e13872e1d6191760e79110377576fa799"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.endsWith(\u0027moving_mean\u0027) || key.endsWith(\u0027moving_var\u0027)\u0060 appears character-identically in 2 files \u2014 source/mxnet.js, source/tvm.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":"source/mxnet.js"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8e09c009008e8969d900bca4044952eb2013b09c7d9b0d2a090769e2cf989c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name === \u0027fused_activation_function\u0027 \u0026\u0026 value\u0060 appears character-identically in 2 files \u2014 source/circle.js, source/tflite.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":"source/circle.js"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1c46b1a452c4a894bd51035e09063f5b4fd5f6da5824eef0d2e8ef7dc7a555"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.indexOf(\u0027.\u0027) === -1 \u0026\u0026 name.indexOf(\u0027|\u0027) !== -1\u0060 appears character-identically in 2 files \u2014 source/pickle.js, source/pytorch.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":"source/pickle.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff699384f78956601210df3485814875e4a834cc0c606074e65e2959a70cd23"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060named.length \u003E 0 \u0026\u0026 (named.length / entries.length) \u003E= 0.8\u0060 appears character-identically in 2 files \u2014 source/pickle.js, source/pytorch.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":"source/pickle.js"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc806132a89e4636ce251d646bac6a9d591a3ea4cc5b3a5c3753aa9fec396c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060obj \u0026\u0026 !Array.isArray(obj) \u0026\u0026 Object(obj) === obj\u0060 appears character-identically in 2 files \u2014 source/pickle.js, source/pytorch.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":"source/pickle.js"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"001f8a836df3fa2644111213fcf6d24b310644a6a8234b938ede7da645baf0d2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060obj \u0026\u0026 (obj.__class__ || obj === Object(obj))\u0060 appears character-identically in 3 files \u2014 source/pickle.js, source/pytorch.js, source/sklearn.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":"source/pickle.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5699d08d2acd65e31e524a1d539321531d283ed67d2bdadd03d79d201452c048"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060obj \u0026\u0026 Array.isArray(obj.dimensions) \u0026\u0026 Array.isArray(this.dimensions)\u0060 appears character-identically in 3 files \u2014 source/hailo.js, source/kmodel.js, source/om.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":"source/hailo.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d366cb88a92fb279d50aa087a193fb5fa9141eadc39173c84deda725b87e0472"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060obj \u0026\u0026 obj.__class__ \u0026\u0026 obj.__class__.__module__ \u0026\u0026 obj.__class__.__name__\u0060 appears character-identically in 4 files \u2014 source/catboost.js, source/pickle.js, source/pytorch.js, source/sklearn.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":"source/catboost.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"357229c824e46fda6134f20cd0b2c1a8c57d0218ab5167c671cf0f5ee1852687"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060obj \u0026\u0026 obj.subgraphs \u0026\u0026 obj.operator_codes\u0060 appears character-identically in 2 files \u2014 source/circle.js, source/tflite.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":"source/circle.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a919a7caa94d30138a48df0bf4302f64131c665a2ec4c88e1b9b4adea80ab3a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060obj \u0026\u0026 this.dataType === obj.dataType \u0026\u0026 this.shape \u0026\u0026 this.shape.equals(obj.shape)\u0060 appears character-identically in 8 files \u2014 source/coreml.js, source/espresso.js, source/hailo.js, source/kmodel.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":"source/coreml.js"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a3af5cca8fc837e95667eccc2358d43ce8f122daebb05366a5995485a1691d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060obj instanceof Map === false \u0026\u0026 obj \u0026\u0026 !Array.isArray(obj) \u0026\u0026 Object(obj) === obj\u0060 appears character-identically in 2 files \u2014 source/pickle.js, source/pytorch.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":"source/pickle.js"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33bc1cd21c00ee90da0862e6064b776beeb493b04039eb60009a1a8bf39c04e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060obj.convertedBy || obj.generatedBy || \u0027\u0027\u0060 appears character-identically in 2 files \u2014 source/keras.js, source/tf.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":"source/keras.js"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"1661d5b58096aaecf9b1f34d8a4a57747a09a83b2e34f541f3849559521a7259"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060outputIndex \u003C outputs.length || outputDef.option !== \u0027optional\u0027\u0060 appears character-identically in 3 files \u2014 source/caffe2.js, source/tengine.js, source/tnn.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":"source/caffe2.js"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf90f637dec19ce91447c874a70cbab0867c46d6431023924a26dacd3ccb567"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.length \u003E 1 \u0026\u0026 path[path.length - 1] === \u0027_packed_params\u0027\u0060 appears character-identically in 2 files \u2014 source/pickle.js, source/pytorch.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":"source/pickle.js"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab18b36962bae4f36878a238fa85b5a1ba25794cfbf88430489928c024b125a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060proto === Object.prototype || proto === null\u0060 appears character-identically in 4 files \u2014 source/lightgbm.js, source/pickle.js, source/sklearn.js, source/xgboost.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":"source/lightgbm.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f144e849722e294d847d23242dc461a2405734061616e74952614dd73409cc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060quantization \u0026\u0026 (quantization.scale.length \u003E 0 || quantization.zero_point.length \u003E 0 || quantization.min.length \u003E 0 || quantization.max.leng\u2026\u0060 appears character-identically in 2 files \u2014 source/circle.js, source/tflite.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":"source/circle.js"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e617d7ac332004d810d3578c410d3d59479acdf85dbb1c369aaf9865a6a1a64"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060repeat \u0026\u0026 index \u003E= defaultValue.length - 1\u0060 appears character-identically in 3 files \u2014 source/cntk.js, source/mxnet.js, source/openvino.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":"source/cntk.js"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9c3ca90d2e44b87e8a6995fe2ed3d5809903800bacf7dae7cbf120cbf39ba2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060signature[0] === 0x80 \u0026\u0026 signature[1] \u003C 7\u0060 appears character-identically in 2 files \u2014 source/onnx.js, source/pytorch.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":"source/onnx.js"},"region":{"startLine":2800}}}],"partialFingerprints":{"codehealthFindingId/v1":"d002311b6c9368ca47b26bfa72655b7f31aacddc0e9773c9394658883baeeceb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060signature[index] === undefined || signature[index] === value\u0060 appears character-identically in 2 files \u2014 source/pickle.js, source/pytorch.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":"source/pickle.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd02987d619d81780f00101b7436bd3624341fd4be4bd7005c041c111d9c480"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start \u003C offset || start \u003E end || end \u003E this._data.length\u0060 appears character-identically in 2 files \u2014 source/circle.js, source/tflite.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":"source/circle.js"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d321c604c34e438246604c32aa6739033049c4fc3cd783d42ecdc13d89063fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060subgraph.operators.length === 0 \u0026\u0026 subgraph.tensors.length \u003E 0 \u0026\u0026 operators.length === 0\u0060 appears character-identically in 2 files \u2014 source/circle.js, source/tflite.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":"source/circle.js"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f533caf55e2e0da09c637eeed33bd2363448000389ad18b0dba45220e32d204"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060subgraphMetadata \u0026\u0026 index \u003C subgraphMetadata.input_tensor_metadata.length\u0060 appears character-identically in 2 files \u2014 source/circle.js, source/tflite.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":"source/circle.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ea988e1535e81818c28e2fe226c305ed05b5762a2c86c3def9ab40b888cfa2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060subgraphMetadata \u0026\u0026 index \u003C subgraphMetadata.output_tensor_metadata.length\u0060 appears character-identically in 2 files \u2014 source/circle.js, source/tflite.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":"source/circle.js"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b591bed203d43df753ed633c629bc7c0ad6f13b99bd7118ae216f3a3e1a6994"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060subgraphsMetadata \u0026\u0026 i \u003C subgraphsMetadata.length\u0060 appears character-identically in 2 files \u2014 source/circle.js, source/tflite.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":"source/circle.js"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae3f34fab32622ddf35cc9c584bcd758c94b27f949df63f7c8e0d67fdde7eec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tensor \u0026\u0026 tensor !== values.get(name).initializer\u0060 appears character-identically in 3 files \u2014 source/mxnet.js, source/om.js, source/tvm.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":"source/mxnet.js"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa632b2bd6685414348b7e60b1a2b52c800785315ddce2d619fbfc807023550b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tensor.int32_data \u0026\u0026 tensor.int32_data.length \u003E 0\u0060 appears character-identically in 2 files \u2014 source/espdl.js, source/onnx.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":"source/espdl.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c43c532008e9894660fb472018a30ea6c8d0bb541768ab83f5eb67678fc6e32"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tensor.shape_signature \u0026\u0026 tensor.shape_signature.length \u003E 0\u0060 appears character-identically in 2 files \u2014 source/circle.js, source/tflite.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":"source/circle.js"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d34f705de9b17e0e5a900a2080edba2c0bec88a6eaf8e4aee6d652b9568a01"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tensor.type !== undefined \u0026\u0026 tensor.shape !== undefined\u0060 appears character-identically in 2 files \u2014 source/circle.js, source/tflite.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":"source/circle.js"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b7a1155fca212df844dc811c103f4d6060e41f12579e3079945dd7f4421aaa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this \u003E Number.MAX_SAFE_INTEGER || this \u003C Number.MIN_SAFE_INTEGER\u0060 appears character-identically in 3 files \u2014 source/base.js, tools/circle-script.js, tools/tflite-script.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":"source/base.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6678c0c609a420eca9db8cfad7e2ef71b5d6032c3cc7700db1a5007d33d21e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this._char === \u0027 \u0027 || this._char === \u0027\\n\u0027 || this._char === \u0027\\r\u0027 || this._char === \u0027\\t\u0027\u0060 appears character-identically in 2 files \u2014 source/json.js, source/onnx.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":"source/json.js"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf624249a83cb0488654acb88f1221e8cedc0f23660170a9c314e498f9d45720"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this._char === \u0027e\u0027 || this._char === \u0027E\u0027\u0060 appears character-identically in 2 files \u2014 source/json.js, source/onnx.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":"source/json.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"000f0a3818f725d251d508e2c7692575bf2b2f4f3ef39b9765998d47354b2a6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this._decoder || new TextDecoder(\u0027ascii\u0027)\u0060 appears character-identically in 2 files \u2014 source/dl4j.js, source/rknn.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":"source/dl4j.js"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9d4c3623bc653d2eebabdb45f146706d7c6d2d47173ad6e6eec8b2a948dfa7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this._decoder || new TextDecoder(\u0027utf-8\u0027)\u0060 appears character-identically in 4 files \u2014 source/base.js, source/onnx.js, source/tensorrt.js, source/weka.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":"source/base.js"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee52376e14b584854f0362c9bdcb3f85401d6afd524bf33942758e91cff8c772"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this._position === 0 \u0026\u0026 length === undefined\u0060 appears character-identically in 3 files \u2014 source/base.js, source/tar.js, source/zip.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":"source/base.js"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ead8fe1d5d24e7b4c52714f587fe427e652a94ab7ff0c0aa3a65b3a0f7ec8b4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this._position \u003E this._length || this._position \u003C 0\u0060 appears character-identically in 4 files \u2014 source/base.js, source/node.js, source/tar.js, source/zip.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":"source/base.js"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"6517ead87d1f4cda05236a5d01b97ebe7602689e3c555c192c59c8d560c49557"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.dimensions \u0026\u0026 Array.isArray(this.dimensions) \u0026\u0026 this.dimensions.length \u003E 0\u0060 appears character-identically in 2 files \u2014 source/kmodel.js, source/om.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":"source/kmodel.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a657791637324cb75e38add322dc0ef3a81eabcbdf01599861f99b76ccfdd54e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.dimensions \u0026\u0026 this.dimensions.length\u0060 appears character-identically in 2 files \u2014 source/cntk.js, source/paddle.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":"source/cntk.js"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"719fef9121b7d5c51f9acb62c3d144ccc101c502c69229796f45dad5ceec6bf7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.dimensions \u0026\u0026 this.dimensions.length \u003E 0\u0060 appears character-identically in 12 files \u2014 source/dot.js, source/executorch.js, source/hailo.js, source/keras.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":"source/dot.js"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bab096678e55fa42bef33c3c13ae0dbf08ef8d25d8b0265d88d3d7d265effb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.type \u0026\u0026 Array.isArray(this.type.inputs) \u0026\u0026 i \u003C this.type.inputs.length\u0060 appears character-identically in 3 files \u2014 source/espdl.js, source/onnx.js, source/openvino.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":"source/espdl.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c360ae17bed8c7b9c6d85eca8df0fada828cd9ed08231d81a9faf7b410c3097"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.type \u0026\u0026 Array.isArray(this.type.outputs) \u0026\u0026 i \u003C this.type.outputs.length\u0060 appears character-identically in 3 files \u2014 source/espdl.js, source/onnx.js, source/openvino.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":"source/espdl.js"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8b2e28567bf910b76e05c7155dbfb00188a70d808d6d887cca5b433c07a4b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.type \u0026\u0026 this.type.inputs \u0026\u0026 i \u003C this.type.inputs.length\u0060 appears character-identically in 5 files \u2014 source/acuity.js, source/circle.js, source/rknn.js, source/tflite.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":"source/acuity.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa7f6e9d01844abe92d33d59c3205d0d6bb63ab9b9b46e0f543ba7799cd2f40"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.type \u0026\u0026 this.type.outputs \u0026\u0026 i \u003C this.type.outputs.length\u0060 appears character-identically in 4 files \u2014 source/acuity.js, source/circle.js, source/tflite.js, source/tosa.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":"source/acuity.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6b9dce64c00df22cd5f9ff09b9aeaa3859d5bea1c9f72baf6baec91e59b79f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.type.dataType === \u0027string\u0027 || this.type.dataType === \u0027object\u0027\u0060 appears character-identically in 3 files \u2014 source/hailo.js, source/pytorch.js, source/sklearn.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":"source/hailo.js"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2e7eadd3e8b44cce73597b297ee6102b8db237f870c360522c61247fc39fa5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.type.dataType === \u0027string\u0027 || this.type.dataType === \u0027object\u0027 || this.type.dataType === \u0027void\u0027\u0060 appears character-identically in 4 files \u2014 source/hailo.js, source/numpy.js, source/pytorch.js, source/sklearn.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":"source/hailo.js"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e069ae25543eac35517dfe4f05534600023d636c0d90fa68203cf55b14cb45fe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.type.outputs \u0026\u0026 i \u003C this.type.outputs.length\u0060 appears character-identically in 2 files \u2014 source/om.js, source/rknn.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":"source/om.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1b4dfe56e6a92d69587b91b4d3e945af3626229b5230cbf6f186ff5bf78b4f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027object\u0027 || !match(value, inner)\u0060 appears character-identically in 2 files \u2014 source/onnx.js, source/tf.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":"source/onnx.js"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"21949d10689b825e15549f954a2bd98401c2a9eab65ca2ab73705c9a6ea2e639"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027string\u0027 || typeof value === \u0027number\u0027\u0060 appears character-identically in 2 files \u2014 source/pickle.js, source/pytorch.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":"source/pickle.js"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb74a7006c40afeff1aba2e04f5794143ad26a590555f9e09225b993ce675ee4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value \u0026\u0026 value.__module__ \u0026\u0026 value.__name__\u0060 appears character-identically in 2 files \u2014 source/pickle.js, source/pytorch.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":"source/pickle.js"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b12c260661660f5beeb524a903a41672c68fa7ca28412bb52a7ca02f796b16"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === metadata.default || (value \u0026\u0026 value.toString() === metadata.default.toString())\u0060 appears character-identically in 2 files \u2014 source/ncnn.js, source/tengine.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":"source/ncnn.js"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19f47d3fc6240c2800df3f9975871ceb4e9bc0c03be45e466e350e6c6ea436d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060weight.quantization \u0026\u0026 weight.quantization.dtype\u0060 appears character-identically in 2 files \u2014 source/keras.js, source/tf.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":"source/keras.js"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3b7f049ba06a10e3dc4fbb374e0dc0036d5a1c4bfdfb653669f6c08b266090"}},{"ruleId":"X19","level":"warning","message":{"text":"Process-global state is restored only on the happy path: this arrow function changes state that belongs to the whole PROCESS and changes it back at the end of the same body \u2014 the process working directory (changed at line 46, put back at line 48) \u2014 which says the change was meant to last no longer than this call. But the restore is an ordinary statement on the straight-line path, not a \u0060finally\u0060, so it is skipped by any exception thrown in between: the process then keeps the overwritten value for the rest of its life, and every later relative path, child-process launch or config read in ANY module resolves against it. That failure is silent and remote from its cause \u2014 the function that breaks is not the function that moved the directory. The durable fix is not to widen the restore but to stop mutating the global: pass the value to the operation that needs it \u2014 the \u0060cwd\u0060 and \u0060env\u0060 options of \u0060child_process.spawn\u0060/\u0060exec\u0060/\u0060execSync\u0060 (or \u0060Deno.Command\u0060) scope both to the CHILD \u2014 or build absolute paths with \u0060path.resolve\u0060. Where the global genuinely must move, wrap it \u0060try\u0060/\u0060finally\u0060 so the restore runs on every path."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/app.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce74add2cf094b1ae91a64ae59eb6aeed4a1b5cec1448392fa43bdf22c38a94b"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 111 is called with an argument built by \u0060\u0022\u2026\u0022.join(args)\u0060 (line 111), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/server.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd5b24dfe149ae4f47035f2122eadb39a6d305d99712079323ccdc7f202a161"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060value.substring(0,index)\u0060 is text this program did not author, and it is written into the text of an element through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5a942a1d8b52abc63f1eafa1a0bba841301bc84a1636d156d705dde320cad7"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060item.shortcut\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92c5c96f762168ff7ad9768b87e603024470de299ad57b2823defa513f90e14"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060entry.title||\u0027\u0027\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":3415}}}],"partialFingerprints":{"codehealthFindingId/v1":"c544cf7fbb522cf0db1f8dfc2505ddee1f77252be12746d8c5c0946b02a3301b"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060entry.element\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":3418}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62e7deb64cd9964085030d90d7627d2b6f757a4dd4a512a09ff1b6c9fdf3ad2"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060text\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":3864}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8402f24d45576fb77472074521b4903ed3a773b796cfa3e5beb5f44065d7d16"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060content?content:\u0027\u0026nbsp;\u0027\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":4002}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a6face610f85fea5bcade158fdefa51fd3588d1e050046a23a6ba15bab2385"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060name\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":4046}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc35463b7ea60b72c1115e5ba2fb05a4f3bca0b60faa8cf68ca149bb49295e5"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060name\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":4194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab047a62cf9c50ddd6360109aba23eeceef169eabdc9fe112ec42f803664639e"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060name\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":4200}}}],"partialFingerprints":{"codehealthFindingId/v1":"569f8e6669abf17809466ccb55e580041173ae84410dab9d218571f09b93a888"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060name\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":4206}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d974a6adf8818e19080b452a65fb41e7499ce6484375205883464d81f3a8c8"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060content\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":4827}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb86f5f935087ee39a98898567b3f52f50425b6412e7ba53b754f70c46ee179"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060type\u0060 is text this program did not author, and it is written into a URL attribute through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":5022}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafe34172375d8ec8ca92b3ace5f9075fd910554f85a3468776642a174d0c284"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060name\u0060 is text this program did not author, and it is written into a URL attribute through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":5142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41db866a41887f933027a4a2fe6cf4a4ae69271c288224323521506c06a7df6"}},{"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":"package.js"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"807f0d700f9c5b02cbae547bbabbb265c2f48a20db1e2ae74d800786ca6354b7"}},{"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":"source/server.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bd9c188c2eb147f5d302de107150d7b0f7fa24b9f17c72536650cf65de74d6"}},{"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":"source/server.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcfa53418e453302b721e6d2d853aa104f8a677e0a873be53d19be50a9e64d3"}},{"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":"source/app.js"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8982f3abab54ac4b8d151fc7dc267308f288f64e1cab44b37ac824b3810c864"}},{"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":"source/base.js"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"5501c166ec02d3d5294df62673a9d3d552cbd824b97ee5f5359eb23ce7c2198e"}},{"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":"source/browser.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3814615a0c6e23eaff05a5b01b9d9445c09149b5017be1af19a6883eeaf95092"}},{"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":"source/browser.js"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c169e606e1c6285b5cdd015ff6a5f728d8ca36aabe0a01a0e501a4064226996"}},{"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":"source/browser.js"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"6296c1569fe72801f8afe1b40c7bd1583a864c7f8bdc3e1f4390e824dec1c52c"}},{"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":"source/browser.js"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e4330a2c704d3399d505d85c51589521d97d96b716689cd705bd58a6d5a1da"}},{"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":"source/caffe2.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8eef4e3d094ce3a3bf02b61c5a66e5f58b7374679300da1f04c479f7ea2f35d"}},{"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":"source/caffe2.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe33b4f157f27a9ade1806963ecf93a6a47ba937f3d5928ef772df4d29a4fd8"}},{"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":"source/caffe2.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"41549d17dcb42c15b720e386d1dbf03fb8e2ce6f52272e42c275747b98250bba"}},{"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":"source/caffe2.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b90625198b4f4847cbae759f9addfe09db1162e2c13bf8389e2341bb9207dc8"}},{"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":"source/caffe2.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"877c27e808fee680bac6b8f4fadba622fbf1e9cd0250f7740c53582ef992ac70"}},{"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":"source/caffe2.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9e3dea9e0414677f3041989b1061e0b716e2383c3f3d0a1b79a755d2b595d8"}},{"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":"source/caffe2.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43eeef948ab9a32f0516704125500d81179fcf76b9580fd1f87465b379d1f0e"}},{"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":"source/circle.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a435ce46115b55d789cf4cf04739bffb3fac9d515c54462f78bf5581dc9354a"}},{"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":"source/circle.js"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"c057b8031bddde284704b2556a063ecb935d3ca352b975433f67a59c3fd6adf8"}},{"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":"source/coreml.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2dcf74928e96173a1677ecc5691bac0f49c435320de8c264387f7dfe87792f8"}},{"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":"source/coreml.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7a39b2c40c314bd1ea01685f9d64899a7574537049d4129e422b066f7218ce"}},{"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":"source/darknet.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"713e3fa876d1ecb364b6150c0476840d33d1ac32a973c8ab2c9c3e5fa38860ff"}},{"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":"source/desktop.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9a45ae7ca2419455386682af6da481bf7b836e8b19a29683e7aa7c61482ea0"}},{"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":"source/desktop.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b4d2649fb45d9f0816c4dfe7d9d655b521099291c796474367675741b260ac"}},{"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":"source/desktop.mjs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c95ee874f90d08e03dd5e36c184e21f47c00c0b6b196813b10085b67bc5877"}},{"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":"source/desktop.mjs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7e03945742d4e53c514ccdc65530a4aabbb7f1e21ec54d746713228e427829"}},{"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":"source/desktop.mjs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"49919185f8cc85968c17ad989f68d864ec10050bb6cc61749c5bf266446e8c46"}},{"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":"source/desktop.mjs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5a20c202c1ba9b57ecdd1c7732cdfb7c8a586a56facfb2dfc429e4a37baedf"}},{"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":"source/dot.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"104cd26c627b180417d1f0208670205b6c02f53628a63bfd99ddb56b9caad907"}},{"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":"source/espdl.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a176fb3cd64bece67067a36eac15601c70bdc183d707f9b5ff2192f9c5deb8"}},{"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":"source/espresso.js"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6f1670709f13b1020ece24777417f98d379ac991cd3956df29cfc64008bd22"}},{"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":"source/espresso.js"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"debccb8d0f8a3045e36d49ad5b688ca432540026e7dd01c35ac5fa76c672ca90"}},{"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":"source/hailo.js"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d06c89243fd30cc937d0cb3acc5a75b0c1485da38e148a31c03463b3745c28"}},{"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":"source/index.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a6dc4fc6b09e7ffc1fbb241a7bf73569e88f43bb66b562362a8ee446852cc7"}},{"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":"source/keras.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab7f526c100f82133b92cb6a226d6f6071f75404b0546a06fdd4aeb1ad05bb0"}},{"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":"source/mlir.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a01222360275a43fb37ed34fd80aaade1cf48a91b83fc46ee31f54cb607e17"}},{"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":"source/mxnet.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"af89a08ff86d402474ba93e1f42d6d4513811e6efe9da02d8736e18a75ad1486"}},{"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":"source/mxnet.js"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e0ece0d746606175a86af448e798f75d0f15425ffe136546f2f2348eecdd14"}},{"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":"source/ncnn.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c8c14915d39e97a02395a7d02d13270aa534a57c2fdbb4df748ca072775ba6"}},{"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":"source/ncnn.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a07635a60c23b3bc63762dac4e937f2336752d37bce4e9498a902930a5484d"}},{"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":"source/ncnn.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"920c18b3e65365f525f2664f8b2ec6d639d3d602598f6b3076e83e2619dace29"}},{"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":"source/ncnn.js"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d47a80df28be2096781d1f8f8b01f7440d8881ab1cc13d54f4306afe7c1c13"}},{"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":"source/ncnn.js"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd079bc3f63312c0818e9d0b5e89fc73932ee2dc4fbc5f8ed6b76abcfacf520"}},{"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":"source/onnx.js"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfbc9996b41403b5abe4d531ac47f1d020662f0efe92813649b48f2062be592"}},{"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":"source/onnx.js"},"region":{"startLine":2085}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb077f6a358d3d2be8a1c3d4109fee99362ee995159665bc4b846b7bccf1377"}},{"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":"source/openvino.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd01bb0d7a1004024ffd30707aa10bed2b6d2b7ed687ebb0d2f7e02c6eac9607"}},{"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":"source/protobuf.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e128154935e95fca9f2e6def15e6c08cf2ceca8de3f73dfca23995a7e521eadc"}},{"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":"source/python.js"},"region":{"startLine":5051}}}],"partialFingerprints":{"codehealthFindingId/v1":"12070e7c2afe14731cc4f85ef1e5908632cbf5b90290edb26b28248126f2083d"}},{"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":"source/python.js"},"region":{"startLine":12134}}}],"partialFingerprints":{"codehealthFindingId/v1":"422b6d65080683a0675d08b8952650b05bd43185ddf5a042161e0c9b9f4c6959"}},{"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":"source/pytorch.js"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"b629386885eb6c08714bc039b90bf309ce538ac27b1860b32b10faa5e0e1e40f"}},{"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":"source/pytorch.js"},"region":{"startLine":2696}}}],"partialFingerprints":{"codehealthFindingId/v1":"0183bd092ebb45b355657030a50af71928e08fbfeed5c91bb9442d5013e9ff76"}},{"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":"source/qnn.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1286eaa2592c836c6b3666481d1c6256aa0ac9d17741740675380a618ddae384"}},{"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":"source/tengine.js"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"44760ede67d8f173835847dd53d2a5083791e95f69e388fe39e6b7c296d3ad00"}},{"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":"source/tf.js"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6743b0029560bb095699a556e635596943bcb69ca51b8bc295e5051b6ba7d49f"}},{"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":"source/tf.js"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c3ca2fa4c9e071e2c62d0a15b50ea884b788addf1051b95b12bebc448287c5"}},{"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":"source/tf.js"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f0090ec5dabf766303362c51f257d4eddf624cbdc7a121c489fb423b729748"}},{"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":"source/tflite.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dae575d3c028e97df1acd58e41a19b10318e0603df59d72033302fc75438883"}},{"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":"source/tflite.js"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67187185cbeddeae60ad5b61eb91dcfbc76748e113fcf1b59f6005e3535e817"}},{"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":"source/tnn.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9f0854d44c998b9bffc49b43c36ed3efa680c34fc9b86759a41aae4e5dab76"}},{"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":"source/transformers.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d662bab2d5b7c2e686e4c39c63c9ce0aca936bd4a80ff6b426e31ccf65291d7"}},{"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":"source/tvm.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95262e3eabf414dc9b001add67fbf3f75b2f7464a1fe439ef6bfbc671880e79"}},{"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":"source/tvm.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0a677c705ed2ff6bb500d5cd4bed6f33c3e5496370d896ebb81be510f555b9"}},{"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":"source/view.js"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5e065c7d21033779b83894af0bc639147995f225946f8bc6735ed0af82dd23"}},{"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":"source/view.js"},"region":{"startLine":6814}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef3312980cef706040055d3208e8dd276f740277221b699d38c98daf4e6f44f"}},{"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":"source/view.js"},"region":{"startLine":6831}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8c0e5597de5fa68d9602f5d8dfb70df5fb80fa6a1841f82d09d9a976dd98aa"}},{"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":"source/view.js"},"region":{"startLine":6848}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc04c2f7771a3122b5f7a9b9e4d82bd7abc6f38fa5b9ec78fdc13362eac68b9f"}},{"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":"source/view.js"},"region":{"startLine":6889}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df9d108e473eeaa8c65e92e5b7ec206b9f0f02bf6415ff37c6775ce63f2b01a"}},{"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":"source/view.js"},"region":{"startLine":7393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12332eebd02244082b0c0788d4b694adeeb97512a02221112abc525bedcd6a5"}},{"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":"source/view.js"},"region":{"startLine":7416}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4005fcffb6fb853f5fcd8dd3b7ee7d2d0c72c1c14f6f943f811ddd99bff344"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":7937}}}],"partialFingerprints":{"codehealthFindingId/v1":"344350f456afb266e97d27de39f58aa7ebbb24858cf6d5658d4ca70009086822"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/view.js"},"region":{"startLine":7938}}}],"partialFingerprints":{"codehealthFindingId/v1":"754b7b8368f1f1b57945e65acdd86a347001dc6ae56c3523b8f16f536260bc0c"}},{"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":"source/view.js"},"region":{"startLine":7953}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acdb667174e9e5472f48f930c2675d8e7b99654472b777c0d5800a09d4211e5"}},{"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":"source/weka.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"691e4b7cbdc4e6f3bc57512c007ec13aa889b2d3241d7ad6f55506f55edc36f6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 36 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/__init__.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"05dc129aac4923b9ccbcbec57dbc30c06bebf01ecb3e1e020b64f7ba559b4be9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 300 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/server.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"22293493a5719360809a34bb9e8d4617dfce56cf03d6ed604cc77d85fe690d9d"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/keras.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"384aaadfd4eca85d176c80d0f43e2ac070f1f0e3cf0d7b558dba312e2163192f"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/message.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df58c4932fdc778b0571d3ddbb0cca762c53a0a944f0194bab38d92e12fdf0c"}}],"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-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.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-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.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-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"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":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-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-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":34,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}