{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"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":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"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":"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":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"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":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"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":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"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":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"PartialEvaluator.getOperatorList (cyclomatic 140): PartialEvaluator.getOperatorList has cyclomatic complexity 140 (threshold 15). Most of this is not in the body itself: 8 of the 140 points are its own statements and the rest belongs to 12 function items inside it that branch (a function literal at line 1687, a function literal at line 1730, a function literal at line 2132, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ff50bffe2b09d83ebcf428e5d3fd013ebabb6a0086abc9bc5e460905aa2a9d"}},{"ruleId":"D1","level":"warning","message":{"text":"app.onKeyDown (cyclomatic 120): app.onKeyDown has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app.js"},"region":{"startLine":3315}}}],"partialFingerprints":{"codehealthFindingId/v1":"207081ac3ea126156c7ed8721860494ad9623f1bc0948e169297b88f99d7cde2"}},{"ruleId":"D1","level":"warning","message":{"text":"getOperatorList::promiseBody (cyclomatic 110): getOperatorList::promiseBody has cyclomatic complexity 110 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"8003573083cfa850a02dea8e5630d006b2580b3ac2d3cddc85d7001abc0aa1a5"}},{"ruleId":"D1","level":"warning","message":{"text":"checkAndRepair (cyclomatic 105): checkAndRepair has cyclomatic complexity 105 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d7382ea545a5428907831e1e429fbdfc669c578ce11a9c97af7da2f61996f2"}},{"ruleId":"D1","level":"warning","message":{"text":"bidi.bidi (cyclomatic 97): bidi.bidi has cyclomatic complexity 97 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bidi.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3198a7071b5d79f52ee85ba3174dfcab3b0e867e007961a4d776c507cb2c0f"}},{"ruleId":"D1","level":"warning","message":{"text":"_initializeViewerComponents (cyclomatic 81): _initializeViewerComponents has cyclomatic complexity 81 (threshold 15). Of this number, 69 points are the body\u0027s own statements and 12 belong to 12 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":"web/app.js"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1084100c2cff21a9b4f1bdc8dab26c1a63496995fb60f8e226f996c5655a2ca"}},{"ruleId":"D1","level":"warning","message":{"text":"render (cyclomatic 77): render has cyclomatic complexity 77 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 48 belong to 16 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3254d981b9b1fb79a0f361809b9878c0469126e64f3872b95fc622cfaab754"}},{"ruleId":"D1","level":"warning","message":{"text":"Type1Parser.extractCidKeyedFontProgram (cyclomatic 76): Type1Parser.extractCidKeyedFontProgram has cyclomatic complexity 76 (threshold 15). Of this number, 74 points are the body\u0027s own statements and 2 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":"src/core/type1_parser.js"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebe4cbe4f2957db46ee5475fce53182bad74da5250f0d839ca9e10bbc47be94"}},{"ruleId":"D1","level":"warning","message":{"text":"PSStackToTree._makeBinary (cyclomatic 75): PSStackToTree._makeBinary has cyclomatic complexity 75 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c630d77461cc2010c1072fa498c3676442972bb761350f9ec6dff0e6b23b25"}},{"ruleId":"D1","level":"warning","message":{"text":"Field.[$toHTML] (cyclomatic 74): Field.[$toHTML] has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":2741}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d54ddc2c8c7151d4bb143ac0c28b932563257397661444a6d32a9866dcf623"}},{"ruleId":"D1","level":"warning","message":{"text":"(computed) (cyclomatic 74): (computed) has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":2741}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60406566536d8e0418a614a6c04a426e8136a02ae53e056ec8da27d12785a03"}},{"ruleId":"D1","level":"warning","message":{"text":"getDocument (cyclomatic 69): getDocument has cyclomatic complexity 69 (threshold 15). Of this number, 59 points are the body\u0027s own statements and 10 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":"src/display/api.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed5b0f5781b3f9ea32a904be6b1aeb4855150d0e256ab9403dd1f48550e047e"}},{"ruleId":"D1","level":"warning","message":{"text":"#mergeStructTrees (cyclomatic 68): #mergeStructTrees has cyclomatic complexity 68 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 13 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"45028b6b4f06a1e18d5a3760b29eed0ce6f1419444c12ecf87ccf5a0aa4e12f5"}},{"ruleId":"D1","level":"warning","message":{"text":"Catalog.parseDestDictionary (cyclomatic 67): Catalog.parseDestDictionary has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f39e39f6daf97758dbf0e19e119a3207dca67831299fd184ce0b34132207bca"}},{"ruleId":"D1","level":"warning","message":{"text":"font_renderer.compileCharString::parse (cyclomatic 65): font_renderer.compileCharString::parse has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/font_renderer.js"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"805c447026f1d725d9c4df89cd9e7101f39b00bf1a7d44d69d53eb269081a1da"}},{"ruleId":"D1","level":"warning","message":{"text":"PSStackBasedInterpreter.#execOp (cyclomatic 62): PSStackBasedInterpreter.#execOp has cyclomatic complexity 62 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/js_evaluator.js"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4c482df8f68258c9d57084e53c4138b3c4dac4a3c9f0e834b5b3323caebecb"}},{"ruleId":"D1","level":"warning","message":{"text":"indexObjects (cyclomatic 62): indexObjects has cyclomatic complexity 62 (threshold 15). Of this number, 54 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":"src/core/xref.js"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c98a9cca3ef0699a0806426b9d10457155ee577976fa2ff39bab305bb1d5ce"}},{"ruleId":"D1","level":"warning","message":{"text":"createImageData (cyclomatic 61): createImageData has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image.js"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd05a0a60b278283665ad4c47491417d25e2ae112fc709e4296fe996ce6ad553"}},{"ruleId":"D1","level":"warning","message":{"text":"Font.checkAndRepair::sanitizeTTProgram (cyclomatic 60): Font.checkAndRepair::sanitizeTTProgram has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent 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: 3 other methods here (Font.checkAndRepair::readCmapTable, Font.checkAndRepair::sanitizeGlyph, Font.checkAndRepair::sanitizeGlyphLocations) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"539f2b65884937635467c7e5028badc1b35d2895a034e90c25860255d435c8e5"}},{"ruleId":"D1","level":"warning","message":{"text":"getTextContent::promiseBody (cyclomatic 60): getTextContent::promiseBody has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":3322}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6a2a5b0dd51dd4160d5b29cca5f8cd885b323e1ae211a9d33a4ceae15bc9fc"}},{"ruleId":"D1","level":"warning","message":{"text":"babelPluginPDFJSPreprocessor (cyclomatic 59): babelPluginPDFJSPreprocessor has cyclomatic complexity 59 (threshold 15). Most of this is not in the body itself: 1 of the 59 points is its own statement and the rest belongs to 12 function items inside it that branch (MemberExpression, CallExpression, exit, \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":"external/builder/babel-plugin-pdfjs-preprocessor.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"744ec81864be7672cd461243a3f4c79398d9d55ec0d3434477582bc305560a4a"}},{"ruleId":"D1","level":"warning","message":{"text":"Font.checkAndRepair::readCmapTable (cyclomatic 58): Font.checkAndRepair::readCmapTable has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent 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: 3 other methods here (Font.checkAndRepair::sanitizeGlyph, Font.checkAndRepair::sanitizeGlyphLocations, Font.checkAndRepair::sanitizeTTProgram) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad95bccbfcc14a5fba2a00f1119265f4836fdeda5d9a63f5b11c2a35866cdb0"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFEditor.#cloneStructTreeNode (cyclomatic 58): PDFEditor.#cloneStructTreeNode has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9991eeb88486db991d63c3ff5aca959b0a465ae6baf889b910ae88d423c0b21"}},{"ruleId":"D1","level":"warning","message":{"text":"PsJsCompiler.execute (cyclomatic 57): PsJsCompiler.execute has cyclomatic complexity 57 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/js_evaluator.js"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e1939c6010ecc5ce9b6d6f8cf6c910d006ec6389fd87fea3407169992d9aa6"}},{"ruleId":"D1","level":"warning","message":{"text":"PartialEvaluator.translateFont (cyclomatic 57): PartialEvaluator.translateFont has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":4614}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e9ef1eb34bc0d6adc7b49a96ae513fe3d02f344f25c19e1580376322a5b7a8"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleExprParser.parse (cyclomatic 57): SimpleExprParser.parse has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/formcalc_parser.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8caff508784aa8582573f3d23a69698143b465791bdfb0b092af57f3667355"}},{"ruleId":"D1","level":"warning","message":{"text":"Type1CharString.convert (cyclomatic 55): Type1CharString.convert has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/type1_parser.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"3684494cbeaeb1957cd373e7c00b2742d557fe2b2f6196dc295bf9e92f19ea16"}},{"ruleId":"D1","level":"warning","message":{"text":"CFFParser.#parseCharString (cyclomatic 54): CFFParser.#parseCharString has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_parser.js"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"b964458981a0a48f1c54a31c95ac9e429ad77c791ba82eded8d4191dc205804a"}},{"ruleId":"D1","level":"warning","message":{"text":"showText (cyclomatic 54): showText has cyclomatic complexity 54 (threshold 15). Of this number, 51 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":"src/display/canvas.js"},"region":{"startLine":2803}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c9dd6d6000e6d06c16707fa6152b05018c1e831a634c84c90c9437480ccc35"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFImage.constructor (cyclomatic 53): PDFImage.constructor 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccb352912d3102001144e5d63421b88dde0dd8d903ec38c15776e3725fe246b"}},{"ruleId":"D1","level":"warning","message":{"text":"DrawLayer.#selectionChange (cyclomatic 53): DrawLayer.#selectionChange 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/draw_layer.js"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"d930554be57f2564650957fac4356d8defe2ae1393f20a70e2a54fb3b87ffb3d"}},{"ruleId":"D1","level":"warning","message":{"text":"PartialEvaluator.getTextContent::compareWithLastPosition (cyclomatic 52): PartialEvaluator.getTextContent::compareWithLastPosition has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (PartialEvaluator.getTextContent::buildTextContentItem) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":2802}}}],"partialFingerprints":{"codehealthFindingId/v1":"949ad453d1f0f0df7c30239e64bfe44b4ce0c4f620c49d8186c2cd8265e1ca65"}},{"ruleId":"D1","level":"warning","message":{"text":"Catalog.viewerPreferences (cyclomatic 52): Catalog.viewerPreferences has cyclomatic complexity 52 (threshold 15). Of this number, 50 points are the body\u0027s own statements and 2 belong to one function literal 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":"src/core/catalog.js"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead852de1a22b3f115d5251d1c103962ebf80a61d09fd971583df55444872c24"}},{"ruleId":"D1","level":"warning","message":{"text":"Subform.[$toHTML] (cyclomatic 52): Subform.[$toHTML] has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":4969}}}],"partialFingerprints":{"codehealthFindingId/v1":"852b122da055045f21f4bde924fdd5604ba21fbe9f13313a1622d168be01c25c"}},{"ruleId":"D1","level":"warning","message":{"text":"(computed) (cyclomatic 52): (computed) has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":4969}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec7fbc28a9836bfc07ea3650844e9985d1e53d98669a71bc05b2eac27de63b4"}},{"ruleId":"D1","level":"warning","message":{"text":"PartialEvaluator.preEvaluateFont (cyclomatic 51): PartialEvaluator.preEvaluateFont has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":4451}}}],"partialFingerprints":{"codehealthFindingId/v1":"895de65de8f845f8c46c4a7b63d776ae8d0a04e1242b567c98f0f49d5c89e0ad"}},{"ruleId":"D1","level":"warning","message":{"text":"builder.preprocess (cyclomatic 50): builder.preprocess has cyclomatic complexity 50 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 14 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":"external/builder/builder.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"20854c66473e63647ea0ec0fc56393a3ffac54c343d98874da76d5de88526a3c"}},{"ruleId":"D1","level":"warning","message":{"text":"optimize.optimizeCMap (cyclomatic 49): optimize.optimizeCMap has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/cmapscompress/optimize.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"be88b4fe5c26658a02fc743574b8b92663486cbf508b2b1b9967f08dcde70c36"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasGraphics.beginGroup (cyclomatic 49): CanvasGraphics.beginGroup has cyclomatic complexity 49 (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":"src/display/canvas.js"},"region":{"startLine":3386}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8f366e16f62fd40d3ee56f61de2c1d808ec9d3e395be622ec9c2fa0fef2110"}},{"ruleId":"D1","level":"warning","message":{"text":"buildPaintImageXObject (cyclomatic 48): buildPaintImageXObject has cyclomatic complexity 48 (threshold 15). Of this number, 44 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":"src/core/evaluator.js"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83f35294cd2f5db42cfb282df1b44c3a53b3aa89142ae6d92df5b172db41f96"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.findDCTDecodeInlineStreamEnd (cyclomatic 46): Parser.findDCTDecodeInlineStreamEnd has cyclomatic complexity 46 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bc73fbc6053e2ede89d01b2f73431d6c51bfca5c1f03e72ba5877b3bdb0969"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.getObj (cyclomatic 45): Lexer.getObj has cyclomatic complexity 45 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf286f9769c20c44ab40bb7285e6950739baaccfe49bf1aec9d00a4ad5d2049"}},{"ruleId":"D1","level":"warning","message":{"text":"Font.fallbackToSystemFont (cyclomatic 45): Font.fallbackToSystemFont has cyclomatic complexity 45 (threshold 15). Of this number, 42 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":"src/core/fonts.js"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a4d127269570d324791e245cd36235b130a0c780eb2e33a4c6fe280bb1f767"}},{"ruleId":"D1","level":"warning","message":{"text":"Type1Parser.extractFontProgram (cyclomatic 44): Type1Parser.extractFontProgram has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/type1_parser.js"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"13639cf6fe531c7d5ce08b76b9e65851e10954c68cc208125176403284f7002a"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetAnnotation._getAppearance (cyclomatic 44): WidgetAnnotation._getAppearance has cyclomatic complexity 44 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":2421}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd63cb36f123b364fa0d9e3aa5ff7065856701bd2265dd295c20132805bfa6e"}},{"ruleId":"D1","level":"warning","message":{"text":"ColorSpaceUtils.#parse (cyclomatic 43): ColorSpaceUtils.#parse 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":"src/core/colorspace_utils.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ced85b4aab4e5c2c18ebe1ac0e0ee96af8f706104da599c0c86b5bfde92819"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor (cyclomatic 43): constructor has cyclomatic complexity 43 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 1 belongs to 3 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":"web/pdf_viewer.js"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af6b1ba1bfbbd1d1f2dece4a3d2d5d6b715c7a3ed41521255f841447c2aeea3"}},{"ruleId":"D1","level":"warning","message":{"text":"CipherTransformFactory.constructor (cyclomatic 42): CipherTransformFactory.constructor has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/crypto.js"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a98a3fa632bc99ebfb45a503ef1c91a82c1b2968874042476eb5e4faea7bf7"}},{"ruleId":"D1","level":"warning","message":{"text":"PartialEvaluator.extractDataStructures (cyclomatic 41): PartialEvaluator.extractDataStructures 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":"src/core/evaluator.js"},"region":{"startLine":3775}}}],"partialFingerprints":{"codehealthFindingId/v1":"080f611c3cb8e8e2a07a0d9c579d0aab01f0966796b20acae64fbcaf650f7f81"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFEditor.#cloneFields (cyclomatic 41): PDFEditor.#cloneFields has cyclomatic complexity 41 (threshold 15). Of this number, 34 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":2196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc2485b378fd02c53b51d8e5dc884ac80680777a4a2d2aa0cd44f7a918d6f61"}},{"ruleId":"D1","level":"warning","message":{"text":"setDocument (cyclomatic 41): setDocument has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 8 of the 41 points are its own statements and the rest belongs to 11 function items inside it that branch (a function literal at line 985, a function literal at line 1143, onAfterDraw, \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":"web/pdf_viewer.js"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a88451c7388336f0f9f1ff2e304371d76b1fe4a735a6ed1e6e115666502af9"}},{"ruleId":"D1","level":"warning","message":{"text":"compileType3Glyph (cyclomatic 41): compileType3Glyph 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":"src/core/fonts_utils.js"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"092c1c2c2df5f6bdb9c0fda6f5ce12b9e56e4a9503f3840fefe5a186a81e6c89"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor (cyclomatic 40): constructor has cyclomatic complexity 40 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 3 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":"src/core/annotation.js"},"region":{"startLine":2921}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecec7269674d810c8ce3668c5a349fdbd99087452b35c6bc554c8a2efef3985"}},{"ruleId":"D1","level":"warning","message":{"text":"Template.[$toPages] (cyclomatic 39): Template.[$toPages] has cyclomatic complexity 39 (threshold 15). Of this number, 38 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":"src/core/xfa/template.js"},"region":{"startLine":5410}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa76aa3d7704bfaeabf92831a094929d0c2cc549ede951acc96dd4cbf39af72"}},{"ruleId":"D1","level":"warning","message":{"text":"Util.printf (cyclomatic 39): Util.printf has cyclomatic complexity 39 (threshold 15). Most of this is not in the body itself: 3 of the 39 points are its own statements and the rest belongs to one function literal inside it that branches (line 73). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/util.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7d9c3abcd5bec9a509a119f21c09e347b10085872f7bec4cb73b2b9172b6c8"}},{"ruleId":"D1","level":"warning","message":{"text":"(computed) (cyclomatic 39): (computed) has cyclomatic complexity 39 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 1 belongs to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":5410}}}],"partialFingerprints":{"codehealthFindingId/v1":"60abab0e659b8ebae9031eb7ea5a0458a373fa00f13e609752e76029c79b3957"}},{"ruleId":"D1","level":"warning","message":{"text":"load (cyclomatic 39): load has cyclomatic complexity 39 (threshold 15). Most of this is not in the body itself: 8 of the 39 points are its own statements and the rest belongs to 19 function items inside it that branch (a function literal at line 1761, a function literal at line 1870, a function literal at line 1681, \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":"web/app.js"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43a90b1194dcdb68353fc83eca6a5f70dea1584ce892e03dafa83b7f3abe9e6"}},{"ruleId":"D1","level":"warning","message":{"text":"#enableGlobalSelectionListener (cyclomatic 39): #enableGlobalSelectionListener has cyclomatic complexity 39 (threshold 15). Most of this is not in the body itself: 4 of the 39 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 285, reset, a function literal at line 270, \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":"web/text_layer_builder.js"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f9f562dd5ed7fbd5d3d1290cb6d1364782b8d051f4895cd05e1be762e7bd51"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkerMessageHandler.createDocumentHandler::saveDocument (cyclomatic 38): WorkerMessageHandler.createDocumentHandler::saveDocument has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/worker.js"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"095af3eb0ce6a3805ba09c709934301ecb40a8bee762624c4e7e0a2ed3d30d5a"}},{"ruleId":"D1","level":"warning","message":{"text":"StructTreeLayerBuilder.#walk (cyclomatic 38): StructTreeLayerBuilder.#walk 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":"web/struct_tree_layer_builder.js"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ab37b568b5d18c815325d035334600fc99fdee9434a3a2ecb82fb64c20762c"}},{"ruleId":"D1","level":"warning","message":{"text":"setupMessageHandler (cyclomatic 38): setupMessageHandler has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 5 of the 38 points are its own statements and the rest belongs to 27 function items inside it that branch (a function literal at line 2775, a function literal at line 2810, a function literal at line 2639, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api.js"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c8e98f247d8f2db08dfe3aa236591d0ace5abf35fc39ab6c34893eec7ed1ef"}},{"ruleId":"D1","level":"warning","message":{"text":"layout.checkDimensions (cyclomatic 37): layout.checkDimensions 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":"src/core/xfa/layout.js"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"884988b3a6a9306fd4b3e67dfb966b72b7a6d36ae8f536eff46ec1c6b02fe82e"}},{"ruleId":"D1","level":"warning","message":{"text":"Binder._bindElement (cyclomatic 37): Binder._bindElement 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":"src/core/xfa/bind.js"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcacf7640e8a0ea725f54e14374bc514c9917b3fbd9e00db75095cb5d9577666"}},{"ruleId":"D1","level":"warning","message":{"text":"#makePageCopy (cyclomatic 37): #makePageCopy has cyclomatic complexity 37 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 5 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":2436}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4ba9d42ce83718139cd657ba7b4408fe2b23145c85f1b4094eba79677da2ad"}},{"ruleId":"D1","level":"warning","message":{"text":"PSStackToTree._evalOp (cyclomatic 36): PSStackToTree._evalOp 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":"src/core/postscript/ast.js"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b54fbf3b947e580820bd30ec47d9f29340c8d1d0e3d055871ed71ba88603837"}},{"ruleId":"D1","level":"warning","message":{"text":"PartialEvaluator.setGState (cyclomatic 35): PartialEvaluator.setGState 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61cbe6faaf4077120d9585c6c9f8078450e547fb7f1c968796848fdafffb83e"}},{"ruleId":"D1","level":"warning","message":{"text":"AnnotationFactory._create (cyclomatic 35): AnnotationFactory._create 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65aa8fb82d558ce00e5d4d8fed4fb15193b5a6d367adea002d0a4058ee054d4"}},{"ruleId":"D1","level":"warning","message":{"text":"parseCMap (cyclomatic 35): parseCMap has cyclomatic complexity 35 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 13 belong to 7 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":"external/cmapscompress/compress.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97de83f845893a6e7392f71ccb159291fcb5b59408cc5713cb832acd109f8a3"}},{"ruleId":"D1","level":"warning","message":{"text":"ExclGroup.[$toHTML] (cyclomatic 34): ExclGroup.[$toHTML] 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":2443}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f7c05418149e210dd31be339adff83e37a754d78a0108520a575bbc1997117"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFEditor.#resolveInsertAfterIndices (cyclomatic 34): PDFEditor.#resolveInsertAfterIndices has cyclomatic complexity 34 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 6 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e8ed70960743c9c0bb9ca77439950fc4dc3befe08fde2aa988e72202e05582"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFLinkService.setHash (cyclomatic 34): PDFLinkService.setHash 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":"web/pdf_link_service.js"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf01c3525febb31ec0fdaa68ea17fb5a62fdbddc930ea39fce0db3f4b7bba3aa"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFViewer.scrollPageIntoView (cyclomatic 34): PDFViewer.scrollPageIntoView 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_viewer.js"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc67971e40435d8d4b1683079fe3505631a9326d27913e99c1f6cc82cce4bad7"}},{"ruleId":"D1","level":"warning","message":{"text":"(computed) (cyclomatic 34): (computed) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":2443}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e33779411880f990330b458d1720a55c8fe43b7112aeffad7698d7e9698e8b"}},{"ruleId":"D1","level":"warning","message":{"text":"compileGlyf (cyclomatic 34): compileGlyf has cyclomatic complexity 34 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 1 belongs to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/font_renderer.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd84979e8420f661c7886ac8d4eec3f5fb1bc03694606ea9fd339aef1c745708"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.getString (cyclomatic 33): Lexer.getString has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7b6cf58ee25b8a46553d0929cd44d94aa38d581838257facb256c528e62866"}},{"ruleId":"D1","level":"warning","message":{"text":"PartialEvaluator.extractWidths (cyclomatic 33): PartialEvaluator.extractWidths has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":4259}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cc37c693d9509145eb2d928cc9e108729aa803f757a8275728d4f339900e14"}},{"ruleId":"D1","level":"warning","message":{"text":"ast._evalBinaryConst (cyclomatic 32): ast._evalBinaryConst has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"0775b9b64bc58f7fd0accc1fe34e45d91079cda3a2426d02b6316c6bd369246c"}},{"ruleId":"D1","level":"warning","message":{"text":"PartialEvaluator.hasBlendModes (cyclomatic 32): PartialEvaluator.hasBlendModes has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"792091eba27e133e2bd4e98cd0c4c0b90dfc5160387a253ccbe14d168a3b9f09"}},{"ruleId":"D1","level":"warning","message":{"text":"TranslatedFont.#removeType3ColorOperators (cyclomatic 32): TranslatedFont.#removeType3ColorOperators has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":5122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a268ed220f7331bfd6c0bf8dac5ba075479fd5dc0f23aded5aa4b3c98dfd6ec"}},{"ruleId":"D1","level":"warning","message":{"text":"Catalog.getPageDict (cyclomatic 32): Catalog.getPageDict has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"543a3108ba7a87b0408daa141411bb4b656963c8d13c417e25d1dd9fabb1de52"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFScriptingManager.#updateFromSandbox (cyclomatic 32): PDFScriptingManager.#updateFromSandbox 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":"web/pdf_scripting_manager.js"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dabc7a13358dd69b9d21758639468646f941c0f433c653a21e4227660e9047b"}},{"ruleId":"D1","level":"warning","message":{"text":"extractPages (cyclomatic 32): extractPages has cyclomatic complexity 32 (threshold 15). Of this number, 29 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fe21d56104907e959957b605f9f66dea52a8cf9f9d9b131d3533d43d36c065"}},{"ruleId":"D1","level":"warning","message":{"text":"_evalBlockFrom (cyclomatic 32): _evalBlockFrom has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60b37ca2631b496146bf5486e622f0a53296135df20c608a8aff1e1a75df446"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.findDefaultInlineStreamEnd (cyclomatic 31): Parser.findDefaultInlineStreamEnd 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":"src/core/parser.js"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8125c0da70e9429c69e717d05c98d84918dd7c0fd77807bca40bfdc661623db5"}},{"ruleId":"D1","level":"warning","message":{"text":"Font.constructor (cyclomatic 31): Font.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":"src/core/fonts.js"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66165f8dbcd6a46b11159fa57eb9ddb7fa4f5a0b91818effcb401c073f11c49"}},{"ruleId":"D1","level":"warning","message":{"text":"SignatureExtractor.#findContours (cyclomatic 31): SignatureExtractor.#findContours 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":"src/display/editor/drawers/signaturedraw.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54c31f9dc688ae4e866d5a5750a5ceb4bca38441b130f6824bd1478520384b1"}},{"ruleId":"D1","level":"warning","message":{"text":"normalize (cyclomatic 31): normalize has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 13 of the 31 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 206, 151, 223). 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":"web/pdf_find_controller.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6c954b73bc9974d259821cd6a713648d18253bda035f48431d75453ef5014b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.makeFilter (cyclomatic 30): Parser.makeFilter has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"f324c0d8f1e0fca6c7dc423a522284e984b990b953644efc57b689e680e86c1f"}},{"ruleId":"D1","level":"warning","message":{"text":"PartialEvaluator.getTextContent::buildTextContentItem (cyclomatic 30): PartialEvaluator.getTextContent::buildTextContentItem has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (PartialEvaluator.getTextContent::compareWithLastPosition) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":3066}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0cf6e9ec9a21e11e3e786043252d228dd55623b589b3043534cdc343a65a4a"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkAnnotationElement._bindResetFormAction (cyclomatic 30): LinkAnnotationElement._bindResetFormAction has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 9 of the 30 points are its own statements and the rest belongs to one function literal inside it that branches (line 1193). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a748506b0dd173ce1023e2c7a563fe96bddac60c7f05faa2dfa9f26347f72458"}},{"ruleId":"D1","level":"warning","message":{"text":"getOperatorList (cyclomatic 30): getOperatorList has cyclomatic complexity 30 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 3 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":"src/core/document.js"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08c83068e7bd4aee442e6b8daa4f07756347a16482a7f06c523789d6e98d37e"}},{"ruleId":"D1","level":"warning","message":{"text":"printx (cyclomatic 30): printx has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/util.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fd7e6e3341079dc979d0c1ef793c9fb298e82f26901b5fff4cf31dd7be917d"}},{"ruleId":"D1","level":"warning","message":{"text":"FlateStream.#readBlock (cyclomatic 29): FlateStream.#readBlock has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/flate_stream.js"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f879b02bc1eca596528223dd2ebbef603a3bed3d253f77c3895b266eb42233d"}},{"ruleId":"D1","level":"warning","message":{"text":"fonts.createOS2Table (cyclomatic 29): fonts.createOS2Table has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca5c7e236d2ec4a4b3c758633ac9af9e8382abaf1421e3a021a076c69285769"}},{"ruleId":"D1","level":"warning","message":{"text":"PartialEvaluator._simpleFontToUnicode (cyclomatic 29): PartialEvaluator._simpleFontToUnicode has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":3980}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ba7180f14657e03f1ebec10f181143c5eb9005d5472bf233b821ae97372a18"}},{"ruleId":"D1","level":"warning","message":{"text":"Catalog.#readOptionalContentConfig (cyclomatic 29): Catalog.#readOptionalContentConfig has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 4 of the 29 points are its own statements and the rest belongs to 4 function items inside it that branch (parseOrder, parseRBGroups, parseOnOff, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"903704113dcdb219bbe669e6cf89a1384a6ebec2e7005b7755027497a89dc4a4"}},{"ruleId":"D1","level":"warning","message":{"text":"WidgetAnnotation.save (cyclomatic 29): WidgetAnnotation.save has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac76a93b5427f332cc81b060730776b0769c6a281c87ad7456dad4c1cd151229"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFViewer.#getPageAdvance (cyclomatic 29): PDFViewer.#getPageAdvance 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":"web/pdf_viewer.js"},"region":{"startLine":2434}}}],"partialFingerprints":{"codehealthFindingId/v1":"172e1c06c92fcc81947df57b1ac9a798c03bb02086b7c8fe701aa1aa83615d82"}},{"ruleId":"D1","level":"warning","message":{"text":"SignaturePropertiesManager.#renderCard (cyclomatic 29): SignaturePropertiesManager.#renderCard has cyclomatic complexity 29 (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":"web/digital_signature_properties_manager.js"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36da81aa32e432358d53990048e0e276b0a1654c8f70375641048ae9b843559"}},{"ruleId":"D1","level":"warning","message":{"text":"reset (cyclomatic 29): reset 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":"web/pdf_page_view.js"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd7e56caf6c5c5f09b911db3d9f7f38613096c5bd5223edd5f9241d1397bc1d"}},{"ruleId":"D1","level":"warning","message":{"text":"writeStream (cyclomatic 29): writeStream has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/writer.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a59761b11c07a1852f03b3dde0df47029ae7a2250f766612f23c88e07c41d66"}},{"ruleId":"D1","level":"warning","message":{"text":"glyf.pruneCompositeGlyphCycles (cyclomatic 28): glyf.pruneCompositeGlyphCycles has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/glyf.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4b03ffd320600ef90501c1557406c22c2b37a1e8706aabab0e0c4a713d223b"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_viewer_utils._binaryToExpr (cyclomatic 28): internal_viewer_utils._binaryToExpr has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/internal_viewer_utils.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5788b14ec6a8a4a049913634719b12d4eb4df75d678a97813447c3a115301b2c"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFThumbnailViewer.#addEventListeners (cyclomatic 28): PDFThumbnailViewer.#addEventListeners has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 1418, 1411, 1488). 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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a90c7278a2f123b482a2129beb22e6f4fc49ec125808f3c7345d314b279f91"}},{"ruleId":"D1","level":"warning","message":{"text":"createCmapTable (cyclomatic 28): createCmapTable has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e367e6a7063fc10b3c4f29c03d9be279821f9fbbe92b4b74dcaee1ed99a8c3"}},{"ruleId":"D1","level":"warning","message":{"text":"convert (cyclomatic 28): convert has cyclomatic complexity 28 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 14 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":"src/core/fonts.js"},"region":{"startLine":3362}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f4c28e8efef05ee91423787efba5be3fdfd15991fdf59d3cb6f3874101ddbf"}},{"ruleId":"D1","level":"warning","message":{"text":"serializable::nodeToSerializable (cyclomatic 28): serializable::nodeToSerializable has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31f2ac7fa05250b26b6b7369f62f8bcacf8c54fc8294fdf7aabe6bc728f556c"}},{"ruleId":"D1","level":"warning","message":{"text":"Font._charToGlyph (cyclomatic 27): Font._charToGlyph has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":3638}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cafa882b7a86c3bada1fb70ec381f3ced22eaed5e0edd75edeceaf4f270ce3"}},{"ruleId":"D1","level":"warning","message":{"text":"Catalog.getAllPageDicts (cyclomatic 27): Catalog.getAllPageDicts has cyclomatic complexity 27 (threshold 15). Of this number, 20 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"9773620d6c705778b7508f72c8bd2c5cbb1f998604535cecd8a14044d69d2258"}},{"ruleId":"D1","level":"warning","message":{"text":"AnnotationEditorUIManager.updateMode (cyclomatic 27): AnnotationEditorUIManager.updateMode has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/tools.js"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36551321c7141e0f85331aeba5a0abc07c612147ea30ad3315d84e10567c2e5"}},{"ruleId":"D1","level":"warning","message":{"text":"EventDispatcher.dispatch (cyclomatic 27): EventDispatcher.dispatch has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/event.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"56105cfb1b3c751d98da20ea3429d79582f1f75acf2dfd639ef5715897725b7a"}},{"ruleId":"D1","level":"warning","message":{"text":"_bindResetFormAction::onclick (cyclomatic 27): _bindResetFormAction::onclick has cyclomatic complexity 27 (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 is NOT this file\u0027s highest cyclomatic complexity: create (cyclomatic 28) 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":"src/display/annotation_layer.js"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd07fe46380298bf4eaf3f66e1595ac7f910ad1d3f7cd27af6a34c3db7bf6682"}},{"ruleId":"D1","level":"warning","message":{"text":"Font.checkAndRepair::sanitizeGlyphLocations (cyclomatic 26): Font.checkAndRepair::sanitizeGlyphLocations 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 shape REPEATS in the file: 3 other methods here (Font.checkAndRepair::readCmapTable, Font.checkAndRepair::sanitizeGlyph, Font.checkAndRepair::sanitizeTTProgram) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":2295}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b017f8b522b795d1d74702b511f2513bebc1f6ef03772aba32475335f83eb2"}},{"ruleId":"D1","level":"warning","message":{"text":"StructElementNode.tableAttributes (cyclomatic 26): StructElementNode.tableAttributes has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56f65432d656690951b577451018c327c296e12b647282ffeae0e4a86c06079"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasGraphics.setGState (cyclomatic 26): CanvasGraphics.setGState has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"62adc25927a319737fe6509cfbb9477a4222649074877e59ab66822c3e2a701c"}},{"ruleId":"D1","level":"warning","message":{"text":"ChoiceWidgetAnnotationElement.render (cyclomatic 26): ChoiceWidgetAnnotationElement.render has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 10 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 2262, getValue, a function literal at line 2194, \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: AnnotationElementFactory.create (cyclomatic 28) 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":"src/display/annotation_layer.js"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"056bafeb35ac2e221a9c14e694c531e0ad3bf293424f127da8eefb3282a4e151"}},{"ruleId":"D1","level":"warning","message":{"text":"content_disposition.getFilenameFromContentDispositionHeader (cyclomatic 26): content_disposition.getFilenameFromContentDispositionHeader has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 4 of the 26 points are its own statements and the rest belongs to 7 function items inside it that branch (rfc2231getparam, textdecode, fixupEncoding, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/content_disposition.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"995bcd774694aeae10c80e9766ce159e4b49d9e5558d9eaab0e96cf2a4526c74"}},{"ruleId":"D1","level":"warning","message":{"text":"AForm.#AFSpecial_KeystrokeEx_helper (cyclomatic 26): AForm.#AFSpecial_KeystrokeEx_helper has cyclomatic complexity 26 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 13 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":"src/scripting_api/aform.js"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb66181bf3f7ff0d1f531b23752bc531e23c28e5fcf35c2b6c07c74f2ecf589"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeView.#setupKeyboardNav (cyclomatic 26): TreeView.#setupKeyboardNav has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to one function literal inside it that branches (line 121). 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":"web/internal/tree_view.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bf42061b6574cad2d923bf968e4ced9624eea4c6a391c9087aa97a887ae70b"}},{"ruleId":"D1","level":"warning","message":{"text":"loadFont (cyclomatic 26): loadFont has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"825bb15df668c23df42d71a08a4882cdd71069188c2926e5fde3b78b0fa29de8"}},{"ruleId":"D1","level":"warning","message":{"text":"#addExternalFileDropListeners (cyclomatic 26): #addExternalFileDropListeners has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 2 of the 26 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 1773, hasMergeableItem, a function literal at line 1707, \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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ffd2ced2bd8da1e7729333932ef4e6f61136bba1625a23b334ad0324cec6ec"}},{"ruleId":"D1","level":"warning","message":{"text":"fillGrayBuffer (cyclomatic 26): fillGrayBuffer has cyclomatic complexity 26 (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":"src/core/image.js"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"40583c5bc926b4916a805eb7b180888564ce047a09ab8a6d23c5327a6a4d1ca5"}},{"ruleId":"D1","level":"warning","message":{"text":"show (cyclomatic 26): show has cyclomatic complexity 26 (threshold 15). Of this number, 21 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":"web/internal/draw_ops_view.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb466ea7d0cccc75740e82ac3d3f42b6504f91a242429cd3443f5f3b0936778"}},{"ruleId":"D1","level":"warning","message":{"text":"XMLParserBase.parseXml (cyclomatic 25): XMLParserBase.parseXml has cyclomatic complexity 25 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xml_parser.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b590f02f79bad194274d8efed73b2f2ac9d2d50d2be6992a9b4855a06906e91"}},{"ruleId":"D1","level":"warning","message":{"text":"StructTreePage.addNode (cyclomatic 25): StructTreePage.addNode has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58a5bbb5fa5e6c38cc36cf8b47531a5c1b89efbf870c242e7273db6f7e01f9f"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFEditor.#collectDependencies (cyclomatic 25): PDFEditor.#collectDependencies has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"0840c283f44ce9144c70c2e3a0b27a568864fc40b7eb9a8cb36d714a0962477b"}},{"ruleId":"D1","level":"warning","message":{"text":"Field.constructor (cyclomatic 25): Field.constructor has cyclomatic complexity 25 (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":"src/scripting_api/field.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c350328580edd8e3ace5f804c480da5c00aeaf2f3c6c96be68ee102628a6ee01"}},{"ruleId":"D1","level":"warning","message":{"text":"CFFParser.parsePrivateDict (cyclomatic 24): CFFParser.parsePrivateDict has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_parser.js"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac634f65c0c14d4df6cc1f1b10042208ced6c0496df662a3c10c8549062619f2"}},{"ruleId":"D1","level":"warning","message":{"text":"Font.checkAndRepair::sanitizeGlyph (cyclomatic 24): Font.checkAndRepair::sanitizeGlyph 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 shape REPEATS in the file: 3 other methods here (Font.checkAndRepair::readCmapTable, Font.checkAndRepair::sanitizeGlyphLocations, Font.checkAndRepair::sanitizeTTProgram) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":2115}}}],"partialFingerprints":{"codehealthFindingId/v1":"034746a319329eb19aa226ad6337f145cb3e7d1335666b19b10ca52895952ae2"}},{"ruleId":"D1","level":"warning","message":{"text":"PSStackToTree._makeTernary (cyclomatic 24): PSStackToTree._makeTernary has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb772a9463fc3c06a0f47d186bda09e40090e25096a3a8008ab7924ebc45549"}},{"ruleId":"D1","level":"warning","message":{"text":"Catalog.getPageIndex (cyclomatic 24): Catalog.getPageIndex has cyclomatic complexity 24 (threshold 15). Of this number, 20 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":"src/core/catalog.js"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f70f2c478cb16ba3c48beb69fe8766e9b562eadc4cbd3b6933cc3c6048d3c69"}},{"ruleId":"D1","level":"warning","message":{"text":"Catalog.#getDestFromStructElement (cyclomatic 24): Catalog.#getDestFromStructElement has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d95061b577483c77a1d05c7ffad166ca639797f103a92243d881fd5183f90e"}},{"ruleId":"D1","level":"warning","message":{"text":"html_utils.layoutNode (cyclomatic 24): html_utils.layoutNode has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/html_utils.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f49e3b2df706c6e11564f32b72600c3d392c2d3db89cb25fc6dec0988d0c33"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFDocument.#parseSignatureDict (cyclomatic 24): PDFDocument.#parseSignatureDict has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea38da896a1a434332ba855ff2350c322f4521646d43c1f6698584beca274fa"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasGraphics.paintChar (cyclomatic 24): CanvasGraphics.paintChar has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"0accdc11f570ff415bab8c6b21f67f884c451b05816995770520230205c18e10"}},{"ruleId":"D1","level":"warning","message":{"text":"OptionalContentConfig.isVisible (cyclomatic 24): OptionalContentConfig.isVisible has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/optional_content_config.js"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2918c29d81c77ee35f92d806801164473e2273f0442da6080d05d3545ea89681"}},{"ruleId":"D1","level":"warning","message":{"text":"XfaLayer.setAttributes (cyclomatic 24): XfaLayer.setAttributes has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/xfa_layer.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeffc24e432b0e721871d9f9ea4d68b2e20fc133c1eeef057dc85fe1ecfe86e1"}},{"ruleId":"D1","level":"warning","message":{"text":"app.onWheel (cyclomatic 24): app.onWheel 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app.js"},"region":{"startLine":3160}}}],"partialFingerprints":{"codehealthFindingId/v1":"396f8d4977aafd9a4ea57c18191aefd43784aa1d01816de8b9fef9246cbb098c"}},{"ruleId":"D1","level":"warning","message":{"text":"getNumber (cyclomatic 24): getNumber has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"581606de490fe210ccafa6eb93d98b6f7e3f04234d0540a71d6f3388d560d2a8"}},{"ruleId":"D1","level":"warning","message":{"text":"compress.compressCmap (cyclomatic 23): compress.compressCmap has cyclomatic complexity 23 (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":"external/cmapscompress/compress.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78afdfed8aa29d9008956f1828b505a1eca89cb1d14464387f576243ec78a4f"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryCMapReader.process (cyclomatic 23): BinaryCMapReader.process 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/binary_cmap.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"706e8ceaefe8e13f1fba956afb043f17a2508cfe5f6f9526a096d64cb6f0cccf"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFFunction.constructSampled (cyclomatic 23): PDFFunction.constructSampled has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 10 of the 23 points are its own statements and the rest belongs to one function item inside it that branches (constructSampledFn). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/function.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fc1c160424084d628c0bec3bf01411dcde2cbe9f71f4ee776fe273e481fc7e"}},{"ruleId":"D1","level":"warning","message":{"text":"evaluator.normalizeBlendMode (cyclomatic 23): evaluator.normalizeBlendMode has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4defbcdb5073766389d6891844c1d5f6266b1e5a74369ca82ade0ed58a11ad1"}},{"ruleId":"D1","level":"warning","message":{"text":"ChoiceWidgetAnnotation._getAppearance (cyclomatic 23): ChoiceWidgetAnnotation._getAppearance has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":4059}}}],"partialFingerprints":{"codehealthFindingId/v1":"09074fdfcb46a22d80ceb4528604655bda18709b3d0e6481f2f77a5fee521284"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasGraphics._createMaskCanvas (cyclomatic 23): CanvasGraphics._createMaskCanvas has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"df415ca9e8c4d45da62e6a2fa99fcf8412d84675e6e130a6cafb56aabf73398a"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFDateString.toDateObject (cyclomatic 23): PDFDateString.toDateObject has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/dom_utils.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc98b278c4ed351be2ed7986b0da5c7c5e1cba7bb021db77ab7aab784ff35ef"}},{"ruleId":"D1","level":"warning","message":{"text":"AnnotationElement._createContainer (cyclomatic 23): AnnotationElement._createContainer has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: AnnotationElementFactory.create (cyclomatic 28) 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":"src/display/annotation_layer.js"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"57df5c32ec1ee823316f5ea9785f9e8a2ed54bcb634181b7452b491d333133c8"}},{"ruleId":"D1","level":"warning","message":{"text":"AnnotationLayer.#addElementsToDOM (cyclomatic 23): AnnotationLayer.#addElementsToDOM has cyclomatic complexity 23 (threshold 15). 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, separate the cases: extract each independent 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: AnnotationElementFactory.create (cyclomatic 28) 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":"src/display/annotation_layer.js"},"region":{"startLine":4114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9082b76bf57bd8cc779f1e6777b15cbbe33e231b4ebb303ef534e84de87bc55"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFPageView.draw (cyclomatic 23): PDFPageView.draw has cyclomatic complexity 23 (threshold 15). 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: 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":"web/pdf_page_view.js"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f786cee0d0c85fc9c9d5530163692109d1ab1221d0bf32f346b9705113b0b1"}},{"ruleId":"D1","level":"warning","message":{"text":"executeOperatorList (cyclomatic 23): executeOperatorList has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1be0d53d1e2c9427fc6f127cdd73d455de4c3e71bb2fcddfef1fc40bded6ce"}},{"ruleId":"D1","level":"warning","message":{"text":"_parseHashParams (cyclomatic 23): _parseHashParams has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 belong to 31 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":"web/app.js"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c75902453c58c24aefd1f6bbf7905d8a494c77d567f0558ecfd55a21e9f520"}},{"ruleId":"D1","level":"warning","message":{"text":"createWebpackConfig (cyclomatic 23): createWebpackConfig has cyclomatic complexity 23 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 4 belong to 3 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":"gulpfile.mjs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3926b8938fab66ffcb861340d48bc23713096768b455b5b94c5678152de0c21"}},{"ruleId":"D1","level":"warning","message":{"text":"#collectFieldObjects (cyclomatic 23): #collectFieldObjects has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"b019b880b89e58b1ead13366167a8f97784da666b42588ea58fa92d0ef5bf39f"}},{"ruleId":"D1","level":"warning","message":{"text":"resolveCommonObject (cyclomatic 23): resolveCommonObject has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/object_handler.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1fe59cd3d7996e2df924f36ccc4100f7e41123f23d720a15e81c1e33781567"}},{"ruleId":"D1","level":"warning","message":{"text":"gulpfile.runTests (cyclomatic 22): gulpfile.runTests 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 2 function literals inside it that branch (lines 828, 917). 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":"gulpfile.mjs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"816c157345e60193acae7450cbc4306950941b713e4af19dc8ddca7c2a734527"}},{"ruleId":"D1","level":"warning","message":{"text":"util._isValidExplicitDest (cyclomatic 22): util._isValidExplicitDest 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/util.js"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f938a4dfb5419f697a929844bf794e5a25a0b566d9159d64b30a5a6ce427a22"}},{"ruleId":"D1","level":"warning","message":{"text":"PredictorStream.readBlockPng (cyclomatic 22): PredictorStream.readBlockPng 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/predictor_stream.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"8636bbb67dd52fb09b589577be01d811aa991b450e8977524ff05881572621f6"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.getObj (cyclomatic 22): Parser.getObj has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9fd5baab121aabbcb8fb9f995b7f1612b22f96c30e1ff469ed25e035196017"}},{"ruleId":"D1","level":"warning","message":{"text":"font_substitutions.getFontSubstitution (cyclomatic 22): font_substitutions.getFontSubstitution has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/font_substitutions.js"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a887e99e4c7b7ce55e8e09d8060c8125f24e40e12cb8ed30d6bce49490df97"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFImage._fillDownscaledRgba (cyclomatic 22): PDFImage._fillDownscaledRgba has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image.js"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6aac9ec570646e4f77cf52410018734f53d3219f217a42ce01d7e32f3be621"}},{"ruleId":"D1","level":"warning","message":{"text":"EvaluatorPreprocessor.read (cyclomatic 22): EvaluatorPreprocessor.read has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":5541}}}],"partialFingerprints":{"codehealthFindingId/v1":"786c015185396aee23d683351639718e579e8143752ca2730b0e9c2e34bf255f"}},{"ruleId":"D1","level":"warning","message":{"text":"AppearanceStreamEvaluator.parse (cyclomatic 22): AppearanceStreamEvaluator.parse has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/default_appearance.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"343a902ad6d4e12821d0f60d1c2836d3ab10398e7414b6f0fba0abe6992a84c3"}},{"ruleId":"D1","level":"warning","message":{"text":"Doc.constructor (cyclomatic 22): Doc.constructor has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d758146929e9d72f5350e7339bb18512c88c7922672687207905717bdb01de95"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_find_utils.getNormalizeWithNFKC (cyclomatic 22): pdf_find_utils.getNormalizeWithNFKC has cyclomatic complexity 22 (threshold 15). Of this number, 20 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":"web/pdf_find_utils.js"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae04b2861c33a6648be8bb5688ccdd182cde8bc6a899efa8c49ce9a107ca005"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFViewer.onPagesEdited (cyclomatic 22): PDFViewer.onPagesEdited 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":"web/pdf_viewer.js"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b0153e99dbb24679c324c4121e72066582865a52c02a8ac7bae298ae7ccd88"}},{"ruleId":"D1","level":"warning","message":{"text":"render (cyclomatic 22): render has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 10 of the 22 points are its own statements and the rest belongs to 3 function items inside it that branch (complete, a function literal at line 1665, waitForGPU). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api.js"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0f84b65d5c62dfd67b9fa1f103a4690390950c2eddd7c244e38dbc6e738e76"}},{"ruleId":"D1","level":"warning","message":{"text":"toJSObject (cyclomatic 22): toJSObject has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":2291}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe413e4154bec6157d671779ee45bf8a8d96944a2aa81013179913d982bfca6"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor (cyclomatic 22): constructor has cyclomatic complexity 22 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 7 belong to 7 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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b525ffdc3b0580393aa2088f1d3e9ab200ba1e02de1a467f9a70eea8f90b2c5f"}},{"ruleId":"D1","level":"warning","message":{"text":"parseIf (cyclomatic 22): parseIf has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/formcalc_parser.js"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fc9b2a8f0db376572149dbffbfd0c5cce00171c804a0e3fc366eb10260b834"}},{"ruleId":"D1","level":"warning","message":{"text":"#buildLine (cyclomatic 22): #buildLine has cyclomatic complexity 22 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 7 belong to 6 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":"web/internal/draw_ops_view.js"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26a89ce5508ea2fe7bd1ffa391fe3bb7911918710d74649ebbfcabd7a4e3b63"}},{"ruleId":"D1","level":"warning","message":{"text":"getPdfFilenameFromUrl (cyclomatic 22): getPdfFilenameFromUrl has cyclomatic complexity 22 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 8 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":"src/display/dom_utils.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc09e2cd72ae8baf91a6753b8239c0a21ec255c06cc9aecf7e48e67a27d2919d"}},{"ruleId":"D1","level":"warning","message":{"text":"string_utils.stringToPDFString (cyclomatic 21): string_utils.stringToPDFString has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/string_utils.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56e982c8f93e41e6480096a1f02d8f515caba05836de557998216342a938247"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.makeInlineImage (cyclomatic 21): Parser.makeInlineImage has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"631dc8cf7854aa2dbbb14d7e966677ee4d35eb5bc810f58d538f6b3a5580b304"}},{"ruleId":"D1","level":"warning","message":{"text":"PartialEvaluator.buildFormXObject (cyclomatic 21): PartialEvaluator.buildFormXObject has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98cf3076fa32de776e206222e4a2bfea905e4f2fcc49a5771bd5fbfae5b750d"}},{"ruleId":"D1","level":"warning","message":{"text":"som.searchNode (cyclomatic 21): som.searchNode has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/som.js"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae425999140d3f76ea4932236b37b82f9dc9589216c716fa983e641fe5adb0f1"}},{"ruleId":"D1","level":"warning","message":{"text":"XhtmlObject.[$pushGlyphs] (cyclomatic 21): XhtmlObject.[$pushGlyphs] has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/xhtml.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"258cc489be019026ce9905f94a818ef6f1c70d119e309bc7b392a224414c80bb"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFScriptingManager.setDocument (cyclomatic 21): PDFScriptingManager.setDocument has cyclomatic complexity 21 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 5 belong to 4 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":"web/pdf_scripting_manager.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa80c2e6ca2e568aa46a3e2c18a3e017ef5858aee4e59c2eb65d15a5630b1765"}},{"ruleId":"D1","level":"warning","message":{"text":"run (cyclomatic 21): run has cyclomatic complexity 21 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 5 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":"web/app.js"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e333fedaf382ffa5ba22aaf8f5dd0fd326673915423adebb15498f9058268d6"}},{"ruleId":"D1","level":"warning","message":{"text":"#setScaleUpdatePages (cyclomatic 21): #setScaleUpdatePages 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":"web/pdf_viewer.js"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"0986cc608571d2fe1efdf5d2691b57c8e5fb3fa7c37c968952720f75442044d0"}},{"ruleId":"D1","level":"warning","message":{"text":"documentInfo (cyclomatic 21): documentInfo has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e2093f824070c4afc5977a41ae4b6ec8c9d58a6fa6c40b48b219773014ac91"}},{"ruleId":"D1","level":"warning","message":{"text":"(computed) (cyclomatic 21): (computed) has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/xhtml.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e2d376643b89485e52873e1d51bd2722968687acee18de80393426168be817"}},{"ruleId":"D1","level":"warning","message":{"text":"render (cyclomatic 21): render has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/xfa_layer.js"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b4229faa25d77cd859a4b4854f4db888a347a462cc2da4420b3a45b83515c9"}},{"ruleId":"D1","level":"warning","message":{"text":"cmap.parseCMap (cyclomatic 20): cmap.parseCMap has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cmap.js"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04139624979ceae441257689e2cb4ec4f5ba8152a006a87642144a2aefb31d0"}},{"ruleId":"D1","level":"warning","message":{"text":"PsWasmCompiler._compileUnaryNode (cyclomatic 20): PsWasmCompiler._compileUnaryNode has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/wasm_compiler.js"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"195cb376a19af09fe9e76ccbf9f76df31e20aca7bbd34b943849afbfe726b440"}},{"ruleId":"D1","level":"warning","message":{"text":"PsWasmCompiler._compileNodeAsBoolI32 (cyclomatic 20): PsWasmCompiler._compileNodeAsBoolI32 has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/wasm_compiler.js"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"6827ca6243b8b8d5cc280019bc9d882b278f29e0deb073ef5891276721469f35"}},{"ruleId":"D1","level":"warning","message":{"text":"XRef.readXRefTable (cyclomatic 20): XRef.readXRefTable has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xref.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec775182c07ba46b8d6434893b4dc6b17fbfa9eaa3996361afae6e80069c8dd"}},{"ruleId":"D1","level":"warning","message":{"text":"XRef.fetchCompressed (cyclomatic 20): XRef.fetchCompressed has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xref.js"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18a598a331be3bc7e12bc4b6de68f0f02d71717e91f7f5423464918d1d79725"}},{"ruleId":"D1","level":"warning","message":{"text":"Catalog.#readPageLabels (cyclomatic 20): Catalog.#readPageLabels has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47ca5d484096e4f03b2427f9c92e5b71e82ea4a246a4600122fe4b67324ba3e"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_images.createImage (cyclomatic 20): pdf_images.createImage has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_images.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a9ac705e762f7b401f85facf2708a7861c2f376246bf32baf58086e0b8ad30"}},{"ruleId":"D1","level":"warning","message":{"text":"FontFinder.find (cyclomatic 20): FontFinder.find has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/fonts.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cf1b90f63abb219d82aafad7450c789f21a412d5c2584c31d7a747ea54b589"}},{"ruleId":"D1","level":"warning","message":{"text":"Image.[$toHTML] (cyclomatic 20): Image.[$toHTML] has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":3408}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f4d96760aa9ffce67e32078cf2fbb42c98538b13eaa845ff7c65dfa2fa2c34"}},{"ruleId":"D1","level":"warning","message":{"text":"template.handleBreak (cyclomatic 20): template.handleBreak has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"842b978b585cb54f9fbd9e573a5ae00f36cd770ce2b600bffbe9a447f367b307"}},{"ruleId":"D1","level":"warning","message":{"text":"MessageHandler.#processStreamMessage (cyclomatic 20): MessageHandler.#processStreamMessage has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/message_handler.js"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65caab71184cd801cc7c2e9d3f9d0f6ffecd96dd78d69a58609fed52a39b068"}},{"ruleId":"D1","level":"warning","message":{"text":"AnnotationEditorLayer.disable (cyclomatic 20): AnnotationEditorLayer.disable has cyclomatic complexity 20 (threshold 15). Of this number, 14 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":"src/display/editor/annotation_editor_layer.js"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65267cc154417ebac8d5afb4f81544facd267a409f8f9d7981420b57c1a0f0e"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFRenderingQueue.getHighestPriority (cyclomatic 20): PDFRenderingQueue.getHighestPriority 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":"web/pdf_rendering_queue.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e599a6d628e9660640b2525a32aa7c3aa8d21ed93dff0d9322ea956515bbef2f"}},{"ruleId":"D1","level":"warning","message":{"text":"(computed) (cyclomatic 20): (computed) has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":3408}}}],"partialFingerprints":{"codehealthFindingId/v1":"e620233cbc8db030580751ced54cfa93954e99c76f43918ab2a4c74b9f90ff54"}},{"ruleId":"D1","level":"warning","message":{"text":"_initializeMetadata (cyclomatic 20): _initializeMetadata 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":"web/app.js"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"37806fb3796ebb402a00b3c0f5bd11a0aea7ae621d102d628d290e04f834b526"}},{"ruleId":"D1","level":"warning","message":{"text":"#findClosestThumbnail (cyclomatic 20): #findClosestThumbnail 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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":1895}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bff96d9d1256d375fdd77c59c98f53be43747e42fd8ef58cd89aa0e9a00bf85"}},{"ruleId":"D1","level":"warning","message":{"text":"#onPagesEdited (cyclomatic 20): #onPagesEdited 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":"web/pdf_find_controller.js"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc87a612d2a4770080b296d90bcde508750eac2b06d6c6824eed6187815fdfd"}},{"ruleId":"D1","level":"warning","message":{"text":"prefs.buildPrefsSchema (cyclomatic 19): prefs.buildPrefsSchema 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":"external/chromium/prefs.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a88da4fad129f2789cb4b81ab656d150290cdddd7b5001800933f1869c62267"}},{"ruleId":"D1","level":"warning","message":{"text":"fonts.createNameTable (cyclomatic 19): fonts.createNameTable has cyclomatic complexity 19 (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":"src/core/fonts.js"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d95db8c36a0dae04fe615f2cff4741a208dfad1e2b77535262cae40b1cab1c"}},{"ruleId":"D1","level":"warning","message":{"text":"ast._evalUnaryConst (cyclomatic 19): ast._evalUnaryConst has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db42c4844b91c8e5d8797f8dd1bec506a192707a0fb99a8e651797c91921458"}},{"ruleId":"D1","level":"warning","message":{"text":"Catalog.#readDocumentOutline (cyclomatic 19): Catalog.#readDocumentOutline has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"040670bf874ac1d1de924f6fe122ab4c5a6d67aaa1b877281a422f2129fda95f"}},{"ruleId":"D1","level":"warning","message":{"text":"StructTreeLayerBuilder.#setAttributes (cyclomatic 19): StructTreeLayerBuilder.#setAttributes 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":"web/struct_tree_layer_builder.js"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"0babfa6a8e923b77045f566171085692af323005b3103e569401ae7720a66f06"}},{"ruleId":"D1","level":"warning","message":{"text":"TouchManager.#onTouchMove (cyclomatic 19): TouchManager.#onTouchMove has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/touch_manager.js"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e08e3062f01345b284c92b3d7e8ab3ae7d8db0f96ea5e1fd1fb6857781ebaea"}},{"ruleId":"D1","level":"warning","message":{"text":"XfaLayer.setupStorage (cyclomatic 19): XfaLayer.setupStorage has cyclomatic complexity 19 (threshold 15). Of this number, 17 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":"src/display/xfa_layer.js"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7ee06178b0533ca9756cc50f0042fb9ef16f0d941fca308e1a2e38b7193d62"}},{"ruleId":"D1","level":"warning","message":{"text":"Util.#createDateActions (cyclomatic 19): Util.#createDateActions has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 344, 346, 354, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/util.js"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"959b505317e05ad59c56ed05bf01cd009c3d481181946f8786b22ec45726c26d"}},{"ruleId":"D1","level":"warning","message":{"text":"TextHighlighter._renderMatches (cyclomatic 19): TextHighlighter._renderMatches has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 3 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":"web/text_highlighter.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d7e86ca7206d6b302b72af8627040564c7e42f576c2e5cdbe486da06d60e8d"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFPageView.cancelRendering (cyclomatic 19): PDFPageView.cancelRendering has cyclomatic complexity 19 (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":"web/pdf_page_view.js"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe369e7b04d93053956f0bdc834f1c7aba02222c327ee71f00ae8e97620c771"}},{"ruleId":"D1","level":"warning","message":{"text":"CaretBrowsingMode.moveCaret (cyclomatic 19): CaretBrowsingMode.moveCaret 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":"web/caret_browsing.js"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c503b8cbb8f05fbca1eb408eec0af4ec34e4b3f08b262ea8635e4544416047"}},{"ruleId":"D1","level":"warning","message":{"text":"SignatureManager.#initDrawTab (cyclomatic 19): SignatureManager.#initDrawTab has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 456, drawCallback, a function literal at line 484, \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":"web/signature_manager.js"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"474c8817f93236fb5ed423c04a83459e030e297e68c168d798c5ce8810ef7e22"}},{"ruleId":"D1","level":"warning","message":{"text":"#setupEventListeners (cyclomatic 19): #setupEventListeners has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 14 function items inside it that branch (a function literal at line 571, a function literal at line 468, a function literal at line 536, \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":"web/internal/page_view.js"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"5782d282fd410a43038a7a5bfa9bfcda3b0c6027164b480a9948cf02cc760913"}},{"ruleId":"D1","level":"warning","message":{"text":"#setup (cyclomatic 19): #setup has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 478, 384, 335, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/renderer_worker.js"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccf1d39539c5c958e85f8926235a7cf07f4ffbc6ec6cfedbd0f29493645fff8"}},{"ruleId":"D1","level":"warning","message":{"text":"generate (cyclomatic 19): generate has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 3 belong to 5 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/hellbox.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba76b4333e4e73bdcf1629075b994ae77c108d67d9930d9dbe8c290b1132cbfd"}},{"ruleId":"D1","level":"warning","message":{"text":"contentscript.watchObjectOrEmbed (cyclomatic 18): contentscript.watchObjectOrEmbed has cyclomatic complexity 18 (threshold 15). 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: 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":"extensions/chromium/contentscript.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd6acaf1660753fa926d2023d5fd8054880ec1617efd5412bd7013258a9c923"}},{"ruleId":"D1","level":"warning","message":{"text":"core_utils.escapePDFName (cyclomatic 18): core_utils.escapePDFName has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/core_utils.js"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a806e9886fbe89bc142c65025d74adab9e4e6d2c973034ad0bfc1a75dad086f"}},{"ruleId":"D1","level":"warning","message":{"text":"Linearization.create (cyclomatic 18): Linearization.create has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 9 belong to 2 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":"src/core/parser.js"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ede2c07bc32972239d5ab1c1a8691765c6876359306909c29601ab0c87a653"}},{"ruleId":"D1","level":"warning","message":{"text":"fonts.adjustMapping (cyclomatic 18): fonts.adjustMapping has cyclomatic complexity 18 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29f259942c53536ca98985178c21cfe058b5f3608549a51f5334cfa6b7d86ed"}},{"ruleId":"D1","level":"warning","message":{"text":"RadialAxialShading.constructor (cyclomatic 18): RadialAxialShading.constructor has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pattern.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6ef277bd16942578baf705bf2afff72b4149aaf3608b71f975f231b72d6f0e"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer.next (cyclomatic 18): Lexer.next has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/lexer.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a361186b1737f399d639dd537c232f1fa648a07924245ccbff41697d26f500"}},{"ruleId":"D1","level":"warning","message":{"text":"PSStackToTree._makeUnary (cyclomatic 18): PSStackToTree._makeUnary has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dbf9079eec1ed7df93efd60edac437d1a1d3f3492f3a5e74addb114d66c590"}},{"ruleId":"D1","level":"warning","message":{"text":"XMLParserBase._parseContent (cyclomatic 18): XMLParserBase._parseContent has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xml_parser.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fabe9b2993729860d629674bb098fc818d6345c58ffb5d763a580cd0987533"}},{"ruleId":"D1","level":"warning","message":{"text":"StructTreeRoot.#collectParents (cyclomatic 18): StructTreeRoot.#collectParents has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba47aca8cceffae88f249fcf7de37ed22b243aa89f2066696487cd9efa821223"}},{"ruleId":"D1","level":"warning","message":{"text":"StructTreePage.parse (cyclomatic 18): StructTreePage.parse has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffe87e6007279fefba08d264f6cce2c9d021f002b093be457d2c7aa2ed211d9"}},{"ruleId":"D1","level":"warning","message":{"text":"XRef.readXRefStream (cyclomatic 18): XRef.readXRefStream has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xref.js"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c277340894f2a8191394ea7d5a9ececa9303f4ffc30c816abc689d6857f15387"}},{"ruleId":"D1","level":"warning","message":{"text":"xhtml.mapStyle (cyclomatic 18): xhtml.mapStyle has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/xhtml.js"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2d0a1f2a21ced8ad62d4610ad70befffae698efdbef7208f7fdbae53a9a79c"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFEditor.#postCollectPageData (cyclomatic 18): PDFEditor.#postCollectPageData has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 1247). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd9f5f3d832a9b06394cc496237079e5e5c9de40dcf4fc0101976a06f78b875"}},{"ruleId":"D1","level":"warning","message":{"text":"FreeTextEditor.editorDivPaste (cyclomatic 18): FreeTextEditor.editorDivPaste has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/freetext.js"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c41d3a55b76b8cd3116f9440ebd122149d7592ea12f175769de99ffe56a29c1"}},{"ruleId":"D1","level":"warning","message":{"text":"ui_utils.getVisibleElements (cyclomatic 18): ui_utils.getVisibleElements has cyclomatic complexity 18 (threshold 15). Of this number, 17 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":"web/ui_utils.js"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6f3983a497ac7199d9122204f0f68e19ddfe02598fd738542df62c66e3e636"}},{"ruleId":"D1","level":"warning","message":{"text":"TextLayer.#appendText (cyclomatic 18): TextLayer.#appendText has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/text_layer.js"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6101ac291a022422b5c66fa409d22867a63105053bf668708cd6ea0bf9f498"}},{"ruleId":"D1","level":"warning","message":{"text":"Doc.resetForm (cyclomatic 18): Doc.resetForm has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdd8ea416af046262bca63e93f3ba34812ddae9ac35c4094ff156a4e005cb77"}},{"ruleId":"D1","level":"warning","message":{"text":"draw_ops_view.formatArg (cyclomatic 18): draw_ops_view.formatArg has cyclomatic complexity 18 (threshold 15). Of this number, 17 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":"web/internal/draw_ops_view.js"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5d16e37ab16fa62451c3d2369b380298fa81e2227bf15c1454ea8c1a149a74"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewsManager.switchView (cyclomatic 18): ViewsManager.switchView 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":"web/views_manager.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27e7e5d8b238a0df756e7198a3d2aeb4a7635c8ddabd9bf924fcaa55f15fd87"}},{"ruleId":"D1","level":"warning","message":{"text":"_getContentType (cyclomatic 18): _getContentType has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":5627}}}],"partialFingerprints":{"codehealthFindingId/v1":"976602fc8d398cd0aec689728d974e8245c04d9dfa391988adb0f7175efa97fa"}},{"ruleId":"D1","level":"warning","message":{"text":"core_utils.deepCompare (cyclomatic 17): core_utils.deepCompare has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/core_utils.js"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7922c018d44aee679b84a745d28c25c4910395d58c3b0ea5a61e492cbcae08"}},{"ruleId":"D1","level":"warning","message":{"text":"ColorSpaceUtils.parse (cyclomatic 17): ColorSpaceUtils.parse has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/colorspace_utils.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d5c6c56887d1fe7a0b545ab04851d1d19baaf9895de0e5a3b53755bdfed10f"}},{"ruleId":"D1","level":"warning","message":{"text":"CFFParser.parse (cyclomatic 17): CFFParser.parse 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_parser.js"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"d524efdf2396bae9c61eb54522f385f3aaf436f9b26f4bffc402eed147e2001c"}},{"ruleId":"D1","level":"warning","message":{"text":"CFFParser.parseCharsets (cyclomatic 17): CFFParser.parseCharsets has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_parser.js"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a85ecb84e4377be96f259bc26e02e9ab255ae4d0fb0f12c94ae1de895fdfad5"}},{"ruleId":"D1","level":"warning","message":{"text":"PartialEvaluator.buildToUnicode (cyclomatic 17): PartialEvaluator.buildToUnicode 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":4091}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d60012c81b9c8249f1c49ef075ace7b3bb077c847568e17ed68bce37f4ec30"}},{"ruleId":"D1","level":"warning","message":{"text":"SimpleDOMNode.searchNode (cyclomatic 17): SimpleDOMNode.searchNode has cyclomatic complexity 17 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xml_parser.js"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0212bc63aac6e80d2c1547d1c222714c8525cc11619bf870e96f32bb4a1bb676"}},{"ruleId":"D1","level":"warning","message":{"text":"StructTreeRoot.canUpdateStructTree (cyclomatic 17): StructTreeRoot.canUpdateStructTree has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"682285a7394946c672b1f30fa56e698fc76eae9e763387f7d34c59608ee674e6"}},{"ruleId":"D1","level":"warning","message":{"text":"XRef.readXRef (cyclomatic 17): XRef.readXRef has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xref.js"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd563e34ee0573280bc81fe71ad171f10dfa3bce1630ca0a43dc27835cf9b19"}},{"ruleId":"D1","level":"warning","message":{"text":"Annotation.setLineEndings (cyclomatic 17): Annotation.setLineEndings 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: MediaAnnotation._getContentType (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7cd359fd52a984631e982d87218ebcb9ba7becd3fcf7e99c79e01311296437"}},{"ruleId":"D1","level":"warning","message":{"text":"FreeTextAnnotation.createNewAppearanceStream (cyclomatic 17): FreeTextAnnotation.createNewAppearanceStream 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: MediaAnnotation._getContentType (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":4504}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c5c04095fe2825c79cb4033656df90869711b32ff4902744c1e19fc103f9b1"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasDependencyTracker.recordCharacterBBox (cyclomatic 17): CanvasDependencyTracker.recordCharacterBBox has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas_dependency_tracker.js"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"6162cd2ba8f8d0449c6524d9b0a0fe880b1d95857292ea2031f4444b5d807620"}},{"ruleId":"D1","level":"warning","message":{"text":"CommentPopup.toggle (cyclomatic 17): CommentPopup.toggle 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/comment_manager.js"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c22704702e0959e06170c5e92d26b0c44819b16890cd207d87dd5caeb337929"}},{"ruleId":"D1","level":"warning","message":{"text":"AnnotationLayer.render (cyclomatic 17): AnnotationLayer.render 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: AnnotationElementFactory.create (cyclomatic 28) 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":"src/display/annotation_layer.js"},"region":{"startLine":4020}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd01872161fb28c4397b7c7f6c8da1898bb2af60a4743554edf3cb0346f1deaa"}},{"ruleId":"D1","level":"warning","message":{"text":"AForm.AFNumber_Format (cyclomatic 17): AForm.AFNumber_Format 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/aform.js"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b18883d289d6f55019ec50b10756f7e00a9e434bfe5a4e9ad98cce176e5185"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFFindController.#convertToRegExpString (cyclomatic 17): PDFFindController.#convertToRegExpString has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 694, addExtraWhitespaces). 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":"web/pdf_find_controller.js"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98230f734ce2b3e39647181434827288d39ad6a6f180e33b01395cea43ccd33"}},{"ruleId":"D1","level":"warning","message":{"text":"Menu.#setUpMenu (cyclomatic 17): Menu.#setUpMenu has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 174, 129, 115). 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":"web/menu.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8236789ba26954c1306ca42dd1df8f358072766d61cf7783eb1ad4f9fe5b46ef"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFHistory.push (cyclomatic 17): PDFHistory.push 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_history.js"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d26598e51c991b29dfbbede9bf5879ba456a623d5296bdec582b88bc505781"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_history.isDestArraysEqual (cyclomatic 17): pdf_history.isDestArraysEqual has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (isEntryEqual). 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":"web/pdf_history.js"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c93b9849ca1822fbd1e9fd834bc58ed27163f1afebce15f6aa440d1d9c3e50"}},{"ruleId":"D1","level":"warning","message":{"text":"FontView.#render (cyclomatic 17): FontView.#render 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/internal/font_view.js"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d40f504d6fddf85f9c171f5203df77effe3b0132ddfea3ad991b0fe66f604b"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeView.#renderValue (cyclomatic 17): TreeView.#renderValue 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/internal/tree_view.js"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a2aca6e90c1be2dbe44878422d696a17d8563b0d2536777d386ab781cef7f5"}},{"ruleId":"D1","level":"warning","message":{"text":"endGroup (cyclomatic 17): endGroup has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":3649}}}],"partialFingerprints":{"codehealthFindingId/v1":"f019a078909736196bb62b1cfa50436f2294db81319f28ab012c4caf8365f618"}},{"ruleId":"D1","level":"warning","message":{"text":"initialize (cyclomatic 17): initialize 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f179fb76b5146901aaa72884832796ba6d25c53492ce6f287ae0b201c98b49"}},{"ruleId":"D1","level":"warning","message":{"text":"bindWindowEvents (cyclomatic 17): bindWindowEvents has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 10 function items inside it that branch (scroll, scrollend, addWindowResolutionChange, \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":"web/app.js"},"region":{"startLine":2574}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c77a636da16164450d907989efedb6d1d199ec8aa24a7f16c12952975b64a08"}},{"ruleId":"D1","level":"warning","message":{"text":"serialize (cyclomatic 17): serialize has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/stamp.js"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4910264cd67e55aab6637b55635906c9ef57f9171e3d3031ca74ef722cbfd9"}},{"ruleId":"D1","level":"warning","message":{"text":"setOperatorBBoxes (cyclomatic 17): setOperatorBBoxes has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 493, 468). 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":"web/debugger.mjs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4ffc49565d5af46eb01f9e89e911e3de20d39c8eabd6d95843c0ace724dfb2"}},{"ruleId":"D1","level":"warning","message":{"text":"#rebuildMultilineView (cyclomatic 17): #rebuildMultilineView has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 547, a function literal at line 524, getText, \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":"web/internal/draw_ops_view.js"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8b0c1b1cccc1d5bdd8a84eaaa2eef9daa45f6ea9427956e053a1f682cb90f2"}},{"ruleId":"D1","level":"warning","message":{"text":"createEvent (cyclomatic 17): createEvent 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":"src/scripting_api/event.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9ce60c092e0f9f788e90440c3280b47a4acd7934ba8ae8ca56e733d033902b"}},{"ruleId":"D1","level":"warning","message":{"text":"gulpfile.collectArgs (cyclomatic 16): gulpfile.collectArgs 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":"gulpfile.mjs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"b886384bcb07fbfa74f65f3ba0d88a81a815b40be11f280d2e5ff28a8ade5110"}},{"ruleId":"D1","level":"warning","message":{"text":"ColorSpace.fillRgb (cyclomatic 16): ColorSpace.fillRgb has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/colorspace.js"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f21901580323f86701211d4fd353947f8e5c9ea36ad4499fd5cf68519d0cbad"}},{"ruleId":"D1","level":"warning","message":{"text":"PredictorStream.readBlockTiff (cyclomatic 16): PredictorStream.readBlockTiff has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/predictor_stream.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"919e12f5f1f787c219a829108baf1efa1c0c5e41f31dc56274b9e84ad7151aa8"}},{"ruleId":"D1","level":"warning","message":{"text":"CFFParser.parseDict (cyclomatic 16): CFFParser.parseDict has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (parseOperand, parseFloatOperand). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_parser.js"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85a296a6b32eeb36eb230dabc853f70976632db579664f694af795bcc92fa12"}},{"ruleId":"D1","level":"warning","message":{"text":"CFFCompiler.compileNameIndex (cyclomatic 16): CFFCompiler.compileNameIndex 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":"src/core/cff_parser.js"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"98241b9f3b2e79aa81fcc883426812eda47d0b24fc0370c91d922b9726455a17"}},{"ruleId":"D1","level":"warning","message":{"text":"Font.getMissingFileGlyphs (cyclomatic 16): Font.getMissingFileGlyphs has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d408489287326153c109b014e8f99257f83ce951fc6a4805b0359a02b5d490d"}},{"ruleId":"D1","level":"warning","message":{"text":"StructTreeRoot.getElementsForPage (cyclomatic 16): StructTreeRoot.getElementsForPage has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (walk). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3772fefc1753dbc6062333458453cde074ab6007e71d5c516f0d047662ea56e7"}},{"ruleId":"D1","level":"warning","message":{"text":"XFAObject.[_getPrototype] (cyclomatic 16): XFAObject.[_getPrototype] has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/xfa_object.js"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d45d138b0cd2f5776892a849b7ec89980e2f73e6f40f069aea5703b0eaca2b"}},{"ruleId":"D1","level":"warning","message":{"text":"Caption.[$toHTML] (cyclomatic 16): Caption.[$toHTML] has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ecc32b34c697e1229215c291bcb53dd5b5a2f3f31a5359e0c7ec0bc1a70038"}},{"ruleId":"D1","level":"warning","message":{"text":"Draw.[$toHTML] (cyclomatic 16): Draw.[$toHTML] has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"57515272c8cde7d3486c73e88c81cf49ad8af2555c9e729c5354e9c9ba274a16"}},{"ruleId":"D1","level":"warning","message":{"text":"AnnotationFactory.printNewAnnotations (cyclomatic 16): AnnotationFactory.printNewAnnotations 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: MediaAnnotation._getContentType (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21c9caff16d6887f569738ccf250e48a8bdaeccf0f097e8d3cbd84633cb8477"}},{"ruleId":"D1","level":"warning","message":{"text":"InkAnnotation.constructor (cyclomatic 16): InkAnnotation.constructor has cyclomatic complexity 16 (threshold 15). Of this number, 13 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. This is NOT this file\u0027s highest cyclomatic complexity: MediaAnnotation._getContentType (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":4911}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03276f8e949cd2091758aba8659708691e6fe19dbd83029b37d2bee563e8451"}},{"ruleId":"D1","level":"warning","message":{"text":"ChunkedStreamManager.onReceiveData (cyclomatic 16): ChunkedStreamManager.onReceiveData has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/chunked_stream.js"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce5a978addb8ab1c7c73c3d2aee67e037ebfc07bb5f6655156737a578284ed6"}},{"ruleId":"D1","level":"warning","message":{"text":"SingleIntersector.#intersects (cyclomatic 16): SingleIntersector.#intersects 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":"src/core/intersector.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bf0623fcc621032bd52b43be3219db893e3818d1b61532e010f491eac03a1e"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFEditor.#makeOutline::fillItems (cyclomatic 16): PDFEditor.#makeOutline::fillItems has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc26fe45353f6f997f326e639c9ad0514e82c0b091e3b9041a13bb54d692728b"}},{"ruleId":"D1","level":"warning","message":{"text":"AnnotationEditorUIManager.#selectionChange (cyclomatic 16): AnnotationEditorUIManager.#selectionChange has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 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":"src/display/editor/tools.js"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dca5936cfae4fdaa2afd018711841719201e13ad2dbd6379ee25d33fea98400"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkAnnotationElement.render (cyclomatic 16): LinkAnnotationElement.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: AnnotationElementFactory.create (cyclomatic 28) 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":"src/display/annotation_layer.js"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bcf5c3da1ef08464c0679f4549ca18b0eb9e3b3321d61f7dd5ab2fc42f498d"}},{"ruleId":"D1","level":"warning","message":{"text":"AnnotationLayer.#setAnnotationCanvasMap (cyclomatic 16): AnnotationLayer.#setAnnotationCanvasMap 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: AnnotationElementFactory.create (cyclomatic 28) 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":"src/display/annotation_layer.js"},"region":{"startLine":4280}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa994727d1a883dbdd79d151f937264bc2088a0e385682a07595614a08a964fb"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFFindController.#onFind (cyclomatic 16): PDFFindController.#onFind 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 one function literal inside it that branches (line 508). 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":"web/pdf_find_controller.js"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbf601a27d596208e377145b263c6f8ddc73a6405dfcb4fc98ad91d53f014ae"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFThumbnailViewer.#addDragListeners (cyclomatic 16): PDFThumbnailViewer.#addDragListeners has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 1523, 1571, 1635, \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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b8058e156eb351e5d02faa2cafb22394e4901479b71b0cc54b3f2918075c4d"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFPageView.cssTransform (cyclomatic 16): PDFPageView.cssTransform has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_page_view.js"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed91a461452c7a420b4b65dcef43efdfcc6b24027c30923669eba6be1d6a7c6"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFPresentationMode.#touchSwipe (cyclomatic 16): PDFPresentationMode.#touchSwipe 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":"web/pdf_presentation_mode.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c438bacf3e55393a4fef1503107635214b5127b2745d151f63c1c58d66b8b7"}},{"ruleId":"D1","level":"warning","message":{"text":"(computed) (cyclomatic 16): (computed) has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"77db0d1d08cb0a554f76b24a3374470a46c311d1e59d16e0bd96349581b43405"}},{"ruleId":"D1","level":"warning","message":{"text":"(computed) (cyclomatic 16): (computed) has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"58da1d7ec1aee98451cd71cbf42e9218c57f9416857408dab8e5fa30847c1d04"}},{"ruleId":"D1","level":"warning","message":{"text":"_prepareSMaskCanvas (cyclomatic 16): _prepareSMaskCanvas has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56707bff8672e671d6d70f6aead64c00de37b0ff7bb1635dda993943417b81a"}},{"ruleId":"D1","level":"warning","message":{"text":"extractPages (cyclomatic 16): extractPages has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api.js"},"region":{"startLine":2890}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38f58b81c6389b3ed580938605fa9335a94abc82d3480a03c993fa06397aa58"}},{"ruleId":"D1","level":"warning","message":{"text":"renderDocs (cyclomatic 16): renderDocs has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to 5 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":"gulpfile.mjs"},"region":{"startLine":3364}}}],"partialFingerprints":{"codehealthFindingId/v1":"e446ccfe0bd6a5ae967a76ba56218874b71811f8fd892a478f49763ca63cdca8"}},{"ruleId":"D1","level":"warning","message":{"text":"(computed) (cyclomatic 16): (computed) has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/xfa_object.js"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32cb917f096683bc6eb587613ced8edba68d45766726c69e192bb469e522659"}},{"ruleId":"D1","level":"warning","message":{"text":"postScriptToJSCode (cyclomatic 16): postScriptToJSCode has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 3 function items inside it that branch (ensureShared, a function literal at line 447, a function literal at line 492). 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: _unaryToExpr (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/internal_viewer_utils.js"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"4974d783e6ddb357c7477263ddd351311a68ddfc5aa20b724d72d7778e7c92b9"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialEvaluator.getOperatorList (cognitive 242): PartialEvaluator.getOperatorList has cognitive complexity 242 (threshold 15). Drivers by points: if/else 78 (224 pts), boolean chains 6, loops 4 (6 pts), error handling 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 151). Most of this is not in the body itself: 9 of the 242 points are its own statements and the rest belongs to 12 function items inside it that branch (a function literal at line 1687, a function literal at line 1730, a function literal at line 2132, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce378863256e60d0f2006f2ade59879c0737adeed7c89ee0305b9fe24ad206a0"}},{"ruleId":"D2","level":"warning","message":{"text":"getOperatorList::promiseBody (cognitive 187): getOperatorList::promiseBody has cognitive complexity 187 (threshold 15). Drivers by points: if/else 53 (164 pts), error handling 4 (13 pts), loops 2 (4 pts), ternaries 1 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 125). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca9e88ae6c5a4bef912df9a23748e30a0a4b7c186dbfe93b4f864d9792fbc7e"}},{"ruleId":"D2","level":"warning","message":{"text":"render (cognitive 183): render has cognitive complexity 183 (threshold 15). Drivers by points: if/else 48 (130 pts), boolean chains 18, loops 3 (14 pts), ternaries 3 (13 pts), match/switch 1 (4 pts), other 4 (nesting depth added 106). Of this number, 55 points are the body\u0027s own statements and 128 belong to 16 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"d695ec9625c9e5f2f2b073849370d56827cdf12bd9390ccb969e4b587e721da4"}},{"ruleId":"D2","level":"warning","message":{"text":"checkAndRepair (cognitive 179): checkAndRepair has cognitive complexity 179 (threshold 15). Drivers by points: if/else 204 (390 pts), loops 53 (114 pts), boolean chains 76, ternaries 13 (21 pts), error handling 2 (4 pts), match/switch 2, other 2 (nesting depth added 257). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a4c0560ce178b540e6a248cafe1ba65c3a5117c1e6c02697aab3d9915ad0d4"}},{"ruleId":"D2","level":"warning","message":{"text":"#mergeStructTrees (cognitive 168): #mergeStructTrees has cognitive complexity 168 (threshold 15). Drivers by points: if/else 41 (111 pts), loops 15 (39 pts), boolean chains 12, ternaries 2 (5 pts), other 1 (nesting depth added 97). Of this number, 142 points are the body\u0027s own statements and 26 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a280127cd86d72e8ac89c0c8d5bacc1a797bc03a75e36aed4dc3a37613d2c06"}},{"ruleId":"D2","level":"warning","message":{"text":"bidi (cognitive 152): bidi has cognitive complexity 152 (threshold 15). Drivers by points: if/else 43 (91 pts), loops 19 (29 pts), boolean chains 23, ternaries 5 (9 pts) (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bidi.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"732b9633a14226d5815c4699b80e7bd2e50609fe7dc18b37a3a32534433f316f"}},{"ruleId":"D2","level":"warning","message":{"text":"onKeyDown (cognitive 142): onKeyDown has cognitive complexity 142 (threshold 15). Drivers by points: if/else 43 (100 pts), boolean chains 27, match/switch 5 (11 pts), ternaries 4 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app.js"},"region":{"startLine":3315}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e96c89ae86007af494f10cab43332531784b111dbc86f36736c6401f3eb619f"}},{"ruleId":"D2","level":"warning","message":{"text":"optimize.optimizeCMap (cognitive 138): optimize.optimizeCMap has cognitive complexity 138 (threshold 15). Drivers by points: if/else 19 (62 pts), loops 18 (58 pts), boolean chains 12, ternaries 2 (6 pts) (nesting depth added 87). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/cmapscompress/optimize.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3587935b1e6753a44cc34a7c9c7263b28e73666e4f2615c53c3155ca62e7ce36"}},{"ruleId":"D2","level":"warning","message":{"text":"Font.checkAndRepair::sanitizeTTProgram (cognitive 133): Font.checkAndRepair::sanitizeTTProgram has cognitive complexity 133 (threshold 15). Drivers by points: if/else 43 (95 pts), loops 7 (23 pts), boolean chains 15 (nesting depth added 68). 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: 4 other methods here (Font.checkAndRepair::readTrueTypeCollectionData, Font.checkAndRepair::sanitizeGlyph, Font.checkAndRepair::readPostScriptTable, \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":"src/core/fonts.js"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6728c63acf922ff69d32630262cc3ef3762cb6e72c96e7cb27d31724aebbd70"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFEditor.#cloneStructTreeNode (cognitive 121): PDFEditor.#cloneStructTreeNode has cognitive complexity 121 (threshold 15). Drivers by points: if/else 35 (87 pts), ternaries 5 (12 pts), boolean chains 11, loops 5 (11 pts) (nesting depth added 65). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"85743d547d12d516dfcc82fb45442e53bf043eaf166ee088d80aa93240927844"}},{"ruleId":"D2","level":"warning","message":{"text":"parseDestDictionary (cognitive 120): parseDestDictionary has cognitive complexity 120 (threshold 15). Drivers by points: if/else 42 (94 pts), boolean chains 7, match/switch 2 (7 pts), loops 2 (6 pts), error handling 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 65). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa96d14ae02062c9871a47d7afb63131d8b0426b464d33bd845e8c517786804"}},{"ruleId":"D2","level":"warning","message":{"text":"compileCharString::parse (cognitive 119): compileCharString::parse has cognitive complexity 119 (threshold 15). Drivers by points: if/else 23 (66 pts), loops 11 (31 pts), ternaries 4 (16 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 78). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/font_renderer.js"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0c12c2f9030bdaebd2e44c3e48a946f954c43965f82cff7c9cac670302a05d"}},{"ruleId":"D2","level":"warning","message":{"text":"indexObjects (cognitive 118): indexObjects has cognitive complexity 118 (threshold 15). Drivers by points: if/else 36 (80 pts), loops 10 (16 pts), boolean chains 13, error handling 3 (9 pts) (nesting depth added 56). Of this number, 108 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":"src/core/xref.js"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"89bd6c443f8b2a5db37a47063d38bb147416ef9aeac57c57078eae709a405e99"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 117): (computed) has cognitive complexity 117 (threshold 15). Drivers by points: if/else 49 (81 pts), ternaries 7 (19 pts), boolean chains 11, match/switch 3 (6 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":2741}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f42adc144f30fe2b290110cc9425b2033d22528b3bab2025efbbe2ac6387670"}},{"ruleId":"D2","level":"warning","message":{"text":"#selectionChange (cognitive 117): #selectionChange has cognitive complexity 117 (threshold 15). Drivers by points: if/else 37 (91 pts), loops 7 (13 pts), boolean chains 9, ternaries 1 (4 pts) (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/draw_layer.js"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7d435de6c22fede43c61af7d015de665fff0fdb83ec10d9a5f2e67f2f772e6"}},{"ruleId":"D2","level":"warning","message":{"text":"extractWidths (cognitive 114): extractWidths has cognitive complexity 114 (threshold 15). Drivers by points: if/else 26 (73 pts), loops 8 (33 pts), ternaries 3 (8 pts) (nesting depth added 77). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":4259}}}],"partialFingerprints":{"codehealthFindingId/v1":"545a8a7c62296b1cac9c3cf72796f414876786c51a069c491d9f51a08855e1a3"}},{"ruleId":"D2","level":"warning","message":{"text":"_makeBinary (cognitive 113): _makeBinary has cognitive complexity 113 (threshold 15). Drivers by points: if/else 37 (97 pts), boolean chains 7, match/switch 3 (6 pts), ternaries 1 (3 pts) (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6d0fd17fdd6b29fe53e6ee57d7fa743f6ba43061fac8d1f516640adf55508a"}},{"ruleId":"D2","level":"warning","message":{"text":"preEvaluateFont (cognitive 112): preEvaluateFont has cognitive complexity 112 (threshold 15). Drivers by points: if/else 30 (65 pts), loops 6 (25 pts), ternaries 5 (13 pts), boolean chains 9 (nesting depth added 62). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":4451}}}],"partialFingerprints":{"codehealthFindingId/v1":"7689f0322c58bedc2d784fba3941119747ed278174415c4084939ed6fd6263a3"}},{"ruleId":"D2","level":"warning","message":{"text":"_initializeViewerComponents (cognitive 111): _initializeViewerComponents has cognitive complexity 111 (threshold 15). Drivers by points: if/else 40 (58 pts), boolean chains 26, ternaries 12 (19 pts), loops 2 (5 pts), error handling 1 (2 pts), other 1 (nesting depth added 29). Of this number, 88 points are the body\u0027s own statements and 23 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":"web/app.js"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"067f8dca7c49fad6bd8ee14a18c221f6d0b2129c9fc3fa194ee5552cfe934396"}},{"ruleId":"D2","level":"warning","message":{"text":"_evalBlockFrom (cognitive 108): _evalBlockFrom has cognitive complexity 108 (threshold 15). Drivers by points: if/else 19 (71 pts), loops 8 (34 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 79). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61970763650feb2312d17883272d004adfba91fb330eaca9d42cbbb351b59b4"}},{"ruleId":"D2","level":"warning","message":{"text":"checkAndRepair::readCmapTable (cognitive 107): checkAndRepair::readCmapTable has cognitive complexity 107 (threshold 15). Drivers by points: if/else 27 (54 pts), loops 17 (36 pts), boolean chains 10, ternaries 2 (7 pts) (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ad363c0edbfc89368884638dc66c7103e49599af292de65e0e985847f8865f"}},{"ruleId":"D2","level":"warning","message":{"text":"#parseCharString (cognitive 107): #parseCharString has cognitive complexity 107 (threshold 15). Drivers by points: if/else 35 (78 pts), ternaries 4 (15 pts), boolean chains 13, loops 1 (nesting depth added 54). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_parser.js"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f715d51d8dd0c5ffdcad2ecc9ca120f6e4324a00a5cf075ee63f5cb1d1e03e"}},{"ruleId":"D2","level":"warning","message":{"text":"createImageData (cognitive 105): createImageData has cognitive complexity 105 (threshold 15). Drivers by points: if/else 29 (63 pts), boolean chains 19, match/switch 2 (8 pts), ternaries 3 (8 pts), loops 1 (4 pts), other 3 (nesting depth added 48). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image.js"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"9771ac49086c40a381421fdc9f7b1e54a500b99acfb1ce38dbabfbf3b50666f8"}},{"ruleId":"D2","level":"warning","message":{"text":"_bindElement (cognitive 105): _bindElement has cognitive complexity 105 (threshold 15). Drivers by points: if/else 29 (81 pts), ternaries 3 (13 pts), loops 2 (5 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 67). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/bind.js"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43b6e753cd50e8a2738aedc29c8929f027a38c99fbf01a85c4a72f3b14af31d"}},{"ruleId":"D2","level":"warning","message":{"text":"getTextContent::promiseBody (cognitive 99): getTextContent::promiseBody has cognitive complexity 99 (threshold 15). Drivers by points: if/else 22 (62 pts), ternaries 5 (19 pts), boolean chains 6, error handling 2 (6 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":3322}}}],"partialFingerprints":{"codehealthFindingId/v1":"6355af62b0c77998d79b3661f2d72119b6e803f40df1f9684ce992469a50be58"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 99): (computed) has cognitive complexity 99 (threshold 15). Drivers by points: if/else 35 (82 pts), ternaries 2 (10 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 56). Of this number, 97 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":5410}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc1f904301b3e7f2905fff7b1ce21f432b02a5b5811734a71b021152f6a3b61"}},{"ruleId":"D2","level":"warning","message":{"text":"translateFont (cognitive 98): translateFont has cognitive complexity 98 (threshold 15). Drivers by points: if/else 42 (75 pts), ternaries 4 (10 pts), boolean chains 7, loops 2 (5 pts), error handling 1 (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":"src/core/evaluator.js"},"region":{"startLine":4614}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bd86e7d48314514af4317bdf748198c9d0937ebff829de20c6a7f84ebf9096"}},{"ruleId":"D2","level":"warning","message":{"text":"Field.[$toHTML] (cognitive 97): Field.[$toHTML] has cognitive complexity 97 (threshold 15). Drivers by points: if/else 49 (81 pts), boolean chains 8, match/switch 3 (6 pts), ternaries 2 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":2741}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33f7cd8a7a577c43d37b55a4e992e963f6e4b01b383a47df36637c9177a6f5f"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleExprParser.parse (cognitive 94): SimpleExprParser.parse has cognitive complexity 94 (threshold 15). Drivers by points: if/else 32 (90 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (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":"src/core/xfa/formcalc_parser.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d6dd20a993268bfa9069634dd2d2ea662e3db0574ef0a2ca2d8bf9def5e100"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 91): constructor has cognitive complexity 91 (threshold 15). Drivers by points: if/else 30 (52 pts), ternaries 6 (19 pts), boolean chains 13, match/switch 2 (5 pts), loops 1 (2 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e20a62f317966770d35790f6727210abfbbd5ec230d72e6658ef32d1afddae"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialEvaluator.hasBlendModes (cognitive 90): PartialEvaluator.hasBlendModes has cognitive complexity 90 (threshold 15). Drivers by points: if/else 20 (65 pts), loops 5 (12 pts), error handling 2 (9 pts), boolean chains 4 (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":"src/core/evaluator.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"609f72936327ef2a815bee16d4a89fb7f5c33558858a354c8bce53b201d5957c"}},{"ruleId":"D2","level":"warning","message":{"text":"showText (cognitive 90): showText has cognitive complexity 90 (threshold 15). Drivers by points: if/else 31 (52 pts), ternaries 8 (20 pts), boolean chains 14, loops 2 (3 pts), other 1 (nesting depth added 34). Of this number, 83 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":"src/display/canvas.js"},"region":{"startLine":2803}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f0c2e0bc30b1d9186d3ab7221684d9c3a5db45021c058f3aa6510ca67e225d"}},{"ruleId":"D2","level":"warning","message":{"text":"Type1CharString.convert (cognitive 89): Type1CharString.convert has cognitive complexity 89 (threshold 15). Drivers by points: if/else 27 (82 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/type1_parser.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6970cc82ba0caf2bcc1258453cd21ed558b548979758f930e97384825bcb37"}},{"ruleId":"D2","level":"warning","message":{"text":"Template.[$toPages] (cognitive 89): Template.[$toPages] has cognitive complexity 89 (threshold 15). Drivers by points: if/else 35 (82 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 48). Of this number, 87 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":"src/core/xfa/template.js"},"region":{"startLine":5410}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f16cdf81214d573f3dd99274e1d129341bc777a50412da15a80493aa1579b77"}},{"ruleId":"D2","level":"warning","message":{"text":"findDefaultInlineStreamEnd (cognitive 85): findDefaultInlineStreamEnd has cognitive complexity 85 (threshold 15). Drivers by points: if/else 19 (58 pts), ternaries 3 (13 pts), loops 3 (9 pts), boolean chains 5 (nesting depth added 55). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d395b341162a3e47c3c3308160e38e2d1adc5b36bcc0051ea558930773b79684"}},{"ruleId":"D2","level":"warning","message":{"text":"compileType3Glyph (cognitive 78): compileType3Glyph has cognitive complexity 78 (threshold 15). Drivers by points: if/else 16 (28 pts), ternaries 9 (25 pts), loops 12 (21 pts), boolean chains 4 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts_utils.js"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"80de697d7336cfb2e2d29da4ae881d3f4484ef61faca396f119161cffab0f07d"}},{"ruleId":"D2","level":"warning","message":{"text":"buildPaintImageXObject (cognitive 76): buildPaintImageXObject has cognitive complexity 76 (threshold 15). Drivers by points: if/else 29 (57 pts), boolean chains 13, error handling 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 30). Of this number, 71 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2aa66040cf94a5e21680276728dcfd80bfa9d289672ca8a230e06e81654990"}},{"ruleId":"D2","level":"warning","message":{"text":"#findContours (cognitive 76): #findContours has cognitive complexity 76 (threshold 15). Drivers by points: if/else 17 (47 pts), ternaries 4 (14 pts), loops 7 (12 pts), boolean chains 3 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/drawers/signaturedraw.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d353b866eabba6892019f9e65021266b05f031c49cc9392a47d902033800393f"}},{"ruleId":"D2","level":"warning","message":{"text":"parseXml (cognitive 76): parseXml has cognitive complexity 76 (threshold 15). Drivers by points: if/else 16 (53 pts), ternaries 3 (14 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 52). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xml_parser.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"163f8aa2fe5161dd2ffd9aca9e856e9dce92bc58ad5e75a06576e9cb30b9dc34"}},{"ruleId":"D2","level":"warning","message":{"text":"getPageDict (cognitive 75): getPageDict has cognitive complexity 75 (threshold 15). Drivers by points: if/else 21 (64 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 44). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbfbc4c286374ceec1abff9fd74c12b195a0be36e693ba76432581f9985729e"}},{"ruleId":"D2","level":"warning","message":{"text":"preprocess (cognitive 75): preprocess has cognitive complexity 75 (threshold 15). Drivers by points: if/else 23 (45 pts), ternaries 6 (13 pts), boolean chains 11, match/switch 1 (3 pts), error handling 2, loops 1 (nesting depth added 31). Of this number, 58 points are the body\u0027s own statements and 17 belong to 9 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/builder/builder.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"72346f534cf582b99cd2f18ce2f0fa23de28dee59149a0811016f4c6520d0efa"}},{"ruleId":"D2","level":"warning","message":{"text":"fallbackToSystemFont (cognitive 74): fallbackToSystemFont has cognitive complexity 74 (threshold 15). Drivers by points: if/else 24 (48 pts), boolean chains 15, loops 3 (9 pts), ternaries 1 (2 pts) (nesting depth added 31). Of this number, 68 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":"src/core/fonts.js"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"c017c7a3a2cfd81ef1679eb3b49a8a8ec92694615d20bfeecd2f10fbe0387e54"}},{"ruleId":"D2","level":"warning","message":{"text":"#cloneFields (cognitive 73): #cloneFields has cognitive complexity 73 (threshold 15). Drivers by points: if/else 24 (54 pts), loops 6 (10 pts), boolean chains 9 (nesting depth added 34). Of this number, 64 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":2196}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4dd8b9d554c87e82986128f39a82a2627b0b56d34ae451f473091a3cc4e25f"}},{"ruleId":"D2","level":"warning","message":{"text":"compileGlyf (cognitive 71): compileGlyf has cognitive complexity 71 (threshold 15). Drivers by points: if/else 24 (45 pts), loops 9 (20 pts), match/switch 2 (6 pts) (nesting depth added 36). Of this number, 70 points are the body\u0027s own statements and 1 belongs to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/font_renderer.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f2253fada230bd096bee737d3738e6f52e184cdf5a35ea6cd39c51001c98c6"}},{"ruleId":"D2","level":"warning","message":{"text":"extractCidKeyedFontProgram (cognitive 70): extractCidKeyedFontProgram has cognitive complexity 70 (threshold 15). Drivers by points: if/else 20 (37 pts), boolean chains 14, loops 7 (11 pts), ternaries 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 25). Of this number, 68 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/type1_parser.js"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"82397bdf1197ff2243013c646e48c298f595d045ffb9818281b4bf685b0275e4"}},{"ruleId":"D2","level":"warning","message":{"text":"getTextContent::compareWithLastPosition (cognitive 69): getTextContent::compareWithLastPosition has cognitive complexity 69 (threshold 15). Drivers by points: if/else 34 (55 pts), boolean chains 8, ternaries 3 (5 pts), match/switch 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":"src/core/evaluator.js"},"region":{"startLine":2802}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1286cfec20ab1ee4905eb8a194c4b5223b5be463be3cad8024dd6d66fc3528c"}},{"ruleId":"D2","level":"warning","message":{"text":"#walk (cognitive 69): #walk has cognitive complexity 69 (threshold 15). Drivers by points: if/else 24 (50 pts), boolean chains 10, loops 3 (9 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":"web/struct_tree_layer_builder.js"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"60daf35f3e9f9c10210c2cdc79051289b37190088d161aa07ea554963aa5d10d"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFViewer.#getPageAdvance (cognitive 67): PDFViewer.#getPageAdvance has cognitive complexity 67 (threshold 15). Drivers by points: if/else 16 (46 pts), loops 5 (14 pts), boolean chains 4, ternaries 1 (2 pts), 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":"web/pdf_viewer.js"},"region":{"startLine":2434}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34dd4428768c77e731f551cba0d6f0e544b6fed9978c9df65d57ff22a4a660d"}},{"ruleId":"D2","level":"warning","message":{"text":"extractDataStructures (cognitive 67): extractDataStructures has cognitive complexity 67 (threshold 15). Drivers by points: if/else 27 (50 pts), boolean chains 8, loops 1 (4 pts), ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":3775}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e3b49c3ecf39797ab84755a079cd40c24bff9bf055e99d68fb3a335f54a6d2"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 65): (computed) has cognitive complexity 65 (threshold 15). Drivers by points: if/else 33 (47 pts), boolean chains 16, loops 1, ternaries 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":4969}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c745473e24aac56177ca1983498866d2754ac02d00b25cfe2f5349eb8aae17d"}},{"ruleId":"D2","level":"warning","message":{"text":"extractPages (cognitive 64): extractPages has cognitive complexity 64 (threshold 15). Drivers by points: if/else 22 (44 pts), loops 8 (16 pts), boolean chains 2, other 1, ternaries 1 (nesting depth added 30). Of this number, 61 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"079d9d13f253eed755c722a076da5254c02cbd8ca97e55a545d53b1b45c31496"}},{"ruleId":"D2","level":"warning","message":{"text":"EvaluatorPreprocessor.read (cognitive 63): EvaluatorPreprocessor.read has cognitive complexity 63 (threshold 15). Drivers by points: if/else 14 (46 pts), loops 3 (11 pts), boolean chains 3, ternaries 1 (3 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":"src/core/evaluator.js"},"region":{"startLine":5541}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89f32e07bd074947d31440d9cd3860dca2b15972b99a89535013d70b0f84527"}},{"ruleId":"D2","level":"warning","message":{"text":"Subform.[$toHTML] (cognitive 63): Subform.[$toHTML] has cognitive complexity 63 (threshold 15). Drivers by points: if/else 33 (47 pts), boolean chains 14, loops 1, ternaries 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":4969}}}],"partialFingerprints":{"codehealthFindingId/v1":"879afbcbc15127e4e88bf46581c013e784ef8b0c26ace4ee34656ccb2766595e"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 63): constructor has cognitive complexity 63 (threshold 15). Drivers by points: if/else 25 (43 pts), boolean chains 15, ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/crypto.js"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8d8d7c2f88db84430cbe7495e53a26e6f69d5d187b2aff3f8cd4d93994dc86"}},{"ruleId":"D2","level":"warning","message":{"text":"#parse (cognitive 63): #parse has cognitive complexity 63 (threshold 15). Drivers by points: if/else 16 (51 pts), error handling 1 (4 pts), match/switch 2 (4 pts), ternaries 1 (3 pts), boolean chains 1 (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":"src/core/colorspace_utils.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2139c08b6b96e981e002984ec835fed8c50daeec760c0ffb495711b0f06d065c"}},{"ruleId":"D2","level":"warning","message":{"text":"getDocument (cognitive 62): getDocument has cognitive complexity 62 (threshold 15). Drivers by points: boolean chains 24, ternaries 19, if/else 12 (15 pts), error handling 2 (3 pts), other 1 (nesting depth added 4). Of this number, 48 points are the body\u0027s own statements and 14 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36d9353ccef76837408008404de96cdda5248af8456e60cdc28fa8074e1bacc"}},{"ruleId":"D2","level":"warning","message":{"text":"PSStackToTree._evalOp (cognitive 60): PSStackToTree._evalOp has cognitive complexity 60 (threshold 15). Drivers by points: if/else 29 (55 pts), boolean chains 4, match/switch 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4fc0b674e3dd08a2e00d62ecb36bd743416fe93d8ef7b8b9fcf8d4e9f774824"}},{"ruleId":"D2","level":"warning","message":{"text":"extractFontProgram (cognitive 60): extractFontProgram has cognitive complexity 60 (threshold 15). Drivers by points: if/else 13 (36 pts), ternaries 3 (10 pts), loops 4 (8 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/type1_parser.js"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"226d001db69fab5c9e9a9ab30d5ec75333d298d45232e5a67bebf96bc8fc7254"}},{"ruleId":"D2","level":"warning","message":{"text":"setHash (cognitive 60): setHash has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (33 pts), ternaries 5 (19 pts), boolean chains 7, error handling 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":"web/pdf_link_service.js"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2a053865f184a6b75952a16755c03f2f3a328751ce5a424fadb6c7e4c5b886"}},{"ruleId":"D2","level":"warning","message":{"text":"fillGrayBuffer (cognitive 59): fillGrayBuffer has cognitive complexity 59 (threshold 15). Drivers by points: loops 10 (35 pts), if/else 13 (18 pts), boolean chains 2, other 2, ternaries 2 (nesting depth added 30). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image.js"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae1ec7f1660f265488c4695db1deb50a4c9d78fd1c29372964373d9daac4a79"}},{"ruleId":"D2","level":"warning","message":{"text":"parseCMap (cognitive 59): parseCMap has cognitive complexity 59 (threshold 15). Drivers by points: loops 15 (28 pts), ternaries 7 (20 pts), if/else 3 (5 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 31). Of this number, 44 points are the body\u0027s own statements and 15 belong to 7 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":"external/cmapscompress/compress.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb086bb03a024f697d61429eac668683c7f40f155068c31f4a42a501951c2ecc"}},{"ruleId":"D2","level":"warning","message":{"text":"babel-plugin-pdfjs-preprocessor.babelPluginPDFJSPreprocessor (cognitive 58): babel-plugin-pdfjs-preprocessor.babelPluginPDFJSPreprocessor has cognitive complexity 58 (threshold 15). Drivers by points: if/else 25 (34 pts), boolean chains 12, loops 3 (4 pts), match/switch 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 13). Of this number, 56 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":"external/builder/babel-plugin-pdfjs-preprocessor.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5c31c7fa40b924f97721692faddb849a25467fc746411af4772fdb1bf140ca"}},{"ruleId":"D2","level":"warning","message":{"text":"layout.checkDimensions (cognitive 58): layout.checkDimensions has cognitive complexity 58 (threshold 15). Drivers by points: if/else 19 (49 pts), boolean chains 8, match/switch 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":"src/core/xfa/layout.js"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"43346baef4810b41e89496495834555fd8f6dcb82a3d8492a609b82441881e4c"}},{"ruleId":"D2","level":"warning","message":{"text":"OptionalContentConfig.isVisible (cognitive 58): OptionalContentConfig.isVisible has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (45 pts), loops 4 (12 pts), boolean chains 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/optional_content_config.js"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"563975ca75fa24f9a1e4a04eac540d4cecc7ba0f1e5c19d696f1529fe688de33"}},{"ruleId":"D2","level":"warning","message":{"text":"getTextContent::buildTextContentItem (cognitive 58): getTextContent::buildTextContentItem has cognitive complexity 58 (threshold 15). Drivers by points: if/else 23 (43 pts), ternaries 4 (8 pts), boolean chains 6, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":3066}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b33e0d4144bb5c14ebcbe059461738be59b82df4fb1ae6b3a850d7798b001d3"}},{"ruleId":"D2","level":"warning","message":{"text":"printf (cognitive 58): printf has cognitive complexity 58 (threshold 15). Drivers by points: if/else 23 (34 pts), ternaries 5 (11 pts), loops 3 (6 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 22). Most of this is not in the body itself: 2 of the 58 points are its own statements and the rest belongs to one function literal inside it that branches (line 73). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/util.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"086a9127afcc8decde0bc7e7e34853d41630d5fa51c0236217054b7b8128038d"}},{"ruleId":"D2","level":"warning","message":{"text":"#resolveInsertAfterIndices (cognitive 57): #resolveInsertAfterIndices has cognitive complexity 57 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 10 (20 pts), boolean chains 8, ternaries 1 (4 pts) (nesting depth added 25). Of this number, 48 points are the body\u0027s own statements and 9 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"285435c2f1d207491af274253648eecd2c1fccb2b9c6cf3597fceab35cde5639"}},{"ruleId":"D2","level":"warning","message":{"text":"#makePageCopy (cognitive 56): #makePageCopy has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (29 pts), loops 9 (15 pts), boolean chains 10, other 1, ternaries 1 (nesting depth added 20). Of this number, 50 points are the body\u0027s own statements and 6 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":2436}}}],"partialFingerprints":{"codehealthFindingId/v1":"5938296570389476ea8843e7f265c8a4d366eceeca18e221ab43440c14444d85"}},{"ruleId":"D2","level":"warning","message":{"text":"FlateStream.#readBlock (cognitive 55): FlateStream.#readBlock has cognitive complexity 55 (threshold 15). Drivers by points: if/else 24 (43 pts), loops 4 (8 pts), boolean chains 2, error handling 1, ternaries 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":"src/core/flate_stream.js"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"2156b92213cf725270a1d3cbc6a388e7e1cfcd2d1943683ea822e89342973a56"}},{"ruleId":"D2","level":"warning","message":{"text":"Catalog.#getDestFromStructElement (cognitive 55): Catalog.#getDestFromStructElement has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (46 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db6ff7a24eb8b029f00d31312de6510f3cbe96738f1bb1c5e5b82fe8660536a"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetAnnotation._getAppearance (cognitive 55): WidgetAnnotation._getAppearance has cognitive complexity 55 (threshold 15). Drivers by points: if/else 29 (34 pts), boolean chains 13, loops 3 (6 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":2421}}}],"partialFingerprints":{"codehealthFindingId/v1":"c865221a5b233ce35cfb81fc7dccc1f6c2995586a600f9f84bb9d5845da90373"}},{"ruleId":"D2","level":"warning","message":{"text":"viewerPreferences (cognitive 55): viewerPreferences has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (27 pts), match/switch 6 (22 pts), boolean chains 5, loops 1 (nesting depth added 33). Of this number, 52 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"602d9ae34b88db1896f0a04385835c735a1e69a06d6915329968720e6c6497d5"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkerMessageHandler.createDocumentHandler::saveDocument (cognitive 53): WorkerMessageHandler.createDocumentHandler::saveDocument has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (31 pts), boolean chains 10, loops 4 (9 pts), ternaries 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/worker.js"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bfbd02ba1a7a788199dd70bec28d6e2dffe61e1e73bba2b7325268c3a3e662"}},{"ruleId":"D2","level":"warning","message":{"text":"executeOperatorList (cognitive 53): executeOperatorList has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (36 pts), ternaries 2 (6 pts), loops 2 (5 pts), boolean chains 4, other 2 (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":"src/display/canvas.js"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45c6b7affde9106d962b117cc59961fca4c6718324bb0b93c8680e1188f69cd"}},{"ruleId":"D2","level":"warning","message":{"text":"#enableGlobalSelectionListener (cognitive 53): #enableGlobalSelectionListener has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 12, loops 6 (11 pts), ternaries 3 (6 pts) (nesting depth added 14). Most of this is not in the body itself: 3 of the 53 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 285, reset, a function literal at line 270, \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":"web/text_layer_builder.js"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c193b14b27f60f4aed1c48ce3915c8165b00613a16f842bc0214016173f6bd"}},{"ruleId":"D2","level":"warning","message":{"text":"writeStream (cognitive 52): writeStream has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (24 pts), ternaries 6 (17 pts), boolean chains 7, error handling 2 (4 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/writer.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cee3ab5cba1ca092d754ad6b595c3b442d36ca393fa7ab8c29a435eefc4740"}},{"ruleId":"D2","level":"warning","message":{"text":"Catalog.getAllPageDicts (cognitive 51): Catalog.getAllPageDicts has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (29 pts), error handling 4 (13 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (nesting depth added 24). Of this number, 45 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c17b3464a44a8179e6b896dda50ae583180bd36a8bb3e8c56705d5523bdf3e0"}},{"ruleId":"D2","level":"warning","message":{"text":"setDocument (cognitive 51): setDocument has cognitive complexity 51 (threshold 15). Drivers by points: if/else 29 (37 pts), boolean chains 5, ternaries 3 (5 pts), error handling 2, loops 2 (nesting depth added 10). Most of this is not in the body itself: 8 of the 51 points are its own statements and the rest belongs to 11 function items inside it that branch (a function literal at line 985, a function literal at line 1143, onAfterDraw, \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":"web/pdf_viewer.js"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26df9ec2bd0bf47717ba356baf667b14a99c41d877a25cccf193c83ecc618f1"}},{"ruleId":"D2","level":"warning","message":{"text":"getOperatorList (cognitive 51): getOperatorList has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 10, loops 5 (9 pts), error handling 1 (3 pts), ternaries 1 (nesting depth added 22). Of this number, 47 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":"src/core/document.js"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"656b89c5a75a1d2fca7c3c9d8ba8e33be8fd12790b0750d17bacf74a6ba0b890"}},{"ruleId":"D2","level":"warning","message":{"text":"StructElementNode.tableAttributes (cognitive 50): StructElementNode.tableAttributes has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (39 pts), boolean chains 7, loops 2 (3 pts), ternaries 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"8590f8a2f4f46206f48f040c86b0854ec52ea4031f31cca15181ccf4e57718eb"}},{"ruleId":"D2","level":"warning","message":{"text":"glyf.pruneCompositeGlyphCycles (cognitive 48): glyf.pruneCompositeGlyphCycles has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 7 (11 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":"src/core/glyf.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c6fb7963d8e37186717d8b9d97e65116e4b0bcf932795565edfac99b27661f"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryCMapReader.process (cognitive 47): BinaryCMapReader.process has cognitive complexity 47 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 7 (19 pts), match/switch 2 (5 pts), ternaries 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":"src/core/binary_cmap.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7651c483c9a7ae27042f18a3baac1e7a6f762d5b9fb8ec5822f97bf9bb31b3a5"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.getObj (cognitive 47): Parser.getObj has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 2 (6 pts), ternaries 2 (6 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"323c9206a36874443892945e6e57d207841c2214ea8ba2c872f201607eb57039"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialEvaluator._simpleFontToUnicode (cognitive 47): PartialEvaluator._simpleFontToUnicode has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (35 pts), boolean chains 5, match/switch 2 (5 pts), loops 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":3980}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad501cb055a2fdaaea670cef606d5b2e37ea94a886115661add5fd2053a8bedb"}},{"ruleId":"D2","level":"warning","message":{"text":"normalize (cognitive 47): normalize has cognitive complexity 47 (threshold 15). Drivers by points: if/else 20 (27 pts), loops 8 (13 pts), ternaries 2 (4 pts), boolean chains 2, other 1 (nesting depth added 14). Of this number, 19 points are the body\u0027s own statements and 28 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":"web/pdf_find_controller.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04b118b2fbad03ec138b70a5e4c462a1bce9b4d34cf0d754712a4111ae2bdc6"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 46): constructor has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 13, ternaries 4 (10 pts), other 2, loops 1 (nesting depth added 12). Of this number, 44 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":"src/core/annotation.js"},"region":{"startLine":2921}}}],"partialFingerprints":{"codehealthFindingId/v1":"38798fb9ece0930ddcd03554bfceeff55f89aeb452ba7f477a9db37d30783d21"}},{"ruleId":"D2","level":"warning","message":{"text":"load (cognitive 46): load has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (28 pts), boolean chains 8, error handling 5, ternaries 2 (3 pts), loops 1 (2 pts) (nesting depth added 10). Most of this is not in the body itself: 9 of the 46 points are its own statements and the rest belongs to 19 function items inside it that branch (a function literal at line 1761, a function literal at line 1870, a function literal at line 1681, \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":"web/app.js"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"4844a04cc6c695b2b792c1dab545a5bb481a3104cceaf27e9ceb2f5f332a1296"}},{"ruleId":"D2","level":"warning","message":{"text":"layoutNode (cognitive 46): layoutNode has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 5 (15 pts), boolean chains 7, loops 1 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/html_utils.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc2b9fba788e61dbdf632938c23f521ab4cfd1a07d158adfc7c7e3edc286c7f"}},{"ruleId":"D2","level":"warning","message":{"text":"setupMessageHandler (cognitive 45): setupMessageHandler has cognitive complexity 45 (threshold 15). Drivers by points: if/else 24 (31 pts), boolean chains 7, error handling 5, other 1, ternaries 1 (nesting depth added 7). Most of this is not in the body itself: 4 of the 45 points are its own statements and the rest belongs to 27 function items inside it that branch (a function literal at line 2775, a function literal at line 2810, a function literal at line 2639, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api.js"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"6898c8728e5bf06446591f38bd4b26501ab565f4a0e23194199a7e3c52b4c4fe"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 45): constructor has cognitive complexity 45 (threshold 15). Drivers by points: boolean chains 24, if/else 10 (13 pts), other 7, ternaries 1 (nesting depth added 3). Of this number, 44 points are the body\u0027s own statements and 1 belongs to 3 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":"web/pdf_viewer.js"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"0593e8f0c8026a05699dfbdbc2cd80ff6863b8d3ca158d45fc10b6ffeb485a0e"}},{"ruleId":"D2","level":"warning","message":{"text":"getPageIndex (cognitive 45): getPageIndex has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (38 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 23). Of this number, 34 points are the body\u0027s own statements and 11 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb1f76e8dc9ff3520621f2d9c1140bc586eee00e056cc557b000a1f6085635e"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleDOMNode.searchNode (cognitive 44): SimpleDOMNode.searchNode has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (35 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 26). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xml_parser.js"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2a427a9a64269e3d0476fe38230bc0c1b8f5a5fe77f949a4e4cfc975569f9d"}},{"ruleId":"D2","level":"warning","message":{"text":"_bindResetFormAction::onclick (cognitive 44): _bindResetFormAction::onclick has cognitive complexity 44 (threshold 15). Drivers by points: loops 10 (23 pts), if/else 7 (14 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 21). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"914d02860f9b7f398016b9119799136479f39fcd1188b7fa85d4a90a584883a4"}},{"ruleId":"D2","level":"warning","message":{"text":"execute (cognitive 44): execute has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 11 (33 pts), if/else 4 (8 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/js_evaluator.js"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"55af6a1536c13cca94027a2d258779412a0347fc76450d81f08a46b553b1ded9"}},{"ruleId":"D2","level":"warning","message":{"text":"compressCmap (cognitive 44): compressCmap has cognitive complexity 44 (threshold 15). Drivers by points: loops 7 (19 pts), ternaries 5 (18 pts), if/else 4 (5 pts), match/switch 1 (2 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/cmapscompress/compress.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5558c72f928ebace22206937da3f40d5a04f7f5ea455632fc536b3b1eff200b5"}},{"ruleId":"D2","level":"warning","message":{"text":"createCmapTable (cognitive 43): createCmapTable has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 6 (12 pts), ternaries 4, boolean chains 3, other 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":"src/core/fonts.js"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb2fe20ad7946e13a37d38ba5b09fe7ec6c18a0ac3913aa4d39d1b4b1ad1b64"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.#findStreamLength (cognitive 42): Parser.#findStreamLength has cognitive complexity 42 (threshold 15). Drivers by points: if/else 6 (25 pts), loops 5 (15 pts), boolean chains 2 (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":"src/core/parser.js"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a095024a5f459df551373c24df3b170c78ef631cb3929a7fddacdb6cc5e7eea"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotationEditorLayer.disable (cognitive 42): AnnotationEditorLayer.disable has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (34 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 22). Of this number, 29 points are the body\u0027s own statements and 13 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/annotation_editor_layer.js"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d39e4a707b92d6086bb5b010739cec870bef46634c06c8114bb1994e966c30"}},{"ruleId":"D2","level":"warning","message":{"text":"ChoiceWidgetAnnotationElement.render (cognitive 42): ChoiceWidgetAnnotationElement.render has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (22 pts), loops 7 (12 pts), ternaries 3 (5 pts), boolean chains 3 (nesting depth added 14). Most of this is not in the body itself: 13 of the 42 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 2262, getValue, a function literal at line 2194, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"08655b52b83de117362c16d41566b503a81ab07bcd27f88af91b11d8d10b4d32"}},{"ruleId":"D2","level":"warning","message":{"text":"show (cognitive 42): show has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (24 pts), ternaries 3 (9 pts), boolean chains 6, other 2, loops 1 (nesting depth added 17). Of this number, 28 points are the body\u0027s own statements and 14 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":"web/internal/draw_ops_view.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfd06d533c638c24e66dc9c4a46c3e1c7f41808ac4ff50a4d15cc9956fc8eb7"}},{"ruleId":"D2","level":"warning","message":{"text":"Catalog.#readPageLabels (cognitive 41): Catalog.#readPageLabels has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (36 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"4223439768600b4ea8237d651f78610f0347e1290e79b20391e063d6ee425baa"}},{"ruleId":"D2","level":"warning","message":{"text":"printx (cognitive 41): printx has cognitive complexity 41 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 5 (13 pts), boolean chains 9, match/switch 1 (2 pts), other 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":"src/scripting_api/util.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b563ce94249964742c466f17425a678ecfe6d4de6766840e9b89d537c1fab9"}},{"ruleId":"D2","level":"warning","message":{"text":"searchNode (cognitive 41): searchNode has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (24 pts), ternaries 3 (8 pts), match/switch 1 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/som.js"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6e8abf70c3deab1fbb542c76f2042c0705ef7919983035754292df2f5b590b"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFEditor.#collectDependencies (cognitive 40): PDFEditor.#collectDependencies has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 6, loops 2 (4 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa4f41e19b57e86a83a4bc233773c43582485575b15ca38c8b1c7735214e513"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotationEditorUIManager.updateMode (cognitive 40): AnnotationEditorUIManager.updateMode has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (29 pts), loops 6 (9 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/tools.js"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"de73161be4eec7d9a16b4f7560086928f85b8b15998a4b21328870672e6c550a"}},{"ruleId":"D2","level":"warning","message":{"text":"EventDispatcher.dispatch (cognitive 40): EventDispatcher.dispatch has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (32 pts), boolean chains 4, loops 1 (3 pts), 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":"src/scripting_api/event.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7d9393830d5820fd65296c299318982e197ced544e61953ad949095df5aa9a"}},{"ruleId":"D2","level":"warning","message":{"text":"getScaleForStroking (cognitive 40): getScaleForStroking has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 5 (21 pts), if/else 10 (18 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":4443}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c988160cd54940c79e561e7c2ee1997d7cb41c8a212c5470cc9a66e95bdeff"}},{"ruleId":"D2","level":"warning","message":{"text":"loadFont (cognitive 39): loadFont has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (28 pts), error handling 4 (6 pts), boolean chains 5 (nesting depth added 11). Of this number, 36 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2bf42be6a0c2e2eca9786e0b9ad5ae4713fcc464b8cb1752aa80e01fcd347b"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 39): (computed) has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 13, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":2443}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f366f4399837466fe3b3dd65218e3bfbc9c5607f6f23a447b669f2755b7c8d9"}},{"ruleId":"D2","level":"warning","message":{"text":"#execOp (cognitive 39): #execOp has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 12 (24 pts), loops 2 (6 pts), if/else 2 (5 pts), boolean chains 3, match/switch 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/js_evaluator.js"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b9c7e87ccc91497a1ac87d0efb0bac96066a5e6b02aeae364ec057931652b1"}},{"ruleId":"D2","level":"warning","message":{"text":"fonts.adjustMapping (cognitive 38): fonts.adjustMapping has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 2 (6 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 21). Of this number, 35 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":"src/core/fonts.js"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc7fafc0c62e16b5be5665a84ce8107df995cfc276bdda74e17b8e3afb7b628"}},{"ruleId":"D2","level":"warning","message":{"text":"StructTreeRoot.#collectParents (cognitive 38): StructTreeRoot.#collectParents has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (24 pts), ternaries 2 (7 pts), boolean chains 4, 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":"src/core/struct_tree.js"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b8aee46e20252f41e334b6bb21ac75dbfc93f1cdf977fb038c45f4b01f1055"}},{"ruleId":"D2","level":"warning","message":{"text":"content_disposition.getFilenameFromContentDispositionHeader (cognitive 38): content_disposition.getFilenameFromContentDispositionHeader has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (28 pts), loops 3 (4 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 13). Most of this is not in the body itself: 3 of the 38 points are its own statements and the rest belongs to 7 function items inside it that branch (rfc2231getparam, rfc2616unquote, textdecode, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/content_disposition.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3443c552f3d3f9be8adb14e68f58438c8f3d88542efc390db7e1727803ea0195"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFViewer.onPagesEdited (cognitive 38): PDFViewer.onPagesEdited has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 5 (12 pts), ternaries 2 (3 pts), boolean chains 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":"web/pdf_viewer.js"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad2460b79556aed0f5afa56d58350dbf1b21c22ef04b494bdd07b4a8c0d8609"}},{"ruleId":"D2","level":"warning","message":{"text":"resolveCommonObject (cognitive 38): resolveCommonObject has cognitive complexity 38 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 7, error handling 2 (5 pts), loops 2 (5 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 19). Of this number, 32 points are the body\u0027s own statements and 6 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":"src/display/object_handler.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9547954f663f9e6d149cdaf2331a506518544bbeecc25f19bd4722193c8b40"}},{"ruleId":"D2","level":"warning","message":{"text":"Catalog.#readOptionalContentConfig (cognitive 37): Catalog.#readOptionalContentConfig has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 5 (7 pts), boolean chains 4, ternaries 4 (nesting depth added 10). Most of this is not in the body itself: 3 of the 37 points are its own statements and the rest belongs to 4 function items inside it that branch (parseOrder, parseRBGroups, parseOnOff, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bbb970dc9d1a925f9917e81883c5f63d9e72e77e4a29241b41151277145ae1"}},{"ruleId":"D2","level":"warning","message":{"text":"ObjectLoader.#walk (cognitive 37): ObjectLoader.#walk has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 3 (7 pts), error handling 1 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/object_loader.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23e32107b1fd7b303c342ead1e53c3604eaa6874b594713b7b98063772e03ea"}},{"ruleId":"D2","level":"warning","message":{"text":"XfaLayer.setupStorage (cognitive 37): XfaLayer.setupStorage has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (27 pts), ternaries 2 (5 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 20). Of this number, 32 points are the body\u0027s own statements and 5 belong to 2 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":"src/display/xfa_layer.js"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4c19f7c6350bc3ac4b4b3c06286c2aafb8df0606b3010f195a4b3e6a505abc"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_find_utils.getNormalizeWithNFKC (cognitive 37): pdf_find_utils.getNormalizeWithNFKC has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 8, loops 2 (5 pts), ternaries 1 (2 pts) (nesting depth added 16). Of this number, 33 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":"web/pdf_find_utils.js"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3316cba655ee3c4eedacd61cf900315cd1595a3c0d8fbd26677f83f9bf504366"}},{"ruleId":"D2","level":"warning","message":{"text":"beginGroup (cognitive 37): beginGroup has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 14, ternaries 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":3386}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cf7f5d9db1d349bb5e1d5df09566731deee46f68b25b8d4d870450300388f7"}},{"ruleId":"D2","level":"warning","message":{"text":"#collectFieldObjects (cognitive 37): #collectFieldObjects has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 3 (7 pts), boolean chains 4, loops 2 (4 pts), error handling 1, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb061199ddc5d04961d92654f3e0a07570e34930c2564da23aedee02c21fe4b5"}},{"ruleId":"D2","level":"warning","message":{"text":"fonts.createOS2Table (cognitive 36): fonts.createOS2Table has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 13, ternaries 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"4509fc4394315a9004be8a1463ae180d6717d2237c74ac7902091cef0dedf525"}},{"ruleId":"D2","level":"warning","message":{"text":"XRef.readXRefStream (cognitive 36): XRef.readXRefStream has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (12 pts), match/switch 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":"src/core/xref.js"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05c62a7467e57cf84d59a00dc180cd12776abbe9cf3fbaebcfe1f4a574f5565"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeView.#setupKeyboardNav (cognitive 36): TreeView.#setupKeyboardNav has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (27 pts), ternaries 3 (5 pts), boolean chains 4 (nesting depth added 12). None of this is in the body itself: all 36 points belong to one function literal inside it that branches (line 121). 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":"web/internal/tree_view.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfc41d60fa1b9730538d9cd4e4eee0e1089d9dbbeae3a7714e70679fb37f0bd"}},{"ruleId":"D2","level":"warning","message":{"text":"endGroup (cognitive 36): endGroup has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (29 pts), ternaries 1 (4 pts), other 3 (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":"src/display/canvas.js"},"region":{"startLine":3649}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbbf326c79f7fbb252ab3adabbdc416e7b5b0e5d954ec5e5a58355605499fd6"}},{"ruleId":"D2","level":"warning","message":{"text":"convert (cognitive 36): convert has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 5 (8 pts), boolean chains 7, ternaries 3, other 2 (nesting depth added 10). Of this number, 19 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":"src/core/fonts.js"},"region":{"startLine":3362}}}],"partialFingerprints":{"codehealthFindingId/v1":"da31f732a57aaa43476871c05c386931f2a4691e04b9dfc4a13da5356dc7f8c3"}},{"ruleId":"D2","level":"warning","message":{"text":"_charToGlyph (cognitive 36): _charToGlyph has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 8 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":3638}}}],"partialFingerprints":{"codehealthFindingId/v1":"435008c0d7157d1e36385afe0855cc77a843a82e5ed58f1cd08c6bad879c9a26"}},{"ruleId":"D2","level":"warning","message":{"text":"#AFSpecial_KeystrokeEx_helper (cognitive 36): #AFSpecial_KeystrokeEx_helper has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 9, loops 1 (nesting depth added 11). Of this number, 20 points are the body\u0027s own statements and 16 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":"src/scripting_api/aform.js"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81be514bd69d0b0110845506c2e09ffcd0b15b2af252cbefa3ff158099ae46c"}},{"ruleId":"D2","level":"warning","message":{"text":"PSStackToTree._makeTernary (cognitive 35): PSStackToTree._makeTernary has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 9, ternaries 2 (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":"src/core/postscript/ast.js"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f35c64df15321ba840ebbd0f9c54551d404b79a0c247fbe4c49a39799350d1"}},{"ruleId":"D2","level":"warning","message":{"text":"ExclGroup.[$toHTML] (cognitive 35): ExclGroup.[$toHTML] has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 9, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":2443}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b17c28fc54f918cf1a8002923e2f633bb5e7da927500ebd78ad20188c72cb88"}},{"ruleId":"D2","level":"warning","message":{"text":"XfaLayer.setAttributes (cognitive 35): XfaLayer.setAttributes has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 6, loops 2 (5 pts), 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":"src/display/xfa_layer.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db200546f83c92dfdb36381f2bdc4149079cee77824f307f0c1dea50dbddf26"}},{"ruleId":"D2","level":"warning","message":{"text":"save (cognitive 35): save has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 9, ternaries 2 (3 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":"src/core/annotation.js"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c3fa7c2ee788bc45fa3abc4b06bf65afb59e9652fda21a3a163f470b66f871"}},{"ruleId":"D2","level":"warning","message":{"text":"checkAndRepair::sanitizeGlyphLocations (cognitive 35): checkAndRepair::sanitizeGlyphLocations has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (20 pts), ternaries 6 (7 pts), loops 5, 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":"src/core/fonts.js"},"region":{"startLine":2295}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c19a91bf0846e133436b0bce8f01fc25b1d89f6dbb666f8bd532860ae9f1373"}},{"ruleId":"D2","level":"warning","message":{"text":"serializable::nodeToSerializable (cognitive 35): serializable::nodeToSerializable has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 6, ternaries 2 (5 pts), error handling 1 (2 pts), loops 2, other 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ba982de295341d37f04825615cfaa355be2221000315b91d4cfa7ecb7cd5c6"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictorStream.readBlockPng (cognitive 34): PredictorStream.readBlockPng has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 8 (16 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":"src/core/predictor_stream.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46e2c627948ca8110c619c30069414488cc8b092654da9aaec6024bd6cb2133"}},{"ruleId":"D2","level":"warning","message":{"text":"CFFParser.parsePrivateDict (cognitive 34): CFFParser.parsePrivateDict has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 2 (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":"src/core/cff_parser.js"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"40058bd7eacd40a37054244388ded0c24ba55b6098bb20b59ff7c420e81d183c"}},{"ruleId":"D2","level":"warning","message":{"text":"toJSObject (cognitive 34): toJSObject has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (20 pts), ternaries 2 (4 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (2 pts), other 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":2291}}}],"partialFingerprints":{"codehealthFindingId/v1":"f479f9264c80826c2cc26f36d80621ed695aed1503cdf063237909cd58b97cbf"}},{"ruleId":"D2","level":"warning","message":{"text":"#buildLine (cognitive 34): #buildLine has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (20 pts), ternaries 3 (7 pts), boolean chains 4, loops 1 (2 pts), other 1 (nesting depth added 11). Of this number, 23 points are the body\u0027s own statements and 11 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":"web/internal/draw_ops_view.js"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18eaa06b838463c0ce4da2b64e02b5edf1095a30e05faf3b44dac0192462c2b"}},{"ruleId":"D2","level":"warning","message":{"text":"prefs.buildPrefsSchema (cognitive 33): prefs.buildPrefsSchema has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (8 pts), match/switch 2 (6 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/chromium/prefs.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7258be6f065a174409729296d03a964ec644be47444aeef693054e2ad855327d"}},{"ruleId":"D2","level":"warning","message":{"text":"string_utils.stringToPDFString (cognitive 33): string_utils.stringToPDFString has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 6, ternaries 2 (5 pts), loops 2 (4 pts), error handling 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/string_utils.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"25079c573f8099c5ed3dd096488a0e9eb85c708c8e2093b245b872717b26f3cc"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetAnnotation._computeFontSize (cognitive 33): WidgetAnnotation._computeFontSize has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (14 pts), boolean chains 2 (nesting depth added 20). Of this number, 26 points are the body\u0027s own statements and 7 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":"src/core/annotation.js"},"region":{"startLine":2734}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f1dbe25f6a21ee9f1062c4742f140e1d274f391c0a12a54b8136332c353061"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasGraphics.paintChar (cognitive 33): CanvasGraphics.paintChar has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 10 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffb8c31ff0744cb8b351dde723ac60108b5ff751eda3aea82f1c7ab64e51a23"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotationLayer.render (cognitive 33): AnnotationLayer.render has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 2, loops 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":4020}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c74e502c4de0762ace76c24dfbc59f1823fa4b5f0603b355449b5821f01cf8"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotationLayer.#setAnnotationCanvasMap (cognitive 33): AnnotationLayer.#setAnnotationCanvasMap has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 5 (11 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":"src/display/annotation_layer.js"},"region":{"startLine":4280}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ea626047d75231fc7eb776c8ab188692df9fe5c789a8e3aab94a0a039e15fb"}},{"ruleId":"D2","level":"warning","message":{"text":"SignaturePropertiesManager.#renderCard (cognitive 33): SignaturePropertiesManager.#renderCard has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 7, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/digital_signature_properties_manager.js"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"177e1fae2fc6a9f957a4d1ca09c2bfaaea6326354073d6c3e409b380376818a1"}},{"ruleId":"D2","level":"warning","message":{"text":"_fillDownscaledRgba (cognitive 33): _fillDownscaledRgba has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 7 (11 pts), boolean chains 3, ternaries 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image.js"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8014c369d3211a4ac1d9b8d3b6b0559298a5e789db9362fd8c10d08cb125e16f"}},{"ruleId":"D2","level":"warning","message":{"text":"gulpfile.collectArgs (cognitive 32): gulpfile.collectArgs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 3 (6 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":"gulpfile.mjs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"7627f78f28b746f1a80e39b3a3a89415fbf1571cfd619d2b5eddde0a8b13c361"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.getObj (cognitive 32): Lexer.getObj has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 5, loops 2, 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":"src/core/parser.js"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"3175d03dffeb542cbb4e7be3e427d37591eb6510cd35bd909f40824517eb8ef7"}},{"ruleId":"D2","level":"warning","message":{"text":"Font.constructor (cognitive 32): Font.constructor has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 7, loops 2 (4 pts), ternaries 1 (2 pts), error handling 1, 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":"src/core/fonts.js"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3419b93a12d6ce9cbf0055da6df0cd52206c686a2bad470fe293d9a1068e17a"}},{"ruleId":"D2","level":"warning","message":{"text":"NameOrNumberTree.getAll (cognitive 32): NameOrNumberTree.getAll has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (6 pts), ternaries 2 (6 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/name_number_tree.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"995061f9b54fa4b52892979ed6c341ffccf22cc46e08ca859237afd03d729d09"}},{"ruleId":"D2","level":"warning","message":{"text":"StructTreeRoot.#writeKids (cognitive 32): StructTreeRoot.#writeKids has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (28 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"996f5a967ab05667ef6b8278c871e0fb2c9557861015901956488de415ca1cd4"}},{"ruleId":"D2","level":"warning","message":{"text":"extractPages (cognitive 32): extractPages has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (5 pts), boolean chains 2, ternaries 1 (2 pts), other 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":"src/display/api.js"},"region":{"startLine":2890}}}],"partialFingerprints":{"codehealthFindingId/v1":"133fd8ae154f9c15485ec0f4e99f16cebaaa5898dabaa716681a7b2164431aa1"}},{"ruleId":"D2","level":"warning","message":{"text":"run (cognitive 32): run has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (21 pts), ternaries 1 (4 pts), boolean chains 3, loops 1 (2 pts), other 2 (nesting depth added 9). Of this number, 19 points are the body\u0027s own statements and 13 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":"web/app.js"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1df08ea2b25a80a3eab892604d292d2543e76d2e347efdc8999555bd5d1e92"}},{"ruleId":"D2","level":"warning","message":{"text":"scrollPageIntoView (cognitive 32): scrollPageIntoView has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 8, ternaries 4 (6 pts), 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":"web/pdf_viewer.js"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6bb1b275ca9dff53c58cffc097d56373c26870ef1d852ef53b98a1a53ffc05"}},{"ruleId":"D2","level":"warning","message":{"text":"getNumber (cognitive 32): getNumber has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 5, loops 3 (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":"src/core/parser.js"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"49da0ddf613f7fafb683593792abdd60fe3ee017bd90cd64a6eea6fb11dd4b35"}},{"ruleId":"D2","level":"warning","message":{"text":"createImage (cognitive 32): createImage has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 4 (9 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_images.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"186bae233df307759c313b4eb0152165678061b76764362f7c99691fa1786cbf"}},{"ruleId":"D2","level":"warning","message":{"text":"getHighestPriority (cognitive 32): getHighestPriority has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 3 (6 pts), loops 3 (5 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":"web/pdf_rendering_queue.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44a710b3089014417f266aa5de439ec91e53fa7ef96b1b63fa465214b56ae46"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictorStream.readBlockTiff (cognitive 31): PredictorStream.readBlockTiff has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 7 (15 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":"src/core/predictor_stream.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fe90fa0b04b37290ddd007ec4454c66517582145e94f870d24beee7e22faa8"}},{"ruleId":"D2","level":"warning","message":{"text":"CFFParser.parseCharsets (cognitive 31): CFFParser.parseCharsets has cognitive complexity 31 (threshold 15). Drivers by points: loops 5 (12 pts), ternaries 4 (12 pts), if/else 4 (6 pts), match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_parser.js"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"895836b49b5dfe0a92e55c8a83004ab9dd9bad21c8080354c45f3e846ba05653"}},{"ruleId":"D2","level":"warning","message":{"text":"Font.checkAndRepair::readTrueTypeCollectionData (cognitive 31): Font.checkAndRepair::readTrueTypeCollectionData has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (20 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. This shape REPEATS in the file: 4 other methods here (Font.checkAndRepair::sanitizeGlyph, Font.checkAndRepair::readPostScriptTable, Font.checkAndRepair::readNameTable, \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":"src/core/fonts.js"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d196736087a74d55214842dfefc8db943db30db2252b450fcf7801884872bfb"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotationLayer.#addElementsToDOM (cognitive 31): AnnotationLayer.#addElementsToDOM has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 4 (9 pts), boolean chains 6 (nesting depth added 10). Of this number, 16 points are the body\u0027s own statements and 15 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":"src/display/annotation_layer.js"},"region":{"startLine":4114}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb70163fbccd33eba940f99b919059fe1e2a21e8bbb845b409d7128ad7fb6c3"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFOutlineViewer._getPageNumberToDestHash (cognitive 31): PDFOutlineViewer._getPageNumberToDestHash has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (24 pts), boolean chains 3, loops 2 (3 pts), ternaries 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":"web/pdf_outline_viewer.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d98bb62707782df04e8d41e0a777d514d71da095e91bdcb8ae9bc81bebb91d1"}},{"ruleId":"D2","level":"warning","message":{"text":"resetForm (cognitive 31): resetForm has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"330978801a9e7b03878dbc67494889b1066b486fb966116efdde6699c14f2598"}},{"ruleId":"D2","level":"warning","message":{"text":"render (cognitive 31): render has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 3, loops 2, other 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/xfa_layer.js"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce70fdb2eca2230bef1db3ac0687889d6069fe2df32790e6d3cb5d197438301d"}},{"ruleId":"D2","level":"warning","message":{"text":"moveCaret (cognitive 31): moveCaret has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 6 (14 pts), loops 2, 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":"web/caret_browsing.js"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c38bce65fecf5621988d4bf25bdb7aaed0673f77909311b42bf18d71cef6399"}},{"ruleId":"D2","level":"warning","message":{"text":"Type1Parser.extractFontHeader (cognitive 30): Type1Parser.extractFontHeader has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (10 pts), match/switch 1 (2 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":"src/core/type1_parser.js"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"123730a67e5308778a2069d338dff303f82bf46bf3be7f96d934214a5fd970a6"}},{"ruleId":"D2","level":"warning","message":{"text":"XRef.readXRefTable (cognitive 30): XRef.readXRefTable has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 6, match/switch 1 (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":"src/core/xref.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"1848c522224a9a1430ab3588eb44039a01812fc195015259f102c4d47e7ddcf8"}},{"ruleId":"D2","level":"warning","message":{"text":"FontFinder.find (cognitive 30): FontFinder.find has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/fonts.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9227f3ed39ad4a3416c9e3e354727af1c34db73fbd667a4beed4a79a51aec0"}},{"ruleId":"D2","level":"warning","message":{"text":"ChoiceWidgetAnnotation._getAppearance (cognitive 30): ChoiceWidgetAnnotation._getAppearance has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (19 pts), loops 4 (6 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":4059}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ae8725877c45e68c0bdd1d43e8f4fd4e55a8e67bb3f821b01078c16179d08b"}},{"ruleId":"D2","level":"warning","message":{"text":"TextHighlighter._renderMatches (cognitive 30): TextHighlighter._renderMatches has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 2 (4 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 10). Of this number, 26 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":"web/text_highlighter.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb236d11f720b3904fb5ba5b8b55f56e7adc649d7b2cbfd85c2cdfc0edf2fe8"}},{"ruleId":"D2","level":"warning","message":{"text":"FontView.#render (cognitive 30): FontView.#render has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (6 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 14). Of this number, 24 points are the body\u0027s own statements and 6 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":"web/internal/font_view.js"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"2912d02dea3b2e79c0151b19458cc908c2fa748e03f8496b5db85c87425cc60b"}},{"ruleId":"D2","level":"warning","message":{"text":"parseIf (cognitive 30): parseIf has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 5, 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":"src/core/xfa/formcalc_parser.js"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a9407183fd677f7f01daf7eeedf4cd2bd056f100e000c3a480e41c1901d279"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.getString (cognitive 29): Lexer.getString has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 2 (5 pts), boolean chains 2, 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":"src/core/parser.js"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"539284a03c06d382f8a5a8ad431f4af05eace78d9b01e3860d508f17d5a2961c"}},{"ruleId":"D2","level":"warning","message":{"text":"Font.checkAndRepair::sanitizeGlyph (cognitive 29): Font.checkAndRepair::sanitizeGlyph has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 2, loops 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: 4 other methods here (Font.checkAndRepair::readTrueTypeCollectionData, Font.checkAndRepair::readPostScriptTable, Font.checkAndRepair::readNameTable, \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":"src/core/fonts.js"},"region":{"startLine":2115}}}],"partialFingerprints":{"codehealthFindingId/v1":"05eb00c50ac9aae28b4490a77cfa7f7d3a4d3e81fe542dde0476f3b76d02710d"}},{"ruleId":"D2","level":"warning","message":{"text":"XFAObject.[_applyPrototype] (cognitive 29): XFAObject.[_applyPrototype] has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 4 (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":"src/core/xfa/xfa_object.js"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"9494153cbeafd5c24c69e9a0b97de488610b426215662e2cd1f77942e3e6f849"}},{"ruleId":"D2","level":"warning","message":{"text":"InkAnnotation.constructor (cognitive 29): InkAnnotation.constructor has cognitive complexity 29 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 5 (9 pts), ternaries 1 (4 pts), boolean chains 3 (nesting depth added 14). Of this number, 20 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":"src/core/annotation.js"},"region":{"startLine":4911}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba29ec40f8321c406189ac68c1077c9b1598d191fb6f31da0a413c3f66eb45af"}},{"ruleId":"D2","level":"warning","message":{"text":"FreeTextEditor.editorDivPaste (cognitive 29): FreeTextEditor.editorDivPaste has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/freetext.js"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4338570165350ca456a644c9b7a0c1202a7d2d281673a91acc544f9610bb61d"}},{"ruleId":"D2","level":"warning","message":{"text":"Field.constructor (cognitive 29): Field.constructor has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 19, if/else 5 (8 pts), loops 1 (2 pts) (nesting depth added 4). 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":"src/scripting_api/field.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcec0fc7a29ac00c1cec6f39dcbcfa23bdc6cd7c23a6fe9737c890071e37001"}},{"ruleId":"D2","level":"warning","message":{"text":"buildFormXObject (cognitive 29): buildFormXObject has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 8, ternaries 2 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"45916d0797d92e4b2d00cb650e39f51a25eadc08cbd8829e6ef3bd5f8e2a242a"}},{"ruleId":"D2","level":"warning","message":{"text":"#makeOutline::fillItems (cognitive 29): #makeOutline::fillItems has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 4 (11 pts), boolean chains 3, 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb56f82c3ea13787f7006c566571b1db8eae62e911f00e3f671928848701258f"}},{"ruleId":"D2","level":"warning","message":{"text":"readXRef (cognitive 29): readXRef has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xref.js"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"b541ad7d875b9dac91f016599ea4ce1a2fe813a5a01c6c86d4aadb2e4fe095bc"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 29): (computed) has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 4 (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":"src/core/xfa/xfa_object.js"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd79b0897783565f2ef1c2cf2f3e56c42a7e45e9ba7691960183b5673a5fe5ba"}},{"ruleId":"D2","level":"warning","message":{"text":"getPdfFilenameFromUrl (cognitive 29): getPdfFilenameFromUrl has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (16 pts), error handling 5, loops 2 (5 pts), boolean chains 2, other 1 (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 9 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":"src/display/dom_utils.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d497d1df2b71ac17f9dadda52de78b314541a367ab10a09237f7513ec3b289"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFScriptingManager.#updateFromSandbox (cognitive 28): PDFScriptingManager.#updateFromSandbox has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 3, match/switch 1 (2 pts), loops 1, ternaries 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":"web/pdf_scripting_manager.js"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a47966efa8cc069078a7498a7b00420d3bf9fb38430c50a377e1df25acbda4"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 28): constructor has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 3 (9 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 12). Of this number, 23 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":4818}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b89ae8f6f4c2343a3f5062b516144ecd7d2dafa14ca6c1376923b01a2c07e7"}},{"ruleId":"D2","level":"warning","message":{"text":"handleBreak (cognitive 28): handleBreak has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbc5b05bc6d0a0d402c23e13655ce32064ef7be17e1c414b7e6e3a7d3a580cc"}},{"ruleId":"D2","level":"warning","message":{"text":"onWheel (cognitive 28): onWheel has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 13, if/else 7 (11 pts), ternaries 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":"web/app.js"},"region":{"startLine":3160}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b8118d8c6dc6a37c59cd5d83318d8f9bcedb309a587e3702edc766263836e4"}},{"ruleId":"D2","level":"warning","message":{"text":"renderDocs (cognitive 28): renderDocs has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (7 pts), boolean chains 2, other 2 (nesting depth added 13). Of this number, 17 points are the body\u0027s own statements and 11 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":"gulpfile.mjs"},"region":{"startLine":3364}}}],"partialFingerprints":{"codehealthFindingId/v1":"685ac33a029cf23521b04a563affa255a645fd29a888b1c5f017ae7e3540a392"}},{"ruleId":"D2","level":"warning","message":{"text":"startXRef (cognitive 28): startXRef has cognitive complexity 28 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 6 (12 pts), boolean chains 2 (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":"src/core/document.js"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee01612e2e9a0760be37bb175ba6fedd3915f9eae845a7a03916dfa9535fb8c"}},{"ruleId":"D2","level":"warning","message":{"text":"reset (cognitive 28): reset has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 12, if/else 9 (12 pts), match/switch 1 (2 pts), loops 1, other 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":"web/pdf_page_view.js"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cdfe64d3f1565113b7e9f7653532c53061dd5134bb5cb8994e5899c694e1d7"}},{"ruleId":"D2","level":"warning","message":{"text":"parse (cognitive 28): parse has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be237d61274e5c0d2ded0d82a30bf4c8e59a1682ffcd317a2b8026754bf519b"}},{"ruleId":"D2","level":"warning","message":{"text":"#setAttributes (cognitive 28): #setAttributes has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (18 pts), ternaries 2 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/struct_tree_layer_builder.js"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"900599f0293086456ffbea91b385f49f2801b8732c97aa423f93878093d18952"}},{"ruleId":"D2","level":"warning","message":{"text":"_bindItems (cognitive 28): _bindItems has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/bind.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c73432d2a073ec611297fda3d05530e1c2588e1fc58e0ae90bb8606d6bcc8ce"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialEvaluator.handleColorN (cognitive 27): PartialEvaluator.handleColorN has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 3 (10 pts), error handling 1 (3 pts), boolean chains 1 (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":"src/core/evaluator.js"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"711e205e486b07bb1dd9f3491818ea0e4adf1bad6278256487947308eb8d9529"}},{"ruleId":"D2","level":"warning","message":{"text":"StructTreeRoot.canUpdateStructTree (cognitive 27): StructTreeRoot.canUpdateStructTree has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 5 (9 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed893b71a79bb8043288cc9e647030ef5e562e42a1147d2dd9f4d118f401f399"}},{"ruleId":"D2","level":"warning","message":{"text":"XRef.fetchCompressed (cognitive 27): XRef.fetchCompressed has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 5, loops 2, ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xref.js"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad60aa88fb21b7aeba6f12ad4726e80fb16c162511817142d67b871e4f6adc96"}},{"ruleId":"D2","level":"warning","message":{"text":"RadialAxialShadingPattern.getPattern (cognitive 27): RadialAxialShadingPattern.getPattern has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/pattern_helper.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d472c94034060479a9ff718ffebae5a258bc6d2957a219396120d06d633adf1"}},{"ruleId":"D2","level":"warning","message":{"text":"setGState (cognitive 27): setGState has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (17 pts), boolean chains 4, ternaries 1 (3 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbfa8b59337cadce1cb6bc1139b71681e4d70dc41b44eb6a866962452b47c0b"}},{"ruleId":"D2","level":"warning","message":{"text":"_parseHashParams (cognitive 27): _parseHashParams has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 3 (7 pts), boolean chains 3, ternaries 2 (3 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). Of this number, 25 points are the body\u0027s own statements and 2 belong to 31 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app.js"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"1132214423d80e32621d0c90c0051963b1427302c3b23f7dde11ed78c3495d20"}},{"ruleId":"D2","level":"warning","message":{"text":"#postCollectPageData (cognitive 27): #postCollectPageData has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, ternaries 3 (6 pts), loops 1 (nesting depth added 10). Most of this is not in the body itself: 3 of the 27 points are its own statements and the rest belongs to one function literal inside it that branches (line 1247). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3d6b9995cf370f4ca4ffd844b531e8afd687c83571df463d4e76a8efb8c172"}},{"ruleId":"D2","level":"warning","message":{"text":"computeBbox (cognitive 27): computeBbox has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 2 (8 pts), boolean chains 3 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/html_utils.js"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"af66fb9981654195379faa74aa96cd6d503d94308b3b24835533a3a31e2d2624"}},{"ruleId":"D2","level":"warning","message":{"text":"migration.chrome.runtime.onInstalled.addListener() (cognitive 26): migration.chrome.runtime.onInstalled.addListener() has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 1 (nesting depth added 9). Most of this is not in the body itself: 2 of the 26 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 92, 33, 55, \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":"extensions/chromium/options/migration.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be5312deff6a07470321d6c5d58ffcd3ddc66b5af6af48a3b0f840bc445f541"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFImage.getComponents (cognitive 26): PDFImage.getComponents has cognitive complexity 26 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 8 (12 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image.js"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a121f58c51d06a39303dae5c97a8dd45de06a2050359080a993d067fe62bfc"}},{"ruleId":"D2","level":"warning","message":{"text":"RichMediaAnnotation.#findAsset (cognitive 26): RichMediaAnnotation.#findAsset has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (3 pts), ternaries 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":"src/core/annotation.js"},"region":{"startLine":5718}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a77e5a014e9d4ff9b4fbe7e2bc0c1ce68b2ca3acdf9363ba4767965da275d2"}},{"ruleId":"D2","level":"warning","message":{"text":"pattern_helper.drawTriangle (cognitive 26): pattern_helper.drawTriangle has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/pattern_helper.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a399cfe4bb2b23e4d49510244f836440240e37f96ff8f2919df198b8a762e68c"}},{"ruleId":"D2","level":"warning","message":{"text":"_createMaskCanvas (cognitive 26): _createMaskCanvas has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 9, ternaries 4 (5 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c60383f27951a662374353619e7de5752c48c75648314a3a2dabc48c701a185"}},{"ruleId":"D2","level":"warning","message":{"text":"#findClosestThumbnail (cognitive 26): #findClosestThumbnail has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 4 (7 pts), boolean chains 4, other 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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":1895}}}],"partialFingerprints":{"codehealthFindingId/v1":"687f044d78538ff8c0b0859a42bd386925f8dcb64470bfd709187a7e04ff7f02"}},{"ruleId":"D2","level":"warning","message":{"text":"editorStats (cognitive 26): editorStats has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (4 pts), boolean chains 1, other 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_storage.js"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1d3ac7ced3bba54289ca7d241a4e1e6aebc6bf14712c3fd126e3a150f680bd"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 26): (anonymous) has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 1 (nesting depth added 9). Most of this is not in the body itself: 2 of the 26 points are its own statements and the rest belongs to 11 function items inside it that branch (a function literal at line 92, a function literal at line 33, 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":"extensions/chromium/options/migration.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"161aa3bf696deaee685b565c58d40859adcf16d42d0239b121cbfccfbedc952f"}},{"ruleId":"D2","level":"warning","message":{"text":"CFFParser.parseEncoding (cognitive 25): CFFParser.parseEncoding has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 4 (7 pts), match/switch 1 (2 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 13). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function item 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":"src/core/cff_parser.js"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fa0ad410fb79e88ac8c4650ed4f5df3293abcf4216e48f61bc07d55eab3876"}},{"ruleId":"D2","level":"warning","message":{"text":"Font.getMissingFileGlyphs (cognitive 25): Font.getMissingFileGlyphs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (8 pts), boolean chains 4, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"df60828dc6ec2e503944fead01f9672c5f956f78ec42d452c0c0adab263c02d0"}},{"ruleId":"D2","level":"warning","message":{"text":"PsWasmCompiler._compileNodeAsBoolI32 (cognitive 25): PsWasmCompiler._compileNodeAsBoolI32 has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 5, match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/wasm_compiler.js"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b24888e65ac32dbe3d2b8c73738af45065c70b98cbb9cd420f329221a13b94"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluator_utils.parseMarkedContentProps (cognitive 25): evaluator_utils.parseMarkedContentProps has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 1 (4 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator_utils.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"798d1c8dac2016446e4c65686e8437b54ef15715f6e1e284d3893af4b90e1b9f"}},{"ruleId":"D2","level":"warning","message":{"text":"Catalog.#readDocumentOutline (cognitive 25): Catalog.#readDocumentOutline has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5, ternaries 3 (5 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":"src/core/catalog.js"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49c881d1ad052fe589b9be99284e50a40d6e14b0842812af5ba220661a07f69"}},{"ruleId":"D2","level":"warning","message":{"text":"SignatureExtractor.#bilateralFilter (cognitive 25): SignatureExtractor.#bilateralFilter has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 2 (9 pts), boolean chains 2 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/drawers/signaturedraw.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"1076c8d6525f860dddf8128706b8974a1f6044fe184117419844f6f9a2251f87"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentDialog.open (cognitive 25): CommentDialog.open has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (22 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":"web/comment_manager.js"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"520da9bb38000b316190a3021c7bee8f942043421dbc7b25293c12951bb94e18"}},{"ruleId":"D2","level":"warning","message":{"text":"Stepper.updateOperatorList (cognitive 25): Stepper.updateOperatorList has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 8). Of this number, 23 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":"web/debugger.mjs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"650c637fd0521de6030a696b4e5adf88e69698358b9b0331f7feb29f8683a491"}},{"ruleId":"D2","level":"warning","message":{"text":"#setScaleUpdatePages (cognitive 25): #setScaleUpdatePages has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 7, other 2, ternaries 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_viewer.js"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c7c475aace5de1ffea0d364c0f179fc11d79ca8adcf36186d37b17176aa0d9"}},{"ruleId":"D2","level":"warning","message":{"text":"fillRgb (cognitive 25): fillRgb has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 3 (9 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/colorspace.js"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"6402c78162b2243d757f7b673bd04e3b96ba995e07da8b102631b59e0d61397a"}},{"ruleId":"D2","level":"warning","message":{"text":"onReceiveData (cognitive 25): onReceiveData has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3 (4 pts), boolean chains 2, ternaries 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/chunked_stream.js"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac588999d07761c3de660138eb7a3d99b23c4e39f3b7022cda6324b47af3aafd"}},{"ruleId":"D2","level":"warning","message":{"text":"applyPNGOptimumFilter (cognitive 25): applyPNGOptimumFilter has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 4 (13 pts), loops 4 (8 pts), if/else 1 (3 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":"src/core/editor/pdf_images.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd18346bc0f49beb23a11e8ae5ddfd234482307c9369d0bb84d563b614ea986"}},{"ruleId":"D2","level":"warning","message":{"text":"core_utils.deepCompare (cognitive 24): core_utils.deepCompare has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/core_utils.js"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a157f62f2cbea01ca6c5ef26bd0665dc2f44ef5eafbe4e09266b1d870a4cd7"}},{"ruleId":"D2","level":"warning","message":{"text":"cmap.parseCMap (cognitive 24): cmap.parseCMap has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (3 pts), error handling 1 (2 pts), boolean chains 1, loops 1, 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":"src/core/cmap.js"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc88c94133bade0207fd0fb4dcf128332ff981c42fcbc27570f04ea3dc4a5d85"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialEvaluator.readToUnicode (cognitive 24): PartialEvaluator.readToUnicode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), error handling 1 (2 pts), loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 12). Of this number, 15 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":"src/core/evaluator.js"},"region":{"startLine":4175}}}],"partialFingerprints":{"codehealthFindingId/v1":"800ab3b3c06130074dec8aa722ce4c8115bd85f6330bec3ca0b5e15f3399a6d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder._setProperties (cognitive 24): Binder._setProperties has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/bind.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bac9dbb120ce59f863668c77b50a51fb9ff53f575ca40aefdff3c6c8e3cf689"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotationEditorUIManager.#selectionChange (cognitive 24): AnnotationEditorUIManager.#selectionChange has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 8). Of this number, 17 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":"src/display/editor/tools.js"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"4005415df4b046c05e79574604071e8148f2249a553912d1fe712ccf1091fdbc"}},{"ruleId":"D2","level":"warning","message":{"text":"Util.#createDateActions (cognitive 24): Util.#createDateActions has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 5 (nesting depth added 6). None of this is in the body itself: all 24 points belong to 7 function literals inside it that branch (lines 344, 346, 354, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/util.js"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f74d1c5e54735fea9830c5cb6c9c86a0983d5c259e21f783784e7d99e88d9b4"}},{"ruleId":"D2","level":"warning","message":{"text":"draw_ops_view.formatArg (cognitive 24): draw_ops_view.formatArg has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 4 (8 pts), boolean chains 3 (nesting depth added 7). Of this number, 22 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":"web/internal/draw_ops_view.js"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69b272399821ebc9084ebb837d30b8e53a121f25c4e9d6b285c8d95eeeaeb88"}},{"ruleId":"D2","level":"warning","message":{"text":"_createContainer (cognitive 24): _createContainer has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 8, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc50f8321c8f2f61807c4d3981dc080b881bf58350ab4bb0c9bd8db27eb73c0b"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 24): constructor has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 11, if/else 5 (9 pts), match/switch 1 (2 pts), other 2 (nesting depth added 5). Of this number, 17 points are the body\u0027s own statements and 7 belong to 7 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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67127c193ea6dd27e73f0b8c6e15994a2536e8e22479b717e9faa0d64c992a3"}},{"ruleId":"D2","level":"warning","message":{"text":"#addExternalFileDropListeners (cognitive 24): #addExternalFileDropListeners has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 9, loops 1, other 1, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 6 function items inside it that branch (hasMergeableItem, a function literal at line 1773, a function literal at line 1707, \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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb15a64172a633a92ed009affea0b967406e2d91f3ff1734a7525f41cebcd9a"}},{"ruleId":"D2","level":"warning","message":{"text":"fillOpacity (cognitive 24): fillOpacity has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (9 pts), boolean chains 2 (nesting depth added 11). Most of this is not in the body itself: 9 of the 24 points are its own statements and the rest belongs to 4 function items inside it that branch (apply, apply, apply, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image.js"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"044ff464838a8f495e2f813ba925943da653c430b2e632136ffafa89bbbb211d"}},{"ruleId":"D2","level":"warning","message":{"text":"draw (cognitive 24): draw has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 7, ternaries 3 (nesting depth added 2). Of this number, 16 points are the body\u0027s own statements and 8 belong to 7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_page_view.js"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"004a79f111be0c90f6169aa70ed88f2e65601ba8138f39bb06eb36285ef92640"}},{"ruleId":"D2","level":"warning","message":{"text":"getFontSubstitution (cognitive 24): getFontSubstitution has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 9, loops 1 (2 pts), ternaries 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":"src/core/font_substitutions.js"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b920490bce86c434891c4ff0af80116396e854c572373c478e24c596b09f58"}},{"ruleId":"D2","level":"warning","message":{"text":"_encodeBMP (cognitive 24): _encodeBMP has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (13 pts), if/else 5 (8 pts), ternaries 1 (2 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":"src/core/image_resizer.js"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"048090d81b16d6627c6f91816ea503935c0a1c0362cab42cbefdb1b51387f52b"}},{"ruleId":"D2","level":"warning","message":{"text":"constructSampled::constructSampledFn (cognitive 24): constructSampled::constructSampledFn has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 3 (4 pts), ternaries 1 (3 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":"src/core/function.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0f20ed62aafcf008d65abd2b212adb95524a6a56e4b378be22993244ff9a6e"}},{"ruleId":"D2","level":"warning","message":{"text":"initSandbox (cognitive 24): initSandbox has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 6 (8 pts), error handling 1 (nesting depth added 9). Of this number, 23 points are the body\u0027s own statements and 1 belongs 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":"src/scripting_api/initialization.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d837564349d2b289fdf6624dcb480c8e97a790ce8ac6141680837b7748e4fcb"}},{"ruleId":"D2","level":"warning","message":{"text":"core_utils.validateFontName (cognitive 23): core_utils.validateFontName has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/core_utils.js"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b086db01bd57c4197bc0790c6a0a77c9b3cb62cddd7313727b655a2d8bbeca"}},{"ruleId":"D2","level":"warning","message":{"text":"LZWStream.readBlock (cognitive 23): LZWStream.readBlock has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4 (10 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/lzw_stream.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ead9d21333a84ce6068dfba15417316e520400525af660ec7d10f1f6f06245b"}},{"ruleId":"D2","level":"warning","message":{"text":"Font.encodeString (cognitive 23): Font.encodeString has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (5 pts), ternaries 2 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":3849}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb0113c20103efd20cd11868062b795a70eccdf0c65f32a6701957edd0935fc"}},{"ruleId":"D2","level":"warning","message":{"text":"NameOrNumberTree.getRaw (cognitive 23): NameOrNumberTree.getRaw has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (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":"src/core/name_number_tree.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"705fa78117f654c6baa817ce0743ae7b15f64793d339a891ebf7ca5802e34b6c"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotationFactory.saveNewAnnotations (cognitive 23): AnnotationFactory.saveNewAnnotations has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 1 (3 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bc68a1798d94baaa1eac35130b739292ac3ae1c73a63cd3b278fa9fca38141"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotationFactory.printNewAnnotations (cognitive 23): AnnotationFactory.printNewAnnotations has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, ternaries 1 (3 pts), match/switch 1 (2 pts), 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":"src/core/annotation.js"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"80334a552f02ebdeaededced506e2d5e49a8a9573ba66c0d70991e71fe5d9e80"}},{"ruleId":"D2","level":"warning","message":{"text":"document.find (cognitive 23): document.find has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (10 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"67be8ae1821f7aa4472b82446ee12a93a296cf93ce5741c71e29cc8a7bb3aedf"}},{"ruleId":"D2","level":"warning","message":{"text":"MessageHandler.#processStreamMessage (cognitive 23): MessageHandler.#processStreamMessage has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 3, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/message_handler.js"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bcdc66532b7b0bf4fff6f20d90f805f9a92fa9c9c9c6030230690551122459"}},{"ruleId":"D2","level":"warning","message":{"text":"HighlightOutliner.#breakEdge (cognitive 23): HighlightOutliner.#breakEdge has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/drawers/highlight.js"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"851979f97522b770fc746559ec74ed98a97fcb114f875fc43591ff68bd1f389e"}},{"ruleId":"D2","level":"warning","message":{"text":"StructTreeLayerBuilder.updateTextLayer (cognitive 23): StructTreeLayerBuilder.updateTextLayer has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (9 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":"web/struct_tree_layer_builder.js"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8e0dd3ad51844c7eb0af9e07a82c11ad7531ec6f04844b3c37875eddf533f3"}},{"ruleId":"D2","level":"warning","message":{"text":"TilingPattern.createPatternCanvas (cognitive 23): TilingPattern.createPatternCanvas has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (5 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/pattern_helper.js"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"51be401bda7d010dbb1e5db6d0d8e27daf6649182793203def3cc3828325f91c"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFScriptingManager.setDocument (cognitive 23): PDFScriptingManager.setDocument has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, loops 2 (5 pts), boolean chains 3, error handling 2 (nesting depth added 3). Of this number, 18 points are the body\u0027s own statements and 5 belong to 4 function literals inside it that branch. 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":"web/pdf_scripting_manager.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff22054320ae875530d484837ae85318afad038a1abcf335b46a1ef2d0613f94"}},{"ruleId":"D2","level":"warning","message":{"text":"CaretBrowsingMode.#setCaretPositionHelper (cognitive 23): CaretBrowsingMode.#setCaretPositionHelper has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/caret_browsing.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc0d8afabd11098962c80715b2a9abef72dc4050d1241e056ac3914a8f94d31"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 23): constructor has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (6 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":3938}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20c62a5e9bb29f15482b13c13ba731de24e5e4cfd8f23a3e99a04a2928a5f6c"}},{"ruleId":"D2","level":"warning","message":{"text":"mapStyle (cognitive 23): mapStyle has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 2 (6 pts), boolean chains 5, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/xhtml.js"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"8828f43435a061aa051a2d4cec071aeeef850114e59bae7d3807370667211d3e"}},{"ruleId":"D2","level":"warning","message":{"text":"check_l10n.findDynamicLocation (cognitive 22): check_l10n.findDynamicLocation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), boolean chains 3, 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":"external/check_l10n/check_l10n.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa98ec66258d3d41b0fe14fa9f2950f24b7187e376c092ad67fc614310034b8"}},{"ruleId":"D2","level":"warning","message":{"text":"gulpfile.runTests (cognitive 22): gulpfile.runTests has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 3, error handling 1 (2 pts), match/switch 1 (nesting depth added 3). None of this is in the body itself: all 22 points belong to 2 function literals inside it that branch (lines 828, 917). 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":"gulpfile.mjs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1540824aadf495b4ce9f084f4ddb2525d2b73a643ee6e79d7491b12d2d21e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Dict.merge (cognitive 22): Dict.merge has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 5 (9 pts), boolean chains 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/primitives.js"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"7988481601ba3ee38d30e77d4871d2c6c157b97fdc6237f4c066dd7ea73151aa"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.getName (cognitive 22): Lexer.getName has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 1, 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":"src/core/parser.js"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2c907a4a51f24e262967dc72bf1b65e32ef0734dade2791b11f81e5801d52b"}},{"ruleId":"D2","level":"warning","message":{"text":"CFFCompiler.compileDict (cognitive 22): CFFCompiler.compileDict has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (7 pts), match/switch 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":"src/core/cff_parser.js"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ed51709133b024082c41188e6ec35d0e65891462af880efa046c5f887ec726"}},{"ruleId":"D2","level":"warning","message":{"text":"CFFFont.getGlyphMapping (cognitive 22): CFFFont.getGlyphMapping has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (8 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_font.js"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4638c772e5d5b76bc4b2600d68acfdb3f651019c9ff3da838d1a7f0c824df8d"}},{"ruleId":"D2","level":"warning","message":{"text":"StructTreePage.addNode (cognitive 22): StructTreePage.addNode has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc1dfaabe912bf88cf8a97a6574b28cc682e5e19559def27dd69f4b3f70c042"}},{"ruleId":"D2","level":"warning","message":{"text":"Annotation.setBorderStyle (cognitive 22): Annotation.setBorderStyle has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (20 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":"src/core/annotation.js"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"93839b3d083374146e62151281eda33dd8e6a3f1f1b1b06e859ee49b725c7902"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFEditor.#fixFields (cognitive 22): PDFEditor.#fixFields has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":2156}}}],"partialFingerprints":{"codehealthFindingId/v1":"937eab82b61266add53244e96e286a99006ee0b241e27dd9719043666ec97c55"}},{"ruleId":"D2","level":"warning","message":{"text":"StampEditor.copyCanvas (cognitive 22): StampEditor.copyCanvas has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/stamp.js"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ccea6369240c185f8a4751f290198ee2d8e777ba4a756b280c52d1563d610a"}},{"ruleId":"D2","level":"warning","message":{"text":"TouchManager.#onTouchMove (cognitive 22): TouchManager.#onTouchMove 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":"src/display/touch_manager.js"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f1e059cf6971907d272b4d28d6fb3cb79d7f04b733a6543d822128819f72ae"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotationElement.commentButtonPosition (cognitive 22): AnnotationElement.commentButtonPosition has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (7 pts), ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea32de7ed6508e4bca9508a14f991c87db4d895b5741ccfb723bd89070dfc81"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 22): constructor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (3 pts), ternaries 2 (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":"src/core/annotation.js"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc6e1c82153136bf716ff6420d1fc0dabaf2b9441bac5cc5463fb363f9b6e86"}},{"ruleId":"D2","level":"warning","message":{"text":"getFontFileType (cognitive 22): getFontFileType has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 4 (10 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"7beb092cfd891429ddc8fcedc445d44a33d70a1178dc023578c1ed0016b2415f"}},{"ruleId":"D2","level":"warning","message":{"text":"createWebpackConfig (cognitive 22): createWebpackConfig has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 6, boolean chains 5, other 2, loops 1 (nesting depth added 3). Of this number, 15 points are the body\u0027s own statements and 7 belong to 3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gulpfile.mjs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e2fc9b464271fdd4d55de6fa5c13f4321f29302fd5cfac43ae69f732f0a92d"}},{"ruleId":"D2","level":"warning","message":{"text":"serialize (cognitive 22): serialize has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 1, other 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":"src/display/editor/stamp.js"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7086150ead4683d2debed63f770814851ff5049086c2ddb38cd74156cf46b7d"}},{"ruleId":"D2","level":"warning","message":{"text":"createWrapper (cognitive 22): createWrapper has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (7 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/html_utils.js"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b51b6297c843140a5239b6f958d1a76a4ef1af5b7174cf797576e020b71e26"}},{"ruleId":"D2","level":"warning","message":{"text":"toDateObject (cognitive 22): toDateObject has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, ternaries 7, if/else 5. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/dom_utils.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e4cdf368ab8196f5f94aeac8f18f256fcc5e132085cb267d2db02418f2ef2f"}},{"ruleId":"D2","level":"warning","message":{"text":"_createCanvas (cognitive 22): _createCanvas has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4 (nesting depth added 8). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 126). 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":"web/base_pdf_page_view.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec8b69b9dd18cc93e302078cd06fa78d2bd93dd0559f7f5c7a6cbac4fc19195"}},{"ruleId":"D2","level":"warning","message":{"text":"CFFParser.parseDict (cognitive 21): CFFParser.parseDict has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, loops 2 (nesting depth added 5). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to 2 function items inside it that branch (parseOperand, parseFloatOperand). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_parser.js"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f7fd098e3103430e648a3d78449994ebba2d7ab5fee0c565e69315ff1b12cd"}},{"ruleId":"D2","level":"warning","message":{"text":"CFFParser.parseCharStrings (cognitive 21): CFFParser.parseCharStrings has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_parser.js"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebfb7686fe7ac70f2e7c0f9248107232c7443dbe1ca4a03bd9d7fceb21a493f"}},{"ruleId":"D2","level":"warning","message":{"text":"PSStackToTree._makeUnary (cognitive 21): PSStackToTree._makeUnary has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 7 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"4147e1225bb64d82079f444b4f108d88703486c7c6eb4e0fdcb4b7d052088ae4"}},{"ruleId":"D2","level":"warning","message":{"text":"ast._evalBinaryConst (cognitive 21): ast._evalBinaryConst has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 8 (16 pts), boolean chains 2, if/else 1 (2 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":"src/core/postscript/ast.js"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b09e9c09d5c1ffa0e29fda9fb0545ea9364fa9db0d5fdac9c8980de20a0fc1"}},{"ruleId":"D2","level":"warning","message":{"text":"html_utils.setPara (cognitive 21): html_utils.setPara has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (3 pts), match/switch 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":"src/core/xfa/html_utils.js"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be9d4c55615d4553aef82996c544127d217b1018bec289918b6989c65eb5da8"}},{"ruleId":"D2","level":"warning","message":{"text":"DataHandler.serialize (cognitive 21): DataHandler.serialize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/data.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aef6f3d6358759e059f21044af1a80497ca134fd461478c4812b521b3d6b77d"}},{"ruleId":"D2","level":"warning","message":{"text":"ButtonWidgetAnnotation._getOptInfo (cognitive 21): ButtonWidgetAnnotation._getOptInfo has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 1 (2 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":3667}}}],"partialFingerprints":{"codehealthFindingId/v1":"764d3cd9aee907f06834f0d5ea8d2c75d1571e8c417a3647341d37e81cbd9c8f"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenAnnotation.#findRenditionAsset (cognitive 21): ScreenAnnotation.#findRenditionAsset has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 1 (3 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":5845}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b862a1d818b7b329f2c167184abe3c1ad002c4578127c87154d8443ae7f0c4"}},{"ruleId":"D2","level":"warning","message":{"text":"Page.#replaceIdByRef (cognitive 21): Page.#replaceIdByRef has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 1, 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":"src/core/document.js"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"280f9274361157e1bcfd002fa24ef39fbe6e0bd84986616ed2815aedcfc25697"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFDocument.checkLastPage (cognitive 21): PDFDocument.checkLastPage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 2 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"883bf6145d978b1128154c583882637f1a8edbf8aa5a182fa1834106032cc1d9"}},{"ruleId":"D2","level":"warning","message":{"text":"FreeDrawOutline.#computeMinMax (cognitive 21): FreeDrawOutline.#computeMinMax has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/drawers/freedraw.js"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c367e88bba442816b778c2c01e953321cfc50dff7ddeb0c1c93a16701fc2a3"}},{"ruleId":"D2","level":"warning","message":{"text":"Doc.constructor (cognitive 21): Doc.constructor has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 21. 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":"src/scripting_api/doc.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28a74e8fa5494cbd9f2b723017f7519f9e3f2519562dc66be7da476e94d597f"}},{"ruleId":"D2","level":"warning","message":{"text":"EventDispatcher.#runCalculate (cognitive 21): EventDispatcher.#runCalculate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/event.js"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96a442f496d9372e262ca38e628eb86ed26e0804ef2d6f6eb729d80d0499a02"}},{"ruleId":"D2","level":"warning","message":{"text":"documentInfo (cognitive 21): documentInfo has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (5 pts), error handling 1, loops 1, other 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12b6442e285c2640218ace84b6aca534fe024a7a9f433808a822a690489f958"}},{"ruleId":"D2","level":"warning","message":{"text":"keydown (cognitive 21): keydown has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 6 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/editor.js"},"region":{"startLine":2073}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4204e3074183ce22176cad1b00c297156ccd9387d7b761ac9baecb3f00920f"}},{"ruleId":"D2","level":"warning","message":{"text":"_parseBlock (cognitive 21): _parseBlock has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca049a9a8498343c9f0e8907b3ae858e8dbaa80d5752a1886c330d50edaa15e"}},{"ruleId":"D2","level":"warning","message":{"text":"#onPagesEdited (cognitive 21): #onPagesEdited has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (10 pts), other 6, loops 2 (3 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":"web/pdf_find_controller.js"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a9bc87ad6aadc7e6efd6df18fda511e1354736f8f362e40c3a94d8ab252497"}},{"ruleId":"D2","level":"warning","message":{"text":"cssTransform (cognitive 21): cssTransform has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_page_view.js"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5df5653953544a093f02fa5ec7eb3bbccdbe09fa32469250614025c728d1014"}},{"ruleId":"D2","level":"warning","message":{"text":"getVisibleElements (cognitive 21): getVisibleElements has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 5 (8 pts), boolean chains 2, loops 1 (nesting depth added 7). Of this number, 20 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":"web/ui_utils.js"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"32925658cb0374f431e766d1636d6cf6baaac56e6cbeac4c9f7d744468d59a74"}},{"ruleId":"D2","level":"warning","message":{"text":"setOperatorBBoxes (cognitive 21): setOperatorBBoxes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 5 (6 pts), other 3, ternaries 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 493, 468). 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":"web/debugger.mjs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf31752a17fac0d3c7c23a8322a58b53ab054e7c1a1dd724ec2b29fb39982f39"}},{"ruleId":"D2","level":"warning","message":{"text":"#rebuildMultilineView (cognitive 21): #rebuildMultilineView has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 3 (5 pts), boolean chains 2, other 1 (nesting depth added 4). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 547, a function literal at line 524, getText, \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":"web/internal/draw_ops_view.js"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90e31826f5701202392085090edddc2e22ceb96768a60266ce9c603bd3e46db"}},{"ruleId":"D2","level":"warning","message":{"text":"#setup (cognitive 21): #setup has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, other 3, error handling 1, loops 1, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 2 of the 21 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 478, 384, 335, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/renderer_worker.js"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0d70979312ea8891a08b0f51ccd372472a4f2acbda640bb41d00e3fe68088c"}},{"ruleId":"D2","level":"warning","message":{"text":"#getOutlines (cognitive 21): #getOutlines has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (7 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 10). Of this number, 20 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":"src/display/editor/drawers/highlight.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2afbbfe76c1dd063a957a347dc87cfbb03b8a9467a2f603bf3dfbb1e1f5f24"}},{"ruleId":"D2","level":"warning","message":{"text":"createDataNode (cognitive 21): createDataNode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 1 (3 pts), boolean chains 2, match/switch 1 (2 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":"src/core/xfa/som.js"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"8467c11f43b879d6d954b5e3ebce72c10d54ff5cabcd91d9f9c997e87e628adb"}},{"ruleId":"D2","level":"warning","message":{"text":"core_utils.encodeToXmlString (cognitive 20): core_utils.encodeToXmlString has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/core_utils.js"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bb512ee3a935c1a5af31507ac153ded7101e6c589366d2b1a03ef46feefd22"}},{"ruleId":"D2","level":"warning","message":{"text":"ColorSpaceUtils.parse (cognitive 20): ColorSpaceUtils.parse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, error handling 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/colorspace_utils.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c8b13803d0d9f693bf113a0fe67cf208e04f1e57de8580c501b948a9c7303c"}},{"ruleId":"D2","level":"warning","message":{"text":"Ascii85Stream.readBlock (cognitive 20): Ascii85Stream.readBlock has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 5 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ascii_85_stream.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"af85eb2f0d94a543c3014407f2e3f03ef22ae1869af66e841355c68462bf3a4f"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.makeFilter (cognitive 20): Parser.makeFilter has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 2 (4 pts), error handling 1, 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":"src/core/parser.js"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da66bb2cd4a8c05859a51d11313858e30593ca5b79070e411369d35f5f891fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Font.checkAndRepair::readPostScriptTable (cognitive 20): Font.checkAndRepair::readPostScriptTable has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 4 other methods here (Font.checkAndRepair::readTrueTypeCollectionData, Font.checkAndRepair::sanitizeGlyph, Font.checkAndRepair::readNameTable, \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":"src/core/fonts.js"},"region":{"startLine":2452}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c591538aa2ccbc153821c9f8b9ea4896e80bacaaff9beb8451bafacf4c4f66f"}},{"ruleId":"D2","level":"warning","message":{"text":"fonts.createNameTable (cognitive 20): fonts.createNameTable has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 11, loops 7 (9 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8fd04c0ae7b7622b5310b169b41e2081bda72d1cb79a41c63c5bae8296457f"}},{"ruleId":"D2","level":"warning","message":{"text":"StructTreeRoot.getElementsForPage::walk (cognitive 20): StructTreeRoot.getElementsForPage::walk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, ternaries 1 (2 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":"src/core/struct_tree.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d373afb26ab9e387d79862d784814bb7a9976687b9ad8509096584fe3ed842"}},{"ruleId":"D2","level":"warning","message":{"text":"XRef.parse (cognitive 20): XRef.parse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 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":"src/core/xref.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b323f173bc206ee6f22e9f1e5c26f4cc74b2336615f4cda6eab8276f34deb281"}},{"ruleId":"D2","level":"warning","message":{"text":"som.parseExpression (cognitive 20): som.parseExpression has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 1 (2 pts), 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":"src/core/xfa/som.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"feec910fe7b59e76e8b8ecea2cda3cc836bc8f790879988e09851009a9875866"}},{"ruleId":"D2","level":"warning","message":{"text":"Page.getContentStream (cognitive 20): Page.getContentStream has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). Of this number, 16 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b69e267f5a9c21b36147544b8639eb8505238c9c591ff622be4d0226e97e63e"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFDocument.#collectSignatureFields (cognitive 20): PDFDocument.#collectSignatureFields has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (19 pts), 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":"src/core/document.js"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63490d5ce02ce99f09feab7ef1f026c12d029410cada5e95501cac2c8ca585a"}},{"ruleId":"D2","level":"warning","message":{"text":"Doc.getField (cognitive 20): Doc.getField has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 2, 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":"src/scripting_api/doc.js"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5f53fbb057c8e72294c414e72450a1087a537bb3c0d3f7ae2b2c1e193bccac"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFViewer._updateSpreadMode (cognitive 20): PDFViewer._updateSpreadMode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (6 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":"web/pdf_viewer.js"},"region":{"startLine":2384}}}],"partialFingerprints":{"codehealthFindingId/v1":"25aabe402b786aaf10891614f49ec92e03981016186c3f840ec6a0dbbd077902"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 20): constructor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 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":"src/core/annotation.js"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0ef214472d2fbeff6101497a2ac4c7127fda4c3b2b2c6038763f2a5412bdee"}},{"ruleId":"D2","level":"warning","message":{"text":"parse (cognitive 20): parse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_parser.js"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2078534b4aa5dd5974da3e20fae4808a8f88cb1dadca8ef6c661ebdf84d604e"}},{"ruleId":"D2","level":"warning","message":{"text":"#addEventListeners (cognitive 20): #addEventListeners has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 9, match/switch 1 (nesting depth added 4). None of this is in the body itself: all 20 points belong to 3 function literals inside it that branch (lines 1418, 1411, 1488). 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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc626490b31de404c85c0eb3225aa62c23cbee25529eec4efd03adfcea670f1"}},{"ruleId":"D2","level":"warning","message":{"text":"create (cognitive 20): create has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (7 pts), ternaries 2 (3 pts), loops 1 (2 pts) (nesting depth added 4). Most of this is not in the body itself: 7 of the 20 points are its own statements and the rest belongs to 2 function items inside it that branch (getHints, getInt). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"339ebf5711b64f5bef63b80964c0d64fe69f6afa3ada578ab79893386876b20f"}},{"ruleId":"D2","level":"warning","message":{"text":"isDestArraysEqual (cognitive 20): isDestArraysEqual has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 5). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to one function item inside it that branches (isEntryEqual). 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":"web/pdf_history.js"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"869dc3075b0808a698bc908b384e3c9c25945055ee4894327642084d452157b5"}},{"ruleId":"D2","level":"warning","message":{"text":"deleteItemAt (cognitive 20): deleteItemAt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 2 (4 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/field.js"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"713c765753ec62c321f1bc1ba1c7a5dd3ece66cfee7aff56f731aa3cabf78f49"}},{"ruleId":"D2","level":"warning","message":{"text":"#appendText (cognitive 20): #appendText has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 6, ternaries 1 (2 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/text_layer.js"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dab199a51e02f295529cab53ceb6a117bd662afc19a0c43d2dceb572471e33"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfHandler.chrome.runtime.onMessage.addListener() (cognitive 19): pdfHandler.chrome.runtime.onMessage.addListener() has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/chromium/pdfHandler.js"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61703cc3ebdc5ee8fc0e05aca4b1c93550d035213f0b69c115fca4dadeb464b"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageResizer._rescaleImageData (cognitive 19): ImageResizer._rescaleImageData has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 4 (7 pts), error handling 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image_resizer.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"345d9afe8570934359658534884758253eb0c6644c9a7fbb326be9e67999af3f"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.makeInlineImage (cognitive 19): Parser.makeInlineImage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2453716057a8ce8f111af8e01d1c7578e2e8996e26d71f6caf4f0b9022fceda"}},{"ruleId":"D2","level":"warning","message":{"text":"font_renderer.parseCmap (cognitive 19): font_renderer.parseCmap has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 3 (5 pts), ternaries 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":"src/core/font_renderer.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5c52a80436841eaf18c531c737a82311a6bde971cafda4269ab0c0370a3016"}},{"ruleId":"D2","level":"warning","message":{"text":"Font.checkAndRepair::readNameTable (cognitive 19): Font.checkAndRepair::readNameTable has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (Font.checkAndRepair::readTrueTypeCollectionData, Font.checkAndRepair::sanitizeGlyph, Font.checkAndRepair::readPostScriptTable, \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":"src/core/fonts.js"},"region":{"startLine":2518}}}],"partialFingerprints":{"codehealthFindingId/v1":"a546fb41e3cd0a87c5ba1f95a91e1e81bc7af3cb6eee5bd9846f595163ae0c03"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialEvaluator.buildToUnicode (cognitive 19): PartialEvaluator.buildToUnicode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 1 (3 pts) (nesting depth added 5). Of this number, 12 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":4091}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b6dce6fa4adf970026bb7dcc3c7136cd457015ade04512c06209e88f214eac"}},{"ruleId":"D2","level":"warning","message":{"text":"Image.[$toHTML] (cognitive 19): Image.[$toHTML] has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 1 (2 pts), match/switch 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":3408}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bf396e6d60bc5336c91ba0080be2d483dae31e9aa1ceeb7f5de0cb732ef498"}},{"ruleId":"D2","level":"warning","message":{"text":"TextWidgetAnnotation._splitLine (cognitive 19): TextWidgetAnnotation._splitLine has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":3160}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f62dbeeaf931d333c34bf4f5cb43bb10f4f82220db4403adafa268daca8eed"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFDocument.#parseSignatureDict (cognitive 19): PDFDocument.#parseSignatureDict has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 9, boolean chains 5, if/else 5. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"8613db7048426023315aedc1f0f424d7a394bb8b7b80789ef301745063ab27ed"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasGraphics.fill (cognitive 19): CanvasGraphics.fill has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":2317}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81a58409991c26682b0f33a667cbd3f41dbc59bdaad3dd72f38b2e725c8ce13"}},{"ruleId":"D2","level":"warning","message":{"text":"TextLayer.#processItems (cognitive 19): TextLayer.#processItems has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/text_layer.js"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"678b5f451c3b3579a82f7d6de2fbde68827f129f20c928e60379ad1495f23028"}},{"ruleId":"D2","level":"warning","message":{"text":"FirefoxEventBus.dispatch (cognitive 19): FirefoxEventBus.dispatch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (3 pts), boolean chains 2 (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":"web/event_utils.js"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24a1d44bc2183347291f869c0bb08fe87c16e8580dbab0725b70ce7fefbae5f"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotationElement._getElementsByName (cognitive 19): AnnotationElement._getElementsByName has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcf9dac9cd39cd075fae9eab9bfb802f75127067679c7266f714340cde8689d"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFFindController.#onFind (cognitive 19): PDFFindController.#onFind has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 4 (nesting depth added 2). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 508). 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":"web/pdf_find_controller.js"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1e93a6da814775c0aa1786e9bc3801912ab5c83945b21a9fc6037946c74ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"DrawOpDetailView.#makeImageArgPreview (cognitive 19): DrawOpDetailView.#makeImageArgPreview has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7, loops 3 (7 pts), ternaries 2 (5 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":"web/internal/draw_ops_view.js"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c5f2fdf20a7ce788c34c9716eeced02ac4870138cf9b92f60a8314c5397ce8"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 19): (computed) has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":3097}}}],"partialFingerprints":{"codehealthFindingId/v1":"301254f7982ed16a33c3686768c49563dc756c9e6c8484cdfe9b1fbfde5326f2"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 19): (computed) has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 1 (2 pts), match/switch 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":3408}}}],"partialFingerprints":{"codehealthFindingId/v1":"2957da47837f0b9a7d8fa506be5bf62d7b836f2260488ca3f55ce330710f05ab"}},{"ruleId":"D2","level":"warning","message":{"text":"putBinaryImageData (cognitive 19): putBinaryImageData has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 5 (6 pts), loops 3 (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":"src/display/canvas.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0f2e86aa4c8be85f6fc025b9989ee7c4ffcd39e9407593e3c0e506e0ee72fb"}},{"ruleId":"D2","level":"warning","message":{"text":"render (cognitive 19): render has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":3719}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6aa4e25764ea90accb613178a79a63bad488312dd95de7b30ac029daea0f1b"}},{"ruleId":"D2","level":"warning","message":{"text":"buildMozcentral (cognitive 19): buildMozcentral has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 2 (4 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 1 belongs to 23 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":"gulpfile.mjs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c355cd8f3cce1c276863505b0c03be40615267f739b8ac0282bd629a4400b6"}},{"ruleId":"D2","level":"warning","message":{"text":"#collectPageLabels (cognitive 19): #collectPageLabels has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (5 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":2368}}}],"partialFingerprints":{"codehealthFindingId/v1":"669d4bdae6022cc809c75771aefdbd1bc5a81208aa497ac8bbe296183f229c74"}},{"ruleId":"D2","level":"warning","message":{"text":"#loadXfaFonts (cognitive 19): #loadXfaFonts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 4 (5 pts), error handling 1 (nesting depth added 5). Of this number, 18 points are the body\u0027s own statements and 1 belongs 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":"src/core/document.js"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"98faf8a4889da59d13a3fa55a989ba35be855769f295477436e2677759ecef62"}},{"ruleId":"D2","level":"warning","message":{"text":"#addDragListeners (cognitive 19): #addDragListeners has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7 (nesting depth added 3). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 7 function items inside it that branch (a function literal at line 1523, a function literal at line 1571, a function literal at line 1635, \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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c89c062b788d0116749ca5652807441d917e50ecacded5fac2e4044f7464d7a"}},{"ruleId":"D2","level":"warning","message":{"text":"cancelRendering (cognitive 19): cancelRendering has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (8 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_page_view.js"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"696f5205c63cf608106a1c5c6d58e44919c1c229002527c6147447631085a03e"}},{"ruleId":"D2","level":"warning","message":{"text":"toggle (cognitive 19): toggle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, ternaries 2 (3 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, 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":"web/comment_manager.js"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f13c3c2024571b33746815ea005fb31e4abf4059d331e0181d812ee7c38f8d"}},{"ruleId":"D2","level":"warning","message":{"text":"foundImageMaskGroup (cognitive 19): foundImageMaskGroup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/operator_list.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40978ae3f5e83e3f292a65466364ede8b56debe586e24fd06cb9d867a13620f"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 19): constructor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 9). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 248, 282, 289, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/draw_layer.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"c258b2150cc2d9133b6481d733460a3a195aa9b9edad7ae9e022086cd0ba26af"}},{"ruleId":"D2","level":"warning","message":{"text":"executeOperatorList (cognitive 19): executeOperatorList has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (2 pts), error handling 1, other 1 (nesting depth added 5). 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 into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/renderer_worker_proxy.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"042855c13cc97067c75f253b2a106ce050063b8901fb346244bfd4e3a549cd4f"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 19): (anonymous) has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/chromium/pdfHandler.js"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"823245f375cee9ae0e4354e860152f0cc46b42193bb7ad0762ce13e63b2265e8"}},{"ruleId":"D2","level":"warning","message":{"text":"gulpfile.gulp.task(\u0022lint-chmod\u0022) (cognitive 18): gulpfile.gulp.task(\u0022lint-chmod\u0022) has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 3 (5 pts), loops 3 (4 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":"gulpfile.mjs"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"881f866547c95b2994fea5b9c39f962bc87692e34362212da5acba0b7394b13f"}},{"ruleId":"D2","level":"warning","message":{"text":"util._isValidExplicitDest (cognitive 18): util._isValidExplicitDest has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/util.js"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"be166c254eab964d2188d63bb96c855841295a5d16eb24dad7288c205e575205"}},{"ruleId":"D2","level":"warning","message":{"text":"core_utils._collectJS (cognitive 18): core_utils._collectJS has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/core_utils.js"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"875c5b271f8bf6bf34ad89cc252e2f61e971ad89ff3808b17607bf556ac0496c"}},{"ruleId":"D2","level":"warning","message":{"text":"colorspace.resizeRgbaImage (cognitive 18): colorspace.resizeRgbaImage has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 2, ternaries 1 (2 pts) (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":"src/core/colorspace.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70677852c2599850fe12b5569760d230f1fffcfc14e85e56fab787302c9d675"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueOptimizer._optimize (cognitive 18): QueueOptimizer._optimize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 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":"src/core/operator_list.js"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcce098f71c3b91869cfe801da6fb92a7b3d1798ba82a44e67b837bfbc7d90de"}},{"ruleId":"D2","level":"warning","message":{"text":"fonts_utils.type1FontGlyphMapping (cognitive 18): fonts_utils.type1FontGlyphMapping has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts_utils.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"16dac0ae8c9c277cc069415f00ebcef84790f58258ee8fa97620492c5a023a86"}},{"ruleId":"D2","level":"warning","message":{"text":"obj_bin_transform_core.compileFontInfo (cognitive 18): obj_bin_transform_core.compileFontInfo has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 4 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/obj_bin_transform_core.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"781e18715cb6593083d553392a931ed4f4c6d326077d2c905676c86299c76cec"}},{"ruleId":"D2","level":"warning","message":{"text":"RadialAxialShading.constructor (cognitive 18): RadialAxialShading.constructor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 3 (4 pts), boolean chains 3, ternaries 3 (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":"src/core/pattern.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4958ed9c708d7c2ff80d357a482045f5f33026a43255f7f13c68ea1dc006a12"}},{"ruleId":"D2","level":"warning","message":{"text":"pattern.buildMeshVertexData (cognitive 18): pattern.buildMeshVertexData has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 4 (6 pts) (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":"src/core/pattern.js"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"e067392f0fa3ac7afdca34455e6fa37bd8cb9fd468483a69103c2f0ad1e08d19"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialEvaluator.setGState (cognitive 18): PartialEvaluator.setGState has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), 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":"src/core/evaluator.js"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c67013fcf4f68869944a0bcbbd99af3fb2be6fb15adfa4a0be07b8430c7140"}},{"ruleId":"D2","level":"warning","message":{"text":"Catalog.destinations (cognitive 18): Catalog.destinations has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"201149e14c7b481faa06c4ddd6ce699bfd69731e44fdd56105981e88c63178ab"}},{"ruleId":"D2","level":"warning","message":{"text":"XFAObject.[_getPrototype] (cognitive 18): XFAObject.[_getPrototype] has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/xfa_object.js"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b53123574d341036e0e490c5e3623f13e92540fdb0427e0739fda447ffafc1"}},{"ruleId":"D2","level":"warning","message":{"text":"AForm.AFRange_Validate (cognitive 18): AForm.AFRange_Validate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/aform.js"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47cee183bd923966ae68a88af7fb243172fc42019ca17b0069e779e4c6cb687"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFPageView.update (cognitive 18): PDFPageView.update has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5 (nesting depth added 6). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_page_view.js"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa195e86834c777f819b27347d75b9d39e914073400d0b4a0febe0333627cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFViewer.annotationEditorMode (cognitive 18): PDFViewer.annotationEditorMode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 5 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":"web/pdf_viewer.js"},"region":{"startLine":2699}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d19d82dc61515b09c87fac06cb0f2aa51d01d2f7d7f7da9ff28b6d973f0bff"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFHistory.push (cognitive 18): PDFHistory.push has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6 (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":"web/pdf_history.js"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff130261a3b47941c78607210980e5fd0acaf64d1bff184b26d7263f7460b615"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeView.#buildChildren (cognitive 18): TreeView.#buildChildren has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/internal/tree_view.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0db3c9604a3bcca83fcf9688beaa82c793fdead2fc88816ff9a48c574999bd"}},{"ruleId":"D2","level":"warning","message":{"text":"SignatureManager.#initDrawTab (cognitive 18): SignatureManager.#initDrawTab has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4 (nesting depth added 1). 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 (drawCallback, a function literal at line 456, a function literal at line 484, \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":"web/signature_manager.js"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"800498a56587709b14f27702c553f9f2aac8104aab5abfe5543f7ca3c7c3b725"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewsManager.switchView (cognitive 18): ViewsManager.switchView has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/views_manager.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d240489016a1529da6f7c6511dcfd0910e2bd9619d6fdc5f107550ac9ac488"}},{"ruleId":"D2","level":"warning","message":{"text":"_abortOperatorList (cognitive 18): _abortOperatorList has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, error handling 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":"src/display/api.js"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f9299a03df90700318919734f598b5365f868a830d3195722959e96b0242e5"}},{"ruleId":"D2","level":"warning","message":{"text":"close (cognitive 18): close has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), error handling 2 (5 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app.js"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16b3bbc373b8283e71fe64fae1a1f49e0375f6f23a9f3a2f0da1e7e33233113"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 18): (anonymous) has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 3 (5 pts), loops 3 (4 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":"gulpfile.mjs"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"2844553d5258c6a821ab9ff2425e848d30aec8cbc50282acabc2738a2014b93a"}},{"ruleId":"D2","level":"warning","message":{"text":"#computeThumbnailsPosition (cognitive 18): #computeThumbnailsPosition has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e7fdf468b1c24e5e2833542961312a5358032a1ece8131bab2102aafd801c8"}},{"ruleId":"D2","level":"warning","message":{"text":"#convertToRegExpString (cognitive 18): #convertToRegExpString has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (14 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 2). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 694, addExtraWhitespaces, a function literal at line 750). 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":"web/pdf_find_controller.js"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5cdb4ffae7807c76f21536c38e17eccfb5f4637ec1b216be195917b217a48b"}},{"ruleId":"D2","level":"warning","message":{"text":"fetchUncompressed (cognitive 18): fetchUncompressed has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xref.js"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4be4e4654c69946de8fb5c37a0b117f1b058df9f0b5d856a2ac2c65f909476"}},{"ruleId":"D2","level":"warning","message":{"text":"#renderValue (cognitive 18): #renderValue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, 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":"web/internal/tree_view.js"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d27232c49b1d4694fd18f77786408de883e85955df36ea24dc803f8da40098e"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 18): (computed) has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/xfa_object.js"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"328e5e922e9011b76fb08798753e6c4669182d1791cf117963f5c1b7b13ec0ba"}},{"ruleId":"D2","level":"warning","message":{"text":"writeNumber (cognitive 18): writeNumber has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 2 (7 pts), if/else 3 (6 pts), loops 3 (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":"external/cmapscompress/compress.mjs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"47347f7261435a8c9f2abb8594d897e7ab804efb23592198ee2477ebbb7e29a0"}},{"ruleId":"D2","level":"warning","message":{"text":"_parseContent (cognitive 18): _parseContent has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (6 pts), loops 4 (5 pts) (nesting depth added 4). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xml_parser.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"309c4e581a472b5a102937cb6f2a2876191a802edb95f7d36492e89e6a7dab84"}},{"ruleId":"D2","level":"warning","message":{"text":"options.Promise.all().then() (cognitive 17): options.Promise.all().then() has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1 (nesting depth added 3). None of this is in the body itself: all 17 points belong to 4 function items inside it that branch (a function literal at line 65, a function literal at line 123, a function literal at line 115, \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":"extensions/chromium/options/options.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c98404355103f6db4e896f2286a0e76cfb46eb627431468f13009589a72f48"}},{"ruleId":"D2","level":"warning","message":{"text":"gulpfile.mirrorDir (cognitive 17): gulpfile.mirrorDir has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 3 (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":"gulpfile.mjs"},"region":{"startLine":1977}}}],"partialFingerprints":{"codehealthFindingId/v1":"9288103261c11f4dc630512a5350468892b0afddfe8aeb98940e784abfabdc16"}},{"ruleId":"D2","level":"warning","message":{"text":"OperatorList._transfers (cognitive 17): OperatorList._transfers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 2, match/switch 1 (2 pts), 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":"src/core/operator_list.js"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b28446e1d9eaabac6b7ce18d05fcecec2e05cdee11134db230035d62d3da62"}},{"ruleId":"D2","level":"warning","message":{"text":"FlateStream.generateHuffmanTable (cognitive 17): FlateStream.generateHuffmanTable has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 2 (5 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":"src/core/flate_stream.js"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e42f1b92c194cc3cf6f9c12ea9564c8c42212ba7c18d73fe9b4bd9646cb6fa"}},{"ruleId":"D2","level":"warning","message":{"text":"AESBaseCipher._decryptBlock2 (cognitive 17): AESBaseCipher._decryptBlock2 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/crypto.js"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"30acdf382f2dd52103958521469dbfc19247f5ca44ea809f9267dae3895a75fe"}},{"ruleId":"D2","level":"warning","message":{"text":"CipherTransformFactory.#prepareKeyData (cognitive 17): CipherTransformFactory.#prepareKeyData has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 5, boolean chains 1, ternaries 1 (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":"src/core/crypto.js"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a850ede75e63546343aeca5deadd2a35f1fd7fa99fbf3a10d57825f87976aa"}},{"ruleId":"D2","level":"warning","message":{"text":"cmap.parseBfRange (cognitive 17): cmap.parseBfRange has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 2 (4 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cmap.js"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8efe61b4c959d5c6da6a65d69a503d6ab4f8a6460377cd27b4cb0e340c4ad61"}},{"ruleId":"D2","level":"warning","message":{"text":"CFFCompiler.compile (cognitive 17): CFFCompiler.compile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_parser.js"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcf2983527e41016cd23073db07a9c7245614a168aafcf51b149f6b712bea53"}},{"ruleId":"D2","level":"warning","message":{"text":"Font.spaceWidth (cognitive 17): Font.spaceWidth has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":3597}}}],"partialFingerprints":{"codehealthFindingId/v1":"5626960aaa97f321d2e2d263cfccaae7ca7fad8eaffaf870a77e723609139f87"}},{"ruleId":"D2","level":"warning","message":{"text":"fonts.getRanges (cognitive 17): fonts.getRanges has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"92581186828361683c48f3dae4c37716f4e78d9f6884f2b6c82f3f4138c42ded"}},{"ruleId":"D2","level":"warning","message":{"text":"MurmurHash3_64.update (cognitive 17): MurmurHash3_64.update has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (3 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/murmurhash3.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f5fef4dcd803e6695801dc6f36fe6d0254795f36677de5b77c86ad766b8aee"}},{"ruleId":"D2","level":"warning","message":{"text":"sound.soundStreamToWav (cognitive 17): sound.soundStreamToWav has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/sound.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f5bf01c5c850501bb14aa72d4f5cd0f2755947fa2fa2bc922cb9c549bd1c40"}},{"ruleId":"D2","level":"warning","message":{"text":"StructElementNode.#collectAttributes (cognitive 17): StructElementNode.#collectAttributes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52a540c90a5de06e39dc71feb75222386a7ebc45808837dfe00bb975603ff4a"}},{"ruleId":"D2","level":"warning","message":{"text":"StructTreePage.#collectFormStructParents (cognitive 17): StructTreePage.#collectFormStructParents has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2ef02b43bf8f8432e76314830e6e9d04329960128f8acd8dba3107061103e6"}},{"ruleId":"D2","level":"warning","message":{"text":"TextMeasure.compute (cognitive 17): TextMeasure.compute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 1 (2 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":"src/core/xfa/text.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5fbf4329cd483f907943ce3740d6083eca28c1ba7876baba7a023906c91884"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFEditor.#findDuplicateNamedDestinations (cognitive 17): PDFEditor.#findDuplicateNamedDestinations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts) (nesting depth added 8). Of this number, 13 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"78610b3f7a379c6f257f0e0c0c5546a585a576a0a0c1625ed513603636252d87"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFEditor.#modalPageSize (cognitive 17): PDFEditor.#modalPageSize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":2602}}}],"partialFingerprints":{"codehealthFindingId/v1":"913ea1e36cbc89a2e2b7ed81ca48ba7be0574ce187a5eced64d9749c39fca1de"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFEditor.#makeNameNumTree (cognitive 17): PDFEditor.#makeNameNumTree has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (5 pts), ternaries 4 (5 pts) (nesting depth added 7). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":2774}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b0658519232b283173d47dd2a31887cc0db0610f8eefdfbdc0b2678a490e02"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFEditor.#collectEmbeddedFiles (cognitive 17): PDFEditor.#collectEmbeddedFiles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":2840}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aacabeab68072163862c15292131b9eb1e2afb09c079986c35ed5da444f3ffe"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.getString (cognitive 17): Lexer.getString has cognitive complexity 17 (threshold 15). Drivers by points: if/else 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":"src/core/xfa/formcalc_lexer.js"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccc525326716005b46285fc302fc3ddd3b4b167f5e49169f6e6de9059e38f8e"}},{"ruleId":"D2","level":"warning","message":{"text":"HighlightOutliner.constructor (cognitive 17): HighlightOutliner.constructor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, loops 2, ternaries 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/drawers/highlight.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1bfb06df8bc01c691a648a90b5a061f60b734c5c2132c3c0fe4624de59b2d2"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyboardManager.constructor (cognitive 17): KeyboardManager.constructor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/tools.js"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fd6ce33e36227df7c598f3573f3dcfb32ca1c30d1637d085d6ebca15474d9f"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasDependencyTracker.recordCharacterBBox (cognitive 17): CanvasDependencyTracker.recordCharacterBBox has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas_dependency_tracker.js"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"475b2e5f719f23377dc90229e3cac96e0da9c2a576ca64a5053a00a1ae1431c8"}},{"ruleId":"D2","level":"warning","message":{"text":"OptionalContentConfig.constructor (cognitive 17): OptionalContentConfig.constructor has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 5 (7 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/optional_content_config.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5736a063d2c7869b68decd6dde0c4db1ff018e37d22d0c5be3ce077a5375695a"}},{"ruleId":"D2","level":"warning","message":{"text":"InternalRenderTask._next (cognitive 17): InternalRenderTask._next has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api.js"},"region":{"startLine":3549}}}],"partialFingerprints":{"codehealthFindingId/v1":"371575744404cf5c64a80716d43b19d0cc6826a109338b3fc6f03f98ee061d08"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFThumbnailViewer.#mergeFiles (cognitive 17): PDFThumbnailViewer.#mergeFiles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 1 (3 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 6). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"062a85a43ee583df99a8a936120d59f9a1697ee5665fc081855d0e0e1de876d3"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFThumbnailViewer.scrollThumbnailIntoView (cognitive 17): PDFThumbnailViewer.scrollThumbnailIntoView has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa12dacf809b74995faaca01023e9d5ec28ed953ba36e42326f53471f9cadfb"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasContextDetailsView.wrapContext (cognitive 17): CanvasContextDetailsView.wrapContext has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 4). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 130, 144, 122). 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":"web/internal/canvas_context_details_view.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78f9332d736d0994628460b3f38c8ca2134b6a307767b40c1f86b94ddcb99dd"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeView.#formatBytes (cognitive 17): TreeView.#formatBytes has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), boolean chains 4, if/else 3 (4 pts) (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item 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":"web/internal/tree_view.js"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"3301d6b9dd37d6e8e418d259266b3457a72fb672dae07c2b1591f5865a2485af"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFPresentationMode.#touchSwipe (cognitive 17): PDFPresentationMode.#touchSwipe has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_presentation_mode.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"680c9b9220f5c296aaa16d86336e9692a17a842027f2fd4fbd11d97d603baa27"}},{"ruleId":"D2","level":"warning","message":{"text":"_create (cognitive 17): _create has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (4 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf70a2ecb6bf46b91abbc1c8d49684729bfc9374a38fd43c60a004d379ffb124"}},{"ruleId":"D2","level":"warning","message":{"text":"#findClipAsset (cognitive 17): #findClipAsset has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 3 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":5880}}}],"partialFingerprints":{"codehealthFindingId/v1":"29994032d0927a7dd2c5c2ff5f63714bc4e9071c0f10840455bee919642beb22"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 17): (computed) has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 3 (7 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":3917}}}],"partialFingerprints":{"codehealthFindingId/v1":"87636d270d1d45c7afacdb87bae6e7f21154a638c2f8e11af98ff38fbc4139a1"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 17): (computed) has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 2, other 1 (nesting depth added 4). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":4175}}}],"partialFingerprints":{"codehealthFindingId/v1":"8737b215db3dc88e1b8f313a3bbb88afa798bbc8009779d4e09d54e9061ffb88"}},{"ruleId":"D2","level":"warning","message":{"text":"_bakeSMaskCanvas (cognitive 17): _bakeSMaskCanvas has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 2 (6 pts), boolean chains 2, other 1 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"c297644d58531470bf429c0d67068cb1eba772e7f15b9f3de55e87ac7b96a1e9"}},{"ruleId":"D2","level":"warning","message":{"text":"render (cognitive 17): render has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e220876bd8f77a47537a32121cda7a8214a88de309e4781d6a15c67b1dfffb"}},{"ruleId":"D2","level":"warning","message":{"text":"initialize (cognitive 17): initialize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, error handling 1, match/switch 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":"web/app.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bc1094ec61ea44e44f44e76db1e90c9c08f0757e3a811528c78ff57037a0b8"}},{"ruleId":"D2","level":"warning","message":{"text":"getAnnotationsData (cognitive 17): getAnnotationsData has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 6, error handling 1 (3 pts), 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":"src/core/document.js"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5006523c37796763ae9cf4ba0da685f5c1ce323e25a46be8c38bba0e5130c49"}},{"ruleId":"D2","level":"warning","message":{"text":"#nextMatch (cognitive 17): #nextMatch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_find_controller.js"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b93a4ffe6ce19fcddab081f99b19dbd76a23c637aabeab54bb47cd563fe45ac"}},{"ruleId":"D2","level":"warning","message":{"text":"#renderCanvas (cognitive 17): #renderCanvas has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 1, error handling 1, other 1, 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, 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":"web/internal/page_view.js"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"6278ae1c4b64c694bd214ce507a69d012ec46698347bdcba3f046295e40d4ad1"}},{"ruleId":"D2","level":"warning","message":{"text":"approximateFraction (cognitive 17): approximateFraction has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 3 (5 pts), 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":"web/ui_utils.js"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"d602ce595906475be57ce3e328fbff991f52792dc0cad06849984f40e70b0455"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 17): (anonymous) has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1 (nesting depth added 3). None of this is in the body itself: all 17 points belong to 7 function items inside it that branch (a function literal at line 65, a function literal at line 123, a function literal at line 115, \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":"extensions/chromium/options/options.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6db8ca2e93388d98e190a4da549b0c490151f98b8c6f1ab7d7db8711f5a9a39"}},{"ruleId":"D2","level":"warning","message":{"text":"#setupResizer (cognitive 17): #setupResizer has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (7 pts), boolean chains 6, if/else 4 (nesting depth added 2). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 183, a function literal at line 132, (anonymous)::cancelDrag, \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":"web/internal/split_view.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f408c998467b8e04508ab444541d09945d5d6305bfa4a3b53308fa431a8e1ba6"}},{"ruleId":"D2","level":"warning","message":{"text":"contentscript.watchObjectOrEmbed (cognitive 16): contentscript.watchObjectOrEmbed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, ternaries 1 (nesting depth added 1). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"extensions/chromium/contentscript.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01ef4c1bcb9a5d8218dfd087f8a1e9457335702895d559b446fbb4a574bd0dc"}},{"ruleId":"D2","level":"warning","message":{"text":"util.createValidAbsoluteUrl (cognitive 16): util.createValidAbsoluteUrl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 1 (3 pts), boolean chains 2, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/util.js"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d7853026c21695e68ae2517ae6bd57cbd46578fef1385df62c61cc9f2523c6"}},{"ruleId":"D2","level":"warning","message":{"text":"AlternateCS.getRgbBuffer (cognitive 16): AlternateCS.getRgbBuffer has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (6 pts), if/else 4 (5 pts), boolean chains 3, ternaries 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/colorspace.js"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b87815416663d6860cc513d64d14266956c15d35f2633f2b5b86ac9d0515de"}},{"ruleId":"D2","level":"warning","message":{"text":"AsciiHexStream.readBlock (cognitive 16): AsciiHexStream.readBlock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ascii_hex_stream.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb8d6e9d1c7557bd585f5bb363f8165c03b62d2d4ff5501c7c6436785e9252b"}},{"ruleId":"D2","level":"warning","message":{"text":"JBig2CCITTFaxImage.decode (cognitive 16): JBig2CCITTFaxImage.decode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 4 (8 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/jbig2_ccittFax.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce69b692b96856ef749a294702827d061f83bacb03ceb3dae18f4a399acd5bb4"}},{"ruleId":"D2","level":"warning","message":{"text":"CipherTransformFactory.createCipherTransform (cognitive 16): CipherTransformFactory.createCipherTransform has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3 (nesting depth added 6). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (resolveCipher). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/crypto.js"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec566494b07b7c09eb4a83a55b395514a3d36992ccaafca31c877299e270a794"}},{"ruleId":"D2","level":"warning","message":{"text":"CFFParser.parseFDSelect (cognitive 16): CFFParser.parseFDSelect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (7 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":"src/core/cff_parser.js"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd5d318d11974824670a78d29e87282bac4ad2d5435bc19343589bc56417542"}},{"ruleId":"D2","level":"warning","message":{"text":"CFFCompiler.compileCharset (cognitive 16): CFFCompiler.compileCharset has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (14 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":"src/core/cff_parser.js"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfe73618522870936b7c2579fba6881578c5e87205e483a6a6b141fbc7dccd0"}},{"ruleId":"D2","level":"warning","message":{"text":"MeshShading._decodeType6Shading (cognitive 16): MeshShading._decodeType6Shading has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 2 (6 pts), loops 3 (5 pts), if/else 1 (2 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MeshShading._decodeType7Shading) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pattern.js"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a05678c1365156836a9a22db30b05eb9d2becec2112923241403ea1946312e"}},{"ruleId":"D2","level":"warning","message":{"text":"MeshShading._decodeType7Shading (cognitive 16): MeshShading._decodeType7Shading has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 2 (6 pts), loops 3 (5 pts), if/else 1 (2 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (MeshShading._decodeType6Shading) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pattern.js"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b704d1f1a512f548dc5400408562afeaaac2dca9952ea01ff3929e571ac6ff4"}},{"ruleId":"D2","level":"warning","message":{"text":"MeshShading._buildFigureFromPatch (cognitive 16): MeshShading._buildFigureFromPatch has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), boolean chains 3, if/else 1 (3 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pattern.js"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"a262ff1e1ff376c07ed6eb9e9be536a170e0bfc32a99f15f56268af2dce9a8af"}},{"ruleId":"D2","level":"warning","message":{"text":"TranslatedFont.#removeType3ColorOperators (cognitive 16): TranslatedFont.#removeType3ColorOperators has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 3, if/else 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":5122}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c13968d2ea065ab196a431fe2a16a0caa740bb7aa2ca071d5cc04a7f56dfc5"}},{"ruleId":"D2","level":"warning","message":{"text":"StructElementNode.parseKid (cognitive 16): StructElementNode.parseKid has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 3 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"736fbf34618cd105223e0af5e41689ac7db2c0e64679367720c712025466afbd"}},{"ruleId":"D2","level":"warning","message":{"text":"StructTreePage.#parseWithoutParentTree (cognitive 16): StructTreePage.#parseWithoutParentTree has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 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":"src/core/struct_tree.js"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c727fa33e80d9e9f68aaa07f6055a68eabaca5e6e43785d4b292f016053bdcc7"}},{"ruleId":"D2","level":"warning","message":{"text":"Catalog.#readOptionalContentGroup (cognitive 16): Catalog.#readOptionalContentGroup has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 2 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a06427f445afa25265378095f6dadca16637c1680988c76a591f92394a92e61"}},{"ruleId":"D2","level":"warning","message":{"text":"TextMeasure.addString (cognitive 16): TextMeasure.addString has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), boolean chains 4, if/else 2, ternaries 1 (2 pts) (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":"src/core/xfa/text.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"0378d2630237095a3a3c5033fea0945ae201aa92b5b1846384f21da671abd1c5"}},{"ruleId":"D2","level":"warning","message":{"text":"XmlObject.[$toString] (cognitive 16): XmlObject.[$toString] has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 2 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/xfa_object.js"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"d129af74eda5558d1d5eb465cc41d31114ccb0aeaf56bd2199c50fee0b972746"}},{"ruleId":"D2","level":"warning","message":{"text":"ChoiceList.[$toHTML] (cognitive 16): ChoiceList.[$toHTML] has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea276d3ac10e06bc492aed789eabaec70f1b231864e7a51bb344f175966e527"}},{"ruleId":"D2","level":"warning","message":{"text":"Draw.[$toHTML] (cognitive 16): Draw.[$toHTML] has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"142fa10ce558f68997f21c194540205271ea25afc573c97e751afed952b619a4"}},{"ruleId":"D2","level":"warning","message":{"text":"PageSet.[$getNextPage] (cognitive 16): PageSet.[$getNextPage] has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 2 (nesting depth added 4). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":4175}}}],"partialFingerprints":{"codehealthFindingId/v1":"00968b63f5b1ba5c6cf7d7c1f2a19534e6e862d31ebc47794022602760fb25f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Binder._findDataByNameToConsume (cognitive 16): Binder._findDataByNameToConsume has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), boolean chains 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":"src/core/xfa/bind.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8169f5e344b3adc0fdc811cd285c7599d876488568d05688e449a0e1cd38dc20"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotationBorderStyle.setDashArray (cognitive 16): AnnotationBorderStyle.setDashArray has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c1bcc2595b24a2528bdd239b6e5c6638022f8486152da8bd81ecd2a90fef96"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetAnnotation._getSaveFieldResources (cognitive 16): WidgetAnnotation._getSaveFieldResources has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, 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":"src/core/annotation.js"},"region":{"startLine":2873}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f8660cbe135f49d8ef6689ab92512680b4d27fc9b418e4c4dd9710c7b3041e"}},{"ruleId":"D2","level":"warning","message":{"text":"ButtonWidgetAnnotation._processCheckBox (cognitive 16): ButtonWidgetAnnotation._processCheckBox has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 3, boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":3740}}}],"partialFingerprints":{"codehealthFindingId/v1":"8185255f85545e29810b75bcb8c4d5b8ed72fc6f5bd60ca3d0450b3493c87d6e"}},{"ruleId":"D2","level":"warning","message":{"text":"FreeTextAnnotation.createNewAppearanceStream (cognitive 16): FreeTextAnnotation.createNewAppearanceStream has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 3 (4 pts), boolean chains 2, match/switch 1, ternaries 1 (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":"src/core/annotation.js"},"region":{"startLine":4504}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c67ca12a2b3ea7d17ad88a6b536d9bf43f3a35075d6a040155817471c1bc11"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFDocument.#getLinearizationPage (cognitive 16): PDFDocument.#getLinearizationPage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eda9c60d213bc229af3b3d5f12d43ac141c22c538de5bbb299c2a9b016002e2"}},{"ruleId":"D2","level":"warning","message":{"text":"print_appearances.filterContentStream (cognitive 16): print_appearances.filterContentStream has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (3 pts), loops 2, boolean chains 1, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/print_appearances.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2be7b50b81b07a7b808ef09962d4423fa0242dd304695d5bcb66d44755b5cb"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFPageProxy.render::complete (cognitive 16): PDFPageProxy.render::complete has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api.js"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acebf0806607139fc5751dac8cc7bb2548bdddb840f2c1b067426c6a9894fb8"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFLinkService.goToDestination (cognitive 16): PDFLinkService.goToDestination has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 3). 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, 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":"web/pdf_link_service.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ad3d561b6fbda0d26bd58219a249ddd9f8c4ed5291a6f9f55ce4406afddaeb"}},{"ruleId":"D2","level":"warning","message":{"text":"RadioButtonWidgetAnnotationElement.render (cognitive 16): RadioButtonWidgetAnnotationElement.render has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 4). Of this number, 8 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad63057b8e9ba70813d7211f64807ade8d96e94b4a5324f2343f6d6cc8ddf6e"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotationLayerBuilder.#checkInferredLinks (cognitive 16): AnnotationLayerBuilder.#checkInferredLinks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 5 (6 pts) (nesting depth added 6). None of this is in the body itself: all 16 points belong to 4 function items inside it that branch (a function literal at line 347, intersectAnnotations, annotationRects, \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":"web/annotation_layer_builder.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0c4b7ff056e8bcb5812b49076e6419c597fdd52c311dfed1dbdfd0598d1225"}},{"ruleId":"D2","level":"warning","message":{"text":"AltTextManager.#setPosition (cognitive 16): AltTextManager.#setPosition has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (16 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":"web/alt_text_manager.js"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94f88a0b43d3ed45f8e8a2c9291cfc48c3bf81a62d421ccd906b0b5198540c0"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFDocumentProperties.#parsePageSize (cognitive 16): PDFDocumentProperties.#parsePageSize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, ternaries 4 (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":"web/pdf_document_properties.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"9394effe3c45fbc77673c27a089dabce206630c8661189836cf025588741891e"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 16): (computed) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"396ba512290fa6ffba172f93a3e9bb9495272a423c457f225d1517fcfabe5051"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 16): (computed) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0da4a1d0fd75a0bd069a1bc59a90ddd2d461e90eaa9c913eb4eed47c3e83a8"}},{"ruleId":"D2","level":"warning","message":{"text":"_prepareSMaskCanvas (cognitive 16): _prepareSMaskCanvas has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 5, if/else 5, ternaries 4, other 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":"src/display/canvas.js"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf781938d27b58e007fdf6605fce600d2e1dcc03693d9d456bf707537e6a100"}},{"ruleId":"D2","level":"warning","message":{"text":"_initializeMetadata (cognitive 16): _initializeMetadata has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app.js"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"71dd3d6ba5a3f098328e7842789ea16879809a3e1bdbf3e374817b84f3f837c2"}},{"ruleId":"D2","level":"warning","message":{"text":"bindWindowEvents (cognitive 16): bindWindowEvents has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 7. Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 10 function items inside it that branch (scroll, scrollend, addWindowResolutionChange, \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":"web/app.js"},"region":{"startLine":2574}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a578886dbdf691767ec206531d6e00bf1c6312c5e5e416f13f2c54f53efebb"}},{"ruleId":"D2","level":"warning","message":{"text":"exec (cognitive 16): exec has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 4, boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/tools.js"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"519e6f1ff2415c4030f73ae270d5cba6d8a185a6af607c50895b8fc06e44ee38"}},{"ruleId":"D2","level":"warning","message":{"text":"#extractText (cognitive 16): #extractText has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 8). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 893). 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":"web/pdf_find_controller.js"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafabfec8a5e8793636ee4decddf8fc12c21f3ba9fb138672f4e2862836afab5"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 16): constructor has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), if/else 3 (5 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pattern.js"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf9e274df0a0a93ad2e6c610d57e8d1e01936171cc3b1401ed87460da708c5b"}},{"ruleId":"D2","level":"warning","message":{"text":"mathML (cognitive 16): mathML has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 4, ternaries 1 (3 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a8bf69422d41b0c12aeae15eaac7777b6a4a109637eab29e9aae9d5cad1780"}},{"ruleId":"D2","level":"warning","message":{"text":"parseWhile (cognitive 16): parseWhile has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 4, boolean chains 2 (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":"src/core/xfa/formcalc_parser.js"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec36b5f7d8c94087eb32f87e57c18bd73a3f29f43396684c568a4a531403376"}},{"ruleId":"D2","level":"warning","message":{"text":"parseFor (cognitive 16): parseFor has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 5, boolean chains 3 (nesting depth added 4). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/formcalc_parser.js"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe59f44a73b49e55aaae22477b244d7ae3493040fc43f84d716e98f22c911e1"}},{"ruleId":"D2","level":"warning","message":{"text":"#setupEventListeners (cognitive 16): #setupEventListeners has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 4, other 3. Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 14 function items inside it that branch (a function literal at line 571, a function literal at line 468, a function literal at line 536, \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":"web/internal/page_view.js"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"02eaadb329b188582a4bb1b52085c1dec65e300dfd85d23c255556efdd29c14c"}},{"ruleId":"D2","level":"warning","message":{"text":"(computed) (cognitive 16): (computed) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 2 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/xfa_object.js"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb07e99915917f8a25505dbe9ae563dedf9ead84ab0d6220260405f22a13b2b"}},{"ruleId":"D2","level":"warning","message":{"text":"deserialize (cognitive 16): deserialize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), other 2, match/switch 1 (nesting depth added 7). Of this number, 14 points are the body\u0027s own statements and 2 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":"src/display/editor/drawers/inkdraw.js"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1098f9568fb7128fe457b72f2908a2febdfddd3433cc3be777c9e4f88f7607"}},{"ruleId":"D2","level":"warning","message":{"text":"processDrawnLines (cognitive 16): processDrawnLines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 4 (6 pts), loops 2 (3 pts), other 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/drawers/signaturedraw.js"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"8027669140fdf5cfa432179f7811c2f7774a19f78e2e61d09caa3e0e5483978a"}},{"ruleId":"D2","level":"warning","message":{"text":"editAltText (cognitive 16): editAltText has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, error handling 1, other 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/new_alt_text_manager.js"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1b97f559e8ac77538e791812c2134c1c8379c7c3fdac6c33616ae78f3a3f8b"}},{"ruleId":"D2","level":"warning","message":{"text":"AFNumber_Format (cognitive 16): AFNumber_Format has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 6, 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":"src/scripting_api/aform.js"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9673abaa8b03f597425c5a7274205a9870117f15c3d8bed8b96221683fdc6863"}},{"ruleId":"D2","level":"warning","message":{"text":"babelPluginPDFJSPreprocessor::MemberExpression (cognitive 16): babelPluginPDFJSPreprocessor::MemberExpression has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2 (3 pts), other 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":"external/builder/babel-plugin-pdfjs-preprocessor.mjs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd807fc6fa124832461f4024dbf935b3825ccb4ca12f142b660aa2bdebe5e63d"}},{"ruleId":"D2","level":"warning","message":{"text":"createEvent (cognitive 16): createEvent has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 14, other 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/event.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"726c753958c07d81a33a95750173d5e57223e6e874426bf3890ffb891de14929"}},{"ruleId":"D2","level":"warning","message":{"text":"_drawCanvas (cognitive 16): _drawCanvas has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 1, error handling 1 (nesting depth added 4). Of this number, 12 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":"web/base_pdf_page_view.js"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f620e21b58f46475418f37ac37e8ddd7ba2ceb838a22b8b1ec74e2325a605095"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 16): (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, boolean chains 4, error handling 1 (2 pts), ternaries 1 (2 pts), other 1 (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":"web/internal/debugger.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f20603028e7235c79fa79613b4854e1d3c061446ebd86d267e7ba310e4c03d"}},{"ruleId":"D2","level":"warning","message":{"text":"generate (cognitive 16): generate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5, ternaries 5, boolean chains 3, error handling 1, loops 1, other 1. Of this number, 13 points are the body\u0027s own statements and 3 belong to 5 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/hellbox.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"680026433447ac5a2bd8a8b08718e751de88a0bca001f711c3f827f17405c226"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: glyphlist.getGlyphsUnicode: FunctionTooLong \u2014 getGlyphsUnicode runs 4329 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4229 over it, 43.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":"src/core/glyphlist.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd5a3fa182711334e1a2e03c090f1586c93ddff613e2b41443d444564ace3f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: metrics.getMetrics: FunctionTooLong \u2014 getMetrics runs 2927 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2827 over it, 29.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":"src/core/metrics.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b5c9cfa6646d3defe3e7c05c649c02498e58cb11293db0d97c14620ac2ff4e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Font.checkAndRepair: MethodTooLong \u2014 checkAndRepair runs 1218 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1118 over it, 12.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":"src/core/fonts.js"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"304d3512db13ab9896bdb9afdd2901d6bfece35a51f5d0252505ee6c1eae1103"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PartialEvaluator.getTextContent: MethodTooLong \u2014 getTextContent runs 933 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 833 over it, 9.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e338c657826413d040e18d4060c28b2be5f4ee3371f0eb2a4385cca11adf84"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: xfa/template.js: FileTooLong \u2014 4611 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 4111 over it, 9.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f119f2052d0e606f289d5d8c5bb19cdbc0b72c572530d9400951102412be7d4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/glyphlist.js: FileTooLong \u2014 4535 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 95% of them inside a single declaration: getGlyphsUnicode (18-4349). The bar is 1500 significant lines; this is 3035 over it, 3.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/glyphlist.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"294fe98b0791b3c224be131bebd6e3394dddcd4a2928267686d47ebc2fd27862"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PartialEvaluator: ClassTooLong \u2014 3196 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 2796 over it, 7.99\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"370e827a7546f4738e23ecb1c15a1273e229aa233668000b33fd99a3cecbbabf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/evaluator.js: FileTooLong \u2014 3786 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 84% of them inside a single declaration: PartialEvaluator (227-4987). The bar is 500 significant lines; this is 3286 over it, 7.57\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7ec61c6429372e7d6e318ca3e64b5601b24b5bbf4d009089ad8cc0213eb58f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/annotation.js: FileTooLong \u2014 3713 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 3213 over it, 7.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8779caa85ea04cfc70d351af4e0ef1e2ecbd2a649a7391d6d34bc20b2b49d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkerMessageHandler.createDocumentHandler: MethodTooLong \u2014 createDocumentHandler runs 652 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 552 over it, 6.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":"src/core/worker.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"cade0860c359a14792e50adf702ad20b8e0196a89b7559072c593ba22ec8918d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CanvasGraphics: ClassTooLong \u2014 2593 significant lines (blank, comment-only and punctuation-only lines excluded), 113 methods. The bar is 400 significant lines; this is 2193 over it, 6.48\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"633e158d1e083e4d30d95bfe79fc0ed4f57c37a26fc1e334ccd4e608e61c54eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/metrics.js: FileTooLong \u2014 3000 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 98% of them inside a single declaration: getMetrics (21-2968). The bar is 1500 significant lines; this is 1500 over it, 2.00\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/metrics.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3b649c9b3848bb613d4f9248caae6ca7db3ee31099e69484773d0c1d72f446"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: display/canvas.js: FileTooLong \u2014 2922 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 89% of them inside a single declaration: CanvasGraphics (555-4556). The bar is 500 significant lines; this is 2422 over it, 5.84\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c5aae69006c003312910b2bb2b399f967b62d50302298041649823950e7a17"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: display/annotation_layer.js: FileTooLong \u2014 2769 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 2269 over it, 5.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c07fc0f1805fd4145cf50e90595ee79cb02dad73170dee1d1d448207d29b54d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PartialEvaluator.getOperatorList: MethodTooLong \u2014 getOperatorList runs 547 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 447 over it, 5.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35d076087f7fe88bfbc1d3bcbfaf3da067a804ce7fb83e4b45680d8cc63700e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/fonts.js: FileTooLong \u2014 2575 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 72% of them inside a single declaration: Font (1058-3899). The bar is 500 significant lines; this is 2075 over it, 5.15\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"525b61603f34e9323d7cd0452ba079c8b1c462bdb2cd1613332b2c090137e441"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PDFEditor: ClassTooLong \u2014 1929 significant lines (blank, comment-only and punctuation-only lines excluded), 56 methods. The bar is 400 significant lines; this is 1529 over it, 4.82\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7a6054f22814e128726b8c4348b4aeafaf10377e0ae4d6e252d7791904c71b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./gulpfile.mjs: FileTooLong \u2014 2395 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 1895 over it, 4.79\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":"gulpfile.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20291490f376b6aada3d2572a77bb2fe0ec0e6a6ca48ad147594370f28289cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/app.js: FileTooLong \u2014 2337 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 74% of them inside a single declaration: PDFViewerApplication (115-2851). The bar is 500 significant lines; this is 1837 over it, 4.67\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":"web/app.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dead2e6996d7514a8295d93ace1d2ebc3a593d653cc51fe58c33927af50d69db"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConfigNamespace: TooManyMethods \u2014 140 methods. The bar is 30 methods; this is 110 over it, 4.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/config.js"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae352c4cc9a34851dac0ea72275697d9c73c37ac15302e68004b79c48e4c028"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Font: ClassTooLong \u2014 1844 significant lines (blank, comment-only and punctuation-only lines excluded), 13 methods. The bar is 400 significant lines; this is 1444 over it, 4.61\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"71071594cd75709e6d3e68378e3506001374db8b405f59fde9b65d69c1bfeac1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AnnotationEditor: TooManyMethods \u2014 128 methods. The bar is 30 methods; this is 98 over it, 4.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/editor.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9be1260890d3a040b70f86ff8bfc54765dbc53029b2b4dc3002532171b2208"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AnnotationEditorUIManager: TooManyMethods \u2014 124 methods. The bar is 30 methods; this is 94 over it, 4.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":"src/display/editor/tools.js"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0df9610f55ee4c6404c29b544d779fd6742353af663cb0fbb8f272aa5a92b4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/pdf_editor.js: FileTooLong \u2014 2024 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 95% of them inside a single declaration: PDFEditor (139-3195). The bar is 1500 significant lines; this is 524 over it, 1.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c964275ba9e1146808592bcd82743be775c2c16b2097988c0e77d509edb97079"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TemplateNamespace: TooManyMethods \u2014 114 methods. The bar is 30 methods; this is 84 over it, 3.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":6120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbe5b0e7ecdd1df3c3a041a20c4bd0db21d3d6b01ad4af9eea8a2071217c74e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PDFViewer: ClassTooLong \u2014 1518 significant lines (blank, comment-only and punctuation-only lines excluded), 51 methods. The bar is 400 significant lines; this is 1118 over it, 3.80\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":"web/pdf_viewer.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"47122c753e7453b524fa72ba0301c62bf7cd682c51cfaabcd16c78fcb32515d8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CanvasGraphics: TooManyMethods \u2014 113 methods. The bar is 30 methods; this is 83 over it, 3.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"0332b9bb7e899078b1a977bad67dca73d00ecb58dfd0262aa12d7eb43012049d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Doc: TooManyMethods \u2014 108 methods. The bar is 30 methods; this is 78 over it, 3.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07a3642ec1d6ef9471e303964e064f6fb1501371f47d4c8e4f5cd6a122d6e1f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AnnotationEditor: ClassTooLong \u2014 1399 significant lines (blank, comment-only and punctuation-only lines excluded), 128 methods. The bar is 400 significant lines; this is 999 over it, 3.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/editor.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1419370df936cfb44d5a842ed7442c3319c726a688fa09a1fb7289760bd1a573"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: display/api.js: FileTooLong \u2014 1720 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 1220 over it, 3.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":"src/display/api.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c372b2ce2094a7ff653b804831f51b47b9a3763053205200a37af277b2663de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/tools.js: FileTooLong \u2014 1708 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 78% of them inside a single declaration: AnnotationEditorUIManager (724-3060). The bar is 500 significant lines; this is 1208 over it, 3.42\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/tools.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4c0c408ea28d084e6e913737c536f483d3e5985476a295f4b9ea42342b659b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AnnotationEditorUIManager: ClassTooLong \u2014 1339 significant lines (blank, comment-only and punctuation-only lines excluded), 124 methods. The bar is 400 significant lines; this is 939 over it, 3.35\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/tools.js"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"091ff752cbbeb1c963f26196aeb4b62c697ac3cebc3538c6d54e2c5864b9e770"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: font_renderer.compileCharString: FunctionTooLong \u2014 compileCharString runs 330 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 230 over it, 3.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":"src/core/font_renderer.js"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"33108f5313f5c9ff7bc67a64f307d8c37a6b962c2c5b2e07ca937a6fbada24b3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PDFThumbnailViewer: ClassTooLong \u2014 1298 significant lines (blank, comment-only and punctuation-only lines excluded), 52 methods. The bar is 400 significant lines; this is 898 over it, 3.25\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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"196fba45655f4bcd91f7a3c7176da7d8a85d8fdb561aa7e723e462837660dad2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/pdf_viewer.js: FileTooLong \u2014 1607 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 94% of them inside a single declaration: PDFViewer (231-2803). The bar is 1500 significant lines; this is 107 over it, 1.07\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":"web/pdf_viewer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"174f1cfbc396de14056f54340a2eeb6e3bc37ccb3913f3053e69d6b98e94ff86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/document.js: FileTooLong \u2014 1601 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 101 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efddf69d02c647bd20bbb15832be85696ae83dce169ae5b523c4ce220a59559"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Catalog: ClassTooLong \u2014 1210 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 810 over it, 3.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":"src/core/catalog.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7b6a1497a6819e4d78a24710b3480d0f971e92eaeadae9be851c500f925095"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextWidgetAnnotationElement.render: MethodTooLong \u2014 render runs 301 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 201 over it, 3.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":"src/display/annotation_layer.js"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"5167948d84bd1649236bb08a401d0c365f9fe6fbdb92223898d5adfd7ad5bef9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/cff_parser.js: FileTooLong \u2014 1503 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 1003 over it, 3.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":"src/core/cff_parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b113da93562bf57c5063f373b759ef1d019233222c591e4ca455775016a2f1df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/editor.js: FileTooLong \u2014 1420 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: AnnotationEditor (45-2486). The bar is 500 significant lines; this is 920 over it, 2.84\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/editor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69922cacd68c7a48d7cce1a451d35bc4e21bfb8032a7465dd6c7b8230beab91"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: viewer.getViewerConfiguration: FunctionTooLong \u2014 getViewerConfiguration runs 278 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 178 over it, 2.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b827d799ca9401f64147da42fe8466acb6db41308455012dcf752fa381e8944f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/pdf_thumbnail_viewer.js: FileTooLong \u2014 1318 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: PDFThumbnailViewer (89-1982). The bar is 500 significant lines; this is 818 over it, 2.64\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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8487ddb429229f14462684d6c0d8950342783473c0d3a68dacb5979eadc19e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/catalog.js: FileTooLong \u2014 1270 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: Catalog (120-2058). The bar is 500 significant lines; this is 770 over it, 2.54\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8e527dbea006daba5032bebd6f528c817308e5a9c6452edfa4f711c4b43810"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: app.onKeyDown: FunctionTooLong \u2014 onKeyDown runs 237 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 137 over it, 2.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":"web/app.js"},"region":{"startLine":3315}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a7e34ee0dce6b21a7da41ac30ceca5325dd9369293acc2e7cbce7d66c8fb81"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PDFDocument: ClassTooLong \u2014 920 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 520 over it, 2.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8aa0421408e609d9738ad33c00e088e2ab33f8fd9e789b3766567dd39e8f3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: xfa/config.js: FileTooLong \u2014 1129 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 629 over it, 2.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/config.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0528ddf05630692c26bbb4c6fea9b33f7b7a25206bf1e7a55a69058d616dc2f0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PDFImage: ClassTooLong \u2014 891 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 491 over it, 2.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":"src/core/image.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"1034b2299f30ca4551ede4adc0be7ed17f8b4fcc50d5ffe4b8a6d76961c38400"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Field.[$toHTML]: MethodTooLong \u2014 [$toHTML] runs 221 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 121 over it, 2.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":2741}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e62789a9b390fb3502b80e457aceec3eb50aa83faa9ae8a2f707ae71447a97"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CanvasGraphics.showText: MethodTooLong \u2014 showText runs 219 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 119 over it, 2.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":2803}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a71dfd8d290ebdb43f473220816c882c298107fe176deb79cce563868a41bc2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PDFViewer.setDocument: MethodTooLong \u2014 setDocument runs 211 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_viewer.js"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"83503653d5e696c9f5d6e046a8758ce323923ddda7747414bc5355732497e90d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: glyphlist.getDingbatsGlyphsUnicode: FunctionTooLong \u2014 getDingbatsGlyphsUnicode 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":"src/core/glyphlist.js"},"region":{"startLine":4351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9145b8aca9d7ef2aba0ba3540c7cd215179325ecf3f90d52d3455ee046a12c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: api.getDocument: FunctionTooLong \u2014 getDocument 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":"src/display/api.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fcd7eab81cd17f19a8b116e8a4b2d609e69e6f178210523da8beca06d60e80"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DrawingEditor: TooManyMethods \u2014 61 methods. The bar is 30 methods; this is 31 over it, 2.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":"src/display/editor/draw.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd7b3236eb6e4da6ec6b666ba19932d6eba767bce2a8c2fd4a2fabe7f45a1ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type1CharString.convert: MethodTooLong \u2014 convert runs 199 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 99 over it, 1.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":"src/core/type1_parser.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6fcf086e3a798c73482a4f0fc657de553595dbefb6e6bda6457a4287106729"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: XRef.indexObjects: MethodTooLong \u2014 indexObjects runs 199 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 99 over it, 1.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":"src/core/xref.js"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09c77c5076f8dbc6c631c6f6e667c3cf80627c2ac190297cd23fbf653f4cb17"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type1Parser.extractCidKeyedFontProgram: MethodTooLong \u2014 extractCidKeyedFontProgram runs 198 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/type1_parser.js"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f1cc6ef9f8b7dd7420ba58a44c0bb28761bea9f3100280151c25bf26a4afbb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PDFEditor.#mergeStructTrees: MethodTooLong \u2014 #mergeStructTrees runs 193 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 93 over it, 1.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6fbe6d14d8f7096a3173a16ea28dd749b1db7b7a0480f5b3dcca448c2610e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/image.js: FileTooLong \u2014 952 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: PDFImage (142-1450). The bar is 500 significant lines; this is 452 over it, 1.90\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fbdd04e49e8e068bf64315b22eda23fd277c6dc6da4fd3a25a7c86f415374e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/crypto.js: FileTooLong \u2014 947 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 447 over it, 1.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":"src/core/crypto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3640006331a268246d87036a1e24bf54da1b3c84f5337e998c23c2788c44d28"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PSStackBasedInterpreter.#execOp: MethodTooLong \u2014 #execOp 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":"src/core/postscript/js_evaluator.js"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f4436e12d2ffed68f5a32012a67944795f8f27061335ff462af34931e6d268"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PDFImage.constructor: MethodTooLong \u2014 constructor 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":"src/core/image.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"58da46627945430b4add476cbcea83b457a8e8676fab1f0394a8e22a1f32a6ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/parser.js: FileTooLong \u2014 934 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 434 over it, 1.87\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33031c0b1fcd74d548aa15ec332beeb9dce43e87bd8212e4cfb8bafb57cb863e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PDFEditor: TooManyMethods \u2014 56 methods. The bar is 30 methods; this is 26 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"363ee6b59ab432b18c9d2ff9f024b276af0f8f94250d612443a770aaaab48d85"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/pattern.js: FileTooLong \u2014 924 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 424 over it, 1.85\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pattern.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44d3c18ea606f859b9b1158e1b9b6b3963a524f10eec210da21631e6073df79"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PartialEvaluator.buildPaintImageXObject: MethodTooLong \u2014 buildPaintImageXObject 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":"src/core/evaluator.js"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"d716776952dcff9831273acf1b2e4f6e9bd1404a925106b2a122663cd66ba28e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DrawLayer.#selectionChange: MethodTooLong \u2014 #selectionChange runs 181 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/draw_layer.js"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d5bbf705509d0b71e400ad2deebff2ec5a118848a046ed5219adfcf7adf651"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WidgetAnnotation._getAppearance: MethodTooLong \u2014 _getAppearance runs 180 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 80 over it, 1.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":2421}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c5cad7ca8c99995b6d80691fb59b3d1cd51389e1d347392e6b0ce3641c56a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PDFImage.createImageData: MethodTooLong \u2014 createImageData runs 180 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 80 over it, 1.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image.js"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d32c7311c4e185923d221f1d9344bdef48cbc78cf02b4e9eeed96169f2137a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: babel-plugin-pdfjs-preprocessor.babelPluginPDFJSPreprocessor: FunctionTooLong \u2014 babelPluginPDFJSPreprocessor runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/builder/babel-plugin-pdfjs-preprocessor.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"871eb44ebbce9b599d41cdda64a3da7d0c58f65d6a907a26419e207ade344d8a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PDFPageView: ClassTooLong \u2014 705 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 305 over it, 1.76\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_page_view.js"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b6b4aeca73dbb203c0c715ecf7670c17c6c099b5098a91f507969617a58b76"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChoiceWidgetAnnotationElement.render: MethodTooLong \u2014 render runs 176 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"03974ffc877e8fd6b6f29b3ab7b1d5e2917a0176b3ac0b1c95cf3e90b4b944f0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SignatureManager: ClassTooLong \u2014 696 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 296 over it, 1.74\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":"web/signature_manager.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"500d5b1d4e29b1683c7e0bde02bc4400af276e45ed7b974e2484b9567920175d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DrawingEditor: ClassTooLong \u2014 694 significant lines (blank, comment-only and punctuation-only lines excluded), 61 methods. The bar is 400 significant lines; this is 294 over it, 1.74\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/draw.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d4ba00b04e8ff5bcf5751d714eedea9e3040baaabb7753e3a9e57c252f1b99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: xfa/formcalc_parser.js: FileTooLong \u2014 867 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 367 over it, 1.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/formcalc_parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36515645bfcbbe7415ad6cac7aab8d9609d55c463aeb5c21dc2af2bc1afe756b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PDFThumbnailViewer: 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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"345dc244907910737be90bef4de0592578e6e24b4df3fb05e2b24b7c5f87559a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/comment_manager.js: FileTooLong \u2014 864 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 364 over it, 1.73\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":"web/comment_manager.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d3e5de0d04282825a40acea1da1255c5122ce5eed3633c23818eab708aa1bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/struct_tree.js: FileTooLong \u2014 857 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 357 over it, 1.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e787e331399c092d22ec4a520482e5c47840ab72e0b2dc2fdb972f160aeb23"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shared/util.js: FileTooLong \u2014 855 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 355 over it, 1.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/util.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a0d1c0c8fc3a85832e777c9d092a09f1ca1186cc0caab4bf5bfa6626595530"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Doc: ClassTooLong \u2014 682 significant lines (blank, comment-only and punctuation-only lines excluded), 108 methods. The bar is 400 significant lines; this is 282 over it, 1.71\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d30aa31bad433c3cd304403da1c1870526ddb3d1b559321f85a4908b326b8a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AnnotationEditorLayer: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/annotation_editor_layer.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2081a240b8d561da2622d76fbd1b405585140254631d404d3915562649d173b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PDFViewer: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\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":"web/pdf_viewer.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f87934095e4695649e29d58be548275368d15105544f94b109d8171d0033548"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WorkerMessageHandler: ClassTooLong \u2014 673 significant lines (blank, comment-only and punctuation-only lines excluded), 3 methods. The bar is 400 significant lines; this is 273 over it, 1.68\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/worker.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"feba39d5b5cb38bfcf094354892026764baa8757710cee788f685b5fb55afc4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compress.parseCMap: FunctionTooLong \u2014 parseCMap runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\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":"external/cmapscompress/compress.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcd9e83c0c861602737cfa045a400af5c75c468844c5303bff414c0c9541431"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Subform.[$toHTML]: MethodTooLong \u2014 [$toHTML] runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":4969}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b9c18d850f74418d23878dc5bc526a01d49b5bc254b0be03f34ccc98797987"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: XFAObject: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/xfa_object.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7058beaeb9a20424c8a8f7f813bf6d2f50eb527aade0c98f7dda18d482919cf2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CFFParser: ClassTooLong \u2014 658 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 258 over it, 1.65\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_parser.js"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e263d01a025af494dcf244445d87aacde31931026971724a42fd0fba1dfab7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Catalog.parseDestDictionary: MethodTooLong \u2014 parseDestDictionary 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":"src/core/catalog.js"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0b467700cdddb89ef1dc6555e86c0686fd027f893391b8557faaa53327ee97"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Template.[$toPages]: MethodTooLong \u2014 [$toPages] 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":"src/core/xfa/template.js"},"region":{"startLine":5410}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0dbffa2e5658cd5fbf3a7c41e77585c38497ea540bdc6ef4982e78503fbc33"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PsJsCompiler.execute: MethodTooLong \u2014 execute 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":"src/core/postscript/js_evaluator.js"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1835038d9ab192066bb534662d0859467e49ba7f9027b4820affb1198d56e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: postscript/ast.js: FileTooLong \u2014 806 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 65% of them inside a single declaration: PSStackToTree (527-1419). The bar is 500 significant lines; this is 306 over it, 1.61\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e280269a8b8bbecd4ddfb155b1f1f08589817462e0df2b1077b2936237b4c9a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: XRef: ClassTooLong \u2014 643 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 243 over it, 1.61\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xref.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c12454c478f73e65ee762f2ea2ed245a9cff4e403e9646b8275c2ad48160ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bidi.bidi: FunctionTooLong \u2014 bidi runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bidi.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ced42d0266b921e62c14688c1dd22939f19d127eca1d8fc877abdfbdfb8308"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SimpleExprParser.parse: MethodTooLong \u2014 parse runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/formcalc_parser.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fca713cd5279264ab325737617f1bed114ce14621c55fb21c9f3bee3532929"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/signature_manager.js: FileTooLong \u2014 778 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: SignatureManager (29-997). The bar is 500 significant lines; this is 278 over it, 1.56\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":"web/signature_manager.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe6e5b4ba14b7e36e7d3a801d7c27fc238a9dc1686ccbfdc4caaf4c4ce3b9f6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TreeView: ClassTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 400 significant lines; this is 220 over it, 1.55\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":"web/internal/tree_view.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6a73000ada8b689bbef29c2cf13af71f868d5167c8751e6f11d25b8c9ac019"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StampEditor: ClassTooLong \u2014 616 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 216 over it, 1.54\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/stamp.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b507480bbef05cd23ec38bbd1a073fdb17ba1c9e944e7f404030314c66235952"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/colorspace.js: FileTooLong \u2014 768 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 268 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/colorspace.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"678308bf3b9c540069d15394b8263fc03444caa08aca81fdf299ac8874a22b04"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: App: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/app.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72f3207b6a09d4faf4715306d9292db58cacfb062ae3174d59386c6240e6087"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: font_renderer.compileGlyf: FunctionTooLong \u2014 compileGlyf runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.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":"src/core/font_renderer.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"596021a2402fd88f03d0087382a581d5d1483014d86cf898e0ca554a7fb27eae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Font.convert: MethodTooLong \u2014 convert runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.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":"src/core/fonts.js"},"region":{"startLine":3362}}}],"partialFingerprints":{"codehealthFindingId/v1":"3186540641257d1e88b45b9e72c936e5ec06cb475e8c054788afd90a7550665f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PDFEditor.#cloneStructTreeNode: MethodTooLong \u2014 #cloneStructTreeNode 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"c134e924263abe6799301306663ec8d207226e6ebfdb13537504e06c7294bb81"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkerTransport.setupMessageHandler: MethodTooLong \u2014 setupMessageHandler 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":"src/display/api.js"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"a992ecc7107fa0c14d0bddb79c2660782af01032794d95a4ba0e1069a0fabd63"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/type1_parser.js: FileTooLong \u2014 746 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 246 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/type1_parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06435789d75939477f260c554712d0f62625ef2c19c215de19bc7b958b9d0741"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/pdf_page_view.js: FileTooLong \u2014 741 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: PDFPageView (123-1224). The bar is 500 significant lines; this is 241 over it, 1.48\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":"web/pdf_page_view.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8d92c9173fc8acf48c910452d66bc7ae0c0c9799944f6295e23d1e4f8c51c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RendererMessageHandler.#setup: MethodTooLong \u2014 #setup runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/renderer_worker.js"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"c899a39f4c1b8b2bc96db0cd15fd9281793e5cef295e32d75986fb2b96476449"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/font_renderer.js: FileTooLong \u2014 738 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 238 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":"src/core/font_renderer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e483acadd676aa58f5f530e52845997661dc629095bda6fa2ae4d331e6d3de60"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WidgetAnnotation: ClassTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 186 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb35f38cc39ad9e25de5b2742899c31b4c4b6f958e27e29e9807e7662ef85d7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PSStackToTree._makeBinary: MethodTooLong \u2014 _makeBinary 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":"src/core/postscript/ast.js"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"0080bf9b0bb9d8d98345fe4df37e17914c61b1217ed2bee699f65d1a09f91120"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: postscript/wasm_compiler.js: FileTooLong \u2014 729 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 77% of them inside a single declaration: PsWasmCompiler (150-956). The bar is 500 significant lines; this is 229 over it, 1.46\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/wasm_compiler.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b6f44e0c10acab7ce5cc62a9e1a937b971c537136673db53536892a371d7e5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CFFParser.#parseCharString: MethodTooLong \u2014 #parseCharString 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":"src/core/cff_parser.js"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3e238d15a9e4b0bd9b68387059429b4382860260ad951dcfb6c0ba35b43d99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/draw.js: FileTooLong \u2014 722 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: DrawingEditor (71-1263). The bar is 500 significant lines; this is 222 over it, 1.44\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/draw.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c2c37e5808181aa61de5da48aea43a819cd6f6e6c64d69362a694b71906e6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: display/canvas_dependency_tracker.js: FileTooLong \u2014 719 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 219 over it, 1.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":"src/display/canvas_dependency_tracker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7100fc0458cdd7d9829a43b07ae14c0f92e3470b34af8224d45a47a574f763c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BinaryCMapReader.process: MethodTooLong \u2014 process runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.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":"src/core/binary_cmap.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45f2a1303d029acb28df76debab06fd37288739e049d119641a246728f213e7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CanvasGraphics.beginGroup: MethodTooLong \u2014 beginGroup runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.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":"src/display/canvas.js"},"region":{"startLine":3386}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0514fbd2f50014dcea34a11fa0b88761449214ab2f95ba96a942a4d46763ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/worker.js: FileTooLong \u2014 714 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: WorkerMessageHandler (71-1107). The bar is 500 significant lines; this is 214 over it, 1.43\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/worker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2795b30343ebd090da230617bb5b41607bf54034ad513e104b3872a34a999fdf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AnnotationEditorLayer: ClassTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded), 51 methods. The bar is 400 significant lines; this is 169 over it, 1.42\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/annotation_editor_layer.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"aceee054df379f0bdce624e418b2117b23531a2162b2760047b4f54ff6e7cb56"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CipherTransformFactory.constructor: MethodTooLong \u2014 constructor runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/crypto.js"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c4d87c83c31acbab00e2203d2daa823f129b970c1c96a7c66f86a2fab99e97"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PDFPageView.draw: MethodTooLong \u2014 draw runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_page_view.js"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc73f678ce7877a65438d97f372082875978c3e258b5f337aade3ed3eb53de6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Page: ClassTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 160 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f511cbc5c5a7edf5cef5f6f3908cc68f0bb439cd68751b679983d4909eedd44"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: builder.preprocess: FunctionTooLong \u2014 preprocess runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\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":"external/builder/builder.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b86381521e3734a673707c3acfb4934e25a8d85d97a714cc6e142b4c101674f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_find_controller.normalize: FunctionTooLong \u2014 normalize runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\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":"web/pdf_find_controller.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd88018d421f659e1a7e15327cb763dd1ebde18b8fe30bc13275af2464ed8c6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PsWasmCompiler: ClassTooLong \u2014 559 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 159 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/wasm_compiler.js"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd89b9bc5c2095e539cee78c6da78ff81f870f9bfbfd398f7b3b559ae515091"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/pdf_find_controller.js: FileTooLong \u2014 697 significant lines (blank, comment-only and punctuation-only lines excluded), about 71% of them inside a single declaration: PDFFindController (418-1277). The bar is 500 significant lines; this is 197 over it, 1.39\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":"web/pdf_find_controller.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b490e93d64ba9dee0205c9d83d093acd86143a7e7fb2dd19dacd7890d10dc1f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripting_api/doc.js: FileTooLong \u2014 695 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: Doc (37-1416). The bar is 500 significant lines; this is 195 over it, 1.39\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc78aca72f51eb0e76aafe863e65ec12ddc12deedd238666b98f83771721f21"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SignatureExtractor: ClassTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded), 16 methods. The bar is 400 significant lines; this is 150 over it, 1.38\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/drawers/signaturedraw.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2118ee3c2b1d75a798c6992d95479c5dfdab64b56a7ec0aa7b9938faaf8f8bd9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PDFThumbnailViewer.constructor: MethodTooLong \u2014 constructor 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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0bc4d7c48304f8cc026f39d9d579a2ed9e102960a7b45a1db537a72d28a8bb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FreeTextEditor: ClassTooLong \u2014 541 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 400 significant lines; this is 141 over it, 1.35\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/freetext.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceaf0db33940b7d9078390f9e9cc8cfaffc738e42ebcd6668df42727918e7fe3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: standard_fonts.getSerifFonts: FunctionTooLong \u2014 getSerifFonts runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/standard_fonts.js"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a31edd1cbe83f72704b9dca1edc50acf073941ccebc274e54230ef560d573f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: xfa/xfa_object.js: FileTooLong \u2014 671 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 171 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/xfa_object.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1c08d5c652bb2ad6d8d3b154ec7952f22f13ef438fa462dc88243ddfafc71b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Page.getOperatorList: MethodTooLong \u2014 getOperatorList 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":"src/core/document.js"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7284dbd5a3a0e2e5795dc5c2a488d963405ff724f20abd0452084aeb8f9cdd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: display/pattern_helper.js: FileTooLong \u2014 668 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 168 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/pattern_helper.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06184f2b4556909dd92dc8e91c9b33ddc3cf821f562d7c7076e74bd019cf7011"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WorkerTransport: 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":"src/display/api.js"},"region":{"startLine":2359}}}],"partialFingerprints":{"codehealthFindingId/v1":"3834cd77f4f4970d9b5ec16529b022afa738788c2a53986316f1dffec54eb158"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FreeTextEditor: 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":"src/display/editor/freetext.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"af60fe5ff42aa24bd40ab0fb71338bea834b07f626833cc2d4ba97768127583a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: optimize.optimizeCMap: FunctionTooLong \u2014 optimizeCMap runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\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":"external/cmapscompress/optimize.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d041be2ca3427ab23a360ff0ce2804569ca7c3c8a223346b847e28a3a7d396"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/xref.js: FileTooLong \u2014 662 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: XRef (35-1073). The bar is 500 significant lines; this is 162 over it, 1.32\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xref.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c1b427f1acf3765f74048087b93771bbad844d1323d8925c924cefc58ce0fa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PSStackToTree: ClassTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded), 12 methods. The bar is 400 significant lines; this is 127 over it, 1.32\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddd3b4aa4146528c16e18b6d6bc4e3ea40cf291523a8a3dd1816be3153a4b13"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: postscript/js_evaluator.js: FileTooLong \u2014 649 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 149 over it, 1.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":"src/core/postscript/js_evaluator.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a67aa9820955378a429578bc63991083a16d26cadfef128a4e4e45fd308de21"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WorkerTransport: ClassTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 400 significant lines; this is 110 over it, 1.28\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api.js"},"region":{"startLine":2359}}}],"partialFingerprints":{"codehealthFindingId/v1":"1393b1b14256e9c2a8c0cd56e08c210117faa27ffebc9ced9d7e0e2d228edfd7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Field: ClassTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 400 significant lines; this is 108 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/field.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8b110169d73ea530379bc4db466dcd11a3f476d679d5cee22e2f466aee3a1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: calculate_sha_other.calculateSHA512: FunctionTooLong \u2014 calculateSHA512 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":"src/core/calculate_sha_other.js"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ec561478f6a3c03cc1427e808f4a7b05a2a8bc6ffea35474d8489e957b2a20"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fonts.createCmapTable: FunctionTooLong \u2014 createCmapTable 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":"src/core/fonts.js"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7225b0c87da7fe168fb4b98ddc378e88ad958796ef6c2bce0542d12ca554dda"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Type1Parser.extractFontProgram: MethodTooLong \u2014 extractFontProgram 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":"src/core/type1_parser.js"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc459770cb0ac35b908aafca0818a837e3e2fa1b1ca87c06e5edfa001e92e80"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: drawers/inkdraw.js: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 66% of them inside a single declaration: InkDrawOutline (371-958). The bar is 500 significant lines; this is 131 over it, 1.26\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/drawers/inkdraw.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2383bd73514313da9d1015f9d6ed1a110f1a4dade54f07b1f591dd37b87bd6ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SignaturePropertiesManager.#renderCard: MethodTooLong \u2014 #renderCard runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/digital_signature_properties_manager.js"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2559fe6d8712e66529f484ebf5e8bf52cd1cc8b5f124fa4e6f16b4323aac4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internal/tree_view.js: FileTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: TreeView (31-977). The bar is 500 significant lines; this is 125 over it, 1.25\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":"web/internal/tree_view.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6bd8269a716bc4d6ce4d3bfac4f11317a7703b99bd2eafdfb3b6b022770fd6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Parser: ClassTooLong \u2014 499 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 99 over it, 1.25\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9155db16d2e5dbbb8c1cdfca87bbff64c41cc825cd44c0f6ce300242cf5359a4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PDFFindController: ClassTooLong \u2014 498 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 98 over it, 1.25\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":"web/pdf_find_controller.js"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c4604b95fac96670c32057913c13228756019c1dc4549a668658b814b1fa56"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/stamp.js: FileTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: StampEditor (25-946). The bar is 500 significant lines; this is 122 over it, 1.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/stamp.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59983241ad307976ee81c6d0f5ef175e60cfcb81db97e6aee52c42b4a4461316"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PartialEvaluator.extractDataStructures: MethodTooLong \u2014 extractDataStructures 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":"src/core/evaluator.js"},"region":{"startLine":3775}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eda90c0feb7fd3b165d3ae627009a8ac27a9a9844f2a1862d7f20dfda5b5ec4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PDFPageProxy.render: MethodTooLong \u2014 render 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":"src/display/api.js"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd747c8c2e295a12a97f1425ecad47327622c09ded8e61164e36c242559a94d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Field: 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":"src/scripting_api/field.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12214bfc01b34cb6d50b55ac041077240b95c0b20ba5426429daff7e0987ac5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TreeView: 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":"web/internal/tree_view.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5fe1b4f25faef8427f4cdbdcca09ecbc4a1f72a3f0c3d9fd9a540e4264ae6b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PDFEditor.#cloneFields: MethodTooLong \u2014 #cloneFields 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":2196}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e62b5140afe9dd87cd34fb461319d2d5b19f0213479b65e618f4a750e19093"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PDFEditor.extractPages: MethodTooLong \u2014 extractPages runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"95043c2fef729d4afa4afcc73044dd89fa46fb86a09e69ab8d3a43f58905fc04"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PartialEvaluator: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c57086fd89d94958d51b7190491f9f735ddc0626f9a127a5e731d26510ba185"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ColorSpaceUtils.#parse: MethodTooLong \u2014 #parse runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/colorspace_utils.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c858b657a853bb54ac041e9ae7cd4a778754deac8b8bac724abbfe06d4778359"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compress.compressCmap: FunctionTooLong \u2014 compressCmap runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\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":"external/cmapscompress/compress.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b637489d1219fc4f1db10001d2356a19deea5378775f8fb3412d883fcb1a0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: initialization.initSandbox: FunctionTooLong \u2014 initSandbox runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/initialization.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3adc7b0d72fb7071f9e29477953f1f71c7bfc7c567ee1687e62713a16fc03e0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PageView: ClassTooLong \u2014 474 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 74 over it, 1.19\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":"web/internal/page_view.js"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcaa7bb0deb480777b4c4f547bfc1d2891ef05a7ab50e5b0c7204e359ef6351"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PDFEditor.#makePageCopy: MethodTooLong \u2014 #makePageCopy 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":2436}}}],"partialFingerprints":{"codehealthFindingId/v1":"7597b2faf8d963663cee04072c1b53852af3fe1730dfdb5210f9d8fde2c42af6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Binder._bindElement: MethodTooLong \u2014 _bindElement 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":"src/core/xfa/bind.js"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"74552fb42f28cfed762ba707d54e1d3010dbaef9173ecb6b5a0bfc76a499abf9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/operator_list.js: FileTooLong \u2014 584 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 84 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/operator_list.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed25f2a60cc062892832ecd40ff7b9d9200600355292042e42bdf8447339b94"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/annotation_editor_layer.js: FileTooLong \u2014 582 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: AnnotationEditorLayer (65-1069). The bar is 500 significant lines; this is 82 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/annotation_editor_layer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00093cc69cfad611747a21d407b88005b3776ced47e4ac7559acda2779bf51a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AnnotationElement: ClassTooLong \u2014 464 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 64 over it, 1.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a848bad27dfca356c9210e9338cf0fb93fd2c6b8741fd3114f299777b7c8ed2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FlateStream.#readBlock: MethodTooLong \u2014 #readBlock runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/flate_stream.js"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a452dd7fdf9554d102377227b2e7e7f82cd70d1eb7c2532801f0030975079e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CommentPopup.#createPopup: MethodTooLong \u2014 #createPopup runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/comment_manager.js"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4bd17e3554bbb81ba9e31a7e96a34cce27f972d8c7777481e715efac30391a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/debugger.mjs: FileTooLong \u2014 579 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 79 over it, 1.16\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":"web/debugger.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"500cec1b75b38b7805b3cfa0683ffa62e1a3fd14b433264600e54cb1bb2d7daf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MeshShading._decodeType6Shading: MethodTooLong \u2014 _decodeType6Shading 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":"src/core/pattern.js"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b99f7c7cb24c6f20cb998e59b31a2f8568f3d4aa9a15227a48c04562e17ab43"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnnotationEditor.#resizerPointermove: MethodTooLong \u2014 #resizerPointermove 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":"src/display/editor/editor.js"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ae60786da15d5d90c319ce59ce49f31b2858e1c8b1480912083b4b6072916d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Font.constructor: MethodTooLong \u2014 constructor runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"51741678031f4a200fe39a1ba76a1f1f3461701943d20c583544640143bba637"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImageResizer._encodeBMP: MethodTooLong \u2014 _encodeBMP runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image_resizer.js"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51eba3e5e3512f061fc44a85a36fd6472321cb5f1492a4ce26e65b28a470d1a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Proto.constructor: MethodTooLong \u2014 constructor runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":4407}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe009c408651122f33900457bdd2c49b332a340214e5f4aa1597c68ad342d14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: drawers/signaturedraw.js: FileTooLong \u2014 557 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: SignatureExtractor (27-831). The bar is 500 significant lines; this is 57 over it, 1.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/drawers/signaturedraw.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c71a5109bde8c3e2f88e312771bdc91823d8edb5e8292e333d7ae0f68fc040e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Util: ClassTooLong \u2014 445 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 45 over it, 1.11\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/util.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bccc59899c1dcdf52ba3d487f3bb42c1fd213666bd99f714be01ecf693713d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/freetext.js: FileTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: FreeTextEditor (37-921). The bar is 500 significant lines; this is 55 over it, 1.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/freetext.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e2599beef00545013d2ca398a826558c473e0c59f9ae95727a90a43f1f2d86"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PDFThumbnailViewer.#addDragListeners: MethodTooLong \u2014 #addDragListeners runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"1103301f73614dcdcbb38bc9564e164b7fff60223f01b0859ca5ab3fa17ed96c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PDFViewer.scrollPageIntoView: MethodTooLong \u2014 scrollPageIntoView runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_viewer.js"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a5cf583e9ae342b884ea88d84b8772c7764c6aa2e1e4b0752b00c54260d3c1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Annotation: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a9ce259ba3a15d842c13dfcee03d3a93fa75035fb33cebe649b5664917ae56"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CanvasBBoxTracker: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas_dependency_tracker.js"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"509811f39d1a4e2e2a91257e5d1716646932354e23d9ba513b3696aee589bce5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ButtonWidgetAnnotation: ClassTooLong \u2014 439 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 39 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":3276}}}],"partialFingerprints":{"codehealthFindingId/v1":"806e2a5578687be6a889beda72c0ea57537f10f3cc48de04019ee9e507a61457"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Type1Parser: ClassTooLong \u2014 436 significant lines (blank, comment-only and punctuation-only lines excluded), 12 methods. The bar is 400 significant lines; this is 36 over it, 1.09\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/type1_parser.js"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b168099576334aceca6dbc190a4618c668db373d6a272824584b773fecde9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: content_disposition.getFilenameFromContentDispositionHeader: FunctionTooLong \u2014 getFilenameFromContentDispositionHeader runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/content_disposition.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3be41d3762ab26761a861a043830c31246b48f791d70b073956717c6be34f3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internal/page_view.js: FileTooLong \u2014 541 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: PageView (129-884). The bar is 500 significant lines; this is 41 over it, 1.08\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":"web/internal/page_view.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbe249b9fd44e34670d5400411deb40d879f09d0b5eb14979c160d3736043e4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PartialEvaluator.preEvaluateFont: MethodTooLong \u2014 preEvaluateFont runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":4451}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e3f31ae9804e7bf647cd33d1d3799e46d44aa8c3e80c265b053a93997b8a1f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RadialAxialShading.constructor: MethodTooLong \u2014 constructor runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pattern.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a8f6073ad073fad0dc122e50a3f62b03ba76bb507019cff4ebd0723650b390"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FontLoader.#testFontLoaded: MethodTooLong \u2014 #testFontLoaded runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/font_loader.js"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d221c8b8d32e8c0217784cf7302e62a223b2d509c0c0124931d7cd78954642a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SignatureManager.#initDrawTab: MethodTooLong \u2014 #initDrawTab runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/signature_manager.js"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"3051e343f2739679ce2b07e57b0986b588f689d004e2f6a3d756058931bca8b9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Annotation: ClassTooLong \u2014 429 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 29 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":"src/core/annotation.js"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5e362a38605a7f06ea3e8a6bbe7298c30dd82330753a5452a18c67cbb0d922"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PDFImage._fillDownscaledRgba: MethodTooLong \u2014 _fillDownscaledRgba 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":"src/core/image.js"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d012616c674f835f09d924914b3bc0548ff7df2a79a4f89cff44da0781f279b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CanvasGraphics._createMaskCanvas: MethodTooLong \u2014 _createMaskCanvas 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":"src/display/canvas.js"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"197dddb779428e259b2d40c1aff2dc6d636bdcb75b0fff5908eef830d209203b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CanvasDependencyTracker: 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":"src/display/canvas_dependency_tracker.js"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"f222f8a68307224e4e16c282e79e12334ea43c92e2264014dd9498729bb3e93b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CanvasNestedDependencyTracker: 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":"src/display/canvas_dependency_tracker.js"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"af637f368df441a71f94154950ef44bbdf49e2dc60e0b9f7be47918b3fdeafb4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PDFPageView: 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":"web/pdf_page_view.js"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b8a6b433b79c4d44205f1aa1c86d31efe8336f43f8f20c416b5f953d2f3934"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DrawLayer: ClassTooLong \u2014 426 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 26 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":"src/display/draw_layer.js"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c3d98d81f5b1dd2365b7de1476aa124180e57cc15eb4e68d19210c826e7e4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fonts_utils.compileType3Glyph: FunctionTooLong \u2014 compileType3Glyph 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":"src/core/fonts_utils.js"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba2421a5fb997d37cb381547955f71b86d9eb6f1129af0a6f7fda415215a405"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextLayerBuilder.#enableGlobalSelectionListener: MethodTooLong \u2014 #enableGlobalSelectionListener 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":"web/text_layer_builder.js"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc72efa5ea92ffbe91e290278cc939075134b9d17edc5e8b8e7b60958eafafb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PopupElement: ClassTooLong \u2014 423 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 23 over it, 1.06\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":2478}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e8b58a7e99dfdffdc8f5308793dac8e5f2984218571083105d3eb7bd0ae47c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internal/draw_ops_view.js: FileTooLong \u2014 525 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 25 over it, 1.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":"web/internal/draw_ops_view.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8ca8362054a93c5cbecd4b862553bea71fa57fd27300a8793b1fd26d232cae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fonts.createOS2Table: FunctionTooLong \u2014 createOS2Table 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":"src/core/fonts.js"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"b859f28cbb829e6da28766518ab254b637acfee2fa702ea72492c9b6d9aecdf1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExclGroup.[$toHTML]: MethodTooLong \u2014 [$toHTML] 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":"src/core/xfa/template.js"},"region":{"startLine":2443}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ddb2689d6176215f4e48956e5790eb84a5ee6da1ddd6d78056651383e65ee32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripting_api/field.js: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: Field (38-855). The bar is 500 significant lines; this is 23 over it, 1.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/field.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b0eb395e681d751d08fcd7a2b556aea190614f8f5f7689d5b11017452b9e71"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InkDrawOutline: ClassTooLong \u2014 418 significant lines (blank, comment-only and punctuation-only lines excluded), 16 methods. The bar is 400 significant lines; this is 18 over it, 1.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/drawers/inkdraw.js"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e38b90425967461a8a2469dc9012e17cdee1d9a7010f22e8a3bd884c76a6d30"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Font.fallbackToSystemFont: MethodTooLong \u2014 fallbackToSystemFont 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":"src/core/fonts.js"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cf0f43ba7ef02f8c32818efe342b4b3663cf384196bc709ccd837eac4ab829"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Util.printf: MethodTooLong \u2014 printf 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":"src/scripting_api/util.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"893ba33ed9454d72e3703c9346a68f537692d973a5d3c1f757a993016ccf03e0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnnotationEditorParams.#bindListeners: MethodTooLong \u2014 #bindListeners 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":"web/annotation_editor_params.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8341381a53b194d80e84e6372a6cd62aa5a4bf00a1487f8e6205c6bd2c1f81a9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PDFScriptingManager.setDocument: MethodTooLong \u2014 setDocument 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":"web/pdf_scripting_manager.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23847f52407e8e87ea47311e70e981890065ce0c333f2e90508b78e7a526fce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/firefoxcom.js: FileTooLong \u2014 516 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 16 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":"web/firefoxcom.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"884a4547bbace90f3a14c8033ad32526c88d4b1993ee600cc7f81111c3bf3233"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CFFParser.parse: MethodTooLong \u2014 parse runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_parser.js"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f546b855610bb1b3ded0075ff8d92fbaad8ef8a29881f68823fd7a1509437ec7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StructTreeRoot: ClassTooLong \u2014 409 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 9 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d176535c33f400307e77d7130fd408863ffb3b009f0e8e21cf759a6f4da6ccf6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnnotationFactory._create: MethodTooLong \u2014 _create 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":"src/core/annotation.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbdf6c8585c4ebaa5222f5d7f234c63a0ef23558b7dd5e3fe4c7d96b188fa98"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FreeTextAnnotation.createNewAppearanceStream: MethodTooLong \u2014 createNewAppearanceStream 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":"src/core/annotation.js"},"region":{"startLine":4504}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6d328358fce7e69b285da7aa05cd73f3b013f34038f4123b8a6649192e19d3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CanvasGraphics.paintChar: MethodTooLong \u2014 paintChar 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":"src/display/canvas.js"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c81f819d9e3bea807fa1e7f57a385e63bfbbfcaf86127c66c43e7681fd37093"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CanvasGraphics.endGroup: MethodTooLong \u2014 endGroup 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":"src/display/canvas.js"},"region":{"startLine":3649}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb23cd692784bf4e72702509d5fcb4a81c6c4dc04079b9fc90b3b67ff454510"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MeshShading: ClassTooLong \u2014 407 significant lines (blank, comment-only and punctuation-only lines excluded), 9 methods. The bar is 400 significant lines; this is 7 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pattern.js"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdecbfec5ddee3abef64c5c9784df3177add851cce82c0b8734887ec555d644"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: calculate_sha256.calculateSHA256: FunctionTooLong \u2014 calculateSHA256 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":"src/core/calculate_sha256.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e0ef8e167bc37155fdce5da0fe7e82ae6fe4e4cf8676da6841752821b308ae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Catalog.viewerPreferences: MethodTooLong \u2014 viewerPreferences 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":"src/core/catalog.js"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14cda29beb2048cdb87677d26ed35860fb09e8c2ced63a5b3cd4188c6eeaac2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PSStackToTree._evalOp: MethodTooLong \u2014 _evalOp 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":"src/core/postscript/ast.js"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"075e164a3c44dbc5fb779647ce9c62efa78c0c016c1ae89a4019699ef148fdb2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TilingPattern.createPatternCanvas: MethodTooLong \u2014 createPatternCanvas 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":"src/display/pattern_helper.js"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c6f1df90c61503d970cb1def1ec801cd6a1867141a5dba7725b1440baa1e1e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: XFAObject (LCOM4 8): XFAObject\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/xfa_object.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de926ba114fb334921a9941ff6415811090920104e093fc1cd4786cf3e4325f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Annotation (LCOM4 8): Annotation\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"a950c3cad326bc03a5fc8180067bc30c96e7e85a4967490c2890fb0ac6ffb34a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: HighlightEditor (LCOM4 8): HighlightEditor\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/highlight.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a77bf876a306da2e3e8986b1489392aa40e40b988a83907f70ac73fd7b672d7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Type1Font (LCOM4 5): Type1Font\u0027s methods fall into 5 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 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/type1_font.js"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"468246f42352af2c877f49cdf6ff583b80df11412b75bf27f94f1f9a06e9ba1a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SignatureEditor (LCOM4 5): SignatureEditor\u0027s methods fall into 5 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 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/signature.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41644da02a8a64e425a0dd5a5af51709f42da7ec425b2af7de945053d3862bb"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Util (LCOM4 5): Util\u0027s methods fall into 5 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 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/util.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65d6be29d9476d7162a20638e905e597b22439da4345dc1f1ed15e6ba744b34"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CipherTransformFactory (LCOM4 4): CipherTransformFactory\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":"src/core/crypto.js"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"af37ad1511b698b28247fcd5b4cb15b2a51d79ae5c9d2c2f013ccab73cc39511"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: StampEditor (LCOM4 4): StampEditor\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":"src/display/editor/stamp.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a10dea34c25a57165457640074c3fa48eb765cac54d1b5c395bdbbb73ad3c1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AnnotationEditorUIManager (LCOM4 4): AnnotationEditorUIManager\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":"src/display/editor/tools.js"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"198dc7cea5a0516a80d29cfe5e01d4eb226c4eb0732d79c891948e9296bb0d9d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Field (LCOM4 4): Field\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":"src/scripting_api/field.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"141b28ce8173b1eb01ce96ee6df2d9c383c2c9ec7b0f80b7ef05ab2f87962259"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 the repository root runs vitest but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060@vitest/coverage-v8\u0060 (or \u0060@vitest/coverage-istanbul\u0060) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: destroys the document before the renderer worker is ready: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit/api_spec.js"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd79713bb816bd7fc88ea1a14360d517167c3a7ebbd715eef34fef17b43baf8f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should reject a circular \u0060Parent\u0060 chain: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit/catalog_spec.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1b2f655f4035106048433e6e16da56780ce25f037ec769a3d0ac9be5912f4c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: cancel after a failed read doesn\u0027t cause an unhandled rejection: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit/fetch_stream_spec.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc3cb1b9114ffacdf8dde1ec174ca280e44f06bb1d9b0c10e8e56216dcad33e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: handles an empty input array: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit/image_utils_spec.js"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"85187172fb605234a8ce76e28eaad26bd706ea184a7d242a50589c74d2b3328e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should error with a non-object reason: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit/message_handler_spec.js"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"1057de1c38b46e74324a635070c8713bf68ad311d8c21f3b9515bf11f2ff02a3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should reject with a non-object reason: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit/message_handler_spec.js"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2f38be28bc408ce7327003f85cc966abbd17ccf0de9e71a5af5abb00a6c539"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: cancel after a failed read doesn\u0027t cause an unhandled rejection: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit/node_stream_spec.js"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72ea168da9fe629b5c05add29196a7dbf2dc7e67fa0d95a62437c289c7b7789"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must click on widget annotations: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/annotation_spec.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"365a9782913fd02dd97a711d50883d47bf7b3c3565f76ebbc7ee6a544f5501f4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check the checkbox: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/annotation_spec.mjs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae552b5a1341c17a4e7444eae8a981c3db74a01a53da0a434e4af7d2f92174f4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must click on a link and check if it navigates to the correct page: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/annotation_spec.mjs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"f188e819a5477618fe7ebb8411650ab696ca93ecb81af9ada99295c56a86f48f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the FreeText annotation has a popup: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/annotation_spec.mjs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94d546e5a80c6cc1d8c36a3240889b8ffb45e0287ae2815cea098b8f6bc0908"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the Ink annotation has a popup: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/annotation_spec.mjs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"49536d24a4faf8ce8a5a10775ab21f7bc0673483d2e0493d5b56286b44d768a7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the highlight annotation has no popup and no aria-haspopup attribute: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/annotation_spec.mjs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe18cf58e6c3f66f89d46a043ab314213877186b7c876a9bcfc384c48b5c5e5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the clickable area has been rotated: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/annotation_spec.mjs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"c964a1c2fbb41e1f9ebd6f62690feb51488fac1b3ba9536174c2d6da8d69ddca"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the text under a highlight annotation exist in the DOM: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/annotation_spec.mjs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"527749056aec399d82eb1d13d36ba3856a5e4e8693332b1217f4d1986fd5251d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the text under an underline annotation exist in the DOM: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/annotation_spec.mjs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ee3e1f3a2c6d3e714a18d89ed26e45c2b856ea82e86a19f566277bccce0dec"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the text under a squiggly annotation exist in the DOM: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/annotation_spec.mjs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"0462da896a59a675690add2c2db03c307161487c863e03b9424a231d9e9f4f87"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the text under a strikeout annotation exist in the DOM: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/annotation_spec.mjs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b5df4e145c6eeb4428ff8021918ffe8d4a14d5c4d8e3bdb165cb514a7ea0ed"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the popup is shown: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/annotation_spec.mjs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43ba6b54d070e5f1113c73bee5ae954942a90bbd804c936f5e732df32be8658"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must move the caret down and check the selection: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/caret_browsing_spec.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"260e4f7d4e1d785e2a659833aead30160d3245bd18b70df13bd322139dd0ab07"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the comment button has a title: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/comment_spec.mjs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"18580f7497e9caa7c134facacbfa4181108daacc2324743d0af600e8fa3e97a2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the comment button is added in the annotation layer: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/comment_spec.mjs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f185908326c865f9fac642bd52cda4e783b66c3efb2e035878bf1e83fa6e8b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the button is removed in the annotation layer: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/comment_spec.mjs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7acca53ccfca975b08e6a52b596bd670352f6bfd5a349237869e8680538123b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the focus is moved on the comment button: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/comment_spec.mjs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d52ca7a895e380b6759341fb6f435d48e565bcb7e2903ffc11721eaafa0db8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the focus is moved on the comment button: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/comment_spec.mjs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37c75ea43a5f2b253b3e293f75b2d461a8c96cf61134dfe8d74cca6d9f55e7c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that comments can be selected/unselected: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/comment_spec.mjs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3c59fb007013e5aa9cec58b38dd2867e50007d6def7befc46aa8f2726ed237"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the popup is deleted when the editor is: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/comment_spec.mjs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ae3dabb64180a86898dcccc8a47ffa531ff87774edef817d523f11d20120b7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the focus is moved on the editor once the popup is deleted: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/comment_spec.mjs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"625bb412decd55e13085a4d89b36d48de47d650515a272291a6ba3f3a6b01aa7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the annotation is focused: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/comment_spec.mjs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9f38dfbf1911baa63f262fa02e4f48fe177494e69a084d63a4e3dd48d9bf88"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the comment is saved: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/comment_spec.mjs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"5549f64d4a337191c39a8d66647448b3aa56f5c3513ee48ea39cfc12b85dfbe2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the undo deletion popup displays \u0027Comment removed\u0027 message: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/comment_spec.mjs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad5995f80f5e2d328ba276234410730ef3fc88943aa322eb2dd716b94723ceb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the undo bar closes when clicking the close button: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/comment_spec.mjs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"2322a99d504a601d2858bf743a4e9aa356c511785d76c96a3eb57f363fa7f006"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that deleting a comment can be undone using Ctrl\u002BZ: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/comment_spec.mjs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e826657c50199cd04904e1ad57ebd7065c53591768a5f7a05929e5887315eb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the comment popup is hidden after redo: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/comment_spec.mjs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46c338a75d1cb5e6845404ba12f6f4841cc821e25ca5a0a414f52ef89482c6f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must close a comment popup on escape: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/comment_spec.mjs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab78d751de10af3f0c4e5fbd134564efb822c06d87ba0eb0e21af7c8084f3c2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must close a comment popup on click outside: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/comment_spec.mjs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ccf78f7fef5e9921b26ba8d6e6ebb36ee3d5703fa819ed552e27dd48196b00"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must close a comment popup on click on other highlight: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/comment_spec.mjs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9d5681a2ad8960e1dd0c427197c8f65560dd913a42ac98a8c5e68db2a15cb1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: check that text selection works: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/cursor_tools_spec.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ac1cd467a750023bc23139d102fdbcb87e15dd2ec3642ffd5183a09a714679"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: check that the signatureProperties panel contains two signatures: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/digital_signature_spec.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2711274fc72528c0c8d7d8390c19033d9c8de0e2dc78a31aeac07c8dfcc9d98"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: check that the document properties dialog has the correct information: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/document_properties_spec.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d57897f0ea1ee3729f0cc9328d6c105baf1b49a472d35dd9ac004ceb9b92c0e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: check that the document properties dialog has the correct information: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/document_properties_spec.mjs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"191ab394a07bc5d64effe2ad24204d8441b76d99290cffcf30347a6bf2def7c2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: check that the document properties dialog has the correct information: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/document_properties_spec.mjs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8d10c54bac9d4fd8ed3ff50cfff67e596f2c7dd5aedb3642cf3a2b02c63079"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: check that the document properties dialog has the correct information: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/document_properties_spec.mjs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d82233fe899ab22090601d5d76c51e037cee272bef02c3ef4ef5cf60eb19901"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: check that the document properties dialog has the correct information: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/document_properties_spec.mjs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0254af156bc5666a26084a233adf10a6b85b22bdd3b7a0c81acc995fd71cfcb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must handle no search results being found: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/find_spec.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d4dc6df5f7775ec27b18d3bf0a7e1b586850891b612198c9d5b757027c43e3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must handle multiple search results being found: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/find_spec.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"61351a58dbf33bb2062ced0fbcb8828882d48c26102369ca27b20425c14a34c2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must find search results in the XFA layer: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/find_spec.mjs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec808e98615da4315e4feb6949e928f5ca7b4a5b6386702604b6de0970a42fbf"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that a paste has been undone: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/freetext_editor_spec.mjs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac06aadb2b67cf88e6523b780d99c25123f60dc381c9071031c32050bd3388f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must not remove an empty annotation: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/freetext_editor_spec.mjs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb44dfc3267d5cbf06dde3e76e0560103dd53ecc83fb2a9c129c0c6d58fe9e62"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must hide the popup when editing: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/freetext_editor_spec.mjs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b862d6ef07b75db9069e34abaf3f894e5e7b72f26208ab67b717ea714060040"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the shortcuts are working correctly: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/freetext_editor_spec.mjs"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aace8924c6ddfbe64d105d104520aa89baa70528740b9d6da85cde3cc3cecd7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that a deleted freetext can be restored: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/freetext_editor_spec.mjs"},"region":{"startLine":2320}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f79b7e1a62de51cfca86a962e2c726ec92630fc91581824fb816475da684c7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that a freetext is deleted: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/freetext_editor_spec.mjs"},"region":{"startLine":2625}}}],"partialFingerprints":{"codehealthFindingId/v1":"d122dc5e6a2757e94949454d87b4e7bacc21d315f08c9b71af26b3b308b0c375"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that freetexts are deleted: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/freetext_editor_spec.mjs"},"region":{"startLine":2668}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e290f7837a7735731d484d6ce54e55945728b23933cea88c11423c8d6718db"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the parameters are updated when undoing/redoing: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/freetext_editor_spec.mjs"},"region":{"startLine":2819}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da6acc1dae6d8a815f899618897cf46e45a3e7a6af01f18e05500720733db27"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the annotation layer is visible after a rotation: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/freetext_editor_spec.mjs"},"region":{"startLine":2886}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a5b554cdace0a364446b62b89f61746957702813818184d22b05eb3208a63f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that a freetext can be undone: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/freetext_editor_spec.mjs"},"region":{"startLine":2920}}}],"partialFingerprints":{"codehealthFindingId/v1":"08babf17430bfe580d8d69645f9d6650e2455307eebf3e3e87f10924b02171d1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that a freetext can be undone: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/freetext_editor_spec.mjs"},"region":{"startLine":2969}}}],"partialFingerprints":{"codehealthFindingId/v1":"12861aeacd6777d83c04cd9ad2ed8c1adbd650b5855daa54a21e53b441b26ff0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that deleting a FreeText editor can be undone using the undo button: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/freetext_editor_spec.mjs"},"region":{"startLine":3288}}}],"partialFingerprints":{"codehealthFindingId/v1":"0088319f07d2a72458d2b284f68242a04bf2bd712e9b4bf5ef293ce621b75a33"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the undo deletion popup displays the correct message: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/freetext_editor_spec.mjs"},"region":{"startLine":3316}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9e9e34af30c52d91765854207403258a1fadc93c30f00a1b565c672dd7f17a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the popup disappears when a new textbox is created: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/freetext_editor_spec.mjs"},"region":{"startLine":3337}}}],"partialFingerprints":{"codehealthFindingId/v1":"d743be2fc2f55e841af3d6c90ead447882af6ee540d4f4d938e8a78177cb1ad3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that an added Freetext can be edited in double clicking on it: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/freetext_editor_spec.mjs"},"region":{"startLine":3425}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0d43ec1bdb17cc0d9933b2c54c49ba5f8b0eadc6cde65958b908de54440d3f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that we switch to FreeText in clicking on a FreeText annotation: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/freetext_editor_spec.mjs"},"region":{"startLine":3460}}}],"partialFingerprints":{"codehealthFindingId/v1":"8892d121bba0333fe63aa7566ae0e873487a0aceedeb872a65c63e4ff0433926"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the text color is the one chosen from the color picker: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/freetext_editor_spec.mjs"},"region":{"startLine":3520}}}],"partialFingerprints":{"codehealthFindingId/v1":"658f7b42a99be9eb58388bf290c9a085c8b586063192535354d5ff52351c0f6c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the annotations aren\u0027t displayed after scrolling: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/freetext_editor_spec.mjs"},"region":{"startLine":3564}}}],"partialFingerprints":{"codehealthFindingId/v1":"6888d88a19490607a89f558083b8611650d8b18f930967213a4221eab6b9291e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the buttons work correctly: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/freetext_editor_spec.mjs"},"region":{"startLine":3621}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49bbd6ebdccd0c5a53d8696c0e3159637cd21fb9c7f39a22af2f90b74cd2442"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must scroll and check that the draw layer is there: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f515cf4c1b939106f5f2b8787ebbecdda5c06e4fdb0c7cbf56fcd79b4947c4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must scroll and check that the highlight is selected: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2382b9a06ed25f3082b2600c7199844163372019d3cd11fd480ad16d1076b3ce"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must scroll and change the color without exceptions: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"58298fa8608384c5286d9dfc2ee663b47945df31dc50978792f6eca5861cdd18"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that we can use the keyboard to select a color: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"09275f82aa7de6703644db8340a78cd38be1c2d0ab329c2fca717890e850bf69"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the dropdown is hidden: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5256b06ecdf01555482516a61309009c26251ba126d131f345422102010c21"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that editor is unselected when the mouse is down on the text layer: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd21b56fed0c9c32f8e6a472f1d2cc20a51686313b25022f6a0ee3ae9652d20"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the highlight has been deleted: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"932cdd571d8e7dc99ca9b83f79b8768b228f38fbb3aade3c6754df81d2274466"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check the thickness input state: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"199b2eb3580315b8737c3143cb250da71613874262a6b7e062c57fc1d8de031c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the highlight editor is unselected: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae36701d6a12953803447124c815d2b147bda22327a57e3ffcd0f720d0697d5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the highlights are correctly hidden/shown: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"920aef2f9e4ed66e9fa9146bafb465c1c27f653671e5ba0f2704cb5b238a1d8c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check the focus order: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d739f39113095817870c8d013d9b78ccc2ba341df4797d1a15a37fe333a33b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that a highlight can be undone: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9b14efe2dbca32e9757cc1282147d5f6fb2100c710da4168ed5ca4bd9fcec9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that a highlight can be undone: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf527a60dfa0bd562f38096d7b9ec34851f7bce70f37461a0ab7e2062a68ab9f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that a highlight can be undone: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"26551ae83278d71ed662c1a0ce782947d7b8e99d4171a1a900974cd0e93fddd3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the toolbar is usable: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"077101789fd128cc00e72384060dcb3e55fac5c77bf24739f13fa1147be00072"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must change the color of an highlight: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf197305683794063ee2478ea64a2b771e28426ffdcbc3833c2341692daec8e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must change the color of a free highlight: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"209d1b814f0956aa4768efe634a4762f27bba342d2816d084eaac83c2ac69e0c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must enable \u0026 disable highlight mode successfully: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2ddce9537dbb1c143499a707c9deb3b017a6e999253158d1d2d606921673d3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that deleting a highlight can be undone using the undo button: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac00b5dbedd715654f34da92ba1e95657adc0bce70270ec49b682be7c692def"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the popup disappears when the undo button is clicked: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2176}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2c3131fd13c59e0e021450e79505ac1d640b09168b7e9cebbc0ebb117193bf"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the popup disappears when the close button is clicked: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"2589007cb61bbc91cbfb0e1ad9dc1d357a15b508fd8490103f041c3ac6165b0a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the popup disappears when a new annotation is created: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af6ca55b1d48d09280a8a7dc3f5e0c40df5ef95730953ba330fa0d8c9f66f6e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the popup disappears when the print dialog is opened: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b8c851e89a13f25735bf92fb1be499bb9d65c683fdd8cf3a75453fcb1b036e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the popup disappears when the user clicks on the print button: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2263}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff882a42d597b9601243ffbdb8738c8e50967e654d685dfabdac903427f3b06"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the popup disappears when the save dialog is opened: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2282}}}],"partialFingerprints":{"codehealthFindingId/v1":"31458bbe8a76b526335cbbcfd6fd8c34265527ea2e237ca1e2c45c1adaa6c5f0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the popup disappears when an option from the secondaryToolbar is used: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2301}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e551d530403b729efe354c5d3799c65edc1e4f480704f6a766b51c73e8ff49"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the popup disappears when highlight mode is disabled: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"69319e1d00fc616560647b27b0de0b4d3b9d110b0e13abbe4993236503b0d57d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the popup disappears when a PDF is drag-and-dropped: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2340}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0f24c71c19106fc596c183e1de30af0b6c647be0aa85b38928662cf63af2e7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the undo deletion popup displays the correct message: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50fc43bef570ac1180e0bd5640b10b4687d6ea3f58f4f4776941268d9dc58c5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must display correct message for multiple highlights: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2414}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03d25f43533772b18f55b82830f3ad9c0cfd07449f1ccdcc401aa14882ebf76"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must work properly when selecting undo by keyboard: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2435}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee0139b1c933d97239a909d80364a30abb929709c3af7ae97bf7f99fe3ef27a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must dismiss itself when user presses space/enter key and undo key isn\u0027t focused: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2478}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbeaef8a6683e3e04f084e2d380790003171f9bf7b0a8e995e3ab54dd9d9804"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that there is no scroll because of focus: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2565}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4961ba9dd6ab8ebf04a179cf3eb4453270e8d7c8561708c2929fb87acc8a5c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the color is correctly updated: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2601}}}],"partialFingerprints":{"codehealthFindingId/v1":"866280763c180456181c46123df008f26fadda1d5c6bc0b6798b7909de6e5f4b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that no extra annotations are added while in reading mode: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2773}}}],"partialFingerprints":{"codehealthFindingId/v1":"54729c41481d81841d4a41ecb50547b374f15324ce17dbbd33f87025e0ebe740"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that focus move from an editor to an other: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2831}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ddd12347a8d0f7f885bdda37e2e92bb984bde529568aaffe5875100ba1cf5f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the freetext annotation can be reached: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/highlight_editor_spec.mjs"},"region":{"startLine":2888}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa15c8e8038642d9d35465d1c2c7d3f29d80de3df9716c866a060010bec3af6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the editor layer is disabled: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/ink_editor_spec.mjs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b60fe69d6d69594536fe0cd90ffd9250e25ad13ee55736c48b4dbb0b3e4b229"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the ink editor is committed: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/ink_editor_spec.mjs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"194a6fa25f63f5fc74f1c84641cfdddf3e2487e129475e16d6cb71b9a2584cc6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that a draw can be undone: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/ink_editor_spec.mjs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"248308a548bb5adf7838c7c9175f3ef1d35776d2125cb589a12dac382df2540c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that a draw can be undone: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/ink_editor_spec.mjs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf79d3f82518ef3ec945731d41b9b7325be23cacbb57bda26c58b0eeb9ec940"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that a draw can be undone: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/ink_editor_spec.mjs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec2203298ef45cd3fb2f8ff24593c487863e15e71b463f0ab643ebafd72dae8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that we can draw several times on the same canvas: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/ink_editor_spec.mjs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"700fc9327dc412cb9e9b50232f890bac6b3faca1b23898e1de3ac355a29bd05f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the deletion has been undid: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/ink_editor_spec.mjs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"82736ab1988f53a792eb2b92ffeddd3dd0bc8d1be8cf4606c50c42e3a08e301b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that deleting a drawing can be undone using the undo button: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/ink_editor_spec.mjs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"628e1cefa7c9a818c074c0377b9c83e31828a206fa07adc729291d45b756c5bf"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the undo deletion popup displays the correct message: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/ink_editor_spec.mjs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"62eedf26c4d0726b09071173c5d1d29cf426c58043b33db77eef98ca61f09516"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the popup disappears when a new drawing is created: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/ink_editor_spec.mjs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37c158f05799020ef523a6266588806d4fdd1ec2c1e05284940374e0e53df67"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the editor an the mode are correct: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/ink_editor_spec.mjs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae27c451fae8baf33b89f7eb300d8deeacaad1a10251e04bd5f7ad85aff1a4d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the stroke color is the one chosen from the color picker: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/ink_editor_spec.mjs"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7936acae19d1a118f4ecdfe371e64c11eb3ecae429692afc86fcbda7ff19c0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the resize session is ended when the finger is lifted while another one is down: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/ink_editor_spec.mjs"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44e3eb06f40fd9763ef6553da3e31f9c05d4fddb0b8b548eaf59b87fb001527"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must end pinch-resize when one editor finger is lifted with another finger elsewhere: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/ink_editor_spec.mjs"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"807eee46769c5627ec1f31acdcc508462ac88bb1566f72431cd9b5ffe3f8335a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the tap following a two-finger gesture selects the editor: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/ink_editor_spec.mjs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"4186ceaf4351e4e4fc31d2fea002fe6d5db5cf83352010f789e1adc6448b2cf6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that removing the editor being pinch-resized ends the gesture: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/ink_editor_spec.mjs"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e4bfb05e874f94af15385ea84ebf09768016c5dbaaba90602c075c4061d488"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that changing pages using arrow keys works in presentation mode: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/presentation_mode_spec.mjs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"54998a9b885d8429ec6f1e5de6f2b6e9eb05d17bb08dbd7d311f6b2eb4c31816"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that changing pages using mouse wheel works in presentation mode: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/presentation_mode_spec.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"daae19130a74c32a81bc5da99d115be1efdede24a2dc6d4f14ef8b21a984b240"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that changing pages using mouse click works in presentation mode: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/presentation_mode_spec.mjs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9bdf5a4f8566335777f19c475ef052daf747ab062658c71894876409ae0d7f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: check that clicking on internal links work in presentation mode: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/presentation_mode_spec.mjs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"16aaf0c96386fae8b82749ff833d00179705bfbe75c9b92a71bca63a395cb74a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should show a drag marker when dragging a thumbnail: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"a187a2dab202a361d522f6dd107527a217df7a30e12a202ed316458477b32676"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should select the dropped page (bug 2010820): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f6cecd7992e0c4066d202a9c7cd0be04ac8c9882d5efbe0ce271fbfec9cb64"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should check that find navigation is not blocked after moving pages (bug 2023150): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a77f6d3232e971015b9c2ce706414672d13a5168f0e01d4468b57e8493ed55b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should check if the drag marker width is non-zero: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3b7e62fd3f0ebee2074a6ab4b62888a68bb9285e9a1f1bee73148f399591ac"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should check that the paste button spans have the right l10n id depending on their position: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe0189ef4d011c19d5e5388c73545eafd825ac8ee86c0657dc3edf96fada802"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should disable delete and cut entries when all pages are selected: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b39fd28266f6e67233fa45a40e2f42496afcf22248b766bcfa84fcba060cfc0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should check that the thumbnail has a blob src after cut and paste: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bca2cd3546d00efcda4faed367ccc9d79a44732451bca450724f607cd770ed"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should keep focus on a thumbnail after deleting pages: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3f2b67a3ab8c805f722115c01e2868d666e480538c4d64a54a159e3fbecc3f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should keep focus on a thumbnail after pasting pages: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7ab4e79ae4e3600e8badbc3b7f524cf05d532f10544ad4c391e49fec5b5565"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should focus the newly pasted page after copy and paste (bug 2022516): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"887f34b2336ce9509328395d37beeb9ce8b0c577533d3f9247ee78de46973fa6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should focus the newly pasted page after cut and paste (bug 2022516): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"724b156f41efbfbcea67a2fd779735424cf0d6fa333f7affb727f68d7e9274f1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should update the status label when thumbnails are checked or unchecked: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"67edc40f380f4dc1671d869c48546fbe6dfae745c0cbf1b2e200eca4b43d3074"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should deselect all thumbnails when the deselect button is clicked: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd631225636aecf3dcac9c8afbfd775835c6ae07194333d7c002ee4e8174e49"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should show the correct undo label after cutting one or two pages: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":1808}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a748199f4c1766ef5d5d0baff30cb95043b0cc2dc3e564c21829d9695d52049"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should show the correct undo label after deleting one or two pages: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"360dc8d775eab46318b43d462170d131c5c756fa6ff9394bd3907e57c6def9ab"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should keep the pasted thumbnail visible after dismissing the undo bar: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1499f5fe2ce07967ead9e8e1675eb4761570952261c6c64a1146c034c1adfc"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should hide the new badge when a page is selected and show it again when deselected: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":3162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef0f6c29ea5862e845818253cf9ba5deb1bba0d70471ccae220532c5074b200"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should hide the new badge when dragging an unselected page and restore it after: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":3191}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c08d1cc1eded7c71c21e8fcaad790941a74b8c121b2ea019663aac07d23c7e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should show only merged pages as selected when a page was pre-selected (bug 2034111): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":3507}}}],"partialFingerprints":{"codehealthFindingId/v1":"381cf31516b95acbc4e51f2fe247820eded46fe8799d898a6ed3eecf8244eec7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must format the field with 2 digits and leave field with a click: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/scripting_spec.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c8da6ceafdd8e02ddf3513367a7f4bb573b108f628202d43c8ada8d092bff4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must format the field with 2 digits, leave field with a click and again: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/scripting_spec.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4d8a041d65c69217e2f3734482a2e4ff60adb06baa4647d90a8834a1d2c446"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must format the field with 2 digits and leave field with a TAB: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/scripting_spec.mjs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd231ccac251166f827904148980e3a0673f76a81fc57305d2cc557769f7ab9a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must format the field with 2 digits and hit ESC: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/scripting_spec.mjs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"14441fb580576e548a287156d768ea069687cdc54b94cfc193c5e76fcba46f98"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must format the field with 2 digits on key ENTER: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/scripting_spec.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"689c6238fdd1d62718337f81abf74e946d471bf2122f90713f657821a15680af"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check input for US zip format: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/scripting_spec.mjs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"742679462d300f41b31cfadf792bcd7f70256200b78ac053e393e26020621e79"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check input for US phone number (long) format: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/scripting_spec.mjs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"72076c727c9aea661350aa6b1907cd16acdddbe668bf534d02abaec9f0ca955a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check input for US phone number (short) format: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/scripting_spec.mjs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03d312f5b0858ca0ef30b9885ef6c0de9e4b24e766bc8f289d62d5fb0c86a2c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must convert input to uppercase: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/scripting_spec.mjs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"78378940b1b8644d0173f7e8db17afa581217c245b7100966450c8ca38bf143c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that an infinite loop is not triggered: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/scripting_spec.mjs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ae1d4c1d9cdb7533d5c0c613919ad384b1af92e3d4193be2aa6606c791c0bf"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that data-main-rotation is correct: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/scripting_spec.mjs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"c554585ed620518ac94af3b0f15b7ddf5c453e50bde1ca6936ad245f83d53ab6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that a value is correctly updated on a field and its siblings: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/scripting_spec.mjs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"377f0ef408c716dc6a070bad08920a71042a0dc3965e3ff54deaa5b9f701e3b0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that charLimit is correctly set: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/scripting_spec.mjs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7f5b675e54d428a37233fbd2222a04bd331c6bec1ebdcf991c35491ce73ca4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check if printing is triggered when the document is open: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/scripting_spec.mjs"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"d389cd40cd4f31bd334e5de3a0adecb9942f473b51d779998128c36540771cfd"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the product is computed although a callback threw: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/scripting_spec.mjs"},"region":{"startLine":2604}}}],"partialFingerprints":{"codehealthFindingId/v1":"124e1225c454ce2f5289c781a1c53251f575b1aeab7006a130ae9778affa6edb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the computed value is correct: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/scripting_spec.mjs"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"85afcfcf3fcdf47a4af06d90bfd8a4587298c7a81a685de55e7917c7324845b4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must expose the Opt export value of checkboxes and radio buttons: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/scripting_spec.mjs"},"region":{"startLine":2991}}}],"partialFingerprints":{"codehealthFindingId/v1":"27516e6aee37569e70bef4a6332a9d6550291161ff87fb42adec138a7561f286"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must expose the Opt export value when the parent has no Kids: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/scripting_spec.mjs"},"region":{"startLine":3015}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd37f717957f59cbf106d7320add4d55ab1ef0949fd63587eede7f6cf00db7e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the editor has been removed when the dialog is cancelled: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/signature_editor_spec.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"05635efc643547deb951ff9fb21a96da11818a5746f1c38afc76d4a84738763e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the error panel is correctly removed: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/signature_editor_spec.mjs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40df0dbf6c40ed50bcdeb186656fe8d030b56118ad669e69f31bed4c19de8a0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the signature save checkbox is disabled if storage is full: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/signature_editor_spec.mjs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb18c3724dd782c9d5474b863b5241e2a1f85bcf1eabb62bbf3d0184f311cc74"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that an error is displayed with a monochrome image: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/signature_editor_spec.mjs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"480a66cad6595c9e2bca849100a0622faa8d19ba2c16cb959977f5e045cd4428"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must load a SVG, delete it and undo: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/stamp_editor_spec.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"6052a0a57fadd696769e552603395b8756cb537517a8eab4d06299a4e9de09b2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the alt-text button is here when pasting in the second tab: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/stamp_editor_spec.mjs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d20df2e65afbbe40e66661cf4f531b33fc9ecadc0288696879ab2ae2a47ab9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that a stamp can be undone: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/stamp_editor_spec.mjs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"643dbd0e67587c51d982b3fa0a3f1229f3fcf6a1e9ab9abaf8c202e09d67f4d7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that a stamp can be undone: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/stamp_editor_spec.mjs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c936715fe24f6fffbeee3c8d01023ad12130e00c05fcef5064d6ef6e57c2fe"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that a stamp can be undone: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/stamp_editor_spec.mjs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe8d16dba2a908be5b35252e6e00d0932c4facd39837c98041cc01da8332889"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check the new alt text flow (part 2): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/stamp_editor_spec.mjs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2ba1b2a76816de928be68e1242695ce32e54728c7508d709cbc436f416834e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check the new alt text flow (part 3): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/stamp_editor_spec.mjs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"404ee83370ca413ec5572c0ff6f9e212e86e5ac4ebb8897cea71e657bb8710a3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must hide the alt-text settings when there is no AI: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/stamp_editor_spec.mjs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf43fad2beff0825b7b8f226dbda21f6b9dda5f66a85167bebdbb9b966c193a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the toggle button isn\u0027t displayed when there is no AI: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/stamp_editor_spec.mjs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"36009319fde75c81a564d4cb170a3534db821b17eba34559e1583dd4851c5205"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the annotation isn\u0027t unselected when an other finger taps on the screen: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/stamp_editor_spec.mjs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c56b5fd573936f693a34e24eda77817207baee40ac846547015d302de87911"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that deleting an image can be undone using the undo button: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/stamp_editor_spec.mjs"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"14930f4973daf43d439017d1b84306eeab826d96c62ba5d9bdafaabebb664411"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the undo deletion popup displays the correct message: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/stamp_editor_spec.mjs"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0d9ed307d31bb8e04ee7137c5e6711f093c1eb0aea554558f657eee0284fc8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that the popup disappears when a new image is inserted: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/stamp_editor_spec.mjs"},"region":{"startLine":1709}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f2ca64965a964f56f92b8b6dcd2b8fe04554914436f7ab6944cb033b822393"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must move on the second page: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/stamp_editor_spec.mjs"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac8d02a22075eb4a37c84f344bdd94469e9b22c366efdb705782066e2546890"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must move on the last page: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/stamp_editor_spec.mjs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ecae0db33b172138c1cad73a207aa1fe5ce4440b266606733e08d343ce1ab8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must switch to edit mode: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/stamp_editor_spec.mjs"},"region":{"startLine":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4b6aa78717885b3024850278f96302cde1dcfdcf33a0ed7c08cc868b7ea282"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must move a stamp annotation from page 1 to page 2: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/stamp_editor_spec.mjs"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"563071be9ea86208326a4546b456a084d4f388d390b70543edaa3192f381f26c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must create a free highlight when dragging on an image placeholder (bug 2034980): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/text_layer_images_spec.mjs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"15513261cb4331033bd74316d5907f0e8cadd766d5fb95033f3dfa07b1c62e59"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must create a free highlight when dragging on the empty image container: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/text_layer_images_spec.mjs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"957e5f85bc4a76a3a569b1a0cfb00cd0ba84b2dda2eff8f8dc7c2bc4e4ae6cad"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: in a single page: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/text_layer_spec.mjs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb17f6bd299119ca78f763be62793e3992913ea2a3d99989649b027d7145cdfd"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: across multiple pages: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/text_layer_spec.mjs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0da9ae8a10ff1754ec20629c97413ae908a70cca48e13b655e04dae10fb30f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: in per-character selection mode: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/text_layer_spec.mjs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"219af6706e04bc9dcc51fc454d092686c74b0cf3f26be638929dc4e1e7d46778"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: in per-word selection mode: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/text_layer_spec.mjs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"49337fe35df54c80b5c20a18f78aa3a4981ff7a0c3a84ab90ffbfa698976c0f4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: allows selecting within the link: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/text_layer_spec.mjs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a48113e041607b122511f26cabffc559007d2adc23b4ee5319b44fd82e295b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: allows selecting within the link when going backwards: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/text_layer_spec.mjs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"41396819cea0760d33453d2bbd16d29ac4fd1a59b4532f11ce7b37499a0acbff"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: allows clicking the link after selecting: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/text_layer_spec.mjs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26e1e31927cbe25c5769d330b3c621c70b67e368efd60ef01fe0e845cf28cca"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: allows clicking the link after changing selection with the keyboard: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/text_layer_spec.mjs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"be99a8ee4e312275496d3f551fd6748473ba539015f46f1dcd63fe0561a4afe8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: focuses the field with a single click: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/text_layer_spec.mjs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7283dc01e1bddd86213b006aa8942ad54c124352cbda01b69e375c760fd418"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should render thumbnails without errors: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/thumbnail_view_spec.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6354a1c296ab2048d96e05afd3a72a8d01266c68abb970d6a8dbcc29f18bfb84"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should scroll the view: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/thumbnail_view_spec.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"84545c159af3460cb7470bd5360a69e89bdd32112566951896a09f08f2226ee7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should open with Enter key and remain open: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/thumbnail_view_spec.mjs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e23681e433308d84c29e93d4c80067cb858e5da17331238b579aa3fced3c13"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should open with Space key and remain open: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/thumbnail_view_spec.mjs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82d33204f68759759aeb9fe719a3ddfbc3852a25dea9c97b2eb39ce2cc67736"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must move to the previous item after pressing the End key: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/thumbnail_view_spec.mjs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"44084a98225349bae68382cc40869a9737887e48afaae97ada9cd88f960c08c5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must move to the next item after pressing the Home key: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/thumbnail_view_spec.mjs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"b197ba5ec20ca5908872c2f5a69b7487e22e282c757bc3cc7774e8f56e445164"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should have a title on the checkbox: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/thumbnail_view_spec.mjs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d30fff0bfe374a46c03f065c4cb89ecaa8346766991a3de02d7eefddc7a564"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must navigate menus with ArrowDown and Tab keys: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/thumbnail_view_spec.mjs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5b0157460886d417f706adcedfaecd3caf6a4e04af51b411426f1067fae7c1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should show the manage button in thumbnail view and hide it in outline view: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/thumbnail_view_spec.mjs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d2457a724e82d63d5d6873f49efb51458dc381fd326fa33321fe89f6a76a51"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should focus checkboxes with Tab key: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/thumbnail_view_spec.mjs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d39229a3ad9e439dd2ed56553c26d16df51e26cb0038254dbfccca3916793b7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should navigate checkboxes with arrow keys: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/thumbnail_view_spec.mjs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1984b7ef17602a68327ab77255957eca9e40ca4b307b787650db93aec45289"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: supports specifying a custom origin: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/viewer_spec.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2272a8b1f9573182349627f456d7fe02b66842adc49c857c00a05e69285eff7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must check that we can zoom with the mouse wheel and pressed control key: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/viewer_spec.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"7731736c539381f5a9418d1a1efa7a383a12ffd63e0146f22c1389163bbace29"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should navigate to the correct page when clicking an outline item with an SE entry: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/viewer_spec.mjs"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d35a444d7ff73330941ff9f76cdf750ae28c5a871a4b63b7d40f0687fa05ff"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should restore all layer checkboxes to checked after unchecking them: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/viewer_spec.mjs"},"region":{"startLine":2345}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1d9d1fdd0768233c8e7fc43b4a0ff272fe512be20514a7bea18f4db5c2a86d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: must load a PDF picked through the file input (blob URL): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/viewer_spec.mjs"},"region":{"startLine":2566}}}],"partialFingerprints":{"codehealthFindingId/v1":"39426526c17c791327222d56cb98b95ce3e5d10092e20d2d02b3f2c254c18e4f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: (unnamed test): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/benchmarks/bench_utils.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0fc19cc2030e445163e3356cce888fb254076b8c1d77fcdade009c645a0193"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: cancels and cleans up before the renderer worker is ready: This test starts work it did not wait for (\u0060gate\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise(resolve =\u003E {\n          setTimeout(resolve, 0);\n        })\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit/api_spec.js"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"325fea8cbc638570cd2485da1071b1d77e2bbb079ab9f6ea0dfe7ffd99a9c387"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: should read using a reader: This test starts work it did not wait for (\u0060reader\u0060, still running when the sleep starts) and then orders itself against it with \u0060sleep(10)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit/message_handler_spec.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a57f9ff3786387b9827e9dff10b02bd5b264823956dfd5aa451ac70e9ce3453"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: should not read any data when cancelled: This test starts work it did not wait for (\u0060reader\u0060, still running when the sleep starts) and then orders itself against it with \u0060sleep(10)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit/message_handler_spec.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d11c81d70422c5e89f92b5d68e35bec0320ed5d7b6e957723854a67e74311f2"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: should not read when errored: This test starts work it did not wait for (\u0060reader\u0060, still running when the sleep starts) and then orders itself against it with \u0060sleep(10)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit/message_handler_spec.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"35746c51051db3dac62f97330fe08cd81e97f8d4655a6a4a5845e3e79d0bce2d"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: should read data with blocking promise: This test starts work it did not wait for (\u0060reader\u0060, still running when the sleep starts) and then orders itself against it with \u0060sleep(10)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit/message_handler_spec.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e097c9c20300c8f9c08179289624d9a3decd515bb7b4968d28cca6834ffd268"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: should read data with blocking promise and buffer whole data: This test starts work it did not wait for (\u0060reader\u0060, still running when the sleep starts) and then orders itself against it with \u0060sleep(10)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit/message_handler_spec.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"143c2fb4888ff90d39ef3be9940ea551d4d1d28352f1a82399fc79a539735689"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: should ignore any pull after close is called: This test starts work it did not wait for (\u0060reader\u0060, still running when the sleep starts) and then orders itself against it with \u0060sleep(10)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/unit/message_handler_spec.js"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7a39302ff30fd4a9d365ffbb76f7acde102ba3676725f22834ef351569c510"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/fonts.js: src/core/fonts.js changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 345 in Font.checkAndRepair at line 1532. 4 of those changes were fix/bug commits, and the other 29 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/core/fonts.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"47915f18b8133b8a3ce0a1b0df8e4dc2c2570bf3dc8ca34e6ab90f353b9fef04"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/evaluator.js: src/core/evaluator.js changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 217 in PartialEvaluator.getTextContent at line 2353. 3 of those changes were fix/bug commits, and the other 24 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/core/evaluator.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e9d5b7ab30d0ed15d8cfc5a3f76610da4340ce7ca82637a4150936c5c235a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/display/api.js: src/display/api.js changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in api.getDocument at line 229. 4 of those changes were fix/bug commits, and the other 39 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/display/api.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d15080c5374686746255afb04cb5b064fca0c5611223ef8ea63a130613089b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/worker.js: src/core/worker.js changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 109 in WorkerMessageHandler.createDocumentHandler at line 100. 1 of those changes was a fix/bug commit, and the other 16 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/core/worker.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/worker.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c49661eec185dd21a5d69e2d0c8e1c56cfb69dcfbbbed4d4a59f33c172ac8b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/display/canvas.js: src/display/canvas.js changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in CanvasGraphics.showText at line 2803. 3 of those changes were fix/bug commits, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/display/canvas.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":2803}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2b31c7b9fb6ea03ed4104c6f85cc78fc11692859d30205d08ce9be8e463021"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/postscript/ast.js: src/core/postscript/ast.js changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in PSStackToTree._makeBinary at line 1058. 1 of those changes was a fix/bug commit, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/core/postscript/ast.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f6b235c9395d079c904df47ede13913864f3173c606877ad85bedb66675c8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/annotation.js: src/core/annotation.js changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in WidgetAnnotation._getAppearance at line 2421. 6 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/core/annotation.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":2421}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0f0bd14f4b18690a5b3abfd3ec51f7111114286d71c91a0aecc80f8e94a6e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/cff_parser.js: src/core/cff_parser.js changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in CFFParser.#parseCharString at line 621. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/core/cff_parser.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_parser.js"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c1f1030386863140e41d40fa968ce0e1cccabcd7f8826513c30ece5cee9031"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gulpfile.mjs: gulpfile.mjs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in gulpfile.runTests at line 827. 1 of those changes was a fix/bug commit, and the other 23 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- gulpfile.mjs\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":"gulpfile.mjs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"af60150e7ca74fc5dba4b60ece85009cc9dca3d8a491916be77f1d95c51bd9e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/pdf_viewer.js: web/pdf_viewer.js changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in PDFViewer.setDocument at line 906. 1 of those changes was a fix/bug commit, and the other 11 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- web/pdf_viewer.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":"web/pdf_viewer.js"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7eb1a5013f2358035845e8d3fa25cf04af425da58b9690c02f30c1aef3dfb7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/document.js: src/core/document.js changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Page.getOperatorList at line 478. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/core/document.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff42bdf4ee85170e54d9fd1b24e1e7ebfe3f04df1f38cac6467dcc72628692be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/image.js: src/core/image.js changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in PDFImage.createImageData at line 776. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/core/image.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image.js"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"42404503d872367205b216eda1a1bb21f8ee38754187ecc9fd06ae74aea45f99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/display/renderer_worker.js: src/display/renderer_worker.js changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in RendererMessageHandler.#setup at line 334. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/display/renderer_worker.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/renderer_worker.js"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a270b692bc069a9536c19fea1160964a10440347679e0174fa5a3289f9c4790"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scripting_api/field.js: src/scripting_api/field.js changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Field.constructor at line 111. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/scripting_api/field.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/field.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b868008aac14eef09ab37043f0e8927ea2c6f9d81cffe8b6b349a22a3dd1fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scripting_api/doc.js: src/scripting_api/doc.js changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Doc.constructor at line 120. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/scripting_api/doc.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15f56912195ede4ef3b49169baed229ea2c0e3eb34d111e93f71300748aa8f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/flate_stream.js: src/core/flate_stream.js changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in FlateStream.#readBlock at line 327. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/core/flate_stream.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/flate_stream.js"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45131aa1fa297b31be274e4c0367caee0ec48f63e746452a6ede75c83b96a6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/crypto.js: src/core/crypto.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in CipherTransformFactory.constructor at line 1081. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/core/crypto.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/crypto.js"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c295cae3f2cec4a62efa978805bda2edf990da6183d8727ede5f059ec545fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/pdf_page_view.js: web/pdf_page_view.js changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in PDFPageView.draw at line 987. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- web/pdf_page_view.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":"web/pdf_page_view.js"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc950b2f52c9a5ec676a8ce630aaae43cc1006b040f79f01d9297113ed90870e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: test/test.mjs: test/test.mjs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in parseOptions at line 78. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- test/test.mjs\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":"test/test.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c08af2316e9f8ddc67a2f788a8932622efb404c263733841b187c2d0a199bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/editor/pdf_editor.js: src/core/editor/pdf_editor.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in PDFEditor.#makePageCopy at line 2436. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/core/editor/pdf_editor.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":2436}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a00974aa89bb1beca3e86a3ef1d9b04eee71399b3729bbf739e2147a56547cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: test/driver.js: test/driver.js changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in (anonymous) at line 1068. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- test/driver.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":"test/driver.js"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57cb6c3fd00f67d5d8b5b5e72315bd7113dbe8e06d4dcb2d10c13461c6a30fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/bidi.js: src/core/bidi.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 97 in bidi.bidi at line 124. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/core/bidi.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bidi.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e63f16e867ef6c4b87251e5040331742b004d59fe71527b031ee93c5a66de5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/scripting_api/event.js: src/scripting_api/event.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in EventDispatcher.dispatch at line 109. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/scripting_api/event.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/event.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"81deb6c8868bce742956a75c941ccdc6b21969f39ed941a805afba55feceba43"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/shared/message_handler.js: src/shared/message_handler.js changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in MessageHandler.#processStreamMessage at line 408. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/shared/message_handler.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/message_handler.js"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e39a1c8148f7afd0d323b8b40b0c66dd85378e67ccbd0a6b651d56d3c38d0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/text_layer_builder.js: web/text_layer_builder.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in TextLayerBuilder.#enableGlobalSelectionListener at line 227. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- web/text_layer_builder.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":"web/text_layer_builder.js"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"23df7b5fb60e8a79aaf6bf1106faf0e8885bd9b89a7b3820e487e36720de67a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/display/text_layer.js: src/display/text_layer.js changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in TextLayer.#appendText at line 307. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/display/text_layer.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/text_layer.js"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"6046bd8f0dcb53de0545f152e5545ffc67ec0762cb384459f6135d4af51d6064"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/pdf_scripting_manager.js: web/pdf_scripting_manager.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in PDFScriptingManager.setDocument at line 90. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- web/pdf_scripting_manager.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":"web/pdf_scripting_manager.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1949d340826d6a04c211e3ef32937313d69cfae9d274fe364be7a087d132354a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/pattern.js: src/core/pattern.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in RadialAxialShading.constructor at line 162. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/core/pattern.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pattern.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"19559e858ffd2b86a0269e71e1e04593cd505e2338992eb6c891dab1fdc49192"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/pdf_find_controller.js: web/pdf_find_controller.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in PDFFindController.#convertToRegExpString at line 680. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- web/pdf_find_controller.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":"web/pdf_find_controller.js"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abbe383fcb88bf085df706b5ea0fc92e26fb6c4235e3e3c7f75f65f4fe14009"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/writer.js: src/core/writer.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in writer.writeStream at line 54. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/core/writer.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/writer.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4846528af35adf275b85393df54122b0ba5d345b845242b9f757d81b220e4acf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/display/object_handler.js: src/display/object_handler.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ObjectHandler.resolveCommonObject at line 43. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/display/object_handler.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/object_handler.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b1c01c3f97dfad3cff472094f8a8a6062b789a9c47cc4ea7c80963e8c03c6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/chunked_stream.js: src/core/chunked_stream.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ChunkedStreamManager.onReceiveData at line 434. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/core/chunked_stream.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/chunked_stream.js"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"819a746533b23b5613b341bbfd708ca43edf5a3f6aed0cb96f3d2db842686584"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/pdf_thumbnail_viewer.js: web/pdf_thumbnail_viewer.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in PDFThumbnailViewer.constructor at line 185. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- web/pdf_thumbnail_viewer.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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e020c8c1d53058df9f27db38c3efe9591521a911bc6871d02b8f6ff95ac81e04"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/xfa/layout.js: src/core/xfa/layout.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in layout.checkDimensions at line 262. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/core/xfa/layout.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/layout.js"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fc42f84aff556e0975359dad9a592a1cdbfdd138449f4b800af3d9feea2264"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/struct_tree.js: src/core/struct_tree.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in StructTreePage.parse at line 1031. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/core/struct_tree.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c1f2aaf4cd2ddfb90e655b02ef0636eee7cab0634d329f67bed62838bc3ec8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/xref.js: src/core/xref.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in XRef.readXRefStream at line 347. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/core/xref.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xref.js"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d733ad1fbb75bdfe33d96afe593b205d83101a5a8ebf1804224e4066d668a0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/core/string_utils.js: src/core/string_utils.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in string_utils.stringToPDFString at line 67. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- src/core/string_utils.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/string_utils.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d237ae119b1508b29e2c61c310d72952dfd08679d8e5856f77fe011992b458cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/firefoxcom.js: web/firefoxcom.js changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is ExternalServices.initPassiveLoading at line 736), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CReport PDF modifications to Firefox (bug 2076546)\u201D; \u201CDefer the Firefox features notification until after first-page rendering (bug 2072145)\u201D; \u201C[GeckoView] Add typed signatures (bug 2069485)\u201D; \u201CUse platform print-to-PDF for FreeText appearances (bug 1794809)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- web/firefoxcom.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":"web/firefoxcom.js"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1a8175c73719473e85d0b6e5d8550a8beb04e45459c04fe8e2a928d9bb742b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: test/integration/reorganize_pages_spec.mjs: test/integration/reorganize_pages_spec.mjs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is (anonymous) at line 176), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CReport PDF modifications to Firefox (bug 2076546)\u201D; \u201CUpdate the thumbnail status label and controls together (bug 2080269)\u201D; \u201CFix the adjacent-page reordering integration test\u201D; \u201CFix intermittent reorganize pages integration tests\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:16:35 \u002B01:00\u0027 --until=\u00272026-11-13 22:16:35 \u002B01:00\u0027 --full-history --no-merges -- test/integration/reorganize_pages_spec.mjs\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":"test/integration/reorganize_pages_spec.mjs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d13dd2d535316768f7c66d8a2ea1c58b3feeafee1e063c4b99941c0d6392c1"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 31 significant file(s) lose their only recent owner: src/core/parser.js, src/core/xfa/xfa_object.js, src/display/dom_filter_factory.js, src/core/chunked_stream.js, external/cmapscompress/compress.mjs, src/display/dom_utils.js, web/pdf_document_properties.js, src/core/primitives.js (\u002B23 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cc864af70b765a9bf81fc8a757f2fad2ab1a37e61e9517112c36524e42583ed8"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 15 significant file(s) lose their only recent owner: web/internal/multiline_view.js, src/display/touch_manager.js, src/display/editor/signature.js, src/scripting_api/event.js, src/display/editor/toolbar.js, src/display/webgpu.js, src/display/editor/ink.js, external/ccov/coverage_search.mjs (\u002B7 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"96a10e0755f6f523fd13e4611d1336fc8491290bbbd6def21ddf35471bb4ce4b"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060stringToAsciiOrUTF16BE\u0060 spells \u0060BE\u0060 where 12 names in the project spell it \u0060Be\u0060: 12 of 13 names in project pdf.js spell the token \u0060Be\u0060 (12 of 13; unit: names in project pdf.js containing \u0060Be\u0060). Peers: Annotation.mustBeViewed (src/core/annotation.js:917); Annotation.mustBePrinted (src/core/annotation.js:932); Annotation.mustBeViewedWhenEditing (src/core/annotation.js:937); WidgetAnnotation.mustBeViewed (src/core/annotation.js:2092); StampAnnotation.mustBeViewedWhenEditing (src/core/annotation.js:5418). Rename to \u0060stringToAsciiOrUTF16Be\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/string_utils.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e2d260836b429297a614de25d9f42f48f6fc21085b5c02b9ca416e48bebf0a"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060#docID\u0060 spells \u0060ID\u0060 where 191 names in the project spell it \u0060Id\u0060: 191 of 193 names in project pdf.js spell the token \u0060Id\u0060 (191 of 193; unit: names in project pdf.js containing \u0060Id\u0060). Peers: preserve-referer.forgetReferrerEventually(tabId) (extensions/chromium/preserve-referer.js:61); preserve-referer.setCanRequestBody(tabId) (extensions/chromium/preserve-referer.js:75); preserve-referer.setCanRequestBody(frameId) (extensions/chromium/preserve-referer.js:75); preserve-referer.canRequestBody(tabId) (extensions/chromium/preserve-referer.js:84); preserve-referer.canRequestBody(frameId) (extensions/chromium/preserve-referer.js:84). Rename to \u0060#docId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eaf8f0f8190e6758bd9fbb89a5dac4c4221b2a05491f1e013abb742a409eb95"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060docID\u0060 spells \u0060ID\u0060 where 191 names in the project spell it \u0060Id\u0060: 191 of 193 names in project pdf.js spell the token \u0060Id\u0060 (191 of 193; unit: names in project pdf.js containing \u0060Id\u0060). Peers: preserve-referer.forgetReferrerEventually(tabId) (extensions/chromium/preserve-referer.js:61); preserve-referer.setCanRequestBody(tabId) (extensions/chromium/preserve-referer.js:75); preserve-referer.setCanRequestBody(frameId) (extensions/chromium/preserve-referer.js:75); preserve-referer.canRequestBody(tabId) (extensions/chromium/preserve-referer.js:84); preserve-referer.canRequestBody(frameId) (extensions/chromium/preserve-referer.js:84). Rename to \u0060docId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"431584167a25730741536122ee50faaf63be9d6e441626025a3058265135a768"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The value can be one of the exportValue or any other values.\u0022 repeats the code it sits on: 3 of its 3 words (value, export, values) are already in \u0060const option = this.data.options.find(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":2462}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e043f7b564382c9e4a7a1037881d9bd004bfa95da4a505fc4d258313adee307"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022switch\u0022 only labels the closing brace of the switch. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":3740}}}],"partialFingerprints":{"codehealthFindingId/v1":"212a012de075b983638049be6ef98defdaba426db377a7a64480dac34cb413c7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022while\u0022 only labels the closing brace of the while. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":3746}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2152c220015e773e55633db18ee4f600e6071eba749c6639863cad96d555062"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022usFirstCharIndex\u0022 repeats the code it sits on: 3 of its 3 words (first, char, index) are already in \u0060os2.setInt16(firstCharIndex || properties.firstChar);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"64017b5e7f48b4231f58a01d35796864c380a53617e182725d3dd56ae7f0957c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022usLastCharIndex\u0022 repeats the code it sits on: 3 of its 3 words (last, char, index) are already in \u0060os2.setInt16(lastCharIndex || properties.lastChar);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"b334c6536919486cbb044852e0b090a5df7b15bcc3509c3a91090e0932989a52"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022cs\u003Ecf ? cs:cf \u2192 max\u0022 repeats the code it sits on: 3 of its 3 words (cs, cf, max) are already in \u0060return this._makeBinary(TOKEN.max, cf, cs);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e395ef730b1f5650acc713ad29bac1d31365e03aac2b7ed37b649be3b7bc548"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022cs\u003Ccf ? cf:cs \u2192 max\u0022 repeats the code it sits on: 3 of its 3 words (cs, cf, max) are already in \u0060return this._makeBinary(TOKEN.max, cf, cs);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec49696a10d6ba6ce1523cc9b78f3ef34ccd9cf9c1be2db2682a64a0cc701ee"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Filter out consumed nodes.\u0022 repeats the code it sits on: 3 of its 3 words (filter, consumed, nodes) are already in \u0060match = match.filter(node =\u003E !node[$consumed]);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/bind.js"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba838f953febc62a80d32898e03bebe77c6cf9c9455e6862fee167dab06c586"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Recursively get other XRefs \u0027XRefStm\u0027, if any\u0022 repeats the code it sits on: 4 of its 5 words (get, refs, ref, stm) are already in \u0060obj = dict.get(\u0022XRefStm\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xref.js"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"afca4aea9305dec4cac7010dc403be7c80ed1797cd7c87618c352722ef8d817d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The elements that will trigger the popup.\u0022 repeats the code it sits on: 3 of its 3 words (elements, trigger, popup) are already in \u0060this.trigger = elements.flatMap(e =\u003E e.getElementsToTriggerPopup());\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":2562}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c02c38d49b6209ac16e343996f3d922054717fca788d60e72cb4fc20646fb8c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022baseTransform * patternMatrix.\u0022 repeats the code it sits on: 4 of its 4 words (base, transform, pattern, matrix) are already in \u0060this.patternBaseMatrix = this.matrix\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/pattern_helper.js"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"056658c426081563ca63d8ffaa6f062072a9986a4c88160c5e8d140644bc0ff2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Rendering XFA layer as HTML.\u0022 repeats the code it sits on: 4 of its 4 words (rendering, xfa, layer, html) are already in \u0060XfaLayer.render({\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/driver.js"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6ad3c4c05df83fdf136b9835ee545c11a6bc764f0aae2bab898d551478cad6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Wait for the popup to be hidden.\u0022 repeats the code it sits on: 3 of its 3 words (wait, popup, hidden) are already in \u0060await page.waitForFunction(\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/integration/freetext_editor_spec.mjs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8abbfb1ef73fe8558693d4c0bef75ed5340ada3e6d4478a9cfd8742df88718"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Select the second editor.\u0022 repeats the code it sits on: 3 of its 3 words (select, second, editor) are already in \u0060await selectEditor(page, secondEditorSelector);\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/integration/freetext_editor_spec.mjs"},"region":{"startLine":2086}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94c30f06f3c80ef8c803979b02cc0a347a32c7194bc57f426d462177b7ad842"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Select the first editor.\u0022 repeats the code it sits on: 3 of its 3 words (select, first, editor) are already in \u0060await selectEditor(page, firstEditorSelector);\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/integration/freetext_editor_spec.mjs"},"region":{"startLine":2687}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bc5e22002b82ed64663214249e1b87d567c7de63f67ce8df689aa1d5be3908"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 7 comments in this file only repeat the code they sit on (lines 334, 976, 1068, 1165, 1208, 1232, 1347), for example \u0022Wait for the alt-text dialog to be visible.\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":"test/integration/stamp_editor_spec.mjs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c03ae12e5a169da987c6051bd45df4cfb60e63bf9eb3e036b9f253b0ed7322"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Focus the views manager selector button\u0022 repeats the code it sits on: 4 of its 5 words (views, manager, selector, button) are already in \u0060await page.waitForSelector(\u0022#viewsManagerSelectorButton\u0022, {\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/integration/thumbnail_view_spec.mjs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13f2738233b12729628cf5bf8ebbe1824a314f4a42a623102ffef1b352564ba"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Wait for views manager menu to be collapsed\u0022 repeats the code it sits on: 4 of its 5 words (wait, views, manager, menu) are already in \u0060await waitForMenu(page, \u0022#viewsManagerSelectorButton\u0022, false);\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/integration/thumbnail_view_spec.mjs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d695f00a0ef913a3b6e347c85d77cd19b31f0ce83373a89adeccaad5b58ce2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022PSStackToTree\u0022 repeats the code it sits on: 3 of its 3 words (ps, stack, tree) are already in \u0060describe(\u0022PSStackToTree\u0022, function ()\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/unit/postscript_spec.js"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b170a2a7144929c7f2d34f1cf380bae62dd56d234e78836bd63e623179dbdca2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Read the file content\u0022 repeats the code it sits on: 3 of its 3 words (read, file, content) are already in \u0060const content = await fsPromises.readFile(fileURL, \u0022utf8\u0022);\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/webserver.mjs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc9a91a7295acb441e430337005ab17dca268652c7cdef7d097f15977a812a1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Bind the event listener for the Close button.\u0022 repeats the code it sits on: 5 of its 5 words (bind, event, listener, close, button) are already in \u0060closeButton.addEventListener(\u0022click\u0022, this.close.bind(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":"web/pdf_document_properties.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a616c39f5f65fad3c46e597aa118319a222a6ec76aa11a13aaaf9335bb937504"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Attempt to scroll the selected match into view.\u0022 repeats the code it sits on: 4 of its 5 words (scroll, selected, match, view) are already in \u0060findController.scrollMatchIntoView({\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":"web/text_highlighter.js"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfd284b971b58397b55017503636def8a7ab4cefa0f93c696ffed8ca03bd5b7"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5edf5b29fcd0b200335c386e068bf3c44a110979a6b80b708dac0aea4b73b2de"},"properties":{"commitSha":"46e4a305ebb4a2ce9078e0ffbbc5451fafaf2bf7"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"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":"6abf3d1380ae929266cfdf1481e2ff8417a1a1a91f37c7e8738bcc5d07b30ae9"},"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":"3836aeb0fd9f7152b6eacf5d514622e47a673c189a12a7a1684e0d81f2df0fd6"},"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":"01f7507053d4dfabaf93f9596ded74cb738fa406c7fc5fd9f0caef85b1cc0bc2"},"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":"6a0a4eac8cd7583618f835131bfd1b8b9a77d406e5488dfda4d1239cc73162b0"},"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":"2b8a4111bcff0cc8087273bd23a9528e3570cb262687fbe7f1d53ec3d923b453"},"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":"f9f3d43c09288a89179fbb8d13ef961b21e57723b3f52555ac814af1ba095b61"},"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":"3042f8881f541d3f2fcdf81500b3f460cedb6f0e69184319a751388bebe1f563"},"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":"5a0b00fecb45b2186cd280b07b5124b861f37a712bb0862b4b91c833a1543fa0"},"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":"0d9a9d7ee8baea1cf1b28a2620336d06a475a047000241bd7b65a882fb837d30"},"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":"2c10b8247623119218956e5439fac1a02e4d077f2d7dfcac6ac9fc3b3b8ba446"},"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":"b13d96b9202279fa9449e00faf7f7d8a4f132350ad0d76d66c9dee8cbed1ed3b"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1531f5047a602f90d31bfc1987c93438e1b43e541e9859f18c017cefc79d81db"},"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":"43d427bd14bd6f42614f083dd6ebba852ed4b3b3fdf03545b85084eb5cf4bfc9"},"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":"fc76149ed622781846ae9471d297fcd5089872b321c4d29a7bc486ba71ce602e"},"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":"e19ef682db72fdab18e52b5deed1492ae4b9840e0492d4b6c6565f0152134a53"},"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":"3e0275eb725870c15d6815a4cf1c0e8784f683ccac0c7b9af3b558973d593bd7"},"taxa":[{"id":"CWE-1164","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":"ff264a25444dff30d9d07dc154d70f56fc5530eb11d6c8b60ae22f2805fe9008"},"taxa":[{"id":"CWE-1164","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":"530e80becc4349d40f415b8ef075def04227e4fbc9761d1221efa51aab702c3e"},"taxa":[{"id":"CWE-1164","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":"d7216bd110323a7339c215c5b13fa7f6699de6c43e51aa6baadf52ac22f656bc"},"taxa":[{"id":"CWE-1164","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":"1f51e74c8408cbcaae50806042cd88df395e3c81355478adb602e3ce55c07329"},"taxa":[{"id":"CWE-1164","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":"ca9bc1fffee62183052e5409e542eaa1358bbfe4ad7a4fb84069c27a0ed7a4ae"},"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":"343909762de1fe7799512c82f79e2be1216d1bef0013574e17beeb529ef3cc2e"},"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":"e74e1c4a036b6817265aec221c024caea77a17dd3d691e9e9850988b4ac40e71"},"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":"e2df1f0a60d0aa6de54276b3fae9f30cea9f52c02ea006907506eeee11f971b0"},"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":"158c075061b69a7cc119ab0704983db0a07b35662fa180d3692341a2256e3ad0"},"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":"0c74b4992b01d3d7ad7f5d74df5bb78f3c7a7746a56b381692c76fb31d615282"},"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":"8ad4f357049420b4e9ae90fd16c086f248f22858f872c2c036ee46e78f3e161a"},"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":"d3938bc000fad3033f1f9cd1f5da265f53158d4890b8711791d6ce52087ed42e"},"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":"fb01d4ccda2bf4ecde91311235afe6834b87145817a190c4e20a44ac5c535ed5"},"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":"4d5da2ec42ea01e44b274973718a05147dc8e24b8fb54ebf65e5b58dee8341c6"},"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":"159aec617cd987f0b1898542e219efb0906fca0939bc65d8d498da76c5d33b1f"},"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":"a8a95b2de91161492dcafa059ba4a8fc5fe87dd8133d5e2fc38d67c741fce778"},"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":"4549178186f30b40011d96483def03896d49471ab80d710ee7a82f4f18810645"},"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":"1b8be91639e1ee55a67120160342bcd53a753e3f45da4717af2447ca98b6e42a"},"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":"ffcbf81cd46cb22fc75e20d4d03943ece523c13e8e13d97e7308238822d44f95"},"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":"f896ca13e0feb7ee792458211afcee9196fca8d90ba97569c41432dcbf93d541"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f78e8b8e37ff3b818416c23da1b83ed5fc04d96cc55a128c1c93c2055a24e4f"},"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":"e59b59e64dc3e36aedbe290b91ba9aaf401f603d516e7c23a6498f9e07a47b61"},"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":"7d310dc3b612a743bbb3fd3805c2f41a65c4495459110c11728e8c5426a3b77b"},"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":"1e516160b604bac69fb5b514dc190e79234787b726cb1c1e71da92f618a6ece9"},"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":"4f7e01d0d32d5e24f8d612d5b5fcb3dbf6c8336cd847e9a53338b7e774d3c17c"},"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":"9e3bb68e3c67aa9c7bde27a78181020c253e49721dbb08491a62a7f4954066af"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"18639e8f9d80d96fac31e337f027a71da96e64746798cb0a37fb201446607ecf"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"075db5dec5942f2b4c4e6470b656ba866001c05a3bcc718fca539d99c4d3b497"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"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":"98d442b1919e5fa90d9359ad40ec1fa1a6ce94d9b2b4febe5fc3f56c73b52564"},"properties":{"dependency":{"package":"glob","version":"11.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65502758f473fe4b7079fcea72f0dab2f395f9968614b99ee4bb0b108e411516"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"79576c1a688a7e340aa1bd7a396d266075eec98be6cfe8d83a3f8a5153a930a7"},"properties":{"dependency":{"package":"glob","version":"10.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f243c2baa3fda028fe5fd31afa9942e43e662eecf789ce6c0f166345cb6f5dcc"},"properties":{"dependency":{"package":"minimatch","version":"9.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/formcalc_parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1c44a0bbba96bfbf94d4e5f5840634a7087d72993d86c07e96137efcddad6a"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 6 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: extensions/chromium/pdfHandler.js, extensions/chromium/contentscript.js, src/core/xfa/formcalc_lexer.js, src/core/xfa/locale_set.js, extensions/chromium/preserve-referer.js, src/core/xfa/connection_set.js (7 orphaned of 267 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 267 of the 327 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/chromium/pdfHandler.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a9df80120ad4cde8dcd696a76c6e285bbd1aabf18c7c26319c6cfcd0f5a7da"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/chromium/contentscript.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"200536bc990b935add3c2e19977be5cfda63246cb7ce41983e4bdeeb9182dd65"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/formcalc_lexer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c95649101ec7d07e6a2a9543b02ddaeba868ffac2dda2147bf4d363dd2c0a99"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/locale_set.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2468caf817e319d0e7572b4eb605c4ed3186d4f38050acc0674cb16decb98fa"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/chromium/preserve-referer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59faa2e628fe668bf7b6055bf3c461d3df6eac5c265e1fe8cfcc295c8de4c54c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/connection_set.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"061262fd7fa3ea9ea3e6c8982fe6ba37a437bb4dcb7505d6fca5ac75b8dd2592"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: renderer_worker.js \u2194 renderer_worker_proxy.js: \u0060src/display/renderer_worker.js\u0060 and \u0060src/display/renderer_worker_proxy.js\u0060 change together 64% of the time (7 of the 11 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00602ef8c64d\u0060 Release discarded canvases; \u006090821279\u0060 Use the renderer workers preloaded by Firefox (bug 2079251); \u006083bffae5\u0060 Handle invalid canvas sizes in worker rendering (PR 21860 follow-up) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/renderer_worker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fe7eee2b0978d610dba148cec379e0c5b77f454c1afcdc1d83f57560c960b8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: annotation_layer_builder.js \u2194 xfa_layer_builder.js: \u0060web/annotation_layer_builder.js\u0060 and \u0060web/xfa_layer_builder.js\u0060 change together 60% of the time (9 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060eda97fe8\u0060 Move the \u0060PageViewport\u0060 class into its own file; \u006045c7805d\u0060 Fix types to make \u0022gulp typestest\u0022 succeeding; \u0060b517b5c5\u0060 Remove the \u0060IPDFLinkService\u0060 interface \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/annotation_layer_builder.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f396172096dc5776f1765102ced9753e36d6941d69ef028432191aac2f23589a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: obj_bin_transform_core.js \u2194 obj_bin_transform_display.js: \u0060src/core/obj_bin_transform_core.js\u0060 and \u0060src/display/obj_bin_transform_display.js\u0060 change together 53% of the time (8 of the 15 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 8 shared commits counted here, the most recent 3 are \u0060edd591f5\u0060 Remove handling of standalone number entries in the compiled font-info; \u0060a02decd9\u0060 Stop exporting the Font \u0060defaultVMetrics\u0060 by default; \u006057243d72\u0060 Remove the unused \u0060SystemFontInfo.prototype.guessFallback\u0060 getter \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/obj_bin_transform_core.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02654aebece97597228a7eb904dd2275c25b6c0ad81907c4d4f5c10fa9a1022"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: signaturedraw.js \u2194 app.js: \u0060src/display/editor/drawers/signaturedraw.js\u0060 and \u0060web/app.js\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, 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 5 shared commits counted here, the most recent 3 are \u006030c5523f\u0060 Add a no-op helper function for \u0060catch\u0060 handlers that ignore errors; \u00601d82b2ce\u0060 [Editor] Add the possibility to change a signature description (bug 1\u2026; \u006068451fe1\u0060 [Editor] Populate the \u0027Add signature\u0027 menu with the saved signatures \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/drawers/signaturedraw.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a268dd4418f8274be54d6e2155155497d637830aa6ec0f4756b00e93050fa343"}},{"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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer-geckoview.html"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"162e4d6c28bfd1e71f1a24adfa3a654a143e9d90fb744f7dfc815d533c39ca8e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer-geckoview.html"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77852c3587e1a888c9d7c12bb7f88b0b4fdfe83868950b330d7a9d475319549"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer-geckoview.html"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ace74f7304565f210e1854027799e626c6e6ea7e3b261d9972bf00fe7390a37"}},{"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":"web/viewer-snippet-chrome-overlays.html"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c555fc1efabeb0ad48f85e0166df69bb0a93cbb9049159324356485775d24e0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"46da5bbf4bdfe51a66480c53341cd49cabf71a14ada9efebdab53a351d8e2617"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cf856e94648e04330fdcf8e372f9ad3687264996493b52319378a08e9f03d4"}},{"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":"web/viewer.html"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"44faa3fdbd1fef6954c11faaa574b8fcc8a14e0f2d0c8f43c0008004e73552c6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"9023a85cefc4a57039826e56f5a75448449ba8454544bae0efd491ef360c5e99"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"e405ff215d6948924a31f292eed5b5461d2b392ea6220f6ee149453c6d250d31"}},{"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":"web/viewer.html"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a6b111906146c41f580d1ad16c7c904c1d653201a8af4d3bc955f109801e11"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"0047dc67e6b149bdb566602b3a5e7c5034b74e37cc5e114fc1dcac878e63b101"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44095b447004bee280261fc313532000e0793e1a5716d931eb6241e8cbe1ac6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f202d75ff0c80f530af052c07cb210442c4cf8268f2796b3e98445975693f72"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfda7802fc84d0704e101050904e477531f3557290491382546175866363c10"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbc93c9356c19ce2f7f934348ea65c164121f14004fece23758515246a083a5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d72ca4d6a2a50d1ba84efb4697f605feac7a6414d8c6675cb58e06e6d64c17f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e665c8a9820c93f64d9e535d6656a10ea05f848c2a096750d46ae761cb09e7f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"394816c4bd748691d7b6b37f39f34514c28817a105e49a7500daf5f49149fa97"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa8ebb561b89d21c5882aec68195b468c7ae3d3080ebbb31bd880937622c8da"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31de36512402a344720b66f461b0757eb4b82d5f1c6879bee3715646b2ce93e"}},{"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":"web/viewer.html"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea05faf4622da3edf9c2f69aab4dac7092b704179a8b1061667500d0d166af9d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"10249b2231defa6dcfb3a3807aa54c78163e19407901a8156831d6211e405aea"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a6e3ca99724531763d67c2a5c81c436fd7b06646f5762c70a171f57649ef49"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e6d48c47f5b49eae81b5061d339bda988d282e571477b80f2befb39d65bb5a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bea689228a83ac780e0ead23d55a9e3bdeb20df577724ab86614a00ca99957"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10c9761b3fae1dcceec502606264937924a0b1f318a26618dc542b88fba1b7b"}},{"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":"web/viewer.html"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ac7bf13d6aae26713e7cb1b36ef31dea04dc1045fd4c3a2f7cfb6b0fe188c1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b49be88154a384c0020dbbfb9c8d449a9d285d5e43afc9077974a750031e80"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"398bc779b8f6b85d9aa45ecff84b7eb6f5f9c55132db01934b48b6da2968dbd1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d514ed287c6613f976418002a65156b888a4f708d10d2dcff176f917c6f303f4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dce8a328f3427cd6d97a7e765fc86e62979fee5243fda4cf3de540d55ac09d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f22cf69c7529f222f78384768d2f0ea52ba2d18933669a304957d07ddebae0"}},{"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":"web/viewer.html"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3da25ee80f88aabd9a37a5fff6374463347f241cf3db90973f154d3a9a1378"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"114ecd170d6b872980595a6661f04694337d8dbec9c2d6c0973967b5fab6f89f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"79074d6565f7c9101ee7c44e40e3838e9a3b8b5c5daa1f98c18e0a74b9ae3f36"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"61882b5751499dba2041899f6a6552c804d243e1d77c8a0306e0d4bfb8768409"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"444b4743b8f3659870d5b61ce50a1339ba1688d6bb593b84ced33fee7e8e42a2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a728912a2fb3c5f9c7c75a477182363d8130e1110801d36da6f49fdea01890c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\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":"web/viewer.html"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cb81161a46e9133333313cc10945a2418bcbe0fcf2e1de049bd78ef726d5c6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb35328efbb470875bda5e7cb9df5fe1c2e9466e862c0c88969f35c9a7774aac"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0114d6a711a9b6a4cba79cda5aa2e19ec9bc098fd10092eebff247195f6d48"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6c051cd806448dc70102f0f4a51523a5a020550d41fb1f7357c5b1ece476bd"}},{"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":"extensions/chromium/options/options.html"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f36217bb9d2e1fc1e116933cdc2e115c4166d5b27138d93b8bdd1dbff3e72b"}},{"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":"extensions/chromium/options/options.html"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea767574485b8230b3bc1337495be1f92459a50ced5d48f01b7e306cbcff851c"}},{"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":"web/internal/debugger.html"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"467ae59560b28590c545ce447002d949e5ae2983e5ba39c64e29f390b9a843cf"}},{"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":"web/viewer-geckoview.html"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fe5877193bd03cdf118e5e8dc598081dc0cc1927d3ccd899d148f265d45be5"}},{"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":"web/viewer-geckoview.html"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6afafb1bfd4435b8d6f629638f4c7f4b60ddee9a1b1405a43429bdfc69bf81e"}},{"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":"web/viewer-geckoview.html"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee7e678aecb4bfdba3086b35868132c54969cfd92b2940f93ffcce391a46911"}},{"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":"web/viewer.html"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a31771b54c1e8aee794f3959decf0f15909fbaadae22835817ee28daac5e02"}},{"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":"web/viewer.html"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d8877482c2662f34faa26162737b2a95088f3e12be501dcbd7bf7104d41e46"}},{"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":"web/viewer.html"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5144a4a94db6b7d4ed92ac6ae8c55562e289a1af731127bd3e4a8ebcb3ebf6a7"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer-snippet-chrome-overlays.html"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e2bd0045d7b96870dd3f4f5a19305e0e8adeab627adb7a67ec3c32bdb88935"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d66a8d901d0b6f919c534ccf99568a3daa022d7bd25385b8519b6eff02cd938"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f789313013a31bac4865dcd82e11f02742b5beca5512e718943ae8350bb767fe"}},{"ruleId":"AC5","level":"error","message":{"text":"Abstract ARIA role \u0022sectionhead\u0022: Abstract roles exist only to organise the ARIA taxonomy and must never be used in markup. Use a concrete role."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"6533684dd6888c1761a469d7fb5c76374859e3832961c498ee14d4fa65f5d376"}},{"ruleId":"AC5","level":"error","message":{"text":"Abstract ARIA role \u0022sectionhead\u0022: Abstract roles exist only to organise the ARIA taxonomy and must never be used in markup. Use a concrete role."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"26354434e99762c1fac21c9ea728b0ef8922154fbbe623b6bae55774c19e2727"}},{"ruleId":"AC5","level":"error","message":{"text":"Abstract ARIA role \u0022sectionhead\u0022: Abstract roles exist only to organise the ARIA taxonomy and must never be used in markup. Use a concrete role."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c6811933f73e6b319f9283e8647b10b3035a647d2b4584333f9def665bdf56"}},{"ruleId":"AC5","level":"error","message":{"text":"aria-hidden on a focusable element: aria-hidden=\u0022true\u0022 hides the element from assistive tech but leaves it keyboard-focusable \u2014 a confusing dead stop. Remove aria-hidden or make the element non-focusable."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01f1c6d6ee02b2cad50b20aa82fa3b6297c26cfbb9d34404ffb29c163323d49"}},{"ruleId":"AC5","level":"error","message":{"text":"Abstract ARIA role \u0022sectionhead\u0022: Abstract roles exist only to organise the ARIA taxonomy and must never be used in markup. Use a concrete role."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d4a4d121f4c8e82561b724c3e01d85e3428479633b8d8be5b2c84147f3408d"}},{"ruleId":"AC5","level":"error","message":{"text":"aria-hidden on a focusable element: aria-hidden=\u0022true\u0022 hides the element from assistive tech but leaves it keyboard-focusable \u2014 a confusing dead stop. Remove aria-hidden or make the element non-focusable."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"788b7f69060c79c8721368ac69dbdd15df417708ab5286ad7cbe43b6f8014771"}},{"ruleId":"AC5","level":"error","message":{"text":"Abstract ARIA role \u0022sectionhead\u0022: Abstract roles exist only to organise the ARIA taxonomy and must never be used in markup. Use a concrete role."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/viewer.html"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbc27447677b2ef0467f5114b41f7fa4b1a2ff93e5cd92c668f83861dd4e84b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.annotationEditorLayer .signatureEditor \u003E .editToolbar .deleteButton:focus-visible\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":"web/annotation_editor_layer_builder-geckoview.css"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b62e8836c89a26555ca63937b8744d25d366bfca1a70073a0892c756e436c6"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.annotationEditorLayer .freeTextEditor .internal: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":"web/annotation_editor_layer_builder.css"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef2782d3aac6dc8506915ab5a3d4f618456d92a85db8e57e77a5ff53e32ccf0"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.annotationEditorLayer .highlightEditor\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":"web/annotation_editor_layer_builder.css"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"412757bcca46fac26ac86f52e7cfd43df524136f1c751d8a64c1c48d8f7980b2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.commentPopup:focus-visible\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":"web/comment_manager.css"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ff8afa94d7804dc85c5f8d9cd3923b9edc91909de583016345dd79cc09c89f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060#editorSignatureParamsToolbar #addSignatureDoorHanger .toolbarAddSignatureButtonContainer .toolbarAddSignatureButton\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":"web/signature_manager.css"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dac91515dc94ed9cdda8d8c648a7c585b74eb5b343a9a276600d079a286e564"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060#viewerContainer\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":"web/viewer-geckoview.css"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db32cbdc83079c3423310a7e343c2c8e7f96ecbaef9676d5ec883a65d09d449"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060#floatingToolbar .toolbarButton\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":"web/viewer-geckoview.css"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"369cf4b8f435b60099ccec9b1ef6569d13ce84127df6f50931203b5916df5be5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060#viewerContainer\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":"web/viewer.css"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1bb99f5e5260b00303fd32bc07cb56f0a904bc8941e04c713ee4166944e1c3"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.toolbarButton\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":"web/viewer.css"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a0b4330f9267ac8087dbf11a43c54592aadccb4ecec3bc8ed1e39decb7a10d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.dropdownToolbarButton \u003E select\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":"web/viewer.css"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a4144dbd2ec0ccdc0fd230d67d9ccada385188879aa96257c7a8cc39ce6abc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.dropdownToolbarButton \u003E select:focus-visible\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":"web/viewer.css"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"647d1697939c8a762330d0f8f84024676278422c8e3ad026b7250e5afba68864"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.dropdownToolbarButton\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":"web/viewer.css"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"442dc6b5a798a8e34daa28d45b07e03e09e3283ff23940b026c28a94d68fdb9d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060#viewsManager #viewsManagerContent #thumbnailsView \u003E .thumbnail \u003E .thumbnailImageContainer.draggingThumbnail.multiple \u003E .thumbnailImageContainer\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":"web/views_manager.css"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"a263a1f30f5359ea4eeacaa5dae45fc81fd9b9cc6b4fbe2dfd8c4756612c14b1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#signaturePropertiesButton.state-loading .loadingDot\u0060 moves (\u0060animation: signaturePropertiesDot 1.2s ease-in-out infinite both\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":"web/digital_signature_properties.css"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c3364ae4a2446e36bace80156d5ba1ceb8e7f0ec702901d8cf43f90dc89ae3"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.sigCard .subSignatures \u003E summary::before\u0060 moves (\u0060transition: transform 0.15s\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":"web/digital_signature_properties.css"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c870e72637ce89315bd01f0e4844db81d2587763a81eacb576ecf04b335b55"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#toolbarContainer #loadingBar .progress\u0060 moves (\u0060transition: transform 200ms\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":"web/viewer.css"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59ad7d32196a570a3aeb411a582753d8c34540b9ce3599a31e45300044b6da4"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#toolbarContainer #loadingBar.indeterminate .progress .glimmer\u0060 moves (\u0060animation: progressIndeterminate 1s linear infinite\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":"web/viewer.css"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bb049f4011a92eeca7b248169708f57d7a73c30530ce813e52b2e0244ca804"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.pdfViewer .page .loadingIcon\u0060 moves (\u0060animation: 1s steps(10, end) 0s normal none infinite moveDefault\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":"examples/mobile-viewer/viewer.css"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"35513d8283e55b356f328483c144557b18974c012ed8d26492a228627fa0cadd"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#loadingBar .progress\u0060 moves (\u0060transition: transform 200ms\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":"examples/mobile-viewer/viewer.css"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75e4df285893a744ac7e8f35aa5e3577a1efd45fd566b7c5b9c35acde9baf08"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#loadingBar.indeterminate .progress .glimmer\u0060 moves (\u0060animation: progressIndeterminate 2s linear infinite\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":"examples/mobile-viewer/viewer.css"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"715432c44cd4a02cf95770733936b58b3a23799143015170c4b9bffe2d194b73"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060_saveCheckbox\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":"src/core/annotation.js"},"region":{"startLine":3433}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdefc8fc4b92060c69a665752b30890188e6f730c8c3903b558480c4ddfecbae"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060_saveRadioButton\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":"src/core/annotation.js"},"region":{"startLine":3489}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e204f818eec4cd9c097c4fe93cc08c922ba8e347705fca9306a6cc94df35ad"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060createNewAppearanceStream\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":4369}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6fbac09a040924bf219ef2bbc861aedec7fc85a2e1fd623202c8dfb59c3192"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060countUpdatesAfter\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89961b71dae284c78b71db22fb7d9778c0128b03b630d1217f73e3c6c407012"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060#updateParentTag\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":"src/core/struct_tree.js"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"0941fe3ebdad8d65b27bf2de5928926b1ff84012afc6f1a317dca8d62d693a47"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060updateAcroform\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":"src/core/writer.js"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"2602adad114727cdaeaadaacb139de9ea38921fd5f48a9e375bf6246370b000c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060markPoint\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":4356}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d68ffebd473ee55378f5aa8d8470a0be3ac535a19fa8b662729f48bd2a6c464"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060markPointProps\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":4360}}}],"partialFingerprints":{"codehealthFindingId/v1":"24670cf47221f158ca2a55da1d66ac58da601ff3196ff68846c4f2472ebbb45f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060beginCompat\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":4393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a5536dda2cdd8aa1caed279fa9cc50840b9a8554be125781a0f6f8b575a645"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060endCompat\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":4397}}}],"partialFingerprints":{"codehealthFindingId/v1":"097c6d531737b8f34c0527b1768aebf385b1a6c23c9458e64cc5109c710f0b56"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060getSimpleIndex\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas_dependency_tracker.js"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4b07438b67f4228722b893bed3ea662a1074bf09a42dcfd5b01f955d06cab8"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060#setState\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":"src/display/editor/alt_text.js"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"085fde41cdb778521f3b08d3605190519ec97898e2901cb52be26dab24e970a2"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060addButtonBefore\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":"src/display/editor/toolbar.js"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d0e93ff6cd67f716188366ded904ecc40b5461e199e2c96ae780c39dfc7297"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060isEnabledFor\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/chromecom.js"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c00ee337f0e6933606dcf293b4b50cb75d06036349628c7088a5cb82b58b304"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060guess\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/chromecom.js"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fd5512684383fce22fe2a3e7d7a1a53446801aa0a32ac116e13801aeacd5de"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060#save\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":"web/comment_manager.js"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf51cdb42d22f854e90fe3a97eaecf1d7ce949d413e638c5d2e240037e6d162"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060shouldSkip\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/debugger.mjs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"5441eb41c294d54ab703bd3681804d97b1bdb3b1820f2f4665838d666f93bfcb"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060render\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":"web/draw_layer_builder.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73d3fd5f6e9325b362b33853aac891464fc1901e2cf6f2a2c07852bf04d7de7"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060dispatchEventInSandbox\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":"web/firefoxcom.js"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d88104772c4c90bbe55e11ebe7876df5042cb4a5967be395db1773ac5f3afba"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060destroySandbox\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":"web/firefoxcom.js"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe019dbcbfe632c6d872c7c9967837bf3ea649a07dc552cb4bdad68834d433f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060#cancelAllRequests\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":"web/firefoxcom.js"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"28968d4cd2d004cf52b03becba19638cb62d087e149a784188fe1fe1bda0f33e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Both branches are identical \u2014 the condition decides nothing: Both arms of this conditional expression are the same, so no input can make the condition matter. Implement the distinction that was intended, or drop the condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/firefoxcom.js"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc08fa649aef24ada35929a9008028adcddbd642b8ada8cd31dfe329c58d794"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060initCom\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/genericcom.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5000e6a02037f76ca80ece1f1637e6a446494b578543daa3f14ed6b4a4d9d41"}},{"ruleId":"IC1","level":"warning","message":{"text":"Skeleton type \u2014 most members are unfinished: \u0060MLManager\u0060 has 5 unfinished members out of 5 declared members (methods and accessors, whether or not each carries a body) \u2014 a scaffolded class that was never implemented."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/genericcom.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"013df0f571f4f7f980c0dc4067f605a3cb2d6c14441eee83742a49742d29a568"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060isEnabledFor\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/genericcom.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5e5e7b9ba9c5c3b6c32fd6a093fb71a966e12c4f779f4cae78544ada3b74f5"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060deleteModel\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/genericcom.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06d915eb53583d7394da0810bd48b47ff5d29ca69ae385acb8b999ae7a03c6d"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060isReady\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/genericcom.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf83b4e29b7a467fc83d98f31d976cd68cb4528b81bd9a13c667fc9c43a98f37"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060guess\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/genericcom.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"958bc4a416605ff5a0ead093af2b0a2472045bd650de5ca9a22fedd0c19b08e6"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060toggleService\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/genericcom.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"14752f49cc0880a4ef2ca19ff0e2e88d405444047bb1f2c95a7fe61f6accc466"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060deleteModel\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":"web/genericcom.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed19e4d5fb14a07faf1d083c5d92cbf83bf86067562e62d3aa583771ab09710"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060loadModel\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/genericcom.js"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28157ba62357f8a0286f117543c84e05b1cf9fb8b97bf2d1b6fa14eda3b50f3"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060viewCertificate\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/genericcom.js"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c33b2d577462e223ad7bb000e84262b759a4ce0f47eef29fd4994864f24683d"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060#toggleGuessAltText\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":"web/new_alt_text_manager.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a967238f909840b05701204466304a41194702cccaa93eb67bafbce7dcaaf3c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060register\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":"web/overlay_manager.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f6fba564e820af25a19016b235ea7cf479a24d1456d86f5554f94474659c61"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060close\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":"web/overlay_manager.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd31640a5f981a0415a0d0492eb9db4155b2da2fecbfbd5bc170904e0779651a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060close\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":"web/password_prompt.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fff05998f8832ab072556b3747b9279a53116197f80d874ae39e5fc1d189f8"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060close\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":"web/pdf_document_properties.js"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d6b535037e7fe1961e9c3a970d098d73ae5221f72b249d0c31a8d97de640b7"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060#update\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":"web/signature_manager.js"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab212de30351c8cc8f6f77b1661d117a143775b5061c9dc618d7c0a38ff8c680"}},{"ruleId":"IC1","level":"warning","message":{"text":"Skeleton type \u2014 most members are unfinished: \u0060Toolbar\u0060 has 4 unfinished members out of 6 declared members (methods and accessors, whether or not each carries a body) \u2014 a scaffolded class that was never implemented."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/toolbar-geckoview.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42aff499dcfbb72981187e52cc7bbe690790e01ea867e29fbc8252528a46aac"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060setPageNumber\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/toolbar-geckoview.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca898080edf25af29a9bab2a3f6d540115c01fe46b8a859fd6d09df99cd216e8"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060setPagesCount\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/toolbar-geckoview.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6894c43f8f4542da33cabef5e6cbb15a5941b64bc6446cf00559310f7fafdb"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060setPageScale\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/toolbar-geckoview.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8978184404dedd033f173e5f2742e5e88d6faeda64f3e1748c16cc1fc18d519d"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060updateLoadingIndicatorState\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/toolbar-geckoview.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c7e55c84d98c3067f76802c7732bd6b755bc638b023a9e8f7c5021c44cb9d0"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060_writeToStorage\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":"web/view_history.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e469ef8172261f8a4e3cd31a04acfb65e4f114ef00bd6debb6105cde6f71f35b"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060hideDropdown\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/color_picker.js"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e0b083b311b76f7f8936a260e0c6c92da03c24a5f4e1d968d9a7822399e385"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060shown\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/comment.js"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"0226cedefbe7291ab974c78246fac627a8d8a2431dafff6c4be34d6db52ff957"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060goBack\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/app.js"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"256a724faca5b8e2f8ecca143dd430a686088acf8d99f7392189619b1dd4d505"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060goForward\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/app.js"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"6824eb26cbb24324b9b78c352e315cd1eb77e9408896c64ad81591bbc2cd6a43"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060mailMsg\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/app.js"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc61f9a1bb2bf1214e3bc77439a294f7ed64fe16959213a376fe016bbec44c5"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060getAnnot\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f38fec3403002816984e9c26f83059ef50ead8c9a7d92933548ed9c1690bdce"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060getAnnots\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe7ef3e6e8d24dfbbd1f7fccc3c8d4f7d468c58dffb3830789a758caab6b134"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060getPageBox\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc7cbe973f540587876a5077f0dcffeee412fa5a0affa1c281dd8b36c9ead06"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060getPageLabel\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"671b01faa29b436f2933204fc5ab654dbfaa6feb3bc73a4ff46dfea330014231"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060getPageNthWord\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b88d3a3583a087bbb29709b4cbc1d17180d20c7cadfc3269c38f3417ed651c3"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060getPageNthWordQuads\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3586b47572afc9129206c49b8c58ce7e1418aaf7ba349a0aeeefc66c8b135e01"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060getPageNumWords\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a150bf833b6584c337bb1b37b80ec8a3b21762a7982598f8e6ae8cf8c7d8f203"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060getPageRotation\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc27171ab40558becf6f8ab1d6a56afa2e6b8cffeb1fb4c1fcfece3599971129"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060gotoNamedDest\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cbf914b17f2f3214a8ba6011c9d0fc4c3bb6a45a7cd90499ca991ccf4b3f0f"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060mailDoc\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"301103aa985aa50c4986900ad9e9e540dd7502cb80d8c78f8489ba1a357eb90c"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060mailForm\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4667930335a678ac93ff87c1f2c2cd5655d39dfe3c5f1b130929a789aba13f8"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060removeField\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7450179cbee0eb82bc73f43b3bf854a97db524a8770bf6e7665925c1ddb9d4"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060scroll\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f6d5e14501aa0fdfca26a9815f2a01a282a7328f448787f22b99f93eb37814"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060selectPageNthWord\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"8918b522f981a89645c10c59054542c568a3d39a2819371c3d51407a69d66576"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060setAction\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09cec95e4369bde577ba6391bf19ec4c2294faa40f245750002c85775d1976f"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060setPageAction\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f762f722502324938e489d67be5890cae4af7d42efada19ae92acdc3fff2fc4"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060setPageRotations\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee9bc41d6f9b1b69cf8ade9d71e435793259a1eb1317bb445c5536b1749aaaa"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060submitForm\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffa233069dbc551ad6a4a445d45d9dc5fe5d83b7b4b75c375b2bbf8dc24dc8c"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060setLock\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/field.js"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b1fbb81adfda19713d5f63e2367c87f12f7fca045178bb3c04d0d947b08652"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060signatureGetModifications\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/field.js"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"026875020f9aaca69486d26d2f1c9be63c8b2049105fb13ab77b7c28a1981d3f"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060signatureGetSeedValue\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/field.js"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"044f245f399e3919708ecafd2412fcdabd7280e40539341c844161824f708baf"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060signatureInfo\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/field.js"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a61360494cb74cdc1d6e027dc99f15964fb0229b38b43bd097c4a6f8f8e0af"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060signatureSetSeedValue\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/field.js"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2bf79af59aea8b73b9f0d080159eb8ffe0fdbdd9f47994f695104900f568e1"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060signatureSign\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/field.js"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"a264fa4c8ed92d5ea961daa2576e899ab09c844214e70dbd0b1da8cb34c9f651"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060signatureValidate\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/field.js"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"75feb10ae31d290051af095fe43c509ea23f588c6c415dd4644f35c497d79280"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060begin\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/thermometer.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"75101ebdde33561f7ff4f6ffade4e292fa3f2aa61a02e0df82ed72678d513620"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060end\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/thermometer.js"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf1bbc493f56845d783b10d00b7e807080f0b90d9beeed7e25f335f4e5f5ed8"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060getSignature\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/signature_manager-geckoview.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"688634e9dfa0f427ce99f822c8dbd587232073d110f7a5cceae5c41e8e1836aa"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060loadSignatures\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/signature_manager-geckoview.js"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdafd5754da621a2725a4e1e655ffd2aa3ed4ed7ef53bb28304735bfe36bb156"}},{"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":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging call was found in the 329 JavaScript/TypeScript production file(s) this check read across 1 module(s). Each was searched for its ecosystem\u0027s logging libraries (JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger) and for a call on a receiver named \u0060log\u0060/\u0060logger\u0060 (or ending in \u0060Logger\u0060/\u0060_logger\u0060) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read \u2014 this is \u0027no logging found by this walk\u0027, not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch npm: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060npm\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"da14c5e8fb421b8614b797a2517de829b3c94f3b85263a50e3283dfd26519afe"}},{"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.existsSync\u0060 in \u0060downloadLanguageFiles\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":"external/importL10n/locales.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da197930a941c1bfef2bf5f867da5a3648c6ba02685cc00bd74ce3c8ffb78e1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060downloadLanguageFiles\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":"external/importL10n/locales.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd21f4fdcd8b63d8abff1fd7ff3b3abd0cd85756ca5338175c895dc4ee90634"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060downloadLanguageFiles\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":"external/importL10n/locales.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c77f13da8f149628e44f67aa2ffb2cc55a2632ff4e23583da39c9964ad9a624"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060downloadL10n\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":"external/importL10n/locales.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0ef8761621e5ecc093ba20ead479228777fb7d5b100f19879666ab9f3f2101"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060downloadL10n\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":"external/importL10n/locales.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd663538c466e3169136ba6ddc014ff47c644c7839bdf881b43949d5ef682b1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060downloadL10n\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":"external/importL10n/locales.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0526e39cc21b1204723f487e0dba5ffcf216857327ab6e748c4428bfdd7bbd4"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 2 typed \u00B7 455 plain JS \u2014 the untyped files are extensions/chromium/background.js, extensions/chromium/contentscript.js, extensions/chromium/extension-router.js, extensions/chromium/options/migration.js, extensions/chromium/options/options.js, extensions/chromium/pdfHandler.js (\u002B449 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 2 sibling directories (18 clone groups): 18 duplicated blocks under the repository root have copies in at least two of the sibling directories src, web \u2014 7 of them are reported below, and 11 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 18 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 18 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 18 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pdf.js"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6bcb6ada48bc3a0620f39624c9ac57f6c94d92dcdd5885c7e038d207c1cd3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 4 sibling directories (10 clone groups): 10 duplicated blocks under src/ have copies in at least two of the sibling directories core, display, scripting_api, shared \u2014 5 of them are reported below, and 5 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 10 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 10 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 10 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2b588bbab0fd83e7e9c977d6c22f49b416054df5e238be6c79f27b6d3aa876"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (317 lines \u00D7 3 locations): src/core/metrics.js:29 \u00B7 src/core/metrics.js:347 \u00B7 src/core/metrics.js:665 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/metrics.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cf4803129037fb3ef032f9bbc1b65548c59a2dc1dbbae4786696bf444bfad7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (317 lines \u00D7 4 locations): src/core/metrics.js:1301 \u00B7 src/core/metrics.js:1619 \u00B7 src/core/metrics.js:1937 \u00B7 src/core/metrics.js:2255 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/metrics.js"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6a87aa592b0ec8963072ed0fd0b319a1c2256392fdd33fa5edf49f79bb5f05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (185 lines \u00D7 2 locations): src/core/metrics.js:477 \u00B7 src/core/metrics.js:795 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/metrics.js"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8356032e69abca2153428190fce078eb19a5d64d289228928af9b5d919fa584"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (109 lines \u00D7 2 locations): src/core/metrics.js:364 \u00B7 src/core/metrics.js:682 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/metrics.js"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"10559bfdbcab6ed70577ea006e807918248c755444eefe89c1c9252ecf3e49ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (70 matched lines \u00D7 2 locations): web/firefox_print_service.js:39 \u00B7 web/pdf_print_service.js:45 \u2014 the two spans are one implementation copied and then locally edited \u2014 427 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":"web/firefox_print_service.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbcceecf98f9633e7725fa4d69c115ee615b1d72b37e719b752be0b3eb0972c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (66 lines \u00D7 2 locations): src/pdf.js:105 \u00B7 web/pdfjs.js:16 \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":"src/pdf.js"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c480ebb044d986ac5e2699f32cf18c43c450bcf9a25e0a871bda35974a0b2486"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (64 matched lines \u00D7 2 locations): src/display/canvas_dependency_tracker.js:518 \u00B7 src/display/canvas_dependency_tracker.js:872 \u2014 the two spans are one implementation copied and then locally edited \u2014 254 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":"src/display/canvas_dependency_tracker.js"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a8e2dcb4ee783c29608becbfedd824f15eb0e31b4ab6bc64d0eb3922f27b54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (63 matched lines \u00D7 2 locations): src/display/network.js:250 \u00B7 src/display/transport_stream.js:165 \u2014 the two spans are one implementation copied and then locally edited \u2014 355 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/network.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abcccf647ac0ea975c6538bbdf1414d973d6be009619b21fbe0dfd646c43689"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (49 matched lines \u00D7 2 locations): external/builder/test-fixtures.mjs:5 \u00B7 external/builder/test-fixtures_babel.mjs:5 \u2014 the two spans are one implementation copied and then locally edited \u2014 301 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":"external/builder/test-fixtures.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5656ba4997d007ec7217ff2f165d7e05a294d05fab017caed8a53ec2632684"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2 locations): src/core/evaluator.js:2910 \u00B7 src/core/evaluator.js:3008 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":2910}}}],"partialFingerprints":{"codehealthFindingId/v1":"1285d0a731c8b5ece48e714d46f9f1afecafc3a768dbd36c2f60cd0edd7d73b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 20 locations): src/core/xfa_font_widths.js:31 \u00B7 src/core/xfa_font_widths.js:79 \u00B7 src/core/xfa_font_widths.js:127 \u00B7 src/core/xfa_font_widths.js:175 \u00B7 \u002B16 more site(s) not listed \u2014 all 20 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":"src/core/xfa_font_widths.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"961b3a2f5430ac240e30c0ac52447c526de31547dd2c7d8a3349ab9d5ec23239"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2 locations): src/display/editor/freetext.js:76 \u00B7 src/display/editor/tools.js:927 \u2014 the 2 copies are spread across 2 files, 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":"src/display/editor/freetext.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b57e2fdc950a28e430e79d857778264862fc3fcb9cf2951b0149a21350f5efc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2 locations): src/core/evaluator.js:2001 \u00B7 src/core/evaluator.js:2040 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a0ad0a1800604df8c05428d96f50d163e68495742399dbde04f2643a7c4e60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (39 matched lines \u00D7 2 locations): src/core/postscript/js_evaluator.js:87 \u00B7 src/core/postscript/wasm_compiler.js:342 \u2014 the two spans are one implementation copied and then locally edited \u2014 149 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/js_evaluator.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d1c3ea0a94da9a736b06f37a77e3bab470bb76cdf5f6edb3ba9c2f73210753"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (38 matched lines \u00D7 2 locations): web/pdf_layer_viewer.js:133 \u00B7 web/pdf_outline_viewer.js:225 \u2014 the two spans are one implementation copied and then locally edited \u2014 223 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":"web/pdf_layer_viewer.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e036abc61cffa3b566bbde9256ef10c68ade7b292ed4370d4b076441b629a9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2 locations): src/display/annotation_layer.js:3231 \u00B7 src/display/annotation_layer.js:3285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":3231}}}],"partialFingerprints":{"codehealthFindingId/v1":"166fe0fc5764cc728866df814131fcc6eee8a0977469457287731c09ca7af7db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (36 matched lines \u00D7 2 locations): src/display/fetch_stream.js:132 \u00B7 src/display/node_stream.js:91 \u2014 the two spans are one implementation copied and then locally edited \u2014 222 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/fetch_stream.js"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea960d8220bfe566b88f9e5730528a1e6be8e9812e5ed0be5e50c1f60b99aeaf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2 locations): gulpfile.mjs:868 \u00B7 gulpfile.mjs:1120 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gulpfile.mjs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"064ba8a0260ff5d5944977cf2dd36e54637b2150bf02471a9043e4aafc02e31d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2 locations): src/core/xfa/locale_set.js:66 \u00B7 src/core/xfa/locale_set.js:133 \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":"src/core/xfa/locale_set.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59b39d45100ad16cb4dce5afe382fc6242673f616ef578ca73b59564ca3f5c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (32 matched lines \u00D7 2 locations): src/core/binary_cmap.js:221 \u00B7 src/core/binary_cmap.js:266 \u2014 the two spans are one implementation copied and then locally edited \u2014 199 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":"src/core/binary_cmap.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b24d9e614d920eb37752852d540579efe27150a7ad461e2fc99e8a8e42edd7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): src/core/xfa/template.js:1695 \u00B7 src/core/xfa/template.js:3844 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f18e40998f9d2b0720175da14b02b8ce477cab68d935859a4ed3e0ec84a63d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): src/core/xfa/template.js:1842 \u00B7 src/core/xfa/template.js:2675 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e94d008c563a8638194ffc8da424bf1714be8da54de6b875dd3b038793f4c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): src/core/operator_list.js:39 \u00B7 src/core/operator_list.js:170 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/operator_list.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b7cd15fadfab29a9343b03da6090e097f5ec75bbfbc9341f3b932b30e54e5f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (31 matched lines \u00D7 2 locations): src/core/postscript/js_evaluator.js:139 \u00B7 src/core/postscript/js_evaluator.js:211 \u2014 the two spans are one implementation copied and then locally edited \u2014 140 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":"src/core/postscript/js_evaluator.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb040096f4d122a42c4258346670608aafab43fcf3d52e5ea893f69b636ad626"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (30 matched lines \u00D7 2 locations): web/base_pdf_page_view.js:213 \u00B7 web/pdf_thumbnail_view.js:377 \u2014 the two spans are one implementation copied and then locally edited \u2014 126 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":"web/base_pdf_page_view.js"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"1870d941018c920ca612cdffce15d5f19b45442fce0f12f3ba80d62fcbd15b6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): src/core/cmap.js:441 \u00B7 src/core/cmap.js:493 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cmap.js"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"360e2873ea0612963a89e1fff5ece28f78bf8281e1764a016edec4f6fd22d344"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): src/core/postscript/ast.js:1107 \u00B7 src/core/postscript/ast.js:1224 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"340cc5b27dbb85865d8ea82b73b44435548282685508bed300940fc22fd1a44a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): src/core/xfa/template.js:2291 \u00B7 src/core/xfa/template.js:2639 \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":"src/core/xfa/template.js"},"region":{"startLine":2291}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aae0e6fbd3c288c993749fa20c7efcb27bf7aeba574d82d8d0cfcdff7b1abbc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): src/core/colorspace.js:832 \u00B7 src/core/colorspace.js:1120 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/colorspace.js"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9c439b77599c2410a1df61c4f36f6188612db4d124c31efdaed786462b24c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): src/display/annotation_layer.js:2000 \u00B7 src/display/annotation_layer.js:2107 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"0740d7008464fdcc3bcbf7730f292c1cb5ecec2ca3083801199c72d171ebebc8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): src/core/metrics.js:1817 \u00B7 src/core/metrics.js:2135 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/metrics.js"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3a0aad35ec338b0c6b8bd3636719417c5d4ff225710e412a724c468baf740a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): src/core/annotation.js:5308 \u00B7 src/core/annotation.js:5353 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":5308}}}],"partialFingerprints":{"codehealthFindingId/v1":"912d41f5a34690033bcd996f438dfda92cd53f98e3813a131515450834693861"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 3 locations): src/display/annotation_layer.js:3579 \u00B7 src/display/annotation_layer.js:3610 \u00B7 src/display/annotation_layer.js:3641 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":3579}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f72756a3829c01a54c752fb603b99432c89ed11f5d097f58c23da4865dd7bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): src/core/annotation.js:3431 \u00B7 src/core/annotation.js:3487 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":3431}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4045db7b2b2aac50e76f551cea29acdc06ae5afccaf0d1eb1816863c19c5d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/core/annotation.js:5127 \u00B7 src/core/annotation.js:5258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":5127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9752b543d9cfed645cb2a7e3861b5fece067f6a87e7aee43624506cceb03c6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (24 matched lines \u00D7 2 locations): src/core/core_utils.js:341 \u00B7 src/core/core_utils.js:498 \u2014 the two spans are one implementation copied and then locally edited \u2014 144 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":"src/core/core_utils.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a59d2e74b7af36e46796d0976b50d468d0a9faea6dca1fd92e97c69902fa16d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/core/pattern.js:872 \u00B7 src/core/pattern.js:1004 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pattern.js"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e2632cd3998414d36de55928fe94f2fb8381d4441e276071777bffe5eacf65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/core/type1_parser.js:692 \u00B7 src/core/type1_parser.js:870 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/type1_parser.js"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2710c0a58b3cf54c2364527512651a76ebf3f2a62ea4e62fb6843685858275"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/core/xfa/template.js:2525 \u00B7 src/core/xfa/template.js:5124 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":2525}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec9773f535972433ba28e3b6adc5ebc549806e6d59e5e2b88da155b91276ab5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): gulpfile.mjs:1514 \u00B7 gulpfile.mjs:2204 \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":"gulpfile.mjs"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"a830bc31e55d7b3fc121a0a4e9f7bd2c987ab5cb83011dcdad0f25e1d48bbec9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/core/xfa/template.js:2490 \u00B7 src/core/xfa/template.js:5085 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":2490}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a70796aa20bcfd3ea873da1e893d3ba51a9184b35990b09ff0dc31ae62d4841"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): src/core/internal_viewer_utils.js:66 \u00B7 src/core/postscript/js_evaluator.js:109 \u2014 the two spans are one implementation copied and then locally edited \u2014 97 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/internal_viewer_utils.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f960e9af89dc9a8e608eda8fe65f0f08378bb11552d60f8c182ac3656d196a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): src/core/xfa/template.js:677 \u00B7 src/core/xfa/template.js:5337 \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":"src/core/xfa/template.js"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"c870446fc375bde78a92c0ea21f37fc1e50de49b2887ac61d645e653c06df683"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): src/display/dom_filter_factory.js:155 \u00B7 src/display/dom_filter_factory.js:383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/dom_filter_factory.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6259b1891bd02d0f73a4df2c5403605828baaad8cff6d32f1b01c55dc55624d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): src/display/draw_layer.js:277 \u00B7 web/text_layer_builder.js:244 \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":"src/display/draw_layer.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8b25595b733c25eaaa4e121386a35d2527f751255ae330bae28788036ba5b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): src/display/editor/highlight.js:528 \u00B7 src/display/editor/highlight.js:564 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/highlight.js"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f4426359da4cc3005d3b28721959470880f068f9efbf7c6dc06de92980d656"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): src/display/editor/highlight.js:572 \u00B7 src/display/editor/ink.js:175 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/highlight.js"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"dccd07511a7894388c616534ef439907023234355751a6509b614f1c4d0722ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): web/pdf_thumbnail_viewer.js:607 \u00B7 web/pdf_viewer.js:2112 \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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"809b90113f272a8b21429873bcd8fc1784672c0a2ef90ee48231a5a17c39a49e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/core/calculate_sha256.js:79 \u00B7 src/core/calculate_sha_other.js:260 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/calculate_sha256.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5292e4a90180e8f82a5f16e0a0f2bcca7704a3c4a3f54921b714b78ca04d0ab0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/core/crypto.js:326 \u00B7 src/core/crypto.js:367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/crypto.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c5f74c876415e4c291f9fec3854bf9a3d0208308f13d11ba9f84490bc021f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3 locations): src/core/xfa/template.js:524 \u00B7 src/core/xfa/template.js:3681 \u00B7 src/core/xfa/template.js:4625 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"5034c4213aa46d9fed137a6a172f25b5c5772e10791a2325da44bfc07b146cf4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/core/xfa/template.js:1616 \u00B7 src/core/xfa/template.js:2013 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"a307aa0325071aaded70f4ca9fe072ca67add80073e609fc2c24844345099716"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/core/xfa/template.js:2402 \u00B7 src/core/xfa/template.js:4929 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":2402}}}],"partialFingerprints":{"codehealthFindingId/v1":"af36e70876674dd13627e7b5207634e1837f5ff3e736afd400b82678940a534d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): src/core/chunked_stream.js:174 \u00B7 src/core/stream.js:42 \u2014 the two spans are one implementation copied and then locally edited \u2014 124 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/chunked_stream.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5ff0a98fce3ec1a1c3c6c06708da95f0cae7dab208ab24773299ba58654778"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/core/crypto.js:238 \u00B7 src/core/crypto.js:285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/crypto.js"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"66357e361a67454074bc625a2d453d8171b1dc6fc9303be1f5ac7337a6c54978"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/core/jpg.js:522 \u00B7 src/core/jpg.js:601 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/jpg.js"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"0408a2f8a09b75160d042d6ab70689cc7e5aed8fbcd2f984a21ad1867efbddb4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/core/xfa/template.js:1014 \u00B7 src/core/xfa/template.js:1037 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"374fef49db7b591b32d87ad3fadd3293ba4fec234ce8c73c863d03a4d5bd0f8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/core/xfa/template.js:2323 \u00B7 src/core/xfa/template.js:4818 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":2323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c034c230665474a7ad69bf8b29c970f8b8209e9b4176113737a1a52c68abb4e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3 locations): src/shared/message_handler.js:386 \u00B7 src/shared/message_handler.js:451 \u00B7 src/shared/message_handler.js:507 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/message_handler.js"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee2abe220584d535f6d4cd720c9a5266f4f0aeee7017121c44b2d0a1c01183a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): src/core/ccitt_stream.js:41 \u00B7 src/core/jpx_stream.js:30 \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":"src/core/ccitt_stream.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b5c56e0c1408402aa3a9b9bed9dd205821e05872df5eaf101cbf34c8dcf2b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/core/metrics.js:1971 \u00B7 src/core/metrics.js:2289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/metrics.js"},"region":{"startLine":1971}}}],"partialFingerprints":{"codehealthFindingId/v1":"153c139c94db8d58d0159ff37164c12a1333f3e456bde2658704b5d3e27b45b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/core/postscript/ast.js:1182 \u00B7 src/core/postscript/ast.js:1249 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"9798a9091cba6c8410168840942aa9cfdd3910e5b48f5439c1c2e3be5d736d7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/core/primitives.js:29 \u00B7 src/core/primitives.js:55 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/primitives.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a5bdb58dd0d0be89b08820f50e524909fba22eb585a1027892cbdd017e62bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): src/core/xfa/template.js:1750 \u00B7 src/core/xfa/template.js:3181 \u00B7 src/core/xfa/template.js:3514 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"550a167e1717cd0010755f779fa11c6fe227ff618c3872a6f30ac7d0712c6392"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): src/display/annotation_layer.js:2777 \u00B7 src/display/editor/comment.js:98 \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":"src/display/annotation_layer.js"},"region":{"startLine":2777}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff701354ce03275ea135f32e8346f253b3a1de0e1fec80ee920633fc3d92f2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/display/optional_content_config.js:205 \u00B7 src/display/optional_content_config.js:227 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/optional_content_config.js"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b6d376e3bba08a2ebec0f803399930f3b8d34e025d76644a769e783ae68f22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): src/pdf.sandbox.external.js:81 \u00B7 src/pdf.sandbox.external.js:108 \u2014 the two spans are one implementation copied and then locally edited \u2014 94 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":"src/pdf.sandbox.external.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2366e8d24e055f6b104ca96d1adf2493c827694691bc1073734bd140a0aaea75"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): web/comment_manager.js:696 \u00B7 web/comment_manager.js:1045 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/comment_manager.js"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"856fc798b35d128d5ff770c9cb1edc509151b19485f2c0e861dfdf12543fd631"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): web/internal/tree_view.js:566 \u00B7 web/internal/tree_view.js:598 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/internal/tree_view.js"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"2733c7c61c50094f923813e444b4e2041fff45f6c4f80db7682871884082999f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): web/pdf_viewer.js:2275 \u00B7 web/pdf_viewer.js:2346 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_viewer.js"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"6929fbe47ab377f0518e777f529dbd69b2a94e5c2f1f7df0e4762463092c7327"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): src/core/annotation.js:5278 \u00B7 src/core/annotation.js:5317 \u00B7 src/core/annotation.js:5362 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":5278}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3c49dcbc4b6987678a38b8ec56a0d8daf1c8c5b760911889e549d6dc1393c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/core/evaluator.js:1903 \u00B7 src/core/evaluator.js:1922 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":1903}}}],"partialFingerprints":{"codehealthFindingId/v1":"07be8da29252dcca695faf3960f623204fd11d350743789109d7441ab1e90c7d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/core/image_utils.js:60 \u00B7 src/core/image_utils.js:123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image_utils.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3479df1ba798eae17ffefc8d7f7af980d5ccfc85ac50eab2868715d4c1ed80e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/core/metrics.js:1906 \u00B7 src/core/metrics.js:2224 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/metrics.js"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb7f232a45c6d7cc7a3e0bd09b59042e50ec8c7946abb6e7573286222c9c756"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): src/core/parser.js:1244 \u00B7 src/core/type1_parser.js:539 \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":"src/core/parser.js"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"697568e09eb4fa2f8ebde6f8b5041b276f6ac40470500a1f85eb2ee4abeea1e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/core/xfa/bind.js:182 \u00B7 src/core/xfa/bind.js:305 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/bind.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"85404d631cfa67e1cfcf45410045e571c9912fb739448d94368fafdaf48a4cb2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/core/xfa/template.js:1927 \u00B7 src/core/xfa/template.js:2878 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d902a5756e307460dd0c50a8617f1666abc8f4613d89292c78c30af8c8bfb6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/display/api.js:2607 \u00B7 src/display/api.js:2677 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api.js"},"region":{"startLine":2607}}}],"partialFingerprints":{"codehealthFindingId/v1":"113d44b14ce9143f1f57e25d2912d68b0b2228e929a3925823333ff006c791fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/display/editor/freetext.js:854 \u00B7 src/display/editor/ink.js:311 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/freetext.js"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88b085edecb1475a562675908195b560d8d7899b19acb3f21da499d26bb2f58"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/scripting_api/doc.js:472 \u00B7 src/scripting_api/doc.js:612 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba099a7e06d968d145423669aebae0fe367b7182915d4d43fcd97f847de78839"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/core/editor/pdf_editor.js:2578 \u00B7 src/core/editor/pdf_editor.js:2707 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":2578}}}],"partialFingerprints":{"codehealthFindingId/v1":"664383a349da730d3f979489d6b82ea4098e5bf57cd8177e66ef54ae9b4b1267"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/core/evaluator.js:307 \u00B7 src/core/evaluator.js:350 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8ab8447038373ec7a40c3e1521da19d9b9d9b41151296c80e69205f11ae32c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/core/evaluator.js:2888 \u00B7 src/core/evaluator.js:2972 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":2888}}}],"partialFingerprints":{"codehealthFindingId/v1":"daaa1b0e8bb03bb2be4c8af1d7d542a783b30c00250b94ed1da84e1dfa52d610"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): src/core/image_resizer.js:275 \u00B7 src/display/editor/stamp.js:616 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image_resizer.js"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"afeaf5adc0c992efc81d88022118927b865b5f0413211bced0f78aeff41282a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4 locations): src/core/xfa/config.js:147 \u00B7 src/core/xfa/locale_set.js:52 \u00B7 src/core/xfa/locale_set.js:164 \u00B7 src/core/xfa/locale_set.js:203 \u2014 the 4 copies are spread across 2 files, 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":"src/core/xfa/config.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0172bbe6f4bf759e7a74f663f08a3eabb232cbd2e52be446793e2d973f6ae5d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/display/canvas.js:2271 \u00B7 src/display/canvas.js:2348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"c915bc3b67147c11ff174b4f48850787d18294ed6b793505896221d7f0b8b111"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): src/display/editor/drawers/signaturedraw.js:425 \u00B7 src/display/editor/stamp.js:620 \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":"src/display/editor/drawers/signaturedraw.js"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be12702f8d0474bc88587f07fce329ecf9723abe99bf974869def20fa8a3279"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): src/scripting_api/print_params.js:37 \u00B7 src/scripting_api/print_params.js:61 \u00B7 src/scripting_api/print_params.js:101 \u2014 all 3 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":"src/scripting_api/print_params.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e23e0b28a27fe10d27c532762b2d551121a89674de78a5d213fe346f4db0a4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): web/firefoxcom.js:536 \u00B7 web/generic_signature_storage.js:64 \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":"web/firefoxcom.js"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"810331e691402223106e7b260ba897b952fe9999b2766b8b5adf5ba9a04c3715"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): web/viewer-geckoview.js:16 \u00B7 web/viewer.js:16 \u2014 the two spans are one implementation copied and then locally edited \u2014 105 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":"web/viewer-geckoview.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0232c480b59ab27b9389af657b957904c87c20a66bb60f3da384b0d469705b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/core/annotation.js:4433 \u00B7 src/core/annotation.js:5191 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":4433}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1d3c0ae52afc7b5e7502c98a6a5ee36c1213fcdd0e4d6215aae6f89fb1dbbf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/core/annotation.js:4741 \u00B7 src/core/annotation.js:4803 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":4741}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b34f7e47f3e93b144508ab98c5d1474e775e26f146f3f3d724ef56bebd4aa75"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4 locations): src/core/xfa/template.js:1378 \u00B7 src/core/xfa/template.js:1722 \u00B7 src/core/xfa/template.js:3869 \u00B7 src/core/xfa/template.js:5828 \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":"src/core/xfa/template.js"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a29e64b925a6b3497557b50ca4f8df0853cbe98ab63450d32695f2862e5ed1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): src/core/xfa/template.js:1650 \u00B7 src/core/xfa/template.js:1669 \u00B7 src/core/xfa/template.js:5846 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"8646c642d0489c3490032498f44504b5f99de5b7bfdde573802eaf3d36790427"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/core/xfa/template.js:2571 \u00B7 src/core/xfa/template.js:5191 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":2571}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2408022d5e13c5ae742c081873326c8b18bddf6b7766dec38561b478ed59689"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): src/display/editor/signature.js:244 \u00B7 web/signature_manager.js:694 \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":"src/display/editor/signature.js"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ec281308be5bb78244467cd51f440d1ce78f38c59828036ab2efc51c3aa49a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): src/display/fetch_stream.js:110 \u00B7 src/display/network.js:224 \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":"src/display/fetch_stream.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94a82ef99669c3d19203d0eaf912897a2307d989a616fdc2b8d13c2823f259c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/scripting_api/doc.js:552 \u00B7 src/scripting_api/doc.js:600 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69c0d1e40e4bd3a596756d543a9590f68e61a9884023fa97269abde2cff57ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/scripting_api/util.js:451 \u00B7 src/scripting_api/util.js:477 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/util.js"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"52dcb7be3259b5eb27086608ae8286edae8bee2efb2f0c5d6e3bf40cf0cf40dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): external/cmapscompress/compress.mjs:291 \u00B7 external/cmapscompress/compress.mjs:317 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/cmapscompress/compress.mjs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"415ea617b5da7905f2d20c7e04e53abf290a7c75d47018c3eca2f94cd17d086b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): external/cmapscompress/compress.mjs:426 \u00B7 external/cmapscompress/compress.mjs:456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/cmapscompress/compress.mjs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a779e8eeaa32086c2b49eda025862a254007f3729d131c93629d5b0ec2593b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): src/core/calculate_md5.js:59 \u00B7 src/core/calculate_sha256.js:79 \u00B7 src/core/calculate_sha_other.js:260 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/calculate_md5.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3d864d9d8ec5262ad78ece2307e1877eb1829caba3213e61ffb0047247f992"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/core/catalog.js:232 \u00B7 src/core/catalog.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":"src/core/catalog.js"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f91b65649cbd1f51a52e9f014d53287e3193bdc3851c7fe285231cc5aa2212"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5 locations): src/core/catalog.js:302 \u00B7 src/core/catalog.js:333 \u00B7 src/core/catalog.js:362 \u00B7 src/core/catalog.js:473 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"b863da5694eda128f172bd68d77631478ad6291c5ffc81e3b1f3b5ef0dc49778"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/core/crypto.js:581 \u00B7 src/core/crypto.js:639 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/crypto.js"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"5847ab2095b3a07be2c4cb834b35bb98ef54586e4b935cc9e2a2a304192449a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/core/data_builder.js:75 \u00B7 src/core/data_builder.js:108 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/data_builder.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"17003c32eefb47e83cb7c3bcf072700d2f440abfb6471967235fa394e094ee3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/core/editor/pdf_editor.js:608 \u00B7 src/core/editor/pdf_editor.js:1576 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1d15be2480f61eb6f9a86434adb8d0c10c45d513ce16cabfc9649541b6f2ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/core/font_renderer.js:280 \u00B7 src/core/font_renderer.js:295 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/font_renderer.js"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4aedc80030413f603b8605bdaf1436982345c828493ff813185fee83d9545f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): src/core/jbig2_stream.js:26 \u00B7 src/core/jpx_stream.js:24 \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":"src/core/jbig2_stream.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4f1803fd08d7b6280f9e6dedf9abe42674f1cea7ad96b07e9409fee7c66bd4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/core/metrics.js:1925 \u00B7 src/core/metrics.js:2243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/metrics.js"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b847df9f593f340cb09d2ed5dc41ee2728f9d32cf20b707159e5b821668ee69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/core/metrics.js:2020 \u00B7 src/core/metrics.js:2338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/metrics.js"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03f0c9cd425b6d9ddc797eb419b0215a3ab52d6726e4b41215a11b3bc3e06d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/core/metrics.js:2368 \u00B7 src/core/metrics.js:2686 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/metrics.js"},"region":{"startLine":2368}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faac8fe612dbf6066daa58064fa6fd852b9883afdc4467aa5cef24cd90dbff9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/core/xfa/fonts.js:101 \u00B7 src/core/xfa/fonts.js:123 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/fonts.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"795a127a699e1ab0701a97857956960c487afc68d46f8af7b658555269c06c82"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/core/xfa/som.js:198 \u00B7 src/core/xfa/som.js:269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/som.js"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc1bbe0b57fd0469e1ebae704721965c79782831deeb9204152e92f1d7bcf8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/core/xref.js:563 \u00B7 src/core/xref.js:601 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xref.js"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1009770700b8c8435f88ece78cf056736dbae1da93b3fc7e52e2e7b1411f1a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/scripting_api/app.js:626 \u00B7 src/scripting_api/app.js:645 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/app.js"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9a6f8692c2359f53fea75fdc66716b85ea4baa30c8d1aa05a9b8d051eb8763"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 8 locations): src/scripting_api/app.js:301 \u00B7 src/scripting_api/app.js:342 \u00B7 src/scripting_api/app.js:370 \u00B7 src/scripting_api/doc.js:349 \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":"src/scripting_api/app.js"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d6e8ba41f2417494a4a74aab23979de2293fabf5cfa50347437e7bb7fc7e95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): web/app.js:3394 \u00B7 web/app.js:3562 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app.js"},"region":{"startLine":3394}}}],"partialFingerprints":{"codehealthFindingId/v1":"31dd0b9718bf977dfa2e7d84c2be65228481526c6c9fe9668451ac8044e49abe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): web/internal/tree_view.js:468 \u00B7 web/internal/tree_view.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":"web/internal/tree_view.js"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d48c3e9fd7857ed9dc8901f48854a96bd142ca81e77e99ef90836ba45bb9100"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): web/pdf_page_detail_view.js:223 \u00B7 web/pdf_page_view.js:983 \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":"web/pdf_page_detail_view.js"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5fd44320f41b90df54a4e22e14e2f88f6623251b432caa8b1a56c8d855a5a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): external/brotli/decode.js:1263 \u00B7 external/brotli/decode.js:1300 \u00B7 external/brotli/decode.js:1367 \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":"external/brotli/decode.js"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"0162a80a02aa90945b3ef3e7a353fde68f79fff36bcffa6828d380b997347e21"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): src/core/annotation.js:5178 \u00B7 src/core/annotation.js:5304 \u00B7 src/core/annotation.js:5389 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":5178}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d0e031b5724fec09ddf6b6c221453b83c776717abb7df898825b37fdc3833d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/core/colorspace_utils.js:59 \u00B7 src/core/colorspace_utils.js:108 \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":"src/core/colorspace_utils.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea172af3f9544fb184700c89ccedb2b377953c3dbb4ec792cd83105cd449e12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/core/editor/pdf_editor.js:2873 \u00B7 src/core/editor/pdf_editor.js:2891 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":2873}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c27221fd830e61e44c3a1dd83decccb749ae36f115e38c23bf28e85949c2669"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/core/evaluator.js:2129 \u00B7 src/core/evaluator.js:3650 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"45246a366a5d84f12b1a91e5e3637501a4e2c8d56e7c47c25c2730ca6e02ab55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/core/evaluator.js:2332 \u00B7 src/core/evaluator.js:3752 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":2332}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d67061f55f3bd6183696e6aa0a1251a5a8e150868fb68439f911d0dc0cfcf9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4 locations): src/core/image_utils.js:96 \u00B7 src/core/image_utils.js:133 \u00B7 src/core/image_utils.js:150 \u00B7 src/core/image_utils.js:166 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image_utils.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9f206e6b09cb43b9a2ffcbe444f5795be7a4717f9aca9373720015067a11e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5 locations): src/core/metrics.js:1313 \u00B7 src/core/metrics.js:1506 \u00B7 src/core/metrics.js:1824 \u00B7 src/core/metrics.js:2142 \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":"src/core/metrics.js"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6077fb0670b63903fbe7665d9989aecef2a4b3a4fea97bca75f094c530fcea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/core/pattern.js:457 \u00B7 src/core/pattern.js:739 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pattern.js"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e96b656b25471211984ae5ef6dc55ac9b123b75eca262088562797ba2ada0bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): src/core/xfa/config.js:774 \u00B7 src/core/xfa/config.js:789 \u00B7 src/core/xfa/config.js:931 \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":"src/core/xfa/config.js"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b40fa261819476dd33f2213e2ebab2f63dff4133de40a547d41617cbae7170c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5 locations): src/core/xfa/template.js:829 \u00B7 src/core/xfa/template.js:1060 \u00B7 src/core/xfa/template.js:2293 \u00B7 src/core/xfa/template.js:2641 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2537e26689a8e1d0767c11446c79e0d1907de80c8e7004de8b0ecb3c4e975fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/core/xfa/template.js:2450 \u00B7 src/core/xfa/template.js:5034 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":2450}}}],"partialFingerprints":{"codehealthFindingId/v1":"654208e5b55fdba16d10bcef632cf6097abf880d28a1a2b054fdf26f5b8e3c0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): src/display/annotation_layer.js:3168 \u00B7 src/display/annotation_layer.js:3220 \u00B7 src/display/annotation_layer.js:3274 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":3168}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e273c5a540792e4ab5db210639483dcf937aea77e1fc59ae12f82bf8176c77"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/display/editor/alt_text.js:98 \u00B7 src/display/editor/comment.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":"src/display/editor/alt_text.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"5906f104b2a4c5328bcf2c6b686688723d5ea1a7dae85a922b828d6759d8acfd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/display/editor/draw.js:511 \u00B7 src/display/editor/freetext.js:282 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/draw.js"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6dcb37952d0b6d9c7d3c1ec59f522c88cae2d54c5480699dfbeee271bfab0fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/display/editor/draw.js:511 \u00B7 src/display/editor/stamp.js:289 \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":"src/display/editor/draw.js"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fc3948ff36f631bd34f41620868ce80d365fec90739c008acf4a86c0360fec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/display/editor/drawers/highlight.js:367 \u00B7 src/display/editor/drawers/highlight.js:557 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 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":"src/display/editor/drawers/highlight.js"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cdcbef94278317e9523114aa950fdc9b578ea6a1b0f6b8ed310a16d18e5b4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/display/editor/signature.js:130 \u00B7 src/display/editor/stamp.js:340 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/signature.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"193cfaa2d0d3a3e482dec7523d80f1b2e5d1050c24bbf5c36ba898c6755112ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): external/cmapscompress/compress.mjs:53 \u00B7 external/cmapscompress/compress.mjs:85 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/cmapscompress/compress.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"87575e9a22d0aef6ba9f50a725aefd4b9a40dd2c02ace5ae08f323bf47394ff0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): external/cmapscompress/optimize.mjs:66 \u00B7 external/cmapscompress/optimize.mjs:112 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/cmapscompress/optimize.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e20d5b8849c8f95de897ca596e80ba424d8ccdb19e26760290e5466cf90c0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/core/annotation.js:3474 \u00B7 src/core/annotation.js:3533 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":3474}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc057e4d9309e8f80a615edddd255fd0bfa8e1eb3ea28c0b2c258233cf0bca9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/core/annotation.js:3797 \u00B7 src/core/annotation.js:3856 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":3797}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fc069c7a334071a6e7bd18a3e1248f5c147168de63a1c1f2aac31a4eba85af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/core/editor/pdf_editor.js:1475 \u00B7 src/core/editor/pdf_editor.js:1493 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1697ea7f7c55dd1a3e42f34fe25f787949b563a416298dad5cf4b32ed4f557"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/core/metrics.js:2079 \u00B7 src/core/metrics.js:2397 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/metrics.js"},"region":{"startLine":2079}}}],"partialFingerprints":{"codehealthFindingId/v1":"842a203e0d0ca9dc73a601b1d5b7f00e9b9ef70612162056fcc14ff29bc7a47c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): src/core/parser.js:144 \u00B7 src/core/parser.js:506 \u2014 the two spans are one implementation copied and then locally edited \u2014 87 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":"src/core/parser.js"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d776e3d7b1b5a71a8ade0d315947dcbf8c8582e79039f1482b522c880888332e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/core/postscript/ast.js:761 \u00B7 src/core/postscript/ast.js:814 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e4785fa3a3cf5591f8239994e9d0101fd353cc724bb9efef19abb60a899117"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/core/type1_parser.js:631 \u00B7 src/core/type1_parser.js:662 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/type1_parser.js"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57a112b5f322ff283c07c894db3c11bce861dac6a22abf2af0a6921c2637f73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/core/xfa/template.js:1956 \u00B7 src/core/xfa/template.js:2901 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2658155180e13f0798ea43447d6ab5c6d2e1c359edf0f45b088089cd89fb5f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/core/xfa/template.js:2210 \u00B7 src/core/xfa/template.js:3170 \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":"src/core/xfa/template.js"},"region":{"startLine":2210}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fae4bea2c2ce9c19a622faddc993bd26eb8986b8619302c83fdfc5a6d2a3d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/core/xfa/template.js:2613 \u00B7 src/core/xfa/template.js:4660 \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":"src/core/xfa/template.js"},"region":{"startLine":2613}}}],"partialFingerprints":{"codehealthFindingId/v1":"7feeb9f59ad0da61c0257b489618436cec9873fb9acb66bfccebef121750a625"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/core/xfa/template.js:3202 \u00B7 src/core/xfa/template.js:3364 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":3202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de8b2ce08db3c24b2c0d99a1273adacaef89042fe309269ba9bc86cd770a4cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/core/xfa/template.js:4141 \u00B7 src/core/xfa/template.js:5244 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":4141}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb290dbe021fe50c39f2070ef014c01cc171c74046745694943881c91d675faa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/display/annotation_layer.js:1055 \u00B7 src/display/annotation_layer.js:1117 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35d8b4a5ca42a2762620bb9bd7890f96d8fbbcb70a5fb5ca1fbed4402e8604d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/display/api.js:2132 \u00B7 src/display/renderer_worker_proxy.js:313 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api.js"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd3786343611a762dd76e4664fa4b87f99d66fe7a7217fc373be7005a8958cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): src/display/api.js:2775 \u00B7 src/display/renderer_worker.js:304 \u2014 the two spans are one implementation copied and then locally edited \u2014 109 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api.js"},"region":{"startLine":2775}}}],"partialFingerprints":{"codehealthFindingId/v1":"774c4257c0436ef0a194548f042091bb09fdf94af82c79cb912b4b1e8a2704f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): src/display/editor/toolbar.js:49 \u00B7 src/display/editor/toolbar.js:279 \u2014 the two spans are one implementation copied and then locally edited \u2014 90 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":"src/display/editor/toolbar.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ee38a9f53bc5ca48c6b6dcafe45b60a2187bf47e6b9d22d4ecc3222e6065dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): src/display/network.js:286 \u00B7 src/display/network.js:370 \u00B7 src/display/transport_stream.js:177 \u00B7 src/display/transport_stream.js:239 \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":"src/display/network.js"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a11942e66caee285d8ceaefa5af790751efdad1ae30c1096d9abe35978abf20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): web/comment_manager.js:327 \u00B7 web/comment_manager.js:398 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/comment_manager.js"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"88735dbca3f11d2d6e327a49e909b0f86b8ba5083cbfe55b9166fe72137832a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): web/comment_manager.js:664 \u00B7 web/comment_manager.js:1008 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/comment_manager.js"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"e749c3b2a8507f8a9b58682441ab27ba2bf7a97e6549b59682b9b26878c7f576"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): web/pdf_page_view.js:181 \u00B7 web/pdf_viewer.js:350 \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":"web/pdf_page_view.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fa6760d0f644038278bd1ec83c5c8e2a9f5117d57692205b72d08ce11d3c81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): web/secondary_toolbar.js:211 \u00B7 web/toolbar.js:199 \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":"web/secondary_toolbar.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fde67b800b0db071cd76eee1b797ebbcb7053ad8ddd23d2658a5c91ba0f84cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/core/document.js:1947 \u00B7 src/core/document.js:2167 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"src/core/document.js"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"4153f5ad67e63168784703ddfeeda797f193d852b100672fe737812eaa11c2d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/core/evaluator.js:1640 \u00B7 src/core/evaluator.js:2377 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"61df133aced7580deabb991cacf9371e04947adeb991d7933c076d91ea33dded"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/core/evaluator.js:1689 \u00B7 src/core/evaluator.js:3325 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86361769548381be16b67b9f5bd15e35d8cd17b0bb32ab589278aca42ebb9f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/core/flate_stream.js:224 \u00B7 src/core/flate_stream.js:244 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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":"src/core/flate_stream.js"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1fdd493d13064c057efb347ca2b48874432fdb8b2728ee9dcacdca9c329a5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/core/jbig2_stream.js:27 \u00B7 src/core/jpeg_stream.js:29 \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":"src/core/jbig2_stream.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bb1705aa9793f2af06967c7d6b8681d1651c5b4d29da71aad1739015323cc7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): src/core/name_number_tree.js:25 \u00B7 src/display/binary_data_factory.js:26 \u00B7 src/shared/base_pdf_stream.js:33 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/name_number_tree.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a4719def1341aad5b26ec1d87fb6fd0f6bd781b9edcc132b7835b948a21e46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/core/pattern.js:1086 \u00B7 src/core/pattern.js:1099 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pattern.js"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a24a65207a5a9aef707e4f0ac2aeb2fb8f8493195d4eed813993d870f05180"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/core/xfa/config.js:439 \u00B7 src/core/xfa/config.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":"src/core/xfa/config.js"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d15393e57f9a33a8aee688ccd497c4657876919b807f45eff81a96ee45fefc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): src/core/xfa/connection_set.js:115 \u00B7 src/core/xfa/template.js:1287 \u00B7 src/core/xfa/template.js:2205 \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":"src/core/xfa/connection_set.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"689f6cb047a75370e09c26b00803238521a581cede6cff18b39bc14f948f1694"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/core/xfa/formcalc_parser.js:405 \u00B7 src/core/xfa/formcalc_parser.js:446 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/formcalc_parser.js"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b2d4399978ca448ff7f5e9494d705d455940f7b542074aa07b6dcba8ad0cd9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/core/xfa/formcalc_parser.js:1085 \u00B7 src/core/xfa/formcalc_parser.js:1319 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/formcalc_parser.js"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be3559e1cc7b5daad712efa14d8ed4ea86916f2d6b39cc206be7289560059e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/core/xfa/template.js:457 \u00B7 src/core/xfa/template.js:4580 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"5989fc99f9f77dc3fef0bb69c7bedb18febfbf5c9662cd2d419cf90c23c8ef66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/core/xfa/template.js:886 \u00B7 src/core/xfa/template.js:2345 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0edadd64d90a38405acf825f2a0484c5c6b37f262ed5b792121c8b8faff0d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/core/xfa/template.js:2470 \u00B7 src/core/xfa/template.js:5054 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":2470}}}],"partialFingerprints":{"codehealthFindingId/v1":"1104206be81b7207b8e7e3663c85d2be0f8e25dd5e979268f29deee3d7081eec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/core/xfa/template.js:3342 \u00B7 src/core/xfa/template.js:4734 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":3342}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b34f1bba3aa72f29fa63beb6fe1cd2d1dea8930ea4c2bf66a6bed143092e709"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/core/xfa/template.js:3707 \u00B7 src/core/xfa/template.js:4359 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":3707}}}],"partialFingerprints":{"codehealthFindingId/v1":"a844cfb5d16dd947b3dc89eeb87454042f01ace3ee88a9e6dbcb3801bc039f69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/core/xfa/template.js:3748 \u00B7 src/core/xfa/template.js:5886 \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":"src/core/xfa/template.js"},"region":{"startLine":3748}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f9f522f048e4ca752fe39234e98e60dfcbb9ae7c817ee4c7570f657bd11bba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/core/xfa/template.js:4244 \u00B7 src/core/xfa/template.js:4259 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":4244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8790299180eefc2dcc7111a5ae9874e5e53ec2353282e4ef05c1ba0746d779f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): src/core/xfa/template.js:4395 \u00B7 src/core/xfa/template.js:4643 \u00B7 src/core/xfa/template.js:4669 \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":"src/core/xfa/template.js"},"region":{"startLine":4395}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e60c8ca449f541e22f8c6e7b9deee78f78f3ccaf1b720dcf0310ed248c7227e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/display/dom_filter_factory.js:131 \u00B7 src/display/dom_filter_factory.js:296 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/dom_filter_factory.js"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"66feb54f4d1777a707911d3082f10e51f70e3c4fb3264afbdaea9ffaf38afc92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/display/editor/drawers/freedraw.js:237 \u00B7 src/display/editor/drawers/freedraw.js:251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/drawers/freedraw.js"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce2510a294a66320d4def7b8daf90a683c71cbadb3d1df375e028fd637cd86a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/display/editor/drawers/inkdraw.js:854 \u00B7 src/display/editor/drawers/inkdraw.js:885 \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":"src/display/editor/drawers/inkdraw.js"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc43e52290e8d1290e2847ea4b2f621dabb325bf39b680c5a79d49c4d165c93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/display/editor/drawers/signaturedraw.js:57 \u00B7 src/display/editor/drawers/signaturedraw.js:70 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/drawers/signaturedraw.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8203a45139de9925588464f295bc17573d21c1b18060c9df25c120e5682b5165"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/display/editor/ink.js:77 \u00B7 src/display/editor/signature.js:91 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/ink.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"60aa0a0ba90d86ae46cacb0d4b34dff4b72a722b5fba446822c5175a112cd7a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/scripting_api/field.js:673 \u00B7 src/scripting_api/field.js:768 \u2014 the two spans are one implementation copied and then locally edited \u2014 97 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":"src/scripting_api/field.js"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"462fd924fb30173c86ab808b85991fd55a14908c5cf541803ef767e4fbe81e10"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): web/comment_manager.js:684 \u00B7 web/comment_manager.js:1032 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/comment_manager.js"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f14dfbc0f36f5f678105df665697fcd65906bb70960cfa6d8325a852bf6b37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): web/pdf_page_detail_view.js:224 \u00B7 web/pdf_thumbnail_view.js:351 \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":"web/pdf_page_detail_view.js"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f805d49bb9b32966d47fffccef114fae32e5e4c0ec30474dbaa0a5af9cdf4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): web/pdf_thumbnail_viewer.js:553 \u00B7 web/pdf_viewer.js:1103 \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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2621f9aac665135ae0ecb42f45411fd478c4f4e5ba478c8a8b84acf97d8a84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): web/secondary_toolbar.js:221 \u00B7 web/toolbar-geckoview.js:74 \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":"web/secondary_toolbar.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"abeb96eb49764e2aa3cb368406512e733c0207f0cf63f6885f3115652cb5bec0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): extensions/chromium/options/options.js:154 \u00B7 extensions/chromium/options/options.js:171 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/chromium/options/options.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4072244fc202f2f9c7c46092d4e4afa3e52ad23dbacc499b189f938e308d9ae2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): external/brotli/decode.js:282 \u00B7 external/brotli/decode.js:294 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/brotli/decode.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e2bb26cd76fd5c65f09b9a03ae4431d5b7aec30bcd253cb369694289500a77"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): gulpfile.mjs:319 \u00B7 gulpfile.mjs:2385 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gulpfile.mjs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9788cb92dd4ec839c652310558451b6b338e95386ce03605cadab2c4dbd22bbf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): gulpfile.mjs:2668 \u00B7 gulpfile.mjs:3556 \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":"gulpfile.mjs"},"region":{"startLine":2668}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b768b0b02aa5e34fe3e3022cebc298e3e896730e35567f6686292529902efa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): src/core/annotation.js:4464 \u00B7 src/core/annotation.js:5217 \u00B7 src/core/annotation.js:5448 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":4464}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f83ec85de35449622b1f20144e9ec55dbf6979dccdcb2546f5940525012e8e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/annotation.js:5206 \u00B7 src/core/annotation.js:5440 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":5206}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0330e9b37bdccdbe349fc8f131cf95baec478b6704279735f572216831dc4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/catalog.js:579 \u00B7 src/core/catalog.js:591 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccead1e6a45db17e84c9befcb057018caa0c8ad7ff85a9f37e5fe7c7999b74f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/catalog.js:1481 \u00B7 src/core/catalog.js:1542 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea96f996ccb1d1767aa15864b8a96d4cd915dfa8d0c971ed2020e1337f05ee6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/colorspace.js:139 \u00B7 src/shared/util.js:529 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/colorspace.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba46a579371adfb4cdaa50f8eac2c4aa21956188d903c2aaf491a27a05ae65dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/crypto.js:415 \u00B7 src/core/crypto.js:503 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/crypto.js"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9ad1218488676c76bf198ea92635950e4ec1a4c92b42b203f1fbb88bdcdf93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/default_appearance.js:67 \u00B7 src/core/default_appearance.js:151 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/default_appearance.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4d28a9dc26f6ab3021d48498381d7cf2b13b8f9c7a50702c5bdedcebe3a40e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/font_renderer.js:173 \u00B7 src/core/font_renderer.js:361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/font_renderer.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"8208f5b360e407dbff3672925f314d09a1b6cf2be84e8f45fa32652d29e3a23a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/font_renderer.js:406 \u00B7 src/core/font_renderer.js:417 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/font_renderer.js"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e5e60bb3f1a12edbcefaa3d7705ce6993bb036b62bcfe674fdca2e4c090d63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/font_renderer.js:431 \u00B7 src/core/font_renderer.js:602 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/font_renderer.js"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e486205514b81293008825aa3dd88f2cebe1ff2121870811544fa8b26d4771"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/font_renderer.js:675 \u00B7 src/core/font_renderer.js:694 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/font_renderer.js"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe7bbc8881a7649338d1b5b8edbc93fabed78a7f0c9952bb2245c1fdc96b772"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/metrics.js:2286 \u00B7 src/core/metrics.js:2604 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/metrics.js"},"region":{"startLine":2286}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc91fcc88600a27c15410368aa443aecad32e3aa85f5f7099a603f064bcbc8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/core/pdf_manager.js:182 \u00B7 src/core/pdf_manager.js:201 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 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":"src/core/pdf_manager.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"953eb44efab69ccbf92b56c5b95edf1447f7e34edbe4f70ae4bd23dca608944e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5 locations): src/core/xfa/config.js:896 \u00B7 src/core/xfa/template.js:1788 \u00B7 src/core/xfa/template.js:2288 \u00B7 src/core/xfa/template.js:2636 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 2 files, 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":"src/core/xfa/config.js"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d66a8d89e06b8ac33a05c9a1e358ecc35d2baeea8fa2b9e193bdabb6bbd802"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/xfa/config.js:1274 \u00B7 src/core/xfa/config.js:1336 \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":"src/core/xfa/config.js"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"f958e7eea04559367bf6b868d43a89a8e8377512e707f99c3963cb18daeae825"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 7 locations): src/core/xfa/formcalc_parser.js:286 \u00B7 src/core/xfa/formcalc_parser.js:298 \u00B7 src/core/xfa/formcalc_parser.js:317 \u00B7 src/core/xfa/formcalc_parser.js:329 \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":"src/core/xfa/formcalc_parser.js"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d62eba250a6044b0c9400681665d38989ca68a0ff38625d41c643623f178d15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): src/core/xfa/template.js:1596 \u00B7 src/core/xfa/template.js:4755 \u00B7 src/core/xfa/template.js:5998 \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":"src/core/xfa/template.js"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"177980bf97f2824efb235c4e9b191c87fb6374ff7259cb6da586057dfe1341a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): src/core/xfa/template.js:2097 \u00B7 src/core/xfa/template.js:3537 \u00B7 src/core/xfa/template.js:4718 \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":"src/core/xfa/template.js"},"region":{"startLine":2097}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1fb1fa1bcd1bdaacb9a841e1db726abe71dcbc65628e009c3314c4d0fe03d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): src/core/xfa/template.js:2120 \u00B7 src/core/xfa/template.js:3327 \u00B7 src/core/xfa/template.js:4689 \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":"src/core/xfa/template.js"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9aa3abf278b6690d9bb28a6538d29631e205270858292ff44183092d0fe041"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): src/core/xfa/template.js:3218 \u00B7 src/core/xfa/template.js:3239 \u00B7 src/core/xfa/template.js:3787 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":3218}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c848f6e87290d8368fcca5c8906e7ec58ea1b2c1d78abef180555b386cd837"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/xfa/template.js:3794 \u00B7 src/core/xfa/template.js:4663 \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":"src/core/xfa/template.js"},"region":{"startLine":3794}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f0d9f3fc5b831c8fc06f4c85b65bc5aa96103eb54ec5e89bab1b722e319f98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/core/xml_parser.js:82 \u00B7 src/core/xml_parser.js:143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xml_parser.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84ab8b99b84b3d05c4392aa2be0bf4cea93382d865132185022534e543a9cc9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/display/annotation_layer.js:1963 \u00B7 src/display/annotation_layer.js:2065 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":1963}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bd6ade1dd1ddd4425bf6f0a3cbb2cc847de2bd7073a8ddf52ba281ec40776d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/display/canvas.js:1954 \u00B7 src/display/canvas.js:2092 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":1954}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f1c91a8564aeddac36f53db8934a451f19f5c0431a3c69aff8374579904cc9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/display/canvas.js:3415 \u00B7 src/display/canvas.js:3579 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":3415}}}],"partialFingerprints":{"codehealthFindingId/v1":"751f46d5c3391bec1f05e9fe680b12b39d79c5762d3c0ab401ae1c02cdf42f1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/display/obj_bin_transform_display.js:38 \u00B7 src/display/obj_bin_transform_display.js:66 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/obj_bin_transform_display.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc2797ee8bf446fb3024c9ce6cfb4cc8ea0385a3b16fd1629f25a2f62c7f03e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/display/pattern_helper.js:711 \u00B7 src/display/pattern_helper.js:798 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/pattern_helper.js"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba092f14cd152c3ce28c3a2570932521b87a42d89352b035367c0291f533bbf1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/scripting_api/doc.js:632 \u00B7 src/scripting_api/doc.js:824 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"4704301c90bf76450ef02a7b5aa45f75c10d11dabf6e7f8578d6d2281b7e4a0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/new_alt_text_manager.js:100 \u00B7 web/signature_manager.js:1019 \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":"web/new_alt_text_manager.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d220106660168410f6d8b2e8635c619ce90f9e59694aabe8654747f2a6ece4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): external/brotli/decode.js:1682 \u00B7 external/brotli/decode.js:1694 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/brotli/decode.js"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9573610b05569f3720b239a04eaa0cbb8aa98c8afadfa3935d24ef2c85f739e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5 locations): external/brotli/decode.js:2131 \u00B7 external/brotli/decode.js:2151 \u00B7 external/brotli/decode.js:2171 \u00B7 external/brotli/decode.js:2191 \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":"external/brotli/decode.js"},"region":{"startLine":2131}}}],"partialFingerprints":{"codehealthFindingId/v1":"029d8a653e100d823efb989b28822accc1f3020a05addd972605fb9e63156d7c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): external/builder/babel-plugin-pdfjs-preprocessor.mjs:175 \u00B7 external/builder/babel-plugin-pdfjs-preprocessor.mjs:193 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/builder/babel-plugin-pdfjs-preprocessor.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1d710ef1881d163a6fa79663a306ae665bd94c1d938e82701f4b30d7b30cca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): external/cmapscompress/compress.mjs:66 \u00B7 external/cmapscompress/compress.mjs:100 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/cmapscompress/compress.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3ac2ed1fb355404cad80df01eb76e4eb384db70e8f4554ce3acb238fb01ca9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/annotation.js:4729 \u00B7 src/core/annotation.js:4780 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":4729}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be2043295e7502625ed44b32f535cb356a5b0472bdd9ffdcc46a144aad309c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): src/core/calculate_sha_other.js:190 \u00B7 src/core/calculate_sha_other.js:201 \u00B7 src/core/calculate_sha_other.js:212 \u00B7 src/core/calculate_sha_other.js:223 \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":"src/core/calculate_sha_other.js"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b1eb2856a23f6ea8cbd6709f892f099bb14cf7f4c506582681b4f932763e5b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/core/colorspace.js:400 \u00B7 src/core/colorspace.js:753 \u00B7 src/core/colorspace.js:1269 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/colorspace.js"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d320ba364148adffb267600beaff9cb91a7d1aacb22fbdfcef61bbf0f71095"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): src/core/colorspace.js:558 \u00B7 src/core/colorspace.js:753 \u00B7 src/core/colorspace.js:842 \u00B7 src/core/colorspace.js:1130 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/colorspace.js"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eaf321fb817f3cd0a15f1f2e3234708259792df0cf0ed235c92bd1ecd25eef0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/core_utils.js:223 \u00B7 web/pdf_history.js:741 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/core_utils.js"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4981c2696024de87802ffea07bcc33d646c36d9f17f42f505ae9e349214ad00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/editor/pdf_editor.js:2752 \u00B7 src/core/editor/pdf_editor.js:2804 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":2752}}}],"partialFingerprints":{"codehealthFindingId/v1":"896d90b3026eb48e50f807e11cd512083c0c94d3c5c5639dc30452e4ad4ceaeb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/evaluator.js:1425 \u00B7 src/core/evaluator.js:1435 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2664aef2ef6a88aa8304121ccfe0658aec864eac69fd51afb7706d9ce56d1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/evaluator.js:3531 \u00B7 src/core/evaluator.js:3645 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":3531}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14590f03a63492f51b121bbc25677e0c161ecc4a0e0d15c38171aa18f2db532"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/evaluator.js:4269 \u00B7 src/core/evaluator.js:4306 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":4269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d7e480921a82da7ec226887206f1b56ebc40f4b30386dd6dd191044744a07b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/fonts.js:2622 \u00B7 src/core/fonts.js:2643 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":2622}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3bb2b11eccf6a2cbbaf4973c8bd6a259ee8a4c35328d887b393dbd55825638"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/metrics.js:1587 \u00B7 src/core/metrics.js:1905 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/metrics.js"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"30987ef9647169a25d2606fe7c252d458dd7c6c3cc98771567c2a6e1d885b848"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/metrics.js:2223 \u00B7 src/core/metrics.js:2541 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/metrics.js"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"b712994d30cf8b9cc737d49bd207fc89356e7c07d51bf9e6d29508c9962fcc5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/postscript/ast.js:165 \u00B7 src/core/postscript/ast.js:192 \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":"src/core/postscript/ast.js"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6679efbb402499c685ca73ebe7c84e958995e02ffcdf4c560ab85fec5287ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/postscript/js_evaluator.js:360 \u00B7 src/core/postscript/js_evaluator.js:387 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/js_evaluator.js"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d68e2fa7b3c9eaa19954cab24db0300f4ba3b028b2e8649b2c9c34970c9d47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/type1_font.js:208 \u00B7 src/core/type1_font.js:225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/type1_font.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a06f6eee1397595ec5573f8bb9f8159cbe56ae3b34ea3585bd0692a97e74c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/xfa/connection_set.js:25 \u00B7 src/core/xfa/template.js:3960 \u2014 the 2 copies are spread across 2 files, 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":"src/core/xfa/connection_set.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab2acd8dac1d838b8ccb2726c79caafb7e94ba90a5ec30ab6b359adc5a52358"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/xfa/connection_set.js:112 \u00B7 src/core/xfa/xdp.js:22 \u2014 the 2 copies are spread across 2 files, 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":"src/core/xfa/connection_set.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca8a6a9befc29e050d26d85d65c3d0716074f808e056c49e92cb82cd2fb7509"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/xfa/html_utils.js:296 \u00B7 src/core/xfa/html_utils.js:306 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/html_utils.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6fee3d2feeecb20f597365a3baf85f7eb9e0df4a97fcb996d502022bd094ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/xfa/layout.js:322 \u00B7 src/core/xfa/layout.js:343 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/layout.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"8007fbc59670989ae9e1fda2dce53b4cce715ca0ca3d63b73d34f41ccda30bd2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): src/core/xfa/template.js:1540 \u00B7 src/core/xfa/template.js:2228 \u00B7 src/core/xfa/template.js:3396 \u00B7 src/core/xfa/template.js:4658 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"94bbd2271d713d73697a2f29e8babd4aa12a54a85578885520ff3858e40f3865"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/xfa/template.js:1739 \u00B7 src/core/xfa/template.js:4003 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1739}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e9c79278712d04bd641940034560feb084c8d3e7258a970de90a340c824d10"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/xfa/template.js:2230 \u00B7 src/core/xfa/template.js:3398 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":2230}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bde979cd059a83801216617cd6fb8551e98a489cbd3578a8bab85c24b6a2ad6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/core/xfa/template.js:3319 \u00B7 src/core/xfa/template.js:5236 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":3319}}}],"partialFingerprints":{"codehealthFindingId/v1":"514541c31798c671742dd6da12b3b8630836f4d3461d898d74a4eb2dd1fea210"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/display/annotation_layer.js:1099 \u00B7 web/pdf_outline_viewer.js:154 \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":"src/display/annotation_layer.js"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75095a363ffe8d48e32bba394f8b94c1c937574ff1c6615efa1255a40900c2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/display/draw_layer.js:690 \u00B7 src/display/draw_layer.js:719 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/draw_layer.js"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"e195863a2b0d17b9e7162dd9bd3d42f1dae379a36081bf9d82fd6331f0900ce3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/display/editor/drawers/highlight.js:270 \u00B7 src/display/editor/drawers/highlight.js:280 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/drawers/highlight.js"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"be829679c7c8aa7968e70e722693e444dc3c6b031d501a3b46e1b10d307f85e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): web/internal/tree_view.js:429 \u00B7 web/internal/tree_view.js:472 \u00B7 web/internal/tree_view.js:544 \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":"web/internal/tree_view.js"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aaf0a5b2127a2a5a533eb319c5ff6d4ab7601ca86aea2b8d72808402eca1b16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): web/password_prompt.js:50 \u00B7 web/pdf_document_properties.js:74 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/password_prompt.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a34196217d73196152de2405893dc034e725041c8df76d7dfd1670bea3d18f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): web/viewer-geckoview.js:40 \u00B7 web/viewer.js:210 \u2014 the 2 copies are spread across 2 files, 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":"web/viewer-geckoview.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d94e1aed1e611f497880dcf61cbcea96356815401ede7c9a84a42375f3ef18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): external/brotli/decode.js:233 \u00B7 external/brotli/decode.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":"external/brotli/decode.js"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c9df6262d54167982637c6ea008bd65a774ac87907bc48c95a841b69eb8e4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): external/brotli/decode.js:402 \u00B7 external/brotli/decode.js:587 \u00B7 external/brotli/decode.js:641 \u00B7 external/brotli/decode.js:902 \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":"external/brotli/decode.js"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11f5b313c14af2deceaf4931bfc2153c0d4fd372463944dc931747415e301da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): external/brotli/decode.js:639 \u00B7 external/brotli/decode.js:1477 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/brotli/decode.js"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a0d4cc62b8281ad5f0cb69e8112dd562865f9cb7b4f41a0333154d6f8926e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/core/annotation.js:5011 \u00B7 src/core/annotation.js:5205 \u00B7 src/core/annotation.js:5439 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":5011}}}],"partialFingerprints":{"codehealthFindingId/v1":"187a5e7bc41e69f6f1ced7cb0f75bc4f5f821bbc4c01c9e8dbb724e4e23889b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/core/annotation.js:5043 \u00B7 src/core/annotation.js:5219 \u00B7 src/core/annotation.js:5450 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":5043}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1aa38e387b26a7bf47988fab316c8dc5f73ee04720c7d3bdd6d82516d8dd755"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): src/core/annotation.js:5159 \u00B7 src/core/annotation.js:5286 \u00B7 src/core/annotation.js:5325 \u00B7 src/core/annotation.js:5370 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":5159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6baad8950fb56901694316635f8b77b22b2be313250c1b625a58cc5519f82639"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/binary_cmap.js:264 \u00B7 src/core/binary_cmap.js:289 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/binary_cmap.js"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf007442dc1954d7621db21626a3a230605c3d018bd6940284eb232d2c071012"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/calculate_sha_other.js:361 \u00B7 src/core/calculate_sha_other.js:372 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/calculate_sha_other.js"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc90ac01b4ed35ba4d9c86d5eb0c3a6c81f02263b31076ae45c444971af69cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/default_appearance.js:280 \u00B7 src/core/default_appearance.js:325 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/default_appearance.js"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18606d9be36a016a9db35faf0ee348a4259b35db0e7f98cb5f92756693c42cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/editor/pdf_editor.js:2251 \u00B7 src/core/name_number_tree.js:50 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":2251}}}],"partialFingerprints":{"codehealthFindingId/v1":"82aa0ff086b9ce5bc8fd557051716e38d19be6f07fd3bb8bceec209308ce31fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/evaluator.js:5275 \u00B7 src/core/evaluator.js:5285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":5275}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d2b4116b244e1a44482a2f8a6a4857731bc96f4717563a2ad7831374c18480"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): src/core/font_renderer.js:475 \u00B7 src/core/font_renderer.js:488 \u00B7 src/core/font_renderer.js:504 \u00B7 src/core/font_renderer.js:520 \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":"src/core/font_renderer.js"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"802438edabe0d8fcb81d4198a9e27a47af5403689ed5ea7cfbec1e4b82e87d08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 12 locations): src/core/glyphlist.js:18 \u00B7 src/core/glyphlist.js:4351 \u00B7 src/core/metrics.js:27 \u00B7 src/core/metrics.js:345 \u00B7 \u002B8 more site(s) not listed \u2014 the 12 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/glyphlist.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cff3acfb59cdb0413ed716c74b4eda31d0fc9e7a24b4330a768811efa85100b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/jpg.js:575 \u00B7 src/core/jpg.js:688 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/jpg.js"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"489dd66f4670809f3c5879d4815c27e02a4abf1b2dbb4eae46d19d9b232f3354"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/jpg.js:814 \u00B7 src/core/jpg.js:895 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/jpg.js"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd65128894a3938a3a7956f47de6de7e3aa3f538c58bed809f85408ea18cfc3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/jpg.js:1279 \u00B7 src/core/jpg.js:1315 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/jpg.js"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa31be95644bde64cd4d94cdaf98905989b4deb57f7db5f4fbb45d0c24b09c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/pattern.js:910 \u00B7 src/core/pattern.js:1041 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pattern.js"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"363b47a6ea9659fd49a204d803a2373b3262a502000fc22fcb76543fc1374c35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/postscript/ast.js:903 \u00B7 src/core/postscript/ast.js:928 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"617b910ee143cbc51bc047d2a3fdfda01acf7cfa6ef3f94ebff4999136fa85de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/postscript/js_evaluator.js:640 \u00B7 src/core/postscript/js_evaluator.js:649 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/js_evaluator.js"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5bc5ce5d86bc49d893764027bd7fe16c178aff73d4e141106e2884a07571d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/postscript/lexer.js:145 \u00B7 src/core/postscript/lexer.js:157 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/lexer.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f552ea1a57030f7093e508d8aefce63bb8195fc633d7c369fe9c7bcdcee7ec8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/struct_tree.js:889 \u00B7 src/core/struct_tree.js:902 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6e375e7f6546611c4a5593ac48660cfe985b206c52d86d94b06261de8c84fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/core/worker.js:86 \u00B7 src/display/renderer_worker.js:334 \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":"src/core/worker.js"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fe448961896d145305946e7a2cbf60291cab4c4689435200de86cdcb113153"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/xfa/connection_set.js:54 \u00B7 src/core/xfa/template.js:860 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/connection_set.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"105563c172e3909b2ba3b02a4ec18c5c780debd83e299cbec52a679e4d6e7c2d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/core/xfa/formcalc_lexer.js:239 \u00B7 src/core/xfa/formcalc_lexer.js:301 \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":"src/core/xfa/formcalc_lexer.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f98f9d07f841761d984fb3f09f4068df7ca89a488a00675b7361ac1aa9eac3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): src/core/xfa/template.js:423 \u00B7 src/core/xfa/template.js:3339 \u00B7 src/core/xfa/template.js:3616 \u00B7 src/core/xfa/template.js:3818 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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":"src/core/xfa/template.js"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c74e81d33f1754b135c6d99f51173c27824a9d2dbedf680c72847290a26b830"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/xfa/template.js:732 \u00B7 src/core/xfa/template.js:6005 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"219df9a8fbec15951d123d7890d22f74475788fa3169e3a4d81d6b38fb2f3428"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): src/core/xfa/template.js:1781 \u00B7 src/core/xfa/template.js:2628 \u00B7 src/core/xfa/template.js:3559 \u00B7 src/core/xfa/template.js:6098 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5ef231df8523ca2817aabefae50801029b3f55e09cafef95ad9b42824998e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/core/xfa/template.js:1999 \u00B7 src/core/xfa/template.js:3619 \u00B7 src/core/xfa/template.js:4561 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"788df96174d38e187472c7ed612090ae0f29fc5a1eea00b06ed9c80fca9d3c23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/xfa/template.js:3332 \u00B7 src/core/xfa/template.js:3722 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":3332}}}],"partialFingerprints":{"codehealthFindingId/v1":"008aa04691abd3e1ecfdeb9784ecd4c2a92a6597c2c7ca9056d77363b41b491b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/xfa/template.js:3369 \u00B7 src/core/xfa/template.js:5656 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":3369}}}],"partialFingerprints":{"codehealthFindingId/v1":"b060a3225d2097815ac339dd90c4a49f3fe205abe371cffa970526838bad00cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/core/xfa/template.js:4975 \u00B7 src/core/xfa/template.js:4986 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":4975}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc69efaf09f1efc796b05702af674f0a9ac2cdd27baf3d22cbeed932eac303a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/display/canvas.js:146 \u00B7 src/display/canvas.js:179 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fdc6264966dd9c8e2c0ff7f0b41a306466a3cadb2ba60afe89c02531a75928"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/display/editor/annotation_editor_layer.js:812 \u00B7 src/display/editor/annotation_editor_layer.js:873 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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":"src/display/editor/annotation_editor_layer.js"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"36919efeb467a1e9600dcaf191c824355d0336725c859be9c4f793142d8d047f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/display/editor/comment.js:53 \u00B7 src/display/editor/toolbar.js:64 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/comment.js"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"28843e48d05f25e63501b73f762b3b224137dd57b2791f9bec0acb818a79025c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/display/obj_bin_transform_display.js:259 \u00B7 src/display/obj_bin_transform_display.js:269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/obj_bin_transform_display.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"0197510d3498ad8e61ccbd0f5e87425c5889ac28af69d269254961a3ab6097fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): web/internal/debugger.js:27 \u00B7 web/internal/debugger.js:45 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 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":"web/internal/debugger.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7272379beaa6ddc35782a08dec12d7bfa08d1265b02feda16039e5f2a5b46f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): web/internal/draw_ops_view.js:653 \u00B7 web/internal/draw_ops_view.js:666 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 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":"web/internal/draw_ops_view.js"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"e875c48765806767f6cb0c4af457e627599f6ac26bfb8036e0fc364ae67b6b06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): web/pdf_find_controller.js:210 \u00B7 web/pdf_find_controller.js:224 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_find_controller.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b06b5942391a7129b623884fd1c594829af5e17b95bc957b75f6567316cd5ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): external/brotli/decode.js:1693 \u00B7 external/brotli/decode.js:1707 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/brotli/decode.js"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d191ef6056e3513b3a32866b251097c1fa994e5ad1d5c060b1b349d7b0076e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): external/cmapscompress/compress.mjs:312 \u00B7 external/cmapscompress/compress.mjs:338 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/cmapscompress/compress.mjs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"488f3dc62300dd754210cb24ec105368e74781fe9721cc11c76de1c69b129dad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/annotation.js:1548 \u00B7 src/display/annotation_layer.js:894 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae07c024dba9fe79215dce1e5c6470b6c8724cfc7d4b6bf5605f0a10a0cc8bd1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): src/core/annotation.js:4624 \u00B7 src/core/annotation.js:5083 \u00B7 src/core/annotation.js:5124 \u00B7 src/core/annotation.js:5255 \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":"src/core/annotation.js"},"region":{"startLine":4624}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a2e61781dfe1eb9f43cdda343bd5447700ac4d398fa665d159d8ed5848f37c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/annotation.js:5081 \u00B7 src/core/annotation.js:5253 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":5081}}}],"partialFingerprints":{"codehealthFindingId/v1":"919cda778ec746f171c9a608cf723a54a35917c452538a3d36e856061268e9b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/binary_cmap.js:188 \u00B7 src/core/binary_cmap.js:206 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/binary_cmap.js"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9f5d5d9bb10033c5f078ccb62c72d361db330b0982806166fb481973a859fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/catalog.js:1113 \u00B7 src/core/catalog.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":"src/core/catalog.js"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"820fdc144e71f9ab0d0444885ab621cd9e595619eee9c61299c045b2014a65c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/cff_parser.js:573 \u00B7 src/core/cff_parser.js:582 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_parser.js"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec2f187404dedce13c938fe98bebd0c786905548b69f1a97c319fe94e73605d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/crypto.js:665 \u00B7 src/core/crypto.js:682 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/crypto.js"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"128c925489565bf8942dca71fe3e8579c58047428191b2d4333c31bef7f6b3f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/image.js:1082 \u00B7 src/core/image.js:1232 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image.js"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0beecf8d14ac39e60465a1cfcac44b08e84a7fd4bc6ad470615c03676e41c33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/pattern.js:922 \u00B7 src/core/pattern.js:1053 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pattern.js"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea0f87d4ddef1b3aa535a3bee9274da6f04959abb309407fe829b745623be26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/core/string_utils.js:30 \u00B7 src/core/string_utils.js:39 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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":"src/core/string_utils.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fc6be1199d5872c3fbe401e75be54ba1af73f3b7bdffecc1ca5006e92db23a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/type1_parser.js:835 \u00B7 src/core/type1_parser.js:1079 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/type1_parser.js"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"689f03f43a82b5daa3c947c524a3ecf4bdab9dbf9e88ef46384a8414e1916377"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6 locations): src/core/xfa/template.js:869 \u00B7 src/core/xfa/template.js:1648 \u00B7 src/core/xfa/template.js:1667 \u00B7 src/core/xfa/template.js:3179 \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":"src/core/xfa/template.js"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdfe450c83a9789c40f51d5905b5ca0cc35ee96cdd0accf857d79daedcb566b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/xfa/template.js:3489 \u00B7 src/core/xfa/template.js:4342 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":3489}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fc784fd630c321510d17024190851cf85067e3d987c924fd556facda466012"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/core/xfa/template.js:4365 \u00B7 src/core/xfa/template.js:4528 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":4365}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d83ed32116ab7f5457e9654a38e506f1e369484ee9262f08a5f7eca7ca3db8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/display/api_utils.js:172 \u00B7 web/event_utils.js:95 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api_utils.js"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef560fc4fdda2c18721c5ddae1936004c1af74a1bd387801e68bd0f4bc03cea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/display/canvas.js:334 \u00B7 src/display/canvas.js:403 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ed10528f3a2af3362ece71aafbfd95e22a684c7bc0e0865eb62d3845daf71d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): src/display/draw_layer.js:576 \u00B7 src/display/editor/tools.js:3003 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/draw_layer.js"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"690b863ed61afe1331923570b62c971ddc939b1b856b0a7e9e75f398c7858d9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/display/editor/tools.js:2974 \u00B7 src/display/editor/tools.js:2982 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/tools.js"},"region":{"startLine":2974}}}],"partialFingerprints":{"codehealthFindingId/v1":"df20e99a3c3e88eecf4f00ea879839a272bad9392e2c2960c458260317ed59f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): web/alt_text_manager.js:79 \u00B7 web/new_alt_text_manager.js:103 \u00B7 web/signature_manager.js:1022 \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":"web/alt_text_manager.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca13158e9e8d6aa282e7ce31c3c38d2f9bd7525dba620614f7ab9ae0c2f0ef82"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/debugger.mjs:598 \u00B7 web/debugger.mjs:607 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/debugger.mjs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5cbe45132ac6f7b7b4e30e641d07b074f9c3acecaa2abde7f1fce1834a4148"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): web/internal/draw_ops_view.js:389 \u00B7 web/internal/tree_view.js:824 \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":"web/internal/draw_ops_view.js"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f678ace57683c4d93cc31abd5665bd6720acbb10a6573ede830c288c8c6da0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/internal/tree_view.js:679 \u00B7 web/internal/tree_view.js:689 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/internal/tree_view.js"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea641684827ddd4ba1b6a8dde298c63eef87e9d114348603c9366b51c040e91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): external/cmapscompress/compress.mjs:96 \u00B7 external/cmapscompress/compress.mjs:130 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/cmapscompress/compress.mjs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32e6ae9db4fa665e6f93ca77a0af5ee841a6bb35616f09cc37ce4a8f62b2a8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/core/annotation.js:1872 \u00B7 src/core/annotation.js:5134 \u00B7 src/core/annotation.js:5265 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a01c2beaaf1d8d55b95a9ab608f69d64dcd46344887e6a7044bcf92ab16c867"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/annotation.js:3620 \u00B7 src/core/annotation.js:5508 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":3620}}}],"partialFingerprints":{"codehealthFindingId/v1":"718115c52100fc07ae1514f86058719989b4e88fbed4d843f2eabc50cec4fdf9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/core/annotation.js:4545 \u00B7 src/core/default_appearance.js:377 \u00B7 src/core/default_appearance.js:419 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":4545}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b9989c73ac50074757148d4d8e696bc25e178772bc277d7902df3989f0ffdc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/annotation.js:4891 \u00B7 src/core/annotation.js:4984 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":4891}}}],"partialFingerprints":{"codehealthFindingId/v1":"113d82455ab7635520fe0d69830e308d50a6ad7ff9b0dd222efe1a8a264bfba0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/catalog.js:1326 \u00B7 src/core/catalog.js:1384 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f628f3a9af9bbea58691523ab85f477a9ec3560a0357002283af33fe6091cb4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/colorspace.js:46 \u00B7 src/core/colorspace.js:84 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/colorspace.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aba948531759c9cb3650601b739d44392a168de004fe8104ef677da1113f968"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/colorspace.js:998 \u00B7 src/core/colorspace.js:1039 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/colorspace.js"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a1bee9880d5c2055ac52a5993923123a58d355f6ba1f6981b3cf39ad384769"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/crypto.js:674 \u00B7 src/core/crypto.js:692 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/crypto.js"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d1a82d4e7d17eda73000bec1831b82586ffff93bea0726c5e7a1a747aeebc7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/crypto.js:983 \u00B7 src/core/crypto.js:1033 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/crypto.js"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57aac7a6e6eac73d4bc8fad7c3400e194772022833793fcd0c5ce29362ad06d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/evaluator.js:1402 \u00B7 src/core/evaluator.js:1409 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb46894fb269b27876808f3eff479a70f204aeca3b9d54e2e44e36a18969ee4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/font_renderer.js:649 \u00B7 src/core/font_renderer.js:693 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/font_renderer.js"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e767826680db0095c474704c1472ec4e93642fd0286a348d9f78b683e0ae25e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/parser.js:215 \u00B7 src/core/parser.js:485 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d53c2a98fa496ab5652dd1de9efdfcc391704ba770941f284d2353b7e6f3c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/pattern.js:900 \u00B7 src/core/pattern.js:1031 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pattern.js"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f573ff1db5a9b556bc057ccc4e243bf284b975137d525dbe556e757a138671e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/postscript/ast.js:1389 \u00B7 src/core/postscript/ast.js:1397 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64394a4c290ac105d8538a6dcdd2eeab8c9e1ed9f30a28fc782269564f6bbed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/core/postscript/js_evaluator.js:551 \u00B7 src/core/postscript/js_evaluator.js:560 \u00B7 src/core/postscript/js_evaluator.js:576 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/js_evaluator.js"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf62ee02a26f5db4d220b32d679f2b78fc3a7d6a156cdfa648e50d36b089050e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/postscript/js_evaluator.js:657 \u00B7 src/core/postscript/js_evaluator.js:669 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/js_evaluator.js"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a127b7d1a7eb891e7a048d691ebc69f263f8ad47405f42b7f027de89ad1ae0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/unicode.js:232 \u00B7 src/core/unicode.js:240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/unicode.js"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e21782c5a53c3d4fc71cab05d590fb2a0b879518077739dc485ec4761d14e4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/xfa/html_utils.js:84 \u00B7 src/core/xfa/html_utils.js:327 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/html_utils.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5f93d639a56799635a62203be111b0c64a6e200effd4d7bdfa51c71c8a0ba7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/xfa/template.js:551 \u00B7 src/core/xfa/template.js:1557 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef84feb337561bb07f64920dff686363c78f9ec514fc73c2a1739387d9b3f58a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/xfa/template.js:2278 \u00B7 src/core/xfa/template.js:5357 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":2278}}}],"partialFingerprints":{"codehealthFindingId/v1":"fece476751471c238f47507d6c6ce560e1c02131805f2386d5f6e6853030f5fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/core/xfa/template.js:3969 \u00B7 src/core/xfa/template.js:5291 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":3969}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5cac27cf5bb10bf23558bffb4136cf943f7de8ebdbbee8949dcfc1e46b68fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/display/editor/drawers/inkdraw.js:791 \u00B7 src/display/editor/drawers/inkdraw.js:842 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/drawers/inkdraw.js"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cc56ca15b3c646c5acc2bdd937ebcfe4c007dc29dd600f49728c3c7640aa3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/display/editor/editor.js:948 \u00B7 src/display/editor/editor.js:1429 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/editor.js"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"c088a803844ce191901a404d976e0cfeb2d4770b777085259f99870b35da81d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/display/webgpu.js:184 \u00B7 src/display/webgpu.js:192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/webgpu.js"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6dd23fd4405b2a522d4206ae04202f9c8c7ef7fa406771c80f89619016b2d43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/shared/image_utils.js:99 \u00B7 src/shared/image_utils.js:117 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/image_utils.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a39d44dfe07465a9e04fe20d08e50c639dc247e81486787fdde0d4714b6a6b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/shared/murmurhash3.js:66 \u00B7 src/shared/murmurhash3.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":"src/shared/murmurhash3.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd503fc637d51c9a86a633d0c0074619ac93b721b0c8ba5bc3cb5502dceae28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/shared/util.js:784 \u00B7 src/shared/util.js:809 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/util.js"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"e133dbd528ffb347e281e57878c7f957e5b8094ff2d35130e4262d6c163b1104"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/internal/tree_view.js:331 \u00B7 web/internal/tree_view.js:347 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/internal/tree_view.js"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6eac1c48a8e6f954b7dbc41e4844e6ed702f818724dca93bbd3b804c5b817a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/pdf_page_view.js:822 \u00B7 web/pdf_page_view.js:829 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_page_view.js"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca552248c839f2d459809688b20b20052f106861a514588ffde55eece80ebd5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): external/brotli/decode.js:260 \u00B7 external/brotli/decode.js:907 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/brotli/decode.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c34a62b9c9437677bfcf2c807bbfaf7e31e751fd0e0b91b5d63e32e4dde303"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): external/brotli/decode.js:2103 \u00B7 external/brotli/decode.js:2115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/brotli/decode.js"},"region":{"startLine":2103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3ef5b3046ddacf5bdb12230d0c086023b5d83118d8507dea96f317aa3da6ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): gulpfile.mjs:1472 \u00B7 gulpfile.mjs:1499 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gulpfile.mjs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b49912bd4e9581973b3b4db8b8b314382516bb6e96e60678d2408dbe965262"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): src/core/annotation.js:4655 \u00B7 src/core/annotation.js:4714 \u00B7 src/core/annotation.js:4760 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":4655}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af992256502f498ff3aa4e14a33972e17897f2b71a8c60048fe928e41a5500a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/bidi.js:214 \u00B7 src/core/bidi.js:290 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bidi.js"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99a4b4bc5fcceb84a995631ff998fce16f68a276f7ae3522533abea9fa8fe9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/colorspace.js:280 \u00B7 src/core/colorspace.js:290 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/colorspace.js"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"656350883adce9146d8120bc4b7fd779317d4722a1835248a7451e100990dd8c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/crypto.js:445 \u00B7 src/core/crypto.js:517 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/crypto.js"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27482fa0ec223c68e6cff899fd0de52f2dd9651f4d27588f5f7023566e35db4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/core/xfa/template.js:3600 \u00B7 src/core/xfa/template.js:3612 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":3600}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d58f0477198bdb89aa2ae116ed6ab87f3e2494c950438f48c857374cf656a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/display/annotation_layer.js:2670 \u00B7 src/display/annotation_layer.js:2680 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":2670}}}],"partialFingerprints":{"codehealthFindingId/v1":"debc5a2e3efc651a7d07ce43e5c9a4aad7b9cf431b7850e3060ccca1aa6b2222"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/display/annotation_layer.js:703 \u00B7 web/annotation_layer_builder.js:313 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"57821fb5756c85abb1e1dc112003076aab888d2c1f3067c6d8b1e9a457fefe0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/display/editor/drawers/outline.js:146 \u00B7 src/display/editor/drawers/outline.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":"src/display/editor/drawers/outline.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ec42a97a88120d0ba5656dbe38b18ab9977222f045cb6792227c6d8353f5cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/display/editor/editor.js:956 \u00B7 src/display/editor/editor.js:1422 \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":"src/display/editor/editor.js"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffe23505ed96517e6921d72873b5c0bbcd1f5e615ccc31e73be090f3253470f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/scripting_api/doc.js:121 \u00B7 src/scripting_api/doc.js:128 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"133448c9180c0f60ddd511522e0f14b0e27bada110458f528ceb2c61b0082557"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/core/annotation.js:4358 \u00B7 src/core/annotation.js:5438 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":4358}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b058dad57a713a22126b7eda388447a8baa489b895b5dc86caa239d69bc06b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/core/cmap.js:309 \u00B7 src/core/cmap.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":"src/core/cmap.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bb37297636916fe4439c4ad969ff16755bdf7df4506e54265a250178118337"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/core/evaluator.js:5295 \u00B7 src/core/evaluator.js:5301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":5295}}}],"partialFingerprints":{"codehealthFindingId/v1":"458b52f63e9eff0348a31d4eaabf9f78f44d815b0cede3145d7e218ff5be4d4f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/core/image.js:92 \u00B7 src/core/image.js:116 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ae757b0640c1c5a9c2e0cce4c0f921ef38499844d1213e47a38480a7991cc6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/core/image.js:1122 \u00B7 src/core/image.js:1130 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image.js"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd79de130a800c29b5ffab24838dea313ef1086f77336e039d928a45e71c68a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/core/pattern.js:932 \u00B7 src/core/pattern.js:1063 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pattern.js"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99050827a08b6a517c55f22f2355ee026f4d68afe3afcb4a246579648e0676b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/display/canvas.js:172 \u00B7 src/display/canvas.js:190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59d6848dfb47700a602c4e3667dfb78119c63c21f4c13ec81b6db696f9ea839"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/shared/util.js:929 \u00B7 src/shared/util.js:951 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/util.js"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"46093c1644fb9db06ddff06babac51c645132413665f954d1de92f53a859c10e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/pdf_thumbnail_viewer.js:745 \u00B7 web/pdf_viewer.js:1287 \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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b75e0fc60cad5f0893ea4b0a3ef85eb1a282c38b633fdd0081db3ad31d555d0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: external/stylelint/no-unused-custom-properties.mjs:17 imports stylelint/lib/utils/validateTypes.mjs, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/stylelint/no-unused-custom-properties.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8edc5f0f6a159e5bb5a208e972a82118f9e17a2d0db792b9e0f9cdc71139aa"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: gulpfile.mjs:3228 imports test/webserver.mjs, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gulpfile.mjs"},"region":{"startLine":3228}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bd6c64c5c009c377569833e52fad895bdda9f6754518521daface19dc04a6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onKeyDown (cyclomatic 120, cognitive 142): onKeyDown has cyclomatic complexity 120 and cognitive complexity 142; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app.js"},"region":{"startLine":3315}}}],"partialFingerprints":{"codehealthFindingId/v1":"88117d4a84b948d666d4d06d5bc9415528440baabc80b3b5275bd92485311b5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function promiseBody (cyclomatic 110, cognitive 187): promiseBody has cyclomatic complexity 110 and cognitive complexity 187; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f11b58fd936ab29e5db74e6db5c1eeb525b236f20543e0de2bf4a3da3bf3a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkAndRepair (cyclomatic 105, cognitive 179): checkAndRepair has cyclomatic complexity 105 and cognitive complexity 179; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8db67395e639322e8cbed4e464341d619f49753a5d772e4c8f31a7080ce158"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bidi (cyclomatic 97, cognitive 152): bidi has cyclomatic complexity 97 and cognitive complexity 152; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bidi.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"76319db5ae2dba92828f30258c8ffcd03b4defc493e8467c260e24552051051e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decompress (cyclomatic 84, cognitive 250): decompress has cyclomatic complexity 84 and cognitive complexity 250; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/brotli/decode.js"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9cdcccf2bd9dca35cfd68e7e26d79f7970f359d1cd3f284fbd37427e469892"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _makeBinary (cyclomatic 75, cognitive 113): _makeBinary has cyclomatic complexity 75 and cognitive complexity 113; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"3326346b66a454be3500ab959818726ef852773139bfdf6b8e6db4b3e5e8ccd4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 74, cognitive 117): (computed) has cyclomatic complexity 74 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":"src/core/xfa/template.js"},"region":{"startLine":2741}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e04dfd0d2c589b9fd28ffa4fac7d1a60e8e95ea2e0af13e5fe5cab4971a6f44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractCidKeyedFontProgram (cyclomatic 74, cognitive 68): extractCidKeyedFontProgram has cyclomatic complexity 74 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/type1_parser.js"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6992114bf6d99239dec25617403081d133b6d3f275a5403c92125ccc7316555"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _initializeViewerComponents (cyclomatic 69, cognitive 88): _initializeViewerComponents has cyclomatic complexity 69 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":"web/app.js"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"69158e82b7d34e198a36285625442b94cb36b43c1a0bf9939f1b97f28282f8ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 68, cognitive 98): parse has cyclomatic complexity 68 and cognitive complexity 98; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/jpg.js"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba82d4161d2c71583730722978de240b9f5764bbd393a08dc7062cde14527a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDestDictionary (cyclomatic 67, cognitive 120): parseDestDictionary has cyclomatic complexity 67 and cognitive complexity 120; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5d445f359a5228de9665ec49af2387125d9c7ae11761a6d263b31d922a7538"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 65, cognitive 119): parse has cyclomatic complexity 65 and cognitive complexity 119; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/font_renderer.js"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"96889eac5b7f6ec352210b7bd2233b68ccc4dfeb8b99ddc17e24164e7afa99bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #execOp (cyclomatic 62, cognitive 39): #execOp has cyclomatic complexity 62 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/js_evaluator.js"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc77396eb972ef30523ef329b2ed0375551abf00d21ef6d9c3676c622f02cac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createImageData (cyclomatic 61, cognitive 105): createImageData has cyclomatic complexity 61 and cognitive complexity 105; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image.js"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"2164b192b2fb7dad779cfd066d53ffa72535773a1761314d05e61a79a702bb3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitizeTTProgram (cyclomatic 60, cognitive 133): sanitizeTTProgram has cyclomatic complexity 60 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":"src/core/fonts.js"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad11b6d17c7eead2a2aae1cf777f22e79ad2b06666286903eb386f35aef2b84d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function promiseBody (cyclomatic 60, cognitive 99): promiseBody has cyclomatic complexity 60 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":"src/core/evaluator.js"},"region":{"startLine":3322}}}],"partialFingerprints":{"codehealthFindingId/v1":"a475566339390b15816ea583bf9fcb594b9093a43cd2abba7cbe1d34b7f077c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getDocument (cyclomatic 59, cognitive 48): getDocument has cyclomatic complexity 59 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2009b8013173adee4cbefd4cadd080dda53357e2eb3bafb90f6429905c34cb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #cloneStructTreeNode (cyclomatic 58, cognitive 121): #cloneStructTreeNode has cyclomatic complexity 58 and cognitive complexity 121; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be9af48ece85b60efa68841fb2cc32541d680c215564d0a39d10368d5897456"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readCmapTable (cyclomatic 58, cognitive 107): readCmapTable has cyclomatic complexity 58 and cognitive complexity 107; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa714cb725c870c0db0760d932b6a13239fb9f17bb6a85c5edf06832e75f1d2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function translateFont (cyclomatic 57, cognitive 98): translateFont has cyclomatic complexity 57 and cognitive complexity 98; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":4614}}}],"partialFingerprints":{"codehealthFindingId/v1":"43549e87a9939c9b0e573a003c5f985d635cc14c665dd95aa8b54c8e6e62d5c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 57, cognitive 94): parse has cyclomatic complexity 57 and cognitive complexity 94; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/formcalc_parser.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa1a050bf10104ca049005bcec8a8f728ba820e4d6f4948ddda2d8d58e45552"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 57, cognitive 44): execute has cyclomatic complexity 57 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/js_evaluator.js"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9ba094e7537b60d2bfad54aeeca7936a0ad697d05ae30b0827a4d2a34aa068"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #mergeStructTrees (cyclomatic 55, cognitive 142): #mergeStructTrees has cyclomatic complexity 55 and cognitive complexity 142; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d019ae5d79da74594a7148d471115ff1dec780eaaf537711d69284137abe071"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convert (cyclomatic 55, cognitive 89): convert has cyclomatic complexity 55 and cognitive complexity 89; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/type1_parser.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"806deb1cdd494000c454124940c1a99aeecc3c9aa6ccd6dca6d9ac67649e3e32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function indexObjects (cyclomatic 54, cognitive 108): indexObjects has cyclomatic complexity 54 and cognitive complexity 108; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xref.js"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"f234d4155c88cb9c4f0d46b4d3db337c40f5ceada26cc54b51a1f6499409115f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #parseCharString (cyclomatic 54, cognitive 107): #parseCharString has cyclomatic complexity 54 and cognitive complexity 107; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_parser.js"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"901694ddf89f2fd54c2ad1282d11e4962b8bc78dca61782fd9d3280b52ab04ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #selectionChange (cyclomatic 53, cognitive 117): #selectionChange 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":"src/display/draw_layer.js"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"639919dd7ed06b7d9cf8b926a411187b16151c8a9e81829783e7cc0255f9ac99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 53, cognitive 91): constructor has cyclomatic complexity 53 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":"src/core/image.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"896fdf5c63b163ca81713b63f2c25acf0b4a0983537215492355fd83ba1ed406"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareWithLastPosition (cyclomatic 52, cognitive 69): compareWithLastPosition has cyclomatic complexity 52 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":"src/core/evaluator.js"},"region":{"startLine":2802}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e68b834f753cb15fe58a90c9299e287e21636b8fcef509f9f55bb50613ad1d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 52, cognitive 65): (computed) has cyclomatic complexity 52 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":4969}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43031bbbe3da44069fba3db0f03b7b612fc8f2d43ddc9ca74252578e9d97a07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preEvaluateFont (cyclomatic 51, cognitive 112): preEvaluateFont has cyclomatic complexity 51 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":"src/core/evaluator.js"},"region":{"startLine":4451}}}],"partialFingerprints":{"codehealthFindingId/v1":"5624770d541f1706046962112abad3fdec9900eddff1145d4db44eed2b8289a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function showText (cyclomatic 51, cognitive 83): showText has cyclomatic complexity 51 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":"src/display/canvas.js"},"region":{"startLine":2803}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9b57f42f840003fe6f9f95c347665a293d41b46ede1bc6468ab9ecf3f6b7fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function optimizeCMap (cyclomatic 49, cognitive 138): optimizeCMap has cyclomatic complexity 49 and cognitive complexity 138; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/cmapscompress/optimize.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dca66f2d10583b282295af1cfbc5cfc8399ee285b459cdaecce7f42e74201c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function beginGroup (cyclomatic 49, cognitive 37): beginGroup has cyclomatic complexity 49 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":3386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46d5c08fb79931eece59d2e2be2435fd133007af9703fd05ad05cd1377cc257"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function viewerPreferences (cyclomatic 48, cognitive 52): viewerPreferences has cyclomatic complexity 48 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07d0f4e24fb97f8e993e8677a8318c1695327f7e185f5b49ce1f1ae952b7df0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findDCTDecodeInlineStreamEnd (cyclomatic 46, cognitive 11): findDCTDecodeInlineStreamEnd has cyclomatic complexity 46 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":"src/core/parser.js"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"427e8328f4d616721d3ba1518f5661073adffecaf12e26a491747be6748d8e8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getObj (cyclomatic 45, cognitive 32): getObj has cyclomatic complexity 45 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3eba1a4f170d993c567459e22137929502e99eb7b3bf5533f29d620ae490bc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPaintImageXObject (cyclomatic 44, cognitive 71): buildPaintImageXObject has cyclomatic complexity 44 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe272a2114fcec09de5544a936d519b0fbbee503601b374c71db239eec41d4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractFontProgram (cyclomatic 44, cognitive 60): extractFontProgram has cyclomatic complexity 44 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":"src/core/type1_parser.js"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"de15dc85430efe90ce58149d82946be962131f904daae809f5f6551019fed7a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _getAppearance (cyclomatic 44, cognitive 55): _getAppearance has cyclomatic complexity 44 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":"src/core/annotation.js"},"region":{"startLine":2421}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f36e582f206e27404a9c318740d30fd917aaf2a62bd777c9d4313b36718db1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #parse (cyclomatic 43, cognitive 63): #parse has cyclomatic complexity 43 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":"src/core/colorspace_utils.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1a5a26139820a4608bebe99699a6c0f7d2f883af38f04efb77c0e8a6035a36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fallbackToSystemFont (cyclomatic 42, cognitive 68): fallbackToSystemFont has cyclomatic complexity 42 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"966428b15050684da28b21b01b786e8f9711195a27d9f94b067a103446727651"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 42, cognitive 63): constructor has cyclomatic complexity 42 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":"src/core/crypto.js"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4a6307d75aba9a85b2d61dafeeb9a08addace6aedce9e7f77947471ca55c29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 42, cognitive 44): constructor has cyclomatic complexity 42 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":"web/pdf_viewer.js"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"53831a6caebbc7c739f2623da0a44274aadae089266463aefbff91fb116b8d8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compileType3Glyph (cyclomatic 41, cognitive 78): compileType3Glyph has cyclomatic complexity 41 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":"src/core/fonts_utils.js"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2cc14b26a4d8ac3cda1b1bad55a423e9f9794f52488026000e5b513290a54a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractDataStructures (cyclomatic 41, cognitive 67): extractDataStructures has cyclomatic complexity 41 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":3775}}}],"partialFingerprints":{"codehealthFindingId/v1":"baad64fad2761cf7fdc23b07ad31730fe2764edbc9b3b6aad013447260b46d4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 38, cognitive 97): (computed) has cyclomatic complexity 38 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":"src/core/xfa/template.js"},"region":{"startLine":5410}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb186df727f1c84e9c3e83fa3431692fb2ccceadb87c3e4b14f73791707286a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #walk (cyclomatic 38, cognitive 69): #walk has cyclomatic complexity 38 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":"web/struct_tree_layer_builder.js"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"c027eacd0690b33c0168c2a9db4f8fb0442bcc7edf6e59a3bdf9f49aa7416b6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveDocument (cyclomatic 38, cognitive 53): saveDocument has cyclomatic complexity 38 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":"src/core/worker.js"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2703b68f13126a21f95d245ad52552417aa1645cab9e0de1131767fc240d296"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _bindElement (cyclomatic 37, cognitive 105): _bindElement has cyclomatic complexity 37 and cognitive complexity 105; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/bind.js"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3e58ec6feac4cbdfff093025c0752cc62d601acd9896332cab6450a28c618f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkDimensions (cyclomatic 37, cognitive 58): checkDimensions has cyclomatic complexity 37 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":"src/core/xfa/layout.js"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"632f340d0d584e20d663faa4faa0c5e7791e2918f75e27cb4198cdc801e41124"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 37, cognitive 56): (anonymous) has cyclomatic complexity 37 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/util.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a36b561daf03808c65cbb4d6a49878b7d2a3fe0bd4b5d6836b41b1d5d1d24c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 37, cognitive 44): constructor has cyclomatic complexity 37 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":"src/core/annotation.js"},"region":{"startLine":2921}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a96b403c350b96f964617509aee9f85576db5bf2bc407d7bae248378e93f79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _evalOp (cyclomatic 36, cognitive 60): _evalOp has cyclomatic complexity 36 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":"src/core/postscript/ast.js"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62fb6c218c6364419885a29f070960701f0845db99d6706bb0857bea67f5eb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preprocess (cyclomatic 36, cognitive 58): preprocess has cyclomatic complexity 36 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":"external/builder/builder.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57e5d8ca4719d68885e44af601ff98bc29eb9668d7496b177d772889e4a8a57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setGState (cyclomatic 35, cognitive 18): setGState has cyclomatic complexity 35 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":"src/core/evaluator.js"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fbdbf083697cd504242c7d8fa398a0ec87a0002863646636cf2eae3b1d585a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _create (cyclomatic 35, cognitive 17): _create has cyclomatic complexity 35 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":"src/core/annotation.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cd1b027501accf1b99b722cb3dbd20011be8f51fe1fe314f7537b6cc0bfd16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 73): (anonymous) has cyclomatic complexity 34 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":"test/driver.js"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"867bcd2838a4584dfa5c932cfb86158110c80e14ccc594766f923042209741c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #cloneFields (cyclomatic 34, cognitive 64): #cloneFields has cyclomatic complexity 34 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":2196}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a112319a3af6cef4546b376f2f0313bee54e6ffc77a0d54c01cb4068fec164"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setHash (cyclomatic 34, cognitive 60): setHash has cyclomatic complexity 34 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":"web/pdf_link_service.js"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84b3a70c0f06f125d7cc1100f3bbba7c65cc002a4d0270a96cc5dbbac5e46c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 34, cognitive 39): (computed) has cyclomatic complexity 34 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":2443}}}],"partialFingerprints":{"codehealthFindingId/v1":"789ec4d7cf4eaf55fe87bf2a73f74d9d74d102e3c331c5a3ea797e4173322f42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scrollPageIntoView (cyclomatic 34, cognitive 32): scrollPageIntoView has cyclomatic complexity 34 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 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":"web/pdf_viewer.js"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5b518df4ce44e8e7a36ee9ac01a127e43cf9f26b843d76292f86519e4d453a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractWidths (cyclomatic 33, cognitive 114): extractWidths has cyclomatic complexity 33 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":"src/core/evaluator.js"},"region":{"startLine":4259}}}],"partialFingerprints":{"codehealthFindingId/v1":"8035f987daea2e7be06c9183b6de58942cd43fc96f8cc7de1b5bb398595def3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compileGlyf (cyclomatic 33, cognitive 70): compileGlyf has cyclomatic complexity 33 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/font_renderer.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c09e97cb7b0f81291f009bdd1968e5c7ae34a2b07b11ebd9e0d0fb10ef7a664"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 33, cognitive 47): (anonymous) has cyclomatic complexity 33 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":"web/text_layer_builder.js"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1599aef7eda476b3d1cca454b9c5ec8d046dca5d05762c83a1218fbf512e798"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getString (cyclomatic 33, cognitive 29): getString has cyclomatic complexity 33 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":"src/core/parser.js"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec06b2f0932e11bd5008b9f66822cca158cf817cac37afe43ff4cc369807357e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _evalBlockFrom (cyclomatic 32, cognitive 108): _evalBlockFrom has cyclomatic complexity 32 and cognitive complexity 108; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"22db7cdf44a4df0cfabc5f591f220ec0e5e5ede2bda1e538b99b2c218026dea5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasBlendModes (cyclomatic 32, cognitive 90): hasBlendModes has cyclomatic complexity 32 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":"src/core/evaluator.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"4403db4391771bfc30a64714674ea56ef9372cfce8659d7e292389d17c6163de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPageDict (cyclomatic 32, cognitive 75): getPageDict has cyclomatic complexity 32 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":"src/core/catalog.js"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78283e91596a83d09414029703e31e61b803dc3f824331cb8c2c7d0a9d8a191"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #makePageCopy (cyclomatic 32, cognitive 50): #makePageCopy has cyclomatic complexity 32 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":2436}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b90c75b5680c0f01122cd9d159770f6ad92427b4af8d98965c9fb99ffe759aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #updateFromSandbox (cyclomatic 32, cognitive 28): #updateFromSandbox has cyclomatic complexity 32 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 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":"web/pdf_scripting_manager.js"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"3861b404f3a27819be638b54b22ac00ef39daa524bbcca05352f6539870c389e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _evalBinaryConst (cyclomatic 32, cognitive 21): _evalBinaryConst has cyclomatic complexity 32 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":"src/core/postscript/ast.js"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed4392f652716148b03da0a31885f54852bc496cd5dc7326adfd09725140a06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #removeType3ColorOperators (cyclomatic 32, cognitive 16): #removeType3ColorOperators has cyclomatic complexity 32 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":"src/core/evaluator.js"},"region":{"startLine":5122}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdd3c433c2e4570e18494493d115f8d597b7ea523183e656b99d1ed900b09f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findDefaultInlineStreamEnd (cyclomatic 31, cognitive 85): findDefaultInlineStreamEnd has cyclomatic complexity 31 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"627815d6105a718b2a6a5131fc6d37913e90dacf73bab06225ce5c37e1bc680b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #findContours (cyclomatic 31, cognitive 76): #findContours has cyclomatic complexity 31 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":"src/display/editor/drawers/signaturedraw.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82448d32d77ef67c06e7ae4cb06be699d888765c3f2a741ac2ddbe99c2d2210"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 31, cognitive 32): constructor has cyclomatic complexity 31 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f87af90201a8c059c8dd4fd85f3c34cff4bf224e4ca78d3939224686e66ef8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildTextContentItem (cyclomatic 30, cognitive 58): buildTextContentItem has cyclomatic complexity 30 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":"src/core/evaluator.js"},"region":{"startLine":3066}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25171b44c291d5b108cfab972b62ca68dadc1cfe3173b960a80d75e3265f1da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printx (cyclomatic 30, cognitive 41): printx has cyclomatic complexity 30 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":"src/scripting_api/util.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"353feba6119e809e9c90152af7518a293dbe863598e1d320751599e52f97a3a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeFilter (cyclomatic 30, cognitive 20): makeFilter has cyclomatic complexity 30 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":"src/core/parser.js"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ac167ca1b1f0248e240b36da1e3eb240aa84cc3508550362a14117cea8b6a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #getPageAdvance (cyclomatic 29, cognitive 67): #getPageAdvance has cyclomatic complexity 29 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_viewer.js"},"region":{"startLine":2434}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82e426a3a8e4fdfb4cf3a471ce217484f44d4c965877a26dafdb8baab5565c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPages (cyclomatic 29, cognitive 61): extractPages has cyclomatic complexity 29 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"131e88ed8ff61c1fed0d6e0bbecfbcb1561d350e1394486799ab215f106c0ab0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #readBlock (cyclomatic 29, cognitive 55): #readBlock has cyclomatic complexity 29 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":"src/core/flate_stream.js"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeea1fafc6a5e17cfccaa43b9d9243788a6c3456c52442ab137f9e7632868d55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 29, cognitive 55): render has cyclomatic complexity 29 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":"src/display/annotation_layer.js"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"957f88c089cd9eb0c32e593a5210c8626a4234781b4be7db80171f546b727160"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transformDictionaryWord (cyclomatic 29, cognitive 53): transformDictionaryWord 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":"external/brotli/decode.js"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"224e201ce03115b04a04d8f3bc256358e949ac91e90dcd2359d48606cd40584a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeStream (cyclomatic 29, cognitive 52): writeStream has cyclomatic complexity 29 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/writer.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1800d04bc55818b08e515b41283039655caa280b5ab0a523da532752d1c5ff0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _simpleFontToUnicode (cyclomatic 29, cognitive 47): _simpleFontToUnicode has cyclomatic complexity 29 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":3980}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a392c084d6a8b15fbc4695749edef013d613be42d98f6d4b0a1eb113191ad80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function save (cyclomatic 29, cognitive 35): save 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":"src/core/annotation.js"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"6139a7a5af69091ceffe1de8e27fe5cac4cbb0cba81587aca03f32b9fc8cc14c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createOS2Table (cyclomatic 29, cognitive 35): createOS2Table 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":"src/core/fonts.js"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcafabf60cc2e970a772c162a1533ce559ea2f5bdc8deaf3281be008b6b64686"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #renderCard (cyclomatic 29, cognitive 33): #renderCard has cyclomatic complexity 29 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":"web/digital_signature_properties_manager.js"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"879a2c99801ceb7bc80564d0f349a63fa90465d2aae5e435b89ec8af5937002b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reset (cyclomatic 29, cognitive 28): reset has cyclomatic complexity 29 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 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":"web/pdf_page_view.js"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"2005891973cb6fd6b9d95a6571d49642c81f422a7c8cfe45d2c97141fde6ee20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pruneCompositeGlyphCycles (cyclomatic 28, cognitive 54): pruneCompositeGlyphCycles 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":"src/core/glyf.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27ed3372ce1e5d227100fabb2fec5cabb73eb42ecc6b2885d35811b982f5c40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createCmapTable (cyclomatic 28, cognitive 43): createCmapTable 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":"src/core/fonts.js"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c7a68777f683c0859d2f42abd08c18ac4944109550bb7b614c104f248e214a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nodeToSerializable (cyclomatic 28, cognitive 35): nodeToSerializable has cyclomatic complexity 28 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":"src/core/struct_tree.js"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cff8cfaed5beb62071dd7bda13be035add8fdb18a241e6c711d4a7d9379e5b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _binaryToExpr (cyclomatic 28, cognitive 13): _binaryToExpr has cyclomatic complexity 28 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":"src/core/internal_viewer_utils.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85e1676e1f501119a5009ad1561cf6e8458af6b7d024172ae9f77bbea6831e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #resolveInsertAfterIndices (cyclomatic 27, cognitive 48): #resolveInsertAfterIndices has cyclomatic complexity 27 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95c5827265b9b1b2266cd0a346405865e85d6030cc1a924796d35f798a4b162"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getOperatorList (cyclomatic 27, cognitive 47): getOperatorList has cyclomatic complexity 27 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccc11ecd52793d53cc54fc5060b5e34ea9dc3714e932c73c63c7a9632e60da1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onclick (cyclomatic 27, cognitive 44): onclick has cyclomatic complexity 27 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":"src/display/annotation_layer.js"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"18326c4d0ab38c9a36f31b95fde671dbd74c32f4b83f37c65a5810ebb1200e8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateMode (cyclomatic 27, cognitive 40): updateMode 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":"src/display/editor/tools.js"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa46854e4f9c28aae672a027edd6a9edda1c1ebb5af528286184c6bb636995a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatch (cyclomatic 27, cognitive 40): dispatch 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":"src/scripting_api/event.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4b7620b05ab721fb7707ed9c226a63661ad4d7c661a5b1c6ec272b8c367514"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _charToGlyph (cyclomatic 27, cognitive 36): _charToGlyph has cyclomatic complexity 27 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":3638}}}],"partialFingerprints":{"codehealthFindingId/v1":"c594a38b28a97c188ec64abfe50ec6e163c387920d5d78033612da2ab9c56c5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fillGrayBuffer (cyclomatic 26, cognitive 59): fillGrayBuffer has cyclomatic complexity 26 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":"src/core/image.js"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"659b6a8538665b7725e9aa8a304f64b693f891c794ee4538f2ae9cd37d8efa9e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tableAttributes (cyclomatic 26, cognitive 50): tableAttributes 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":"src/core/struct_tree.js"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd52722dd96666d575876c700fb1503c38d78e18f82954bc29fe1d9745e42552"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 36): (anonymous) has cyclomatic complexity 26 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":"web/internal/tree_view.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"70725658ed4221ad67933c779dd3f4691ba051407bd7343d25f9592a7e86adab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setGState (cyclomatic 26, cognitive 27): setGState has cyclomatic complexity 26 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":"src/display/canvas.js"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6f96232c2cdd4f471c8127f339ed915c137ff5b6795a9386dd409710d58ada"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 18): (anonymous) has cyclomatic complexity 26 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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"b496a04b026a838c8f9f2d179baba1069532e77def83fbac24de4458d1b491bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseXml (cyclomatic 25, cognitive 76): parseXml has cyclomatic complexity 25 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":"src/core/xml_parser.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96993557adbc9f51b8f9a604fdee4de6b0e3c8ef546fc5969707ccb7274d4a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #collectDependencies (cyclomatic 25, cognitive 40): #collectDependencies has cyclomatic complexity 25 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d10555a029d6cf6b2edbb57e669056403a7c594c60f5ef6adb1cb411fc11d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitizeGlyphLocations (cyclomatic 25, cognitive 35): sanitizeGlyphLocations 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":"src/core/fonts.js"},"region":{"startLine":2295}}}],"partialFingerprints":{"codehealthFindingId/v1":"509c868c58e6b22a4eb4a71fde1874ec44974ba54b9044ce0602850ad8151d22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 25, cognitive 29): constructor 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":"src/scripting_api/field.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"762897574532dd37b5eabc83fd8b15dfc2dc3e7ac7dafb9932e2375270b792db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isVisible (cyclomatic 24, cognitive 58): isVisible has cyclomatic complexity 24 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":"src/display/optional_content_config.js"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db012f9b4d968afb883d51106782935b210d384d3a58a0433c5ee3ca70a41d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #getDestFromStructElement (cyclomatic 24, cognitive 55): #getDestFromStructElement 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":"src/core/catalog.js"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23b3000dc2b782af35f9739f7a337b02234d9f383a6dd34d0e442cef4c1c03b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layoutNode (cyclomatic 24, cognitive 46): layoutNode has cyclomatic complexity 24 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/html_utils.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fbbc415fe2632c821dfd44682842ed6b1245732fc71dfbb60e5e1830212a0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function quantizeAndInverse (cyclomatic 24, cognitive 44): quantizeAndInverse has cyclomatic complexity 24 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":"src/core/jpg.js"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"d326fd0019fead03a0fe4e7c5883553498102ac30f0a36fe3eb4e8d183a6da8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadFont (cyclomatic 24, cognitive 36): loadFont has cyclomatic complexity 24 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"381d453f0cf4752be15c602b8978881e1f36977a21ba67c7684397a6da361636"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _makeTernary (cyclomatic 24, cognitive 35): _makeTernary has cyclomatic complexity 24 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":"src/core/postscript/ast.js"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8208457a5ff5b292f7a7885ef90dfacbf514bc5f8a486c18cb5951a90b3dc63"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setAttributes (cyclomatic 24, cognitive 35): setAttributes has cyclomatic complexity 24 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":"src/display/xfa_layer.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e02ad6002aec12acb54b568888a3f5832d7fa857c5e78a2010ed760d39a871c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePrivateDict (cyclomatic 24, cognitive 34): parsePrivateDict has cyclomatic complexity 24 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_parser.js"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7cdba0f84c9c1cc6af566b366d07ab65839c8167dea070e860eccbd50458ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function paintChar (cyclomatic 24, cognitive 33): paintChar has cyclomatic complexity 24 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be017e609efb9c96828ed42eba2cf4b1097419a82fe17d273db4ed22563c7a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getNumber (cyclomatic 24, cognitive 32): getNumber has cyclomatic complexity 24 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96e5608f16a9048834099c9e53de18f43e55159cf75ed7b2692764f51b001e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitizeGlyph (cyclomatic 24, cognitive 29): sanitizeGlyph has cyclomatic complexity 24 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":2115}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf97c04c4c2a55a7c8087e616511597d1071d5cdfed1476ab2094407a8c057f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onWheel (cyclomatic 24, cognitive 28): onWheel has cyclomatic complexity 24 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":"web/app.js"},"region":{"startLine":3160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ae0140b13293eebafba3269aa97e9f267511acf950e5b967f65e4596e70e38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addNode (cyclomatic 24, cognitive 21): addNode has cyclomatic complexity 24 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":"src/core/struct_tree.js"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"211d0f69327748892d809547ea11122fbf8370367b4309a6d191aed554155e9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeOperatorList (cyclomatic 23, cognitive 53): executeOperatorList has cyclomatic complexity 23 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":"src/display/canvas.js"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83133850e4c5c93e7a24f0cd6d34c327587f0d7d873050681e57716da415391"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function process (cyclomatic 23, cognitive 47): process has cyclomatic complexity 23 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/binary_cmap.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a7d8b3c4f4c84bd27a196d8b2cb3e8467ce8b83c27b099e9a4842fb3c9cf18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compressCmap (cyclomatic 23, cognitive 44): compressCmap 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":"external/cmapscompress/compress.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a655648328b185f4ce558cb7650f032ed80d4c177bc0ec78284507c43bbf3fbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #collectFieldObjects (cyclomatic 23, cognitive 37): #collectFieldObjects has cyclomatic complexity 23 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":"src/core/document.js"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2be0b9a70e905a738cba284d854449e06221ea0f491eb0e3ea5493d65bec9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _getAppearance (cyclomatic 23, cognitive 30): _getAppearance 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":"src/core/annotation.js"},"region":{"startLine":4059}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4d1908477d1fd51b36863f68997a6bd982ee74966ff2ae5ef9fd3522e5ccfe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _createMaskCanvas (cyclomatic 23, cognitive 26): _createMaskCanvas has cyclomatic complexity 23 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb22d46b104ff3f37ec8459cd2652069292e17860ba3725d2bd2814e77dd9b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _createContainer (cyclomatic 23, cognitive 24): _createContainer has cyclomatic complexity 23 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ffa694c315c71250c0a499fc038cb629f63b87c7cb6e03c1ab7724cbc6713f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toDateObject (cyclomatic 23, cognitive 22): toDateObject has cyclomatic complexity 23 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":"src/display/dom_utils.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb05e201ffb601881b6b262bcf88432056a04169bd1864fab878abd8e36710b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #parseSignatureDict (cyclomatic 23, cognitive 18): #parseSignatureDict 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":"src/core/document.js"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea6f1d38ed256a85e23e68ec6755c7f9c5669dd4052dc0f8c5210a6bcac3f12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeBlendMode (cyclomatic 23, cognitive 10): normalizeBlendMode has cyclomatic complexity 23 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"093e6c110ab909487a01f9059fe1a90b86d99a8059fd8a78469c6c760eec6080"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 22, cognitive 63): read has cyclomatic complexity 22 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":"src/core/evaluator.js"},"region":{"startLine":5541}}}],"partialFingerprints":{"codehealthFindingId/v1":"9266fa9f1df46c6b68ee0a89ac9a0686a62a687dc430d9d279425e5351efb05b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getObj (cyclomatic 22, cognitive 47): getObj 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":"src/core/parser.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b68b7cfa7d0e22cb5219abe9db9ec60c2afbaa55caa66ecc7bf49d6da5ce41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCMap (cyclomatic 22, cognitive 44): parseCMap 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":"external/cmapscompress/compress.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a2e6ac5c18d49ec92c1ab25542c1343b83c21f18e3b0925308ce13d6a5c79b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onPagesEdited (cyclomatic 22, cognitive 38): onPagesEdited has cyclomatic complexity 22 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":"web/pdf_viewer.js"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"975e1ceaa226e92c0a1dc0e3a9bdc60b0dd77c15052412b066a08bc636019176"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toJSObject (cyclomatic 22, cognitive 34): toJSObject has cyclomatic complexity 22 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":2291}}}],"partialFingerprints":{"codehealthFindingId/v1":"e223895b1cba5b222f3db042175bdfecf004188399f469df2ddf28fee27eb813"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBlockPng (cyclomatic 22, cognitive 34): readBlockPng has cyclomatic complexity 22 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/predictor_stream.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d26af40b2bea31fd488e95a50bf80afdb4681a9197c0b7b6cf28ef20e1573a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _fillDownscaledRgba (cyclomatic 22, cognitive 33): _fillDownscaledRgba has cyclomatic complexity 22 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image.js"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d2b53fdd75c5a125124a617b82caeb973d8ba120b0db4a581ae7cd82e0161a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 31): (anonymous) 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":"test/driver.js"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cf5589936caa230ca11e1cc765404b50bcd3b9ce8c190baaab152537668fb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseIf (cyclomatic 22, cognitive 30): parseIf has cyclomatic complexity 22 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/formcalc_parser.js"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1ca1c7e765db94d0599091ee606c303bd1d20de2bd97cba9b442029bf11e77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getFontSubstitution (cyclomatic 22, cognitive 24): getFontSubstitution 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":"src/core/font_substitutions.js"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"042f064469ec3de82ad7f354df64b1f797264792818060f4f921453d734b64a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 22, cognitive 21): constructor has cyclomatic complexity 22 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":"src/scripting_api/doc.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c3a1886416d4b26034cfbab31b424d899e62be6ac1613070f386e233c4f4c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _isValidExplicitDest (cyclomatic 22, cognitive 18): _isValidExplicitDest has cyclomatic complexity 22 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":"src/shared/util.js"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"9970a61460e8ad13e019516110096b7f9d435bc9cf2d6b0c4e07b1036997bc9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 22, cognitive 15): parse has cyclomatic complexity 22 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":"src/core/default_appearance.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c07c95e7bbdcf0d5b9909a65732bc86874e857e166207dd018f1826d2e94459"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeScan (cyclomatic 21, cognitive 61): decodeScan has cyclomatic complexity 21 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":"src/core/jpg.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c526661e94510fb4d63bb208d51736863fcff4bade2b37696f9cabe71ce9964"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchNode (cyclomatic 21, cognitive 41): searchNode has cyclomatic complexity 21 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":"src/core/xfa/som.js"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8e8b995265b29aaa996b25a64158359ec7d1ac5c6d94fb34d15974bae3970d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stringToPDFString (cyclomatic 21, cognitive 33): stringToPDFString has cyclomatic complexity 21 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/string_utils.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8c30524bd136888c080f4063d4d380a48d528b03db7f65c47a4bb7c096b908"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCommonObject (cyclomatic 21, cognitive 32): resolveCommonObject 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":"src/display/object_handler.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d8f74b91011e9a30b758dac1fb92950c2c28e96da7a54e51d13f39a3b6cd0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 21, cognitive 31): render 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":"src/display/xfa_layer.js"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9054bdfa063d7cc427f2bc1ca32b083f92f5a5344cf0da0c68ad1a91623181"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readMetablockHuffmanCodesAndContextMaps (cyclomatic 21, cognitive 29): readMetablockHuffmanCodesAndContextMaps 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":"external/brotli/decode.js"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"07421baf6bb71def64b2cfe00f2224e52b9a3cfa26d390e5d488a51bce439277"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildFormXObject (cyclomatic 21, cognitive 29): buildFormXObject 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":"src/core/evaluator.js"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c57961886844e0c20ac1edc98e637e2cdd3b0c5c3f95e2de4d5c61c2e78d8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function show (cyclomatic 21, cognitive 28): show 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":"web/internal/draw_ops_view.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"4871891172cb107a1c3c60cd634dc3416e440549a5b5fab445cf1e29280940bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseHashParams (cyclomatic 21, cognitive 25): _parseHashParams has cyclomatic complexity 21 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":"web/app.js"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf50e97a4f848e2792b619a771f70cf85f54379f56ac5251378382db23c1e0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #setScaleUpdatePages (cyclomatic 21, cognitive 25): #setScaleUpdatePages has cyclomatic complexity 21 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":"web/pdf_viewer.js"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf7f6789aff49c22fe626809b6600a837174c53ea8667117764eed4bc7e0ec3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 21): (anonymous) has cyclomatic complexity 21 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":"gulpfile.mjs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6a9919f766760ea4be17d3d334e1217381d96a8853b06e5ed72313368f7107"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function documentInfo (cyclomatic 21, cognitive 21): documentInfo has cyclomatic complexity 21 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"405717473292add420c8cf8069ecd9ae44145af02ef9fa0b2f785cc25626c022"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeInlineImage (cyclomatic 21, cognitive 19): makeInlineImage has cyclomatic complexity 21 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce66294abb67d4dddccbd45b87816ec1d0759d398b6817eadf835ee4a621a6a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 21, cognitive 14): (computed) has cyclomatic complexity 21 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":"src/core/xfa/xhtml.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6baf15e5e1ff1347c8f939d7ea918df5197e657a83a14dfc10da03a7ee3d76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getAllPageDicts (cyclomatic 20, cognitive 45): getAllPageDicts 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":"src/core/catalog.js"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55a40666ac4af3b8c97aefd9c98f9b446bbbf98dc34f327910c885329e504f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #readPageLabels (cyclomatic 20, cognitive 41): #readPageLabels 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":"src/core/catalog.js"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"630681cb20f962e36418ee0031305024e603e35e9dd69d45c8e4b3bf0bdb2088"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPageIndex (cyclomatic 20, cognitive 34): getPageIndex has cyclomatic complexity 20 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e289e19951bf93d01fc6ce2a0257d3c4b1a586d62a6d022b4750d4c0df19ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getNormalizeWithNFKC (cyclomatic 20, cognitive 33): getNormalizeWithNFKC 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":"web/pdf_find_utils.js"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c4119286269b1bbbc66717e44a5fc672e6a4cfada961f8127302fcaee32920"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createImage (cyclomatic 20, cognitive 32): createImage 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":"src/core/editor/pdf_images.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"541830210820a2678a36d6cf9085f8446de0ad8074199686cfefa2d8f126fe98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getHighestPriority (cyclomatic 20, cognitive 32): getHighestPriority 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":"web/pdf_rendering_queue.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11686b12f80f5e668b0241465fb0636e89719ce506d99d1003fc7e7480cdc29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function find (cyclomatic 20, cognitive 30): find has cyclomatic complexity 20 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/fonts.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"00496960ceaa4af85bcfb5be08d197d290cdd410af2bb7273c1301595fad392d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readXRefTable (cyclomatic 20, cognitive 29): readXRefTable 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":"src/core/xref.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bf31e477a1e0a4bbfd920abaae328ff6dc01752b4bd9688b932970f7c02eae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleBreak (cyclomatic 20, cognitive 28): handleBreak 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":"src/core/xfa/template.js"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c319a180508f5fa6b96a90f37b0ff4e746cdfbda926945cb9a4d734c9171fa8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchCompressed (cyclomatic 20, cognitive 27): fetchCompressed has cyclomatic complexity 20 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":"src/core/xref.js"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d63dbeb09929d8edd1d7f963664e63285d60ed76f1b1c3f811aaea4bb09cb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #findClosestThumbnail (cyclomatic 20, cognitive 26): #findClosestThumbnail has cyclomatic complexity 20 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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":1895}}}],"partialFingerprints":{"codehealthFindingId/v1":"812837f1f3eef11db1a50fdb1db6fe8f60abe369b9838e3f8736e57037afabdc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _compileNodeAsBoolI32 (cyclomatic 20, cognitive 25): _compileNodeAsBoolI32 has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/wasm_compiler.js"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"986d77f87f2340a85b94556f90e0da8731748f77ad558e5141a1f629897556b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCMap (cyclomatic 20, cognitive 24): parseCMap 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":"src/core/cmap.js"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"1341392cc9cd15277324eb0cbbab63da65a62c10bc1e1c2b773808c500fabb03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #processStreamMessage (cyclomatic 20, cognitive 23): #processStreamMessage 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":"src/shared/message_handler.js"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2b00de2dda493092b6c796a562e79497f6b03f19cbd3d08510f1f2e178094b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #onPagesEdited (cyclomatic 20, cognitive 21): #onPagesEdited 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":"web/pdf_find_controller.js"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a2b9a55e265deada0ed494f56439878d570fe28107329d73097f4818d09636"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 20, cognitive 19): (computed) has cyclomatic complexity 20 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":3408}}}],"partialFingerprints":{"codehealthFindingId/v1":"4727d1691d3fa15aba0912433b0c437ffef4aeb31a8f58f158e93aaa6f3b2995"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _initializeMetadata (cyclomatic 20, cognitive 16): _initializeMetadata has cyclomatic complexity 20 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":"web/app.js"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd4aa028fc1bfdbedd75f53d12c479f75bad82ec846238b814d1a6eb44a1953"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _compileUnaryNode (cyclomatic 20, cognitive 15): _compileUnaryNode has cyclomatic complexity 20 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":"src/core/postscript/wasm_compiler.js"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cc89fb0a2c9452f72a8d9cc9b4d27a9771cc221c260ebb7b69646a55f23ccf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 49): (anonymous) has cyclomatic complexity 19 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/worker.js"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"a038915090860262371635cb40a2501a576cefe99fe4eff1fc8378fafddd5bd0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeACSuccessive (cyclomatic 19, cognitive 45): decodeACSuccessive has cyclomatic complexity 19 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/jpg.js"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b2ed71f23a38f0b8ffbe00edae7e082590a7a40956857bbbeab6eaf1e4f25b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 36): (anonymous) has cyclomatic complexity 19 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":"test/unit/bidi_spec.js"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9068fb3a0c5fd9da2777de97c52071a92ea6bb8cce4e164844f81a23be3c0d80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPrefsSchema (cyclomatic 19, cognitive 33): buildPrefsSchema has cyclomatic complexity 19 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/chromium/prefs.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecd39832c48f71c8a0d2a0be5dec95084fd5374ee9a01a02bf8105e2e15c825"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moveCaret (cyclomatic 19, cognitive 31): moveCaret 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":"web/caret_browsing.js"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aaddfce67b30e39c29cb5e3e962899abbe8870bf15d450c936673796e6f6d6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 28): (anonymous) 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":"web/pdf_find_controller.js"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c61d4e42d23f412b9323314dfc3560eab8e26547df735c1069da5af7ac95fa2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #setAttributes (cyclomatic 19, cognitive 28): #setAttributes 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":"web/struct_tree_layer_builder.js"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"51577d4671d45aacdafc5c040f3e938ede6686a5282d30280c6c550374cccdb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #readDocumentOutline (cyclomatic 19, cognitive 25): #readDocumentOutline has cyclomatic complexity 19 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c5722821f5dace31e5b0892d966fed8fbfb9a515d6d6e9d2f3b79709851e3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #onTouchMove (cyclomatic 19, cognitive 22): #onTouchMove has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/touch_manager.js"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"074b95edb5dd5242dd94616724974c725f72d44bad9b1870768ccd3da5e35e88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createNameTable (cyclomatic 19, cognitive 20): createNameTable 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":"src/core/fonts.js"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"765b49356d9e85135139b39f7b2914fadb6bec8801608f8eaeab398ad03d53ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cancelRendering (cyclomatic 19, cognitive 19): cancelRendering has cyclomatic complexity 19 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":"web/pdf_page_view.js"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"252b3bac8cf4697f44355ac7f9db6dc306408628d8f987793e77f477030b0e71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canUseImageDecoder (cyclomatic 19, cognitive 18): canUseImageDecoder 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":"src/core/jpg.js"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"0801bb6ee29031e06ccfe1ce00809f6cc8c94fb9960a895daeb89addf6756219"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createWebpackConfig (cyclomatic 19, cognitive 15): createWebpackConfig has cyclomatic complexity 19 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":"gulpfile.mjs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6860fe9474b63f5dc842e4aed308cc0b396c65bc1aa86b718bad5a32dfeacc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _evalUnaryConst (cyclomatic 19, cognitive 9): _evalUnaryConst has cyclomatic complexity 19 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":"src/core/postscript/ast.js"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2fbe89fef80013657b052267b0d089553538b1cac62b1ad936586a11b23276"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #collectParents (cyclomatic 18, cognitive 38): #collectParents has cyclomatic complexity 18 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"9daf6b01d4635f881e747d62c9d6a0fcff7d7995859102225158bff90c866753"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkEq (cyclomatic 18, cognitive 32): checkEq 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":"test/test.mjs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"b508821125d41f54938928c17a825271ffb309252befa1c014f5a2cff08ce3f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeContextMap (cyclomatic 18, cognitive 31): decodeContextMap has cyclomatic complexity 18 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":"external/brotli/decode.js"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"939244d32e3da045ca22b185890afa036c7d7b9614cd7bd708c9dbc1f24ba0a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resetForm (cyclomatic 18, cognitive 31): resetForm has cyclomatic complexity 18 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":"src/scripting_api/doc.js"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a385cfd83c45c68c702cc142ff1af9362bd0a623cbaf5683ac2c333fdd710f90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function editorDivPaste (cyclomatic 18, cognitive 29): editorDivPaste 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":"src/display/editor/freetext.js"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"5781131252669e39ca57bcbf58f77a047fb753d8200d4f4727919ed20f067d3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeMetaBlockLength (cyclomatic 18, cognitive 28): decodeMetaBlockLength 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":"external/brotli/decode.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"053c877d56268dcec76f0f1c98a641f6361896747a194a2e239df750a6bd6f7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 18, cognitive 28): parse 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":"src/core/struct_tree.js"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36ff95b85466fbec3e1190799ad044376d02e10dd1fbf93503d93e4ff2b8bc6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapStyle (cyclomatic 18, cognitive 23): mapStyle 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":"src/core/xfa/xhtml.js"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae11adaec7fa126913b657491401996521b856d651ea8bd41d347e6cd44fb27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 23): (anonymous) 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":"web/pdf_viewer.js"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60bfd27473ecc8a96d68fbcbceffc1e8dd257cec14e9b8e0584a85afb4a8a8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _makeUnary (cyclomatic 18, cognitive 21): _makeUnary 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":"src/core/postscript/ast.js"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1c0588417568cae658a270ef305b9622901eeee3d04eb4546233b3df7754d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #appendText (cyclomatic 18, cognitive 20): #appendText 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":"src/display/text_layer.js"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"2daf02aeafcb5fdcdb2d656ee3d23bebfae055054a8dbfd01aeedb3913ac242e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 18, cognitive 18): constructor 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":"src/core/pattern.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4949d422d2912b34490363e297ba95c6c9eb39969de4f898e1884ae43069fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function switchView (cyclomatic 18, cognitive 18): switchView 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":"web/views_manager.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c27ada84fc858da1be9fa94014ddf4e42f01a0ce44a7bca04ed7734c7ab7b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function next (cyclomatic 18, cognitive 11): next has cyclomatic complexity 18 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":"src/core/postscript/lexer.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6c60631922cc5f4d39446a0f39e9a60d78fee7a85a143552b14f9b478b7e42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _getContentType (cyclomatic 18, cognitive 9): _getContentType has cyclomatic complexity 18 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":"src/core/annotation.js"},"region":{"startLine":5627}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a6a3044dacb4145aa114913153f43a8e7f258bf2939570514e4e6f11fecf02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function escapePDFName (cyclomatic 18, cognitive 9): escapePDFName has cyclomatic complexity 18 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":"src/core/core_utils.js"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6cb65eb9a011e15ef57c850a960a9f3287c8955ad30f774663ad723b4cdcae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchNode (cyclomatic 17, cognitive 44): searchNode has cyclomatic complexity 17 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":"src/core/xml_parser.js"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0a288f38a40c50d8179059c0dd9039ed9e14cec05d339487188bbdec6b80dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function endGroup (cyclomatic 17, cognitive 36): endGroup has cyclomatic complexity 17 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":3649}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a06807afbab78d5fbb4287de334c5ae6741cf93647ae84b250322d0e88b4892"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readXRefStream (cyclomatic 17, cognitive 35): readXRefStream 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":"src/core/xref.js"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0086df99236846a1e78023a8be8887ee849ac307e937af9af734ca9af10e1fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 17, cognitive 33): render has cyclomatic complexity 17 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":4020}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90394f2154f405cb04d0729443f3051c180e525549f605416e4574b6c739187"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setupStorage (cyclomatic 17, cognitive 32): setupStorage has cyclomatic complexity 17 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/xfa_layer.js"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e98ee86eea2eedabd1b81b9ef87320bfb56b0a40cbdadd7bcb95c3cd7f82ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCharsets (cyclomatic 17, cognitive 31): parseCharsets 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":"src/core/cff_parser.js"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7e52d344f32f8edd14b3267506511b5b00cd03b898a811da3d8809894d85a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readXRef (cyclomatic 17, cognitive 29): readXRef has cyclomatic complexity 17 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xref.js"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"197e7e37117b4b5c1d47728ca6253f3a9b3b5fc722b4a14c253f63e022e7d0b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getData (cyclomatic 17, cognitive 27): getData 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":"src/core/jpg.js"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab90d05b8b063c67790b76c52faf252916e4a04f5b8defbb23ad499723965ee9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canUpdateStructTree (cyclomatic 17, cognitive 27): canUpdateStructTree 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":"src/core/struct_tree.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"de02427357ea9cd8cf8f77697f379fe424e50579d505bd457898729e7370b8a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deepCompare (cyclomatic 17, cognitive 24): deepCompare has cyclomatic complexity 17 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/core_utils.js"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"28287e3d5179db12f33f1e589d2a2a4dccab0dc63e8235fad507e7ed9ef50021"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serialize (cyclomatic 17, cognitive 22): serialize 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":"src/display/editor/stamp.js"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"068f0524b48d038f04579df363d389bcbd3f9267967b512a7759dad729080fd2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatArg (cyclomatic 17, cognitive 22): formatArg 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":"web/internal/draw_ops_view.js"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"62712c448fab6860a29f461e70caa08699e2d0d0d07db0870acfdc68c7a23924"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 17, cognitive 20): parse 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":"src/core/cff_parser.js"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f826226a34b1e2717ccec4c138dcf3dceb3c098973e4edbfb24e83d4d96d574"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 17, cognitive 20): parse 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":"src/core/colorspace_utils.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e059e60c03780f308fc2329c97c9de2f0e794473bde475fb55cd13c80acdc9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getVisibleElements (cyclomatic 17, cognitive 20): getVisibleElements 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":"web/ui_utils.js"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ba25687e16a6c8cefcf7e693746a0b4e01133d048a72da4db2211a9a1b1ed8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toggle (cyclomatic 17, cognitive 19): toggle 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":"web/comment_manager.js"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad0d3ad928478fc06e5f125178029e2d154fabb344f6e49165e3bd716c07927"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #renderValue (cyclomatic 17, cognitive 18): #renderValue has cyclomatic complexity 17 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":"web/internal/tree_view.js"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4575f6c4ce0632583463f8d76f26d767234bece5a9bf038992a797bfb32c24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function push (cyclomatic 17, cognitive 18): push has cyclomatic complexity 17 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":"web/pdf_history.js"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3df7fecb81f0bac81fd6fda48c62f340fad4994c0735acfb76eca95fd3302dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordCharacterBBox (cyclomatic 17, cognitive 17): recordCharacterBBox 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":"src/display/canvas_dependency_tracker.js"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66b41d5d52cae8e325d1fb51ae916261b1454b0b768de90ceed66e18bd83b1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initialize (cyclomatic 17, cognitive 17): initialize 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":"web/app.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"df81d30333d8a886bd28b3e3f17eedd8ea30ffd784624bf8c00ac081300cc53d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createNewAppearanceStream (cyclomatic 17, cognitive 16): createNewAppearanceStream 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":"src/core/annotation.js"},"region":{"startLine":4504}}}],"partialFingerprints":{"codehealthFindingId/v1":"08abc6ee4bbed9b9c70ffd3727504b372cea34d9b1198dcecdacf8435a9fb825"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AFNumber_Format (cyclomatic 17, cognitive 16): AFNumber_Format 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":"src/scripting_api/aform.js"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba883d1280c0a3da992e80ea1a25d919361d3899d0fbc964c301b67ea3c6fad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createEvent (cyclomatic 17, cognitive 16): createEvent 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":"src/scripting_api/event.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a7a42507246f79ec58359265bad7519b10de021e161b0a3999787ae9087c39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setLineEndings (cyclomatic 17, cognitive 13): setLineEndings 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":"src/core/annotation.js"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f06e652f3ba76c39cba2e2878b7c447049d906fddcd02d2d81f8deafcbd17c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readHuffmanCodeLengths (cyclomatic 16, cognitive 37): readHuffmanCodeLengths has cyclomatic complexity 16 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/brotli/decode.js"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4b4857001e8211820bf251bbb06597724d8404bf55f9bbe1e522135cdd5716"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #setAnnotationCanvasMap (cyclomatic 16, cognitive 33): #setAnnotationCanvasMap has cyclomatic complexity 16 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":4280}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a295e7b479b54601d456de6d5d5a6fa609c04dea4d12132009781e962291433"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #computeCoverageDelta (cyclomatic 16, cognitive 33): #computeCoverageDelta has cyclomatic complexity 16 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":"test/driver.js"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"065ea4f2a60e43ee5c919b3256fd9ed543f17bfa09402677e942b5b1a0ccf4e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectArgs (cyclomatic 16, cognitive 32): collectArgs has cyclomatic complexity 16 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":"gulpfile.mjs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b15f096b52bb242fca666c53dd8e16692ea01897bbfa1e0b8c21eac03afeed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPages (cyclomatic 16, cognitive 32): extractPages has cyclomatic complexity 16 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api.js"},"region":{"startLine":2890}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46372f2b019d5ba911b7db37ed8d24faf9bfe79f419cff70a9b438ca8643b8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBlockTiff (cyclomatic 16, cognitive 31): readBlockTiff 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":"src/core/predictor_stream.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"157ccc71ec8f9e57b6c8e6ade96d5445152fb2a06bbcc85ddaf74f6f8a55656c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fillItems (cyclomatic 16, cognitive 29): fillItems has cyclomatic complexity 16 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e56844ba783ced48a5e26ae6358763d44cbb9d77d0bfa48a8fb6978b956994"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startBrowsers (cyclomatic 16, cognitive 28): startBrowsers 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":"test/test.mjs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fcdd65e35acf3b9c192c4a814f9bd743d6a9aae6b26104c3a00156a1de74d54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _renderMatches (cyclomatic 16, cognitive 26): _renderMatches 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":"web/text_highlighter.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"760b81e268a396443834ce59b846f2bd08b4d311df8c5eb22402ede5d0de7c54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onReceiveData (cyclomatic 16, cognitive 25): onReceiveData has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/chunked_stream.js"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d79eb3c1e975fa393108092d1527a429a23cfb31919512f14295947da127271"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fillRgb (cyclomatic 16, cognitive 25): fillRgb has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/colorspace.js"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef92851c084a1d90ccf1b51127926e6deba5f0780ba59739566b54cdd730e3df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getMissingFileGlyphs (cyclomatic 16, cognitive 25): getMissingFileGlyphs has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"a977e41d876674c34f231ee94fe16b3d207acb8abc08de145bb8cc24f7836214"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printNewAnnotations (cyclomatic 16, cognitive 23): printNewAnnotations 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":"src/core/annotation.js"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e3e41d0ebfbcf61177af7343511d9d12cf6c43e4f79f6d58334c2e2923d5b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cssTransform (cyclomatic 16, cognitive 21): cssTransform has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_page_view.js"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c299b905d3047e33d0fc1e55fd8b2a5be51ad238f750e7b82e8b1b7d93c0f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 16, cognitive 19): run has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app.js"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2360d16fc796b430325d4bdc0f931ddeef7e79d26f0045e70bbc118191ce857"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 16, cognitive 18): (computed) 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":"src/core/xfa/xfa_object.js"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd730310ea26feb02c03ab478a1804446d53b92fb02e2729ab56e7733833749b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setDocument (cyclomatic 16, cognitive 18): setDocument 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":"web/pdf_scripting_manager.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8870abf2698aa7249f0d0e1246e11d978909fc3cd242789b4d7f6770c400b469"}},{"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":"src/display/annotation_layer.js"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f2fd72997acaefb22637a98c2255d94dd1b52dcd79f878de20a33066470206"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOptions (cyclomatic 16, cognitive 17): parseOptions 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":"test/test.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"343a29153b7d57c66926199ddee155c9b0d875e5639064d40a9ee0e2be70d6e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 17): (anonymous) 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":"web/app.js"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a22415ac7e2f084dfac1455a3884f49c1273c318eba7cd434d6f1ba0986b5ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #touchSwipe (cyclomatic 16, cognitive 17): #touchSwipe 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":"web/pdf_presentation_mode.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"e235b4b1d40498328948aa11a8f764acf739b3fbcafa05d94e2d3f8ada696875"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 16, cognitive 16): (computed) has cyclomatic complexity 16 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":"src/core/xfa/template.js"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"a744446cff8600ad4c2bff8b65a690e2eb3e1b95a057f079fee2ad68f2502b6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseContent (cyclomatic 16, cognitive 16): _parseContent has cyclomatic complexity 16 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":"src/core/xml_parser.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf36951a6d784c247bfc8e63951c28bcba9a9d1370f521269f42a6c6781c359e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _prepareSMaskCanvas (cyclomatic 16, cognitive 16): _prepareSMaskCanvas has cyclomatic complexity 16 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":"src/display/canvas.js"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"7600b9d39708e11deb949b52ef7e498342054966e4a82dfe1de6ca87ea566689"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSoundFormat (cyclomatic 16, cognitive 15): getSoundFormat 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":"src/core/sound.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9d0b7228d4a92e08e14deb10800eb64e1050f0bb15789178b920c80b813f62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function watchObjectOrEmbed (cyclomatic 16, cognitive 13): watchObjectOrEmbed has cyclomatic complexity 16 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":"extensions/chromium/contentscript.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd0f62613acd281210723d6ef731d6ee347289e992b24e1ff3840fbd2e5fc3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generate (cyclomatic 16, cognitive 13): generate has cyclomatic complexity 16 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":"src/core/hellbox.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc09639d0f9dd3200f1aeab032c2ae79a2108951e30310122ab2898a516ef1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #intersects (cyclomatic 16, cognitive 13): #intersects has cyclomatic complexity 16 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":"src/core/intersector.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b992e2aa28c5ad8c3465efe8bf343b217798dcdc0fdc1a5c69fd5408bc1795d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 16, cognitive 12): (computed) has cyclomatic complexity 16 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":"src/core/xfa/template.js"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdec96b0b1a83df752728bbe069346be7ba2d23f41609af1100d74dc2e419d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compileNameIndex (cyclomatic 16, cognitive 9): compileNameIndex has cyclomatic complexity 16 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":"src/core/cff_parser.js"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e52541ddde07914d70c28766cba7111f8d14ca377cdb4bb79ae1236a7d0877"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function adjustMapping (cyclomatic 15, cognitive 35): adjustMapping has cyclomatic complexity 15 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":"src/core/fonts.js"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd86ebd523aa869e0dfca8f8d3743fa6a70838ffec9ff88306ca30542b713b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _getPageNumberToDestHash (cyclomatic 15, cognitive 31): _getPageNumberToDestHash 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":"web/pdf_outline_viewer.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b4ad5dd5f5c22636e6953b8c0c45b9634e9a17e5ec51f6f5210e747981614a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 15, cognitive 29): (computed) 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":"src/core/xfa/xfa_object.js"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a300a1bbd77a1f3b8e1ee9a8747721eeb71de2f5dea5225041c14260119cc8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _bindItems (cyclomatic 15, cognitive 28): _bindItems has cyclomatic complexity 15 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/bind.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2ba8c7bd4bb1591322ac6429377ab774a315286b02282b750540a4155aa40f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function editorStats (cyclomatic 15, cognitive 26): editorStats 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":"src/display/annotation_storage.js"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc37051f608d3626bab6a506557798786b024b621941ab172582f27f939a210"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawTriangle (cyclomatic 15, cognitive 26): drawTriangle 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":"src/display/pattern_helper.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e982ad90eb3ba085db7fab7b4545dee392d750f4faf4f7a4b5210ab8d10b4ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 15, cognitive 25): open 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":"web/comment_manager.js"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a02d6906ded0a29be505d4d6058f88335d36ae9678d5d9412175fe9ab1e218d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _setProperties (cyclomatic 15, cognitive 24): _setProperties 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":"src/core/xfa/bind.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"34eb524ae39c235f15e0458ffec4d37f116287963e0c656606ea3c90f2dcee7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #buildLine (cyclomatic 15, cognitive 23): #buildLine 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":"web/internal/draw_ops_view.js"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0b78cf87edeba7d13771262a4548059b744742b5844a5a4c4eb6fc74c96ffe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #checkRequest (cyclomatic 15, cognitive 21): #checkRequest 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":"test/webserver.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9304023a3d0a123365c4d99db271822d028cc7b6f8f22c93de99dbbb08651494"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchUncompressed (cyclomatic 15, cognitive 18): fetchUncompressed 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":"src/core/xref.js"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"e411f8e912e35af0825fff119259b6265a04ffc71238cacf95a9e28afa816866"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AFRange_Validate (cyclomatic 15, cognitive 18): AFRange_Validate 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":"src/scripting_api/aform.js"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b94026d6d9d9140e97d8340d63416127de92fd93c2daf1eaa7027e977328b06"}},{"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":"src/core/editor/pdf_editor.js"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c236c53a4625fe484fb90ee424d15c10c8740257a68e71c6c07856eadbc18e"}},{"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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"296cb34e32ecc0c504446d8ccd52ffadf2d5001aaa060acd27c4fe68f751b786"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MemberExpression (cyclomatic 15, cognitive 16): MemberExpression 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":"external/builder/babel-plugin-pdfjs-preprocessor.mjs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46ee320ba3bef4ceff95f407cf4074f553fb04fbd5dcb80753960d67343479e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function draw (cyclomatic 15, cognitive 16): draw 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":"web/pdf_page_view.js"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7e6668a70678cfa1617c6e15cebe0a61314cb5cb20e016d8f4b1475a1fc0e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 15, cognitive 14): constructor 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":"src/core/annotation.js"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"e150bccb70adfc0bfcdbaaa135842bea539ea456223890d0c023f6e363aa7cde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getOperatorList (cyclomatic 15, cognitive 14): getOperatorList 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":"src/core/annotation.js"},"region":{"startLine":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ea8b05b29b00676322bcd8e89b1ec29a4bb5f2d1ef44ac10084c9c3b3914e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #shouldRenderDifferentArea (cyclomatic 15, cognitive 12): #shouldRenderDifferentArea has cyclomatic complexity 15 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":"web/pdf_page_detail_view.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b0cc25bf7abbd00a63f1d8aa6fbaeb92033ee890a9a08aa773e1aad6019cfa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseExpr (cyclomatic 15, cognitive 9): parseExpr has cyclomatic complexity 15 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":"src/core/xfa/formcalc_parser.js"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97b513109baebdc326df4eac686997e456a8908d6eaa476db4bf3a8d75fc2c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #findStreamLength (cyclomatic 14, cognitive 42): #findStreamLength has cyclomatic complexity 14 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a583365043366f439dfbd2b443a9cfd3a1d359eab200861f39093e275fc99e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #walk (cyclomatic 14, cognitive 37): #walk 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":"src/core/object_loader.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4966654f8969c596fe292b62df5b95c7ef1b81119033d97e458fc6bb33fb37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getAll (cyclomatic 14, cognitive 32): getAll 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":"src/core/name_number_tree.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d83d54c4925349d472dbf9bf3fe4872e583480dcecc7a294c84e0e9bfe4491"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function disable (cyclomatic 14, cognitive 29): disable 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":"src/display/editor/annotation_editor_layer.js"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b578f4754f466d23740e6ef2c6e2f145ce993716e933cf51667a1bd04bbdff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPattern (cyclomatic 14, cognitive 27): getPattern has cyclomatic complexity 14 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":"src/display/pattern_helper.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"68591bfbb6cd5df0bbc3b4b4a09a07cf16207608533258367b25c276bbe0c466"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeCoverageData (cyclomatic 14, cognitive 27): writeCoverageData has cyclomatic complexity 14 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":"test/test.mjs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae7c1962478c683ae0d52f1a3457ff3e5e277a9dd06c88d2e25b63bc72e86ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructSampledFn (cyclomatic 14, cognitive 24): constructSampledFn has cyclomatic complexity 14 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/function.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3fd255bc10b3f6aabcbc6f5599c98d7f34b26c16dc23e06b42666bcbc7595c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #render (cyclomatic 14, cognitive 24): #render has cyclomatic complexity 14 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":"web/internal/font_view.js"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b0c9ea8d059f93b3aa2eefd676d0e510db281cb6a4cb6537ddf55f5cb6d5ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveNewAnnotations (cyclomatic 14, cognitive 23): saveNewAnnotations has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc57f1c03a46c6d4a6e1be14eadb120cd187c1d345d4e3afe10fc87d4d401e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 23): constructor has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":3938}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1945307ee1642015690ff7179e1726354c2a304b004faea24a2bdcf6f61459"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateOperatorList (cyclomatic 14, cognitive 23): updateOperatorList 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":"web/debugger.mjs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c74a524c7999dd8c877fe4578b8b507c93d359feafc369b50c3fea17aed1c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 22): constructor 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":"src/core/annotation.js"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a7288e82de1fc179c078141844dfcb5cab0e08c8bf9fb1bdb554cad99879ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compileDict (cyclomatic 14, cognitive 22): compileDict 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":"src/core/cff_parser.js"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00a60c79b6cd585b531651e7bbc2a6208b053318763fc312b7512daf1c026af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createWrapper (cyclomatic 14, cognitive 22): createWrapper 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":"src/core/xfa/html_utils.js"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6a92331d332e5d70abc1c921fb1ccc70ea815a917a80dfa60939ae3ff0f3e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copyCanvas (cyclomatic 14, cognitive 22): copyCanvas 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":"src/display/editor/stamp.js"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3282583bcde0d3fbaf9506f86045af09d203c65e4d2769e4ed870ab24bf89a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseBlock (cyclomatic 14, cognitive 21): _parseBlock 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":"src/core/postscript/ast.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df4f3236e561d3ebbed87354c45a72cfab3d2b89531bf2026546a11360e6ff0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function merge (cyclomatic 14, cognitive 21): merge 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":"src/core/primitives.js"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"5550a83546a4c66f22f73afedd3498d3b0776638537f5565a5950a395212e034"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createDataNode (cyclomatic 14, cognitive 21): createDataNode 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":"src/core/xfa/som.js"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b9f5cb9d106bc75ac2f50dc50c7250477ea412e0ca7f13aabd5c9a4eae5c87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keydown (cyclomatic 14, cognitive 21): keydown 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":"src/display/editor/editor.js"},"region":{"startLine":2073}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a40cf585c996ee3a6e1d144064409cbf8aaafa8b33dc986117ce4e82e0c811"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPdfFilenameFromUrl (cyclomatic 14, cognitive 20): getPdfFilenameFromUrl 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":"src/display/dom_utils.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"da628c9f156acbb60f10d15c39338177b306c83b57a00b7f776b352b1c40bf73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deleteItemAt (cyclomatic 14, cognitive 20): deleteItemAt 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":"src/scripting_api/field.js"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3e22817eeb1ff6afea87afb6f6e9e15805f0b9b5f64cef59b194ce3b6c89c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 19): (anonymous) 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":"extensions/chromium/pdfHandler.js"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90c79547f16badd19377740f458db4477a3f886546344c87bbce01b708b8a54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convert (cyclomatic 14, cognitive 19): convert 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":"src/core/fonts.js"},"region":{"startLine":3362}}}],"partialFingerprints":{"codehealthFindingId/v1":"600fd6a17b5926c155e3e9ffa2da2559ebc0b25a4d23605d53cac5247e7e79cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readNextMetablockHeader (cyclomatic 14, cognitive 18): readNextMetablockHeader 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":"external/brotli/decode.js"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"41546858c872a8229f96be51f0c337ee27c74cdcfb655f4e5fe9c670de61a7a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #loadXfaFonts (cyclomatic 14, cognitive 18): #loadXfaFonts 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":"src/core/document.js"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b7b675bb1a0abe25723f49f01ee53c12f8ab844b753b82c08fe113bba99e6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _optimize (cyclomatic 14, cognitive 18): _optimize 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":"src/core/operator_list.js"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2baaec7388514235cf2b079658a1eea5bf0766f77a9c11143288be1936bfb4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _abortOperatorList (cyclomatic 14, cognitive 18): _abortOperatorList 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":"src/display/api.js"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a0c2f6eac964fca455ea41b2d8d36b6dd1fa377679e4b54525002d6c06fa8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #serveDirectoryIndex (cyclomatic 14, cognitive 18): #serveDirectoryIndex 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":"test/webserver.mjs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bd6f47509da1ad7fcf5242fcac7637dea1182dc0b9feaee5a294e724aec262"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 18): (anonymous) 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":"web/internal/draw_ops_view.js"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc6cb149894a2aaa099912e772a781fbc3110e4da9e98e3a2b7b98865a7a663"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getAnnotationsData (cyclomatic 14, cognitive 17): getAnnotationsData has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"3884dd093775ef0f6dce0418e2deb64f122d8f82ae794d9a192c4f1289988fdf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _transfers (cyclomatic 14, cognitive 17): _transfers has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/operator_list.js"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bb036d8db5f48ca6c92005abc28b5fdbf0a7aa3d0fcb552a0da8f0f1857fb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeOperatorList (cyclomatic 14, cognitive 17): executeOperatorList has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/renderer_worker_proxy.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f29a071673c6c2fe779e10144f63cba2193671be201aac0edc63fef98bbfb5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _processCheckBox (cyclomatic 14, cognitive 16): _processCheckBox 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":"src/core/annotation.js"},"region":{"startLine":3740}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff86acf22cf078d92fd429c6284a31c9008d9b6143bc4a7731651950b9612076"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exec (cyclomatic 14, cognitive 16): exec 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":"src/display/editor/tools.js"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"041cb538927bad9986df984d65a2e204b6339ac357c0c38b21ecdfff4931fb53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 16): (anonymous) 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":"web/internal/debugger.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7168b672265821b70aed224433292c4228af04dffae8cd4c17ecb08c5daa419"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _scaleImage (cyclomatic 14, cognitive 15): _scaleImage 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":"src/display/canvas.js"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f16e3cb8a1a146588ef05e7f8686f2cd734707e2bf53036876ae7f9d3affa5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #parsePageSize (cyclomatic 14, cognitive 15): #parsePageSize 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":"web/pdf_document_properties.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d62412f560a79fafe445994a61aab03f640d05b195b2cbc40d1fd0410eef6fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeRef (cyclomatic 14, cognitive 13): makeRef 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":"gulpfile.mjs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8a4493e026297b0c697de1699f5480748e37f425d732bd32f99d70fdbcb87b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 13): constructor 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":"src/core/colorspace.js"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba811bf34e35a15ebe28af1341e68b044a894ed6a94e910fe447f7c90310074"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 13): constructor 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":"src/core/xfa/template.js"},"region":{"startLine":4235}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab6b19dc691aba11187c0f65b512826abd77606cfead2520d67e34ab979d5d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initialize (cyclomatic 14, cognitive 13): initialize 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":"web/pdf_history.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0f3cd6a90c6b6a94282a7850743cd2f3f875e3629481674d332eef02e557c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildToUnicode (cyclomatic 14, cognitive 12): buildToUnicode 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":"src/core/evaluator.js"},"region":{"startLine":4091}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54e3fef3fc244289e58660d7992271d74a81c0487a3939d65be2a6be5719b21"}},{"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":"src/core/colorspace.js"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0e4852fc72a2aee95fc95fbcfdf8b0fc02871e64b89cfc77fde0d6410adc5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function windowMessage (cyclomatic 14, cognitive 11): windowMessage 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":"web/firefoxcom.js"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6e5ab85764b8564dc19cc373880ca3e4a2c82fc8449b38a8bf3728fe9fda51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _nodesEqual (cyclomatic 14, cognitive 9): _nodesEqual 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":"src/core/postscript/ast.js"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2651a9f5bd2df19027c1c2fa0c99ffddb5cd51e856dd6aa7a9650f13414c3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getScaleForStroking (cyclomatic 13, cognitive 40): getScaleForStroking has cyclomatic complexity 13 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":4443}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5af676655a17dbd25b552104a4bd7f1c09048b3ba27feabb27c05ed91e12d7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closeSession (cyclomatic 13, cognitive 30): closeSession has cyclomatic complexity 13 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":"test/test.mjs"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"021ee5b4304fe5c859e08adc98936ea1ab2d2a18d4c4a21bf9c2f70557a9f7cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBit (cyclomatic 13, cognitive 29): readBit has cyclomatic complexity 13 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/jpg.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d493d17fa97a033615d3ecf71f74642636a2cc9d7eb9040b56fe578fd9368eae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBlock (cyclomatic 13, cognitive 29): readBlock has cyclomatic complexity 13 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/lzw_stream.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"731a1890b2ccd36aed1f70ddd1f842a45234874f0604687a7ea88aa25386e09e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startXRef (cyclomatic 13, cognitive 28): startXRef 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":"src/core/document.js"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36c708fca3cc1e81a3da819d076fd9575dadc6290b0c8ad7de8e5df2d413789"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMarkedContentProps (cyclomatic 13, cognitive 25): parseMarkedContentProps has cyclomatic complexity 13 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator_utils.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f2f279c7913ecf924f3dfe5e2e62397840291926de8c7673effe750386f6d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 13, cognitive 23): constructor 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":"src/core/annotation.js"},"region":{"startLine":4818}}}],"partialFingerprints":{"codehealthFindingId/v1":"1859213b5651e700a1ab74e0fc89142a6699787f84e7125b60e3ca620872078d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function find (cyclomatic 13, cognitive 23): find 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":"src/core/document.js"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05e764b1c910d8ab154ec98861fd3604aac2847f9cc8f332892cd34d8413805"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getRaw (cyclomatic 13, cognitive 23): getRaw 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":"src/core/name_number_tree.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f266aae1689a371effac3e746f53dea3bf3d23e9a50c776ca6d27a332c366b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createPatternCanvas (cyclomatic 13, cognitive 23): createPatternCanvas 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":"src/display/pattern_helper.js"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19b5d0ece4cd0f77346f7b9bff3f27ed5977774b26ba823cab6e2af12a9c539"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initSandbox (cyclomatic 13, cognitive 23): initSandbox 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":"src/scripting_api/initialization.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"275b831c1d54c94d824df395a2de6112be678496e8da4f99c5cca96560e5ab06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #setCaretPositionHelper (cyclomatic 13, cognitive 23): #setCaretPositionHelper 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":"web/caret_browsing.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e1dd64be45c749309158d5c5e0582e3cc13832ec2fbed667792151e6d7aaa3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setBorderStyle (cyclomatic 13, cognitive 22): setBorderStyle 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":"src/core/annotation.js"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdce713d35de5a9bcea6a8946645e1ad0f4c76e598f7b117724802eb2421b2cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commentButtonPosition (cyclomatic 13, cognitive 22): commentButtonPosition 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":"src/display/annotation_layer.js"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bbc307b71d8c7d75853495640161a91154eb83ab73fd99a73658d46d134318"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _getOptInfo (cyclomatic 13, cognitive 21): _getOptInfo 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":"src/core/annotation.js"},"region":{"startLine":3667}}}],"partialFingerprints":{"codehealthFindingId/v1":"94427ffb1e934ece1b3772ff5233407f0cf24117e4ab9863a43e15333d43a153"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkLastPage (cyclomatic 13, cognitive 21): checkLastPage 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":"src/core/document.js"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc47f3b3db9cd509caef827e1eb158c60280b5a929f30391022cfcaa852a9dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 13, cognitive 20): constructor has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":4911}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc57fb3347e711a29e1d43cfe74e99e3a8346b0e510923d6b573c24b43a8a6ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPostScriptTable (cyclomatic 13, cognitive 20): readPostScriptTable has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":2452}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5678eb215fecf4e1be7231247b68825f0be56a2a4570ae7ee5c7d9a1d3c85e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 13, cognitive 20): walk has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fdf01c2cdd9f00c1cced87f1929725685ede9f186700c8d047b575622b6289"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseExpression (cyclomatic 13, cognitive 20): parseExpression has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/som.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc35d33453fe869eb7f663534a058365ed1c0ef85fad6e4e27b15cca5fe5280"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 13, cognitive 20): parse has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xref.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"42943c3f5e3e1397bee6457bee6cd6ce32b820ab19e390db055809329c7fc83b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #AFSpecial_KeystrokeEx_helper (cyclomatic 13, cognitive 20): #AFSpecial_KeystrokeEx_helper has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/aform.js"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dc3d2088c6aebdb4158245d900cd23e96d8727a42ed53e1d31d786089c506d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finalize (cyclomatic 13, cognitive 20): finalize 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/test.mjs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d48d75ef7223bb7a10f4453157972881840223ab558a1b6b921404db303d2f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #collectPageLabels (cyclomatic 13, cognitive 19): #collectPageLabels 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":2368}}}],"partialFingerprints":{"codehealthFindingId/v1":"2720db0c9f712eda48c57be7b4951b024221af599bdb101cd9deb6fcb6b422fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readNameTable (cyclomatic 13, cognitive 19): readNameTable 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":"src/core/fonts.js"},"region":{"startLine":2518}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f52328979870a22d55fa93b50b3316c54100b651ff6764dba260fe9aa0b01f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function foundImageMaskGroup (cyclomatic 13, cognitive 19): foundImageMaskGroup 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":"src/core/operator_list.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47e199514ea22bacbcf99e5dcdbe643b12b00e8113723ceb72e1f1a2b2538eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 13, cognitive 19): (computed) 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":"src/core/xfa/template.js"},"region":{"startLine":3097}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab341514278acda499393f10328f8ff057d36e35ec0757238c6b3c3643caf7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fill (cyclomatic 13, cognitive 19): fill 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":"src/display/canvas.js"},"region":{"startLine":2317}}}],"partialFingerprints":{"codehealthFindingId/v1":"127019597d562ae51b0fb7e02c80a95e4ae8a53b76eecf3dffc88de35b2a4791"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalize (cyclomatic 13, cognitive 19): normalize 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":"web/pdf_find_controller.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc195b9fb103ccc17cf776d7b388f9392e380a30c0929adfdb887c7e3a95d2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildMozcentral (cyclomatic 13, cognitive 18): buildMozcentral 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":"gulpfile.mjs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"3448f51bd10c17252363cbcacdb5f6b781a33c458cd1bea20196ead01df5634f"}},{"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":"gulpfile.mjs"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"62aafb2f6bfdd8bd8de5bf1b6dd4006cf459a01d05452eae145fddfc08992beb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function close (cyclomatic 13, cognitive 18): close 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":"web/app.js"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc860ef76ed5f5432ca6fdc4a3bc7cfa5650dd430a61a3d9b463124af83aae1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mirrorDir (cyclomatic 13, cognitive 17): mirrorDir 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":"gulpfile.mjs"},"region":{"startLine":1977}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a4f71070c1e281176aa579452b0bd99b588c8c8d8bf99586fadd1f910a1a37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #modalPageSize (cyclomatic 13, cognitive 17): #modalPageSize 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":2602}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6918bdf8336405f7b36736bca0c72c83a12e9b4bfb6eb414257764b803fd93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _bakeSMaskCanvas (cyclomatic 13, cognitive 17): _bakeSMaskCanvas 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":"src/display/canvas.js"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c60a2bfb2ab7cbe72f729fd41d939f2574c8ed92b14f5e593eb56f4dc883463"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 13, cognitive 17): constructor 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":"src/display/editor/drawers/highlight.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8a01d0173f0bc09e21e2a9c21536bc524b78d7e1c3e3daab4ee94edacf6912"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #selectionChange (cyclomatic 13, cognitive 17): #selectionChange 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":"src/display/editor/tools.js"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afd6a69e2b21b50c435e0680a8e115b697f0cb055d45e95b90cf3d68286d3d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #renderCanvas (cyclomatic 13, cognitive 17): #renderCanvas 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":"web/internal/page_view.js"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"405afc302f4685b6be8661b0a598a9975af99408584f2cb3c312b3df71f675ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copyRawBytes (cyclomatic 13, cognitive 16): copyRawBytes 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":"external/brotli/decode.js"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad563e6016b1c96ae40a6994a4908217604ed98195f9216e2e9e2de720c3fa6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _getSaveFieldResources (cyclomatic 13, cognitive 16): _getSaveFieldResources 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":"src/core/annotation.js"},"region":{"startLine":2873}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd62ee1fc089583a5452a84709d29788ffafdaaf747da3af6b4ca49213a63c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBlock (cyclomatic 13, cognitive 16): readBlock 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":"src/core/ascii_hex_stream.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf9e6c858702a72c11f13ac4fc02a0cca1e895c68a974ece08299976c501ad6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #readOptionalContentGroup (cyclomatic 13, cognitive 16): #readOptionalContentGroup 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":"src/core/catalog.js"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd1b62ed693b0878c1d9959f9b29fd825b84d669798a6a0396b573121dacec5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFor (cyclomatic 13, cognitive 16): parseFor 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":"src/core/xfa/formcalc_parser.js"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f80c80f475f25f954d03a291a3400d98d59a7a86db3bb37d65a1dcfbc2156ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #addElementsToDOM (cyclomatic 13, cognitive 16): #addElementsToDOM 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":"src/display/annotation_layer.js"},"region":{"startLine":4114}}}],"partialFingerprints":{"codehealthFindingId/v1":"028ad28469ceb9b4043c385a25a3e3e6c19509558a1a69d90f6c5bda9e48cac0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function update (cyclomatic 13, cognitive 16): update 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":"web/pdf_page_view.js"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"330be4be6c7d746cd38a23bd55d1494c5685279b1a00a4040b21075b531dfb27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compilePatternInfo (cyclomatic 13, cognitive 15): compilePatternInfo 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":"src/core/obj_bin_transform_core.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfe126ee49337d6e2de3a7333de4e23c1c4439896d62a7d3d24dd560ea4a34e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getToken (cyclomatic 13, cognitive 15): getToken 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":"src/core/type1_parser.js"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"1658855d061ae8d85d2348585cf38d87cf364ed9dd272be304e4c2840dd27cbb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructPath (cyclomatic 13, cognitive 15): constructPath 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":"src/display/canvas.js"},"region":{"startLine":2191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fddede28572d1f8d9cbe733c7a85a3c83f6836494f793ea1c8351dcc53101e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function showType3Text (cyclomatic 13, cognitive 15): showType3Text 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":"src/display/canvas.js"},"region":{"startLine":3103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acfb79811eda68ebba1abad009d1d9e90bd16d94af761ab616d93d7f91235b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSelectionBoxes (cyclomatic 13, cognitive 15): getSelectionBoxes 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":"src/display/editor/tools.js"},"region":{"startLine":2948}}}],"partialFingerprints":{"codehealthFindingId/v1":"2250e3797fa533672a20f02adb2de02e4f16ffd1384f240132598e5c9d1fac1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #onStateChange (cyclomatic 13, cognitive 15): #onStateChange 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":"src/display/network.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"718b63b43bd044602b7d043f5472c649f8c097fa2a7de8aa18b38bb9ffc82152"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setTitleUsingUrl (cyclomatic 13, cognitive 15): setTitleUsingUrl 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":"web/app.js"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9f747d24e85e7c6a9eeb7a61d892cb45aae48f63c1b17b538883ee1bf49060"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function goToDestination (cyclomatic 13, cognitive 15): goToDestination 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":"web/pdf_link_service.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"986193d1c127377da10eff9d3ecba91215e72ed12a62fa906040a3ae4aa99a78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _saveRadioButton (cyclomatic 13, cognitive 14): _saveRadioButton 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":"src/core/annotation.js"},"region":{"startLine":3489}}}],"partialFingerprints":{"codehealthFindingId/v1":"7092bd02fde2e3e76f9677635de706c38a2ae02c2c8afe3b6f61c375362eb75a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createAppearance (cyclomatic 13, cognitive 14): createAppearance 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":"src/core/default_appearance.js"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"614aaf813b655b8fcea64c6f81f32141df9bdf705278d361dcfd88820590a993"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #makeStructTree (cyclomatic 13, cognitive 14): #makeStructTree 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":2914}}}],"partialFingerprints":{"codehealthFindingId/v1":"1792f78f576713d7b9b7d553093c161076ff0bb0478e24edecc18a3f9d459de2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createMask (cyclomatic 13, cognitive 14): createMask 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":"src/core/image.js"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"e626e16914ce3805c6cda7b15d4cd1b229093ce1303874caaa6f51c5bf8a7694"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parse (cyclomatic 13, cognitive 14): _parse 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":"src/core/metadata_parser.js"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"820e25a643a2e0d3834c2d29d63386a3264efc16de4eb3f3ae3a3e4f588ff1f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) 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":"src/display/annotation_layer.js"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac92c1f48b3c1bff0bd86b0eeca9a538319d4aa67dc39a0808bd538b5dce045"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 13, cognitive 14): render 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":"src/display/editor/freetext.js"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5a35e64553c52e19bf77e9f064a115145631dc2e550bbee38eba6f8f7d4aeb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) 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":"test/integration/test_utils.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"74db4c342ce51c78d459eaf80998e0e55f97c80587488a8062bc89af09c45c8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getOperatorList (cyclomatic 13, cognitive 13): getOperatorList 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":"src/core/annotation.js"},"region":{"startLine":3342}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f855e12d3b6aba4d8765e9ddddae88616bd6fc42f71a576478a04e2d096bef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #tryPushCurrentPosition (cyclomatic 13, cognitive 13): #tryPushCurrentPosition 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":"web/pdf_history.js"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1dd0e07db1f53c008a2910743b6f6db8ebabe019f9943b70b2cfe1f337affc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getTransferableImage (cyclomatic 13, cognitive 12): getTransferableImage 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":"src/core/jpeg_stream.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"769c1b50f054f185399c0c42972c565e1a33d26559a2dae1bb9f0e2e866e1d51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 13, cognitive 11): constructor has cyclomatic complexity 13 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":"src/core/pattern.js"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"31904b0ab8d2f88424684666645a436959f2854b4280a9f055c57cc37f39511d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _createQuadrilaterals (cyclomatic 13, cognitive 11): _createQuadrilaterals has cyclomatic complexity 13 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":"src/display/annotation_layer.js"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"5529560793cee85c4c6bc90c2e0fd56181e8f080b78dd146d2304a9420bd58b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AFSpecial_Keystroke (cyclomatic 13, cognitive 11): AFSpecial_Keystroke has cyclomatic complexity 13 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":"src/scripting_api/aform.js"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b378030469f1d3d0292c2b0efef11230f07e6b3f10b82fe63b7ac3008f0ee24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getDataProp (cyclomatic 13, cognitive 9): getDataProp 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":"src/display/api_utils.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"97568d11785e33f9873670bf6d5a6487a67106aa58cd52edaabf1be82242b0be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addLinkAttributes (cyclomatic 13, cognitive 9): addLinkAttributes 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":"web/pdf_link_service.js"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"672605be5537e435f018c786880f8016584a33141eba028e69e7c4d636906254"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #writeKids (cyclomatic 12, cognitive 32): #writeKids 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":"src/core/struct_tree.js"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7148746991c73a065a6423dee7e16273a80ed35e2c0e30d4292c064318bd84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readTrueTypeCollectionData (cyclomatic 12, cognitive 31): readTrueTypeCollectionData 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":"src/core/fonts.js"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"7051a860d71ede310322e7940c07b69b755917abbad868f79937eb906d12724a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractFontHeader (cyclomatic 12, cognitive 30): extractFontHeader has cyclomatic complexity 12 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/type1_parser.js"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4f2bdd50ecbb4cbcf5a100fa7d6266e84b484a3ac531d1163d4f5d717d02e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleColorN (cyclomatic 12, cognitive 27): handleColorN 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":"src/core/evaluator.js"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"442bf20a5ed7fd5495fcc0db049caadcaeaf13ec42c6bac960e0e64553a330ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeBbox (cyclomatic 12, cognitive 27): computeBbox 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":"src/core/xfa/html_utils.js"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2afa168fcc550f6a920e803329730d3e185f436fa7e0da3d9da3e11476e5d42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #findAsset (cyclomatic 12, cognitive 26): #findAsset 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":"src/core/annotation.js"},"region":{"startLine":5718}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca0e0caf8bbc21e320bd3b57b88b17aec6cc59315f9f804f0e864ccdc2df5e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getComponents (cyclomatic 12, cognitive 26): getComponents 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":"src/core/image.js"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e38643851e9907b60685ab6dc7c5e517190951a03d530f5e807e698c070b857"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #bilateralFilter (cyclomatic 12, cognitive 25): #bilateralFilter has cyclomatic complexity 12 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/drawers/signaturedraw.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c6543b6ef22f65b1884e72cdf236fbeb295976d015a9be708fb03b1f823607"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseEncoding (cyclomatic 12, cognitive 24): parseEncoding 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":"src/core/cff_parser.js"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2449fd2bb8970f54b191f086e946acecf5e0a37f67fc5738f61c3d65b1b509"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _encodeBMP (cyclomatic 12, cognitive 24): _encodeBMP 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":"src/core/image_resizer.js"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a06443413bbe1453588f8ffffe18579897de4bbd5242617ed018f280e2b6dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateTextLayer (cyclomatic 12, cognitive 23): updateTextLayer has cyclomatic complexity 12 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/struct_tree_layer_builder.js"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cc57fd80e5acb1226f66521897193fc8934612425afb35634485a064c68c25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getFontFileType (cyclomatic 12, cognitive 22): getFontFileType 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":"src/core/fonts.js"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a479cbb68e9f9c65ee4808679f0d88fba03410a2d58d435fdf0397c5a2ce602"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #computeMinMax (cyclomatic 12, cognitive 21): #computeMinMax 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":"src/display/editor/drawers/freedraw.js"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ccce0ca330b0b8520c9feb4d9c2b0291016a68637b1737e4e85afe8d324aa4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #runCalculate (cyclomatic 12, cognitive 21): #runCalculate 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":"src/scripting_api/event.js"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"0697887c5d23edb908d294e474fd8ae1b58928e99c61e0bf0473f1d60ad9e521"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBlock (cyclomatic 12, cognitive 20): readBlock has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ascii_85_stream.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c75f4da1b6c7f4d015b355b30aec2f96ab278e669d58124e3f5e60e09f1b9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getField (cyclomatic 12, cognitive 20): getField has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e8538defbe282aa87a9dee2658fdd7522946b9a3d9239c0c9946bae375fb5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _splitLine (cyclomatic 12, cognitive 19): _splitLine 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":"src/core/annotation.js"},"region":{"startLine":3160}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2ae8725353fb13ea92b6ec2cfdba8febc05ec57f272add8b6fd9034053a4a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _getElementsByName (cyclomatic 12, cognitive 19): _getElementsByName 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":"src/display/annotation_layer.js"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ea3d27bb2ce4e691fc13ead3622d3d1bdb1e39873a2bf80e6197118a1e17b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #makeImageArgPreview (cyclomatic 12, cognitive 19): #makeImageArgPreview 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":"web/internal/draw_ops_view.js"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"62de2a9e7dafc357eef572d2eab49ec9eb9f385b666876aeeb456ba9c0cf37dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _collectJS (cyclomatic 12, cognitive 18): _collectJS has cyclomatic complexity 12 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":"src/core/core_utils.js"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c48e17001d18d2b75a7e036dea574691760f3b0b7f22313b61a8973e8a364a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #buildChildren (cyclomatic 12, cognitive 18): #buildChildren has cyclomatic complexity 12 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":"web/internal/tree_view.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bdf47a5938c024ac09bbab5336643ab7f0e25427f06b44f7151ea92542eabf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #computeThumbnailsPosition (cyclomatic 12, cognitive 18): #computeThumbnailsPosition has cyclomatic complexity 12 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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3c4008cbf08d41dc26c724d7febdae420360b2bea09205598f2ea8958955d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildHuffmanTable (cyclomatic 12, cognitive 17): buildHuffmanTable 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":"external/brotli/decode.js"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e5bfc3fc91c9cc035029666b43e3864567d1e3828661d784be178539c66750"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #findClipAsset (cyclomatic 12, cognitive 17): #findClipAsset 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":"src/core/annotation.js"},"region":{"startLine":5880}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c4ebade8d2815c9bc8c592beec358285b3a5750117d1d5792346ad98e854ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #prepareKeyData (cyclomatic 12, cognitive 17): #prepareKeyData 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":"src/core/crypto.js"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed0cb143217ecd23507868f10b11b25a3e4baffb8fb8d6f63e5ec26bf97e29e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #collectFormStructParents (cyclomatic 12, cognitive 17): #collectFormStructParents 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":"src/core/struct_tree.js"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f71023c62ba00ec9aa5e396208946367cddc5c4950ef43e2bc0b39c41f38210"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 12, cognitive 17): (computed) 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":"src/core/xfa/template.js"},"region":{"startLine":3917}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88d2e6643f6edd51c285b97530de0008cdc8c8c7d8ef854a954d34171ae5a68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #nextMatch (cyclomatic 12, cognitive 17): #nextMatch 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":"web/pdf_find_controller.js"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc12592b0455bd6fbfdb54da2f60615967fe9e1a4da9b6258320a5c834645755"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function approximateFraction (cyclomatic 12, cognitive 17): approximateFraction 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":"web/ui_utils.js"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f3016a5fa4836795fa036138ce0dc255951f41de169f006b50a296fcb76021"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getRgbBuffer (cyclomatic 12, cognitive 16): getRgbBuffer 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":"src/core/colorspace.js"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d45aad2b692a8efefa3731e724b922944742363e575347add3e1611de19cbb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #getLinearizationPage (cyclomatic 12, cognitive 16): #getLinearizationPage 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":"src/core/document.js"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d2b2c3293844ad6793946ce309a5bafd0c5f4c0e9de4c54f9e0ee3b471ade8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterContentStream (cyclomatic 12, cognitive 16): filterContentStream 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":"src/core/editor/print_appearances.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee345e282ce516b6ab941d5267c4e5e5f6a6fe9c8e37897345f17a320252638a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _decodeType6Shading (cyclomatic 12, cognitive 16): _decodeType6Shading 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":"src/core/pattern.js"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1b647ea463dcf33e8c0119e415b0efd3fbada697f8dc27f9abe1a90dbd7293"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _decodeType7Shading (cyclomatic 12, cognitive 16): _decodeType7Shading 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":"src/core/pattern.js"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"f352b039cf259b9551ee2a0d1dedbfa691c548f416f22370efea9f2596c8e45c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mathML (cyclomatic 12, cognitive 16): mathML 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":"src/core/struct_tree.js"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91c9ce2d22d0f3c87be1bdbefab99d05550b97039c44995c7e15a105e87331d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseKid (cyclomatic 12, cognitive 16): parseKid 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":"src/core/struct_tree.js"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80e47f0b45f338b7fb063693e9e1d7db0ea9a251b65cdb26f79a363ecbdd234"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWhile (cyclomatic 12, cognitive 16): parseWhile 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":"src/core/xfa/formcalc_parser.js"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16c4fbcc0f53ffd1d9ccf06843a6250d67438308a7c6fad90f4caf11dee9fa8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 12, cognitive 16): (computed) 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":"src/core/xfa/template.js"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e55c6933faaa46a5c68a571527d34adc98f23d5a27d6da527c1f8d593169d6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addString (cyclomatic 12, cognitive 16): addString 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":"src/core/xfa/text.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f13c6b57f1dd22797b39bb885230d1a7fde6b972b2962a3b2e0dc513a8e7a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processDrawnLines (cyclomatic 12, cognitive 16): processDrawnLines 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":"src/display/editor/drawers/signaturedraw.js"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdbc15c558e7d32332b88b69dd3d13d9adc53f3fbb2815e459a85125f3233c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #setPosition (cyclomatic 12, cognitive 16): #setPosition 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":"web/alt_text_manager.js"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"293df1aa4f540c5cec279e377378a72580609c55ff95cba94220fb98c6ab82e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function editAltText (cyclomatic 12, cognitive 16): editAltText 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":"web/new_alt_text_manager.js"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f10204be03cb332a91dd524212bb6ad6c304c59381d5a2b88e03da71fba7158"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compileIndex (cyclomatic 12, cognitive 15): compileIndex has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_parser.js"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79e0c4734a43383b581ffb4acbe03b7559be2fa34955b801987edddbe7e622c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 12, cognitive 15): parse has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/default_appearance.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"631ff3929513e4237ba3e8475ebf8005d8ea73069d6d1dcb6c0c4044b04d8b26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _xfaStreams (cyclomatic 12, cognitive 15): _xfaStreams has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cdd329ba5dc36a85d3603f0171e058338825957db3016cba3a910359c698c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 15): (anonymous) has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"853338920000f3b8ce0582ae3a33cb739bdd2644fa8ea7486358c8bb39356596"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function build (cyclomatic 12, cognitive 15): build has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/builder.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3c50da789e7779a175398e8fd3ee592fa83213fff81c8b1e849f8dec4565ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 12, cognitive 15): (computed) has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":3261}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d040cb6e39d0325f67dc0731a34c06ad230778af9897efd93812a7eb8e69e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fixAndSetPosition (cyclomatic 12, cognitive 15): fixAndSetPosition has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/editor.js"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3a00d37ead26f16be757a47abf6c72f547c9d863324fb49e26264224a67d3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 15): (anonymous) 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":"web/pdf_find_controller.js"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce904758994a897e9a122d99f060cf006d055d649b3a3da574415ea13f551f6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #setScale (cyclomatic 12, cognitive 15): #setScale 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":"web/pdf_viewer.js"},"region":{"startLine":1685}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d82cfca24ed995bcb20bf1f57236c3178c8fc1e1048d32a56f101eaa96e77d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _constructFieldName (cyclomatic 12, cognitive 14): _constructFieldName 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":"src/core/annotation.js"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e8f789789c1abebd00866217c5e580f707b321178516436e42f6b20841a927"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function adjustTrueTypeToUnicode (cyclomatic 12, cognitive 14): adjustTrueTypeToUnicode 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":"src/core/fonts.js"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96eab84b5afc0adb021f9cfcb15ceb97adade3a7619e4008138c2b0a8934edc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compressSignature (cyclomatic 12, cognitive 14): compressSignature 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":"src/display/editor/drawers/signaturedraw.js"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0344e5374ba905fc346de4a47cfe6361414e7aec0515b63c5b223f4610a541"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setAll (cyclomatic 12, cognitive 14): setAll 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":"web/app_options.js"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"227c3a344fc2865904836597c7390280d680a25ac613779947191ad0c8951883"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 14): (anonymous) 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":"web/internal/split_view.js"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f9e8a2059e55a0a714ad67b1577bacbfcf42b6f7661e9f9275dc7dcf39444d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isEntryEqual (cyclomatic 12, cognitive 14): isEntryEqual 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":"web/pdf_history.js"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"411e4898052702c207fd42b29d29514cbfead856b9ed4cd61c7f652ae3a890d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function update (cyclomatic 12, cognitive 14): update 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":"web/pdf_viewer.js"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c5e2db4bfb285fd328e1513dd80d1637b6af10cc9a06b78fb5c791f75865a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshIndex (cyclomatic 12, cognitive 13): refreshIndex 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":"external/ccov/coverage_search.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfbba103ca5b72761fd805d6a0f58f7b66dec28bc19bc5526cca3ac6208c37a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _saveCheckbox (cyclomatic 12, cognitive 13): _saveCheckbox 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":"src/core/annotation.js"},"region":{"startLine":3433}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f05f1ca03340daf039bfbb84e0fa46a7aeabc6419d186861e2caab6894ebbe0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) 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":"src/core/evaluator.js"},"region":{"startLine":3539}}}],"partialFingerprints":{"codehealthFindingId/v1":"1146ce2428094621050305c7dae9bb4aec380d5b5dca83b827d086906c2e804f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compileFontInfo (cyclomatic 12, cognitive 13): compileFontInfo 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":"src/core/obj_bin_transform_core.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"13454d214164fc8776ebb9fa6d774c2cb4fe4bc02e2a989f921920bf690e7931"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createDocumentHandler (cyclomatic 12, cognitive 13): createDocumentHandler 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":"src/core/worker.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7153d11fcf368256a5420bd9710f26362183a8a19504330db74eb6795b084caa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeValue (cyclomatic 12, cognitive 13): writeValue 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":"src/core/writer.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"af93c3f1e9161199cde1d45f956db9fd4916996ce8cb30d4b667a5413a1596f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #createKnockoutMaskCanvas (cyclomatic 12, cognitive 13): #createKnockoutMaskCanvas 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":"src/display/canvas.js"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"d649144d4a71b7a0ad0bc967abf193257326097531c813a61abb81ec4b90c2b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function record (cyclomatic 12, cognitive 13): record 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":"src/display/canvas_dependency_tracker.js"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4423860ac307494fc1b1a182d01c2d9e3d513b0740e4cce50be5ac142382bb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _nextPage (cyclomatic 12, cognitive 13): _nextPage 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":"test/driver.js"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c288a505dadf3a85609dadf921658dbbc8300a13b9010ad0692827211eca41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #sortComments (cyclomatic 12, cognitive 13): #sortComments 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":"web/comment_manager.js"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4eee02d3d66c47023d615a06754bdc5067f3a84361aa0e560caeececede55e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #mouseWheel (cyclomatic 12, cognitive 13): #mouseWheel 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":"web/pdf_presentation_mode.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6810706ad6ac828ca85c44d43588c7d5b5dd13a212fa153d38907dac09dd07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getBorderAndBackgroundAppearances (cyclomatic 12, cognitive 12): getBorderAndBackgroundAppearances 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":"src/core/annotation.js"},"region":{"startLine":2118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6991472ce2398b47eaaa0ea2f92084a42ac96bacc23bd7a1268ec6b9bdb5edb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 12, cognitive 12): (computed) 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":"src/core/xfa/template.js"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6e7f9addbbd607f0b42898c894145ec7d876954cd7c0d6ac984ac647a3ad34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setFont (cyclomatic 12, cognitive 12): setFont 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":"src/display/canvas.js"},"region":{"startLine":2516}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabf6ab80a0895bfcbda94892d5f61da8c6b8f80c58d37e0a536506dc864163c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #serveFile (cyclomatic 12, cognitive 12): #serveFile 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":"test/webserver.mjs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc14846b0d34bb10a4d26f935d9fb2b2159c00c58481f9b7c7ab8fff8ccae483"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _initializeAutoPrint (cyclomatic 12, cognitive 12): _initializeAutoPrint 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":"web/app.js"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"a774cfac9326b8df860b8a411223b9beceed9b7d866d297d250eac1b65b60859"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #mlGuessAltText (cyclomatic 12, cognitive 12): #mlGuessAltText 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":"web/new_alt_text_manager.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b448b902d11a0c89c1d9ecac42a406a5cfee82be4675e9585b71583e598ea9"}},{"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":"src/core/colorspace.js"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"af028d1e6cc321dfecd25d473d1f434fb86d82575c535de9004c97fe4bb1b70a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 12, cognitive 11): open 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":"web/pdf_document_properties.js"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f632a79b97620bddb7f28fc91d3c8c4b8649e2f45f161cc949b0b1532e75ac"}},{"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":"web/pdf_page_view.js"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bb08ed7d1f4aaa640d9efcde0eb5fa12746134609771a3fb808a7d11e108cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function iterateImageGroup (cyclomatic 12, cognitive 10): iterateImageGroup has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/operator_list.js"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4ad4cd6b89a94a0d5d9d8f0a12f828d33639d36c3f9b877be355a2cbddf931"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pointerup (cyclomatic 12, cognitive 10): pointerup has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/annotation_editor_layer.js"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"e170e617e56ab585b7da8243bb010377c10b49a045ebbc2a72f74c1a35a5071d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function alert (cyclomatic 12, cognitive 10): alert has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/app.js"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd5d68c40ca0c3e49ca3dd1062afd01545fd680795b6ca8330786088e0da3ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addHTML (cyclomatic 12, cognitive 9): addHTML 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":"src/core/xfa/layout.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"372dc5e35c1b2ec721f9bf898db661cacc4e07cf061171e24ec3c4569ef7d390"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #popState (cyclomatic 12, cognitive 9): #popState 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":"web/pdf_history.js"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"62de7442029458e344c4f062bd74c73b55e521b98a0f77e404c2b8de8753bb52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyPNGOptimumFilter (cyclomatic 11, cognitive 25): applyPNGOptimumFilter has cyclomatic complexity 11 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_images.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4eaab42a9dc918c1896d008fbac7479409d6a04b3532509ef39f0ebc9e743a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateFontName (cyclomatic 11, cognitive 23): validateFontName 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":"src/core/core_utils.js"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac635c80382d1da7a814d7a6d5baaffca858de7472185f6a683c2d2f566d2cb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findDynamicLocation (cyclomatic 11, cognitive 22): findDynamicLocation has cyclomatic complexity 11 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":"external/check_l10n/check_l10n.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c629bfada4d4350be4f068e205ac7ec564160abc1791e084f828dabe7b288c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #fixFields (cyclomatic 11, cognitive 22): #fixFields has cyclomatic complexity 11 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":2156}}}],"partialFingerprints":{"codehealthFindingId/v1":"2052ed095316439c9eb9deb10bd406418242285f79208fe4ff4c9b8cc3c41af9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 22): (anonymous) has cyclomatic complexity 11 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":"test/test.mjs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3d1abcc3152aa88dcddc6ecb8022e17b161862163cb7d046d732d0e274cbaa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCharStrings (cyclomatic 11, cognitive 21): parseCharStrings 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":"src/core/cff_parser.js"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6792b7cd149c0298be6487404c6a8527856205463215beff9233d99b2ac8a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setPara (cyclomatic 11, cognitive 21): setPara 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":"src/core/xfa/html_utils.js"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"903b0998f086a8416b11fd61b3e5e4c957df0bb3611337dad506a6a9de4d771b"}},{"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":"src/core/annotation.js"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e85a27d0c176418fc115e7bd9fbc42fdcc8a6a34058deb61bf20a59d1ba9fa9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 20): (anonymous) 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":"web/base_pdf_page_view.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a1ce09a7f8d0b81859bddde9a0818eedc04406379c2ad3637c283408cdb076"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _updateSpreadMode (cyclomatic 11, cognitive 20): _updateSpreadMode 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":"web/pdf_viewer.js"},"region":{"startLine":2384}}}],"partialFingerprints":{"codehealthFindingId/v1":"810d22073e33a2b9f49178d6bcee18c9cff532498003556c29141138ee8df1c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCmap (cyclomatic 11, cognitive 19): parseCmap 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":"src/core/font_renderer.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58458512844801837d96c6d205f498677d2a4277eef45900fdccb81b41af103"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _rescaleImageData (cyclomatic 11, cognitive 19): _rescaleImageData 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":"src/core/image_resizer.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6add3f87a1ba4c951a676ddd35c55c6456eebe035903dbc07c24ae48d834e3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function putBinaryImageData (cyclomatic 11, cognitive 19): putBinaryImageData 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":"src/display/canvas.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"c313f33accb0ff452ee0a7dd1bf42a2b2ed564bafddbe69c2fcef3eb4acfd7f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 18): (anonymous) 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":"test/unit/bidi_spec.js"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68a2264a57043f4d1ab9f594c91fa2c0b8770aaf4fc44a7dbf044686594f21c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getRanges (cyclomatic 11, cognitive 17): getRanges 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":"src/core/fonts.js"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d57c08395f7198ac7e81b35c452f3a4d29939ebd4c192a524ab7c545715012"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spaceWidth (cyclomatic 11, cognitive 17): spaceWidth 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":"src/core/fonts.js"},"region":{"startLine":3597}}}],"partialFingerprints":{"codehealthFindingId/v1":"38aaa40f17ce9e960c174d8f3922fcd0217ba30c69b9df50f4f16f280320242f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _next (cyclomatic 11, cognitive 17): _next 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":"src/display/api.js"},"region":{"startLine":3549}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66cc0dad6a799c612ba4f3778d7a2e48213df3f529a048908957817d31c8c64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function update (cyclomatic 11, cognitive 17): update 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":"src/shared/murmurhash3.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a1903d9184e133933f33ea3ad0c33a8d7d19064368d6ab1bb3f8f4fc2d4210"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decode (cyclomatic 11, cognitive 16): decode 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":"src/core/jbig2_ccittFax.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bb2e9e6a46a737035f8b1577b40bafac26fbf9f5cc44c18b485eabb731a213"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 11, cognitive 16): constructor 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":"src/core/pattern.js"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"1256a2f90acd1aa1543561b17527c73b945cfa79c4b04819d5bcd3389d2d695f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #parseWithoutParentTree (cyclomatic 11, cognitive 16): #parseWithoutParentTree 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":"src/core/struct_tree.js"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96eca454f0f6fab33e66fb8f93909d2ec4868fc6e9dbf2227e743ffb81dd2a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _findDataByNameToConsume (cyclomatic 11, cognitive 16): _findDataByNameToConsume 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":"src/core/xfa/bind.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97c3f64602753a9a477cba3d9e8047036a3897c6fbad0b5c13dd42cb95abd97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 11, cognitive 16): (computed) 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":"src/core/xfa/xfa_object.js"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbcd60c7a030ecb900bf4b5b504d47e4f6f7c80ebac7eb4718dbde28ac66c16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function complete (cyclomatic 11, cognitive 16): complete 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":"src/display/api.js"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93d61b4b78ff3e1023039c8949597b63ba920c1e40a2dda714f409df1cdc0f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createValidAbsoluteUrl (cyclomatic 11, cognitive 16): createValidAbsoluteUrl 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":"src/shared/util.js"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eafca4b690661effa6592cb7e37e087b0949621b67722674c962fecaf67f7da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateEdited (cyclomatic 11, cognitive 15): updateEdited 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":"src/display/annotation_layer.js"},"region":{"startLine":2946}}}],"partialFingerprints":{"codehealthFindingId/v1":"827ae5b6e7674c8e8b5f00989daf0bd1b471e86814fe93b01ee3e735eeb046bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #isValidState (cyclomatic 11, cognitive 15): #isValidState 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":"web/pdf_history.js"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"c290e1690256c069e95dc3baa20b471138853690d7e3e1efa98c09753adbae30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 14): (anonymous) 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":"src/core/document.js"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3d0b9e532b80073b0428b5ffdebdbbdbc2cb74af6796aaa2cd21f385f816e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadType3Data (cyclomatic 11, cognitive 14): loadType3Data 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":"src/core/evaluator.js"},"region":{"startLine":5038}}}],"partialFingerprints":{"codehealthFindingId/v1":"553e548c1ed6d5d2e4a2ab6fae16068c12ff803cfd5cc802672c6331b98db5a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getUnicodeForGlyph (cyclomatic 11, cognitive 14): getUnicodeForGlyph 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":"src/core/unicode.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbda62a8efd342995bcdb15d08e307e8d4e4a22783fd1ab22c99461e7cdb898"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (computed) (cyclomatic 11, cognitive 14): (computed) 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":"src/core/xfa/template.js"},"region":{"startLine":4175}}}],"partialFingerprints":{"codehealthFindingId/v1":"5137daf919939d5b3c72b5e05b1ebc06c4b68afedd259858739121eacb1761a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function composeSMask (cyclomatic 11, cognitive 14): composeSMask 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":"src/display/canvas.js"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8f116dc84884d3af28618767b1bea6f83e93fb7c83e856be9a1e33dba5f1cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deserialize (cyclomatic 11, cognitive 14): deserialize 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":"src/display/editor/drawers/inkdraw.js"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"7717484a9ae29c49f4cf7b480089c16a19dcd2e490a1bea0113b8c2e228af500"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deserialize (cyclomatic 11, cognitive 14): deserialize 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":"src/display/editor/stamp.js"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae540ace8f7642f767ec0d094cb155a46589003516c233dac30be0f87f9a7196"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isCSSString (cyclomatic 11, cognitive 14): isCSSString 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":"src/shared/css_utils.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"06557e806afd76ef18d874e470be948d8251cedeb782205aec051602375d95d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #onMessage (cyclomatic 11, cognitive 14): #onMessage 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":"src/shared/message_handler.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e305359e4463e377b4139cec85edb2b347eb31740e6755cb14d91ea4d375f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateScale (cyclomatic 11, cognitive 14): updateScale 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":"web/pdf_viewer.js"},"region":{"startLine":2573}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6e01bc8ef2b8f1177acf9096d3943a381c0e92faeaa9a5ae50e983115e3fdc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CallExpression (cyclomatic 11, cognitive 13): CallExpression 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":"external/eslint_plugins/prefer-math-clamp.mjs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"822282518dc0bdc14a0d07cc3410dcab9e5489e48b10d0abaac28fce51cc6adc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 11, cognitive 13): constructor 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":"src/core/annotation.js"},"region":{"startLine":4291}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91725bfaa5eade713d57b1a0695a8899fca6a3b85e2dd443dde829d3d569b78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #collectDocumentData (cyclomatic 11, cognitive 13): #collectDocumentData 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":"src/core/editor/pdf_editor.js"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"413fd27b04d64d5be2902ae5af50e1df50d4290d10b8f0f2f30e71a0fe56fcb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleTransferFunction (cyclomatic 11, cognitive 13): handleTransferFunction 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":"src/core/evaluator.js"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc53fa6af62a644a5454c988a3aeb979b0b84a6e2eefd8294c50b36294b4c9eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initializeGraphics (cyclomatic 11, cognitive 13): initializeGraphics 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":"src/display/api.js"},"region":{"startLine":3404}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1514341ed269120d698f1d5616ce58c92686f4aedbd9519535c7aea805e3067"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) 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":"src/display/renderer_worker.js"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"606872c9405bc30aec5ad0c4e7855fd3d49e9eea42a3291bda820670502c4d9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #setValue (cyclomatic 11, cognitive 13): #setValue 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":"src/scripting_api/field.js"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe7159471cd7dae9cca50f1065b148f3c4bedd4909d5bb094367281fccadb21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function insertItemAt (cyclomatic 11, cognitive 13): insertItemAt 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":"src/scripting_api/field.js"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b20d31b22504b99ccba34faeaea3987ad66cdf877807276eab4b818697adf4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 11, cognitive 13): main 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":"test/test.mjs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"538b282735a24190583f167e4d2bd618d40269bfe50865390b202e20c193037b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _initializePageLabels (cyclomatic 11, cognitive 13): _initializePageLabels 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":"web/app.js"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a44df2609edb1e3b8dc26edf351e8b1f82c25b020990fe9f9ebc89917daaf6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function annotationEditorMode (cyclomatic 11, cognitive 13): annotationEditorMode 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":"web/pdf_viewer.js"},"region":{"startLine":2699}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d29778e9a68a90de6bc108495f07ad92b0b54d2c3925ef39ee596b750df911"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _getExportValue (cyclomatic 11, cognitive 12): _getExportValue has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":3707}}}],"partialFingerprints":{"codehealthFindingId/v1":"009585bec2095ba9fce4f0e586b315a6795e509d5ec35f0cea89161df102f4a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateFont (cyclomatic 11, cognitive 12): generateFont has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/font_substitutions.js"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c429644d3e86ae9f3f53de426c9ddc2d00038a34a085cb041a23bcad1fb5a00"}},{"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":"src/core/evaluator.js"},"region":{"startLine":1730}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc041bcfb5fb79e1385b68bf4f3355debd845e652ced8e81d508fd710728ad5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenToJSObject (cyclomatic 11, cognitive 11): tokenToJSObject 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":"src/core/internal_viewer_utils.js"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9617cb4ac705ce7e0042fa5e5df2a120a7a76cc095ce3d7481fe5f638ae5d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addPdfFont (cyclomatic 11, cognitive 11): addPdfFont 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":"src/core/xfa/fonts.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d68267ae042c8361e939d10cc0796b1373b83e0f7dd5383202cecfea003015"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 11, cognitive 11): fetch 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":"src/core/xref.js"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0f3bae7dc470db23303934963aaca8c6e2c102cce8564f77a7688d3f6a7ecd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #createCanvas (cyclomatic 11, cognitive 11): #createCanvas 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":"src/display/editor/stamp.js"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda33f948932cc8d54aba0c6f26ef7229e31c44427808584e2137eb0f3254e8c"}},{"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":"src/core/predictor_stream.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6629f0172e0dce16344207612292422f4d4a9f18c2d839b10c1ad4396af31b68"}},{"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":"src/core/xfa/template.js"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeea0a5572403b2c416980c96620c80b5a2e8d3a7f7926fe6331647cee7cc74e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #endKnockoutElement (cyclomatic 11, cognitive 10): #endKnockoutElement 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":"src/display/canvas.js"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eaab7a1f04789648101fbaf56a686f432fc3e2141776746cb8809f2bf112d5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPathResizedSVGProperties (cyclomatic 11, cognitive 10): getPathResizedSVGProperties 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":"src/display/editor/drawers/inkdraw.js"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"601cb72c7996d7dd7e417d4edddd0bd4a63217d61102a4011ef046cba9c70850"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decompressSignature (cyclomatic 11, cognitive 10): decompressSignature 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":"src/display/editor/drawers/signaturedraw.js"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d8972d26359c5f4f4b2640b54b827af4b41bf50a5f034e81f4123fe7784367"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mlGuessAltText (cyclomatic 11, cognitive 10): mlGuessAltText 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":"src/display/editor/stamp.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac50891f917438f490613a6787ecdf66d1349e0fad3b64a4c91604bb38d2173f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bind (cyclomatic 11, cognitive 10): bind 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":"src/display/font_loader.js"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbdc797600c03b3d740ae6ac635eb27205857da7d80856e0bf490d199ea4523"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verify (cyclomatic 11, cognitive 10): verify 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":"web/firefoxcom.js"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0c80b3273e427a85a1a0141c06ed9a802f931bb658804006b461e8e9d450a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #updateStatus (cyclomatic 11, cognitive 10): #updateStatus 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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"9577a01cd7faa4cf86569dfe866cc57026532f26d2166478eedddb4f21cc2fb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRangeRequestCapabilities (cyclomatic 11, cognitive 9): validateRangeRequestCapabilities 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":"src/display/network_utils.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c2983f63f2f84f510465e0d856ddf76ff2ed9c84aa1468f525e8e5b63e652a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setOCGState (cyclomatic 11, cognitive 9): setOCGState 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":"src/display/optional_content_config.js"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"460c4c3cc55e6f12a6abc57483446cad2db3cb2b7b59bf19596954bd522248b8"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/xfa/template.js: 5900 lines of code: src/core/xfa/template.js has 5900 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/template.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46ac1a48e8fe9c6ef05f57885f1e64716da4f9ae6454d3105f272fa30ac5b12"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/annotation.js: 5320 lines of code: src/core/annotation.js has 5320 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8a87d3b4d13ff89acd78c84209393b53c9125af6e57f0b1bbfb6c4d3ddf10e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/evaluator.js: 5180 lines of code: src/core/evaluator.js has 5180 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac60d495346668ff27444f892cfe09368060b18620b51a8d57472281b72f41b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/glyphlist.js: 4552 lines of code: src/core/glyphlist.js has 4552 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/glyphlist.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f45aecab07b7700d7d5eeee12af1b3e194a063331de7cba25fe6baeab1e0ab"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/canvas.js: 4129 lines of code: src/display/canvas.js has 4129 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b2c85cd47b6fd448bec7891205ebea606c5ae07b40cd0a3504f639ab5e7409"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/annotation_layer.js: 3924 lines of code: src/display/annotation_layer.js has 3924 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4756538491e4432ad76f77a58c65e645f1569db8bdb5a7db99191572bb98193d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/fonts.js: 3616 lines of code: src/core/fonts.js has 3616 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/fonts.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba3149d444eac40d31aed24dc49c1e8ce05747d7ddadc89508161661d861476"}},{"ruleId":"R3","level":"warning","message":{"text":"web/app.js: 3342 lines of code: web/app.js has 3342 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":"web/app.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ef4457a5733ad5d949a70bbad26300bdfa6c816024c31064a651e5f8635501"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/api.js: 3246 lines of code: src/display/api.js has 3246 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a3484cd4389f4a6406eeb598955af90e1758b3f0d46adacd8d27ce31413caa"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/metrics.js: 3053 lines of code: src/core/metrics.js has 3053 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/metrics.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d460d9f9bdaa6972e663747310cb740c2878e1e0365db21e67d14211546509db"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/editor/pdf_editor.js: 2984 lines of code: src/core/editor/pdf_editor.js has 2984 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_editor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6560478e333947e626f1d51fd58e620d6763fcd1c97cfb78d78d797ea473ef"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/editor/tools.js: 2719 lines of code: src/display/editor/tools.js has 2719 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/tools.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3b272781aefea3c381072e17d863be7b7846b54039aa60afc8a2c5bbba494a"}},{"ruleId":"R3","level":"warning","message":{"text":"web/pdf_viewer.js: 2505 lines of code: web/pdf_viewer.js has 2505 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":"web/pdf_viewer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc010c3358839e9f8bda159906628fd9e407c471bdbac384e0b9545bd254da1"}},{"ruleId":"R3","level":"warning","message":{"text":"external/brotli/decode.js: 2445 lines of code: external/brotli/decode.js has 2445 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":"external/brotli/decode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bf72efcd018d33b52b9b7697f1b11ebe75a37a4d80e9252b84395fb7ee2b89"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/editor/editor.js: 2193 lines of code: src/display/editor/editor.js has 2193 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/editor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75df010b4cc2c75e6d68e0a09888b840379792c4f5c96f125c59d62b53b30ab"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/document.js: 2186 lines of code: src/core/document.js has 2186 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f60dc400839b2df90a164522ec0357672533338f0dabf8391898d72e00a75e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/cff_parser.js: 2015 lines of code: src/core/cff_parser.js has 2015 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cff_parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c337814c8a53ae5d26973f1452550a89b0dfaf3bd565f943da3e537d11455e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/catalog.js: 1858 lines of code: src/core/catalog.js has 1858 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/catalog.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab28db98696eb5a4d2e0aefb321b8f23b621a357fa84a124d7940908df52ae32"}},{"ruleId":"R3","level":"warning","message":{"text":"web/pdf_thumbnail_viewer.js: 1809 lines of code: web/pdf_thumbnail_viewer.js has 1809 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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22dca93062603a86223324108b756ad7d358e872e8d0fc3614fb77cd7246b961"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/xfa/config.js: 1620 lines of code: src/core/xfa/config.js has 1620 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/config.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4bd2c973a5932db837cf8db931ad422e3782d6d2a1b83652d865c04b2b5abb"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/parser.js: 1355 lines of code: src/core/parser.js has 1355 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5541a178193b08c4f56f68867965393ea5270a7c2b122f7487e498d82124cfba"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/postscript/ast.js: 1354 lines of code: src/core/postscript/ast.js has 1354 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/ast.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52afad79e5a7f352ac6e455bcb564feddecae2f431d8f646704f036975d00f48"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/image.js: 1343 lines of code: src/core/image.js has 1343 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5513a8ebec0f2faf9fb25e78320e579de52d9c1a6dbb712ac54a299e4e004a3"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/jpg.js: 1297 lines of code: src/core/jpg.js has 1297 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/jpg.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ac99a7a3154e5b030bf254e2319868bc186d713dfd6723665d98a8b2803c6e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/crypto.js: 1283 lines of code: src/core/crypto.js has 1283 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/crypto.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa427225a46341b5d86ba249380faf5834f4c54d0b4d07686e7d1496cb3a0ae"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/struct_tree.js: 1212 lines of code: src/core/struct_tree.js has 1212 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/struct_tree.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8bd8d811bcf8c311c65f5b3349f17cc329ae07710377e00b83b0f1616d3b30"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/xfa/formcalc_parser.js: 1171 lines of code: src/core/xfa/formcalc_parser.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":"src/core/xfa/formcalc_parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"272e5ebed53d9442c0e3b963cf42dd938552c8016c0c079932bf7b666315773d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/colorspace.js: 1170 lines of code: src/core/colorspace.js has 1170 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/colorspace.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e6725add755bf345fb4df82667329177fc6b553b4102c77148feda8eaac324"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/pattern.js: 1166 lines of code: src/core/pattern.js has 1166 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/pattern.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"655e50f8d68467a91bb921e636b869d43ae1b3486b552d4ace7ca3980079f1dd"}},{"ruleId":"R3","level":"warning","message":{"text":"src/shared/util.js: 1155 lines of code: src/shared/util.js has 1155 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/util.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a1cfa209298a4b7d7914a5e14dfebc6f2f9b2963a5b5a8e4e3385bb5551583"}},{"ruleId":"R3","level":"warning","message":{"text":"web/pdf_find_controller.js: 1145 lines of code: web/pdf_find_controller.js has 1145 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":"web/pdf_find_controller.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42771b9bdb65d25da9b2782067361515ef346a6983ff4f400187a318cc5b1ea7"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/editor/draw.js: 1129 lines of code: src/display/editor/draw.js has 1129 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/draw.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f05d2daa0c002d05835b20f45de07a9cdaea908e2cb0470894bcc9c90211665"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripting_api/doc.js: 1125 lines of code: src/scripting_api/doc.js has 1125 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2935dee8a1348a904c5d13742bca277e609eebd4aa9f28261b3a2151e4975c"}},{"ruleId":"R3","level":"warning","message":{"text":"web/app_options.js: 1104 lines of code: web/app_options.js has 1104 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":"web/app_options.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"700b4c522ac2297abd82b93570cbf80d2aaf643cbac5cf73462b3197e8919b16"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/canvas_dependency_tracker.js: 1103 lines of code: src/display/canvas_dependency_tracker.js has 1103 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/canvas_dependency_tracker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81bea541d632fe1d56f4fc44d76d7060069e6a68da1f017532a528a262a297b"}},{"ruleId":"R3","level":"warning","message":{"text":"web/pdf_page_view.js: 1103 lines of code: web/pdf_page_view.js has 1103 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":"web/pdf_page_view.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb67412de48ac2a80a61f47dc111c9a449575cbbdbebde6a80deeb393d8f0183"}},{"ruleId":"R3","level":"warning","message":{"text":"web/comment_manager.js: 1089 lines of code: web/comment_manager.js has 1089 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":"web/comment_manager.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1493ec008103218d0d8ab05f680c0f571e167cd06e2c53e569596dcd15ff91ad"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/standard_fonts.js: 1054 lines of code: src/core/standard_fonts.js has 1054 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/standard_fonts.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afac41fb924ce2f5059ad4fb3ac1135bf442f5560e63e1dde3c75c403fc0458"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/type1_parser.js: 1042 lines of code: src/core/type1_parser.js has 1042 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/type1_parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd08f0689077eb1cfe5ba5236e687b1e4a54b99d24372e619c46924e83c4464"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/postscript/wasm_compiler.js: 1012 lines of code: src/core/postscript/wasm_compiler.js has 1012 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/wasm_compiler.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcedd9afd1fb1c366168ae0bff92e9aa2ba6c521c8a89c81a098410c5008b50"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/worker.js: 986 lines of code: src/core/worker.js has 986 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/worker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ed99f9fc564696a622734114ef3848f1a021c51ebbba2ff150b63e65a6aef0"}},{"ruleId":"R3","level":"warning","message":{"text":"web/signature_manager.js: 982 lines of code: web/signature_manager.js has 982 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":"web/signature_manager.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d53b51ced2f4204e534759018eb945496e09bdddb78081453b7688147b12de2"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/xref.js: 977 lines of code: src/core/xref.js has 977 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xref.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07745d2746f316f6f149fca0f0c8bd58104960e788d1450bc023099f1009ae42"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/editor/annotation_editor_layer.js: 949 lines of code: src/display/editor/annotation_editor_layer.js has 949 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/annotation_editor_layer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68bb8378dfb7c9885185d0387271967f4577d500e035a57e3ea8b39680d4399"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/xfa/xfa_object.js: 943 lines of code: src/core/xfa/xfa_object.js has 943 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/xfa_object.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c0c31d7cd93d6c6fc2087be8964e7bf5c63686cba064f03a04c1b67598db71"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/pattern_helper.js: 910 lines of code: src/display/pattern_helper.js has 910 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/pattern_helper.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d526b8c67e37b1fa138dc79322f7e9d06208a62ec80cfb0d96462767c58f1e"}},{"ruleId":"R3","level":"warning","message":{"text":"web/internal/tree_view.js: 907 lines of code: web/internal/tree_view.js has 907 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":"web/internal/tree_view.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c463a744c29d1132200a2864ab3e30d4894cd1d2af075a09a5c80578d94f6944"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/font_renderer.js: 902 lines of code: src/core/font_renderer.js has 902 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/font_renderer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e53e255f1d328ae323cd5cad8c6c19a7a0b20f244db7630b15cc4fb764b858"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/editor/drawers/inkdraw.js: 848 lines of code: src/display/editor/drawers/inkdraw.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":"src/display/editor/drawers/inkdraw.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcd3ad0a4b2c4b65de665fbfcd34963ede4e0aee8aa3ea9b732676252fd648c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/editor/stamp.js: 847 lines of code: src/display/editor/stamp.js has 847 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/stamp.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff7e5a8702cf6da34ec3de4eb2ba859d8af65c07906177ead29dafad753a918"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/editor/freetext.js: 816 lines of code: src/display/editor/freetext.js has 816 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/freetext.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50bdcf7d3113f9073dbbd8cc1dd2e075355a408f54cbbf5283b5c117fa0dac9"}},{"ruleId":"R3","level":"warning","message":{"text":"web/ui_utils.js: 814 lines of code: web/ui_utils.js has 814 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":"web/ui_utils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8320a2a81e3199e0ee4e4c9cea2265095692e6e3d7bc5108f15de1f27cacc457"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/postscript/js_evaluator.js: 799 lines of code: src/core/postscript/js_evaluator.js has 799 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/js_evaluator.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0b2c4a95415cdf7876ecdaf1415dd7e58555837c575ff2e7c650a46dc88441"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/operator_list.js: 785 lines of code: src/core/operator_list.js has 785 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/operator_list.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aeec9a67b7416233a10e4536f307473e146296250b350c64f665d42cdea3262"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/font_substitutions.js: 783 lines of code: src/core/font_substitutions.js has 783 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/font_substitutions.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfdf9a236d95d2cd3bbe96e556dec8124cee8a201e2bf681a004ea78d373fd9"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/draw_layer.js: 775 lines of code: src/display/draw_layer.js has 775 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/draw_layer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8faaee51540a1a037014f8737165f4c49b19165c5a6812b46147825a89d3cb38"}},{"ruleId":"R3","level":"warning","message":{"text":"web/internal/page_view.js: 769 lines of code: web/internal/page_view.js has 769 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":"web/internal/page_view.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4444dde0f6be5d7fb48c64bbb7937e6f5cba7839587155a7dbb040477f594bb"}},{"ruleId":"R3","level":"warning","message":{"text":"web/debugger.mjs: 766 lines of code: web/debugger.mjs has 766 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":"web/debugger.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12587146c5fb47a7fcae09bee6164e88a0c4d873bc8083ebf2a148727716ec77"}},{"ruleId":"R3","level":"warning","message":{"text":"web/firefoxcom.js: 749 lines of code: web/firefoxcom.js has 749 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":"web/firefoxcom.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7204edf072775c0ac0f55bc7a82d001cc4ecad676d679ff33e12afd96b5a29e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/editor/drawers/signaturedraw.js: 743 lines of code: src/display/editor/drawers/signaturedraw.js has 743 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/drawers/signaturedraw.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b758b1a3b350804a467f6988bbbc94ddd7425eedc71129cfec8cd8bb5a256a46"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripting_api/field.js: 728 lines of code: src/scripting_api/field.js has 728 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/field.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcc621b91aee32ef34b3321d505daff3b65fa8277597a14be53e0b56728d34c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/core_utils.js: 704 lines of code: src/core/core_utils.js has 704 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/core_utils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63ac82cede257c49074107fa8f74f8b4f2fb076486a418f4486431fade60fc3"}},{"ruleId":"R3","level":"warning","message":{"text":"web/internal/draw_ops_view.js: 694 lines of code: web/internal/draw_ops_view.js has 694 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":"web/internal/draw_ops_view.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07beff2fae71ff1814066613c698af8bfcc0bbc01f756972b7923ab148e951e8"}},{"ruleId":"R3","level":"warning","message":{"text":"web/pdf_history.js: 681 lines of code: web/pdf_history.js has 681 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":"web/pdf_history.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf39dc6fa584a345424d5b5b091d7354c33833eb8d24a385830aec9524b07880"}},{"ruleId":"R3","level":"warning","message":{"text":"web/digital_signature_properties_manager.js: 643 lines of code: web/digital_signature_properties_manager.js has 643 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":"web/digital_signature_properties_manager.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b6f5ff6c05335069c85fe2e99ced1db1746069cc80595bc534ec41e97b9842"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/cmap.js: 641 lines of code: src/core/cmap.js has 641 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/cmap.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"957c6879efe471f9b7296d3586b5cb80ce002ed488dfc92c23e8d119df75c61e"}},{"ruleId":"R3","level":"warning","message":{"text":"web/struct_tree_layer_builder.js: 639 lines of code: web/struct_tree_layer_builder.js has 639 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":"web/struct_tree_layer_builder.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"453e4c24f24ed9dcd6f525b02e6f4ca6dc29d56870b93b3612fb61ed68a274ff"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/editor/drawers/freedraw.js: 616 lines of code: src/display/editor/drawers/freedraw.js has 616 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/drawers/freedraw.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"915a49514984b475a647ff36791dda24dbae9d3fb6ea316d3a99f94e0f85cf39"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/renderer_worker_proxy.js: 616 lines of code: src/display/renderer_worker_proxy.js has 616 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/renderer_worker_proxy.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3457e4bd8091f644a5ec3191a18b571cb4d5265d3725be5157d3daa6a786292"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripting_api/util.js: 603 lines of code: src/scripting_api/util.js has 603 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/util.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c60636b56ab52b0c1107b43226d58b90d11e67e5457bdda3fb7ace82c7b8b7"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/xfa/html_utils.js: 599 lines of code: src/core/xfa/html_utils.js has 599 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/html_utils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44008899b826f5e8c374e9c3a17f85f4c33f80cbbb809dfd372bd7dd66d79f9a"}},{"ruleId":"R3","level":"warning","message":{"text":"web/new_alt_text_manager.js: 595 lines of code: web/new_alt_text_manager.js has 595 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":"web/new_alt_text_manager.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede5bfcd666bff223ff3a9a42efe7c5e9a8949b23410fcd65ac33690fc1083ad"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/xfa/bind.js: 590 lines of code: src/core/xfa/bind.js has 590 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/bind.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1a1cf10b88a1c0bf29eed928f65335ffeda67fff4c9de5dd847da153a11812"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/editor/highlight.js: 581 lines of code: src/display/editor/highlight.js has 581 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/highlight.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e782ed98484d90e9874a631e3afef9203081d7062edc67f47e7f08e3d5c38d77"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/dom_filter_factory.js: 549 lines of code: src/display/dom_filter_factory.js has 549 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/dom_filter_factory.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"494ad7f9e160528f1fbfd9e61507df806a2284c04f767ac20cdd8e8ab6a34a94"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/editor/drawers/highlight.js: 545 lines of code: src/display/editor/drawers/highlight.js has 545 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/drawers/highlight.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5036f03dbbd96ea097395e8177471e787537c5a7eaff57a7b9728a1c4c748809"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/renderer_worker.js: 545 lines of code: src/display/renderer_worker.js has 545 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/renderer_worker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf98e53b9eb1035f23d59ba9f14175313b18e1a07ac730af4631a375ea127ad2"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripting_api/app.js: 543 lines of code: src/scripting_api/app.js has 543 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/app.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca52ea6a1966e46439b77919c64d509598f02ea8ec96c822aa2d9dc7c2eebe77"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/font_loader.js: 531 lines of code: src/display/font_loader.js has 531 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/font_loader.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d0c63d474ddc171817c0601fccf40d0de74bb02157043964390b6d44ca00dd"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/internal_viewer_utils.js: 526 lines of code: src/core/internal_viewer_utils.js has 526 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/internal_viewer_utils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e356dcd9f629a8d37df5db5af790f5c5c252d76ee0fcd15117cadf018f24068f"}},{"ruleId":"R3","level":"warning","message":{"text":"src/scripting_api/aform.js: 521 lines of code: src/scripting_api/aform.js has 521 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/aform.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9226d752022ab69578fdb250e7bd2e630fd67e58042af7f5d17c7ce56f53575f"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/writer.js: 516 lines of code: src/core/writer.js has 516 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/writer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1971616fde0b7404ee2dbbad5b8246dc06b0da87f5c41f7fb8f4786ae188fefd"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/xfa/xhtml.js: 515 lines of code: src/core/xfa/xhtml.js has 515 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xfa/xhtml.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b38b1b823fcd421c4cd3c13352c4bec50606f3cf852231c64218371d0186bcb"}},{"ruleId":"R3","level":"warning","message":{"text":"src/shared/message_handler.js: 514 lines of code: src/shared/message_handler.js has 514 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/message_handler.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"941ec539518d4d4040f8bb9f6302a0e5f6d4a0cb45f0892908bd847b9c6f0cea"}},{"ruleId":"R3","level":"warning","message":{"text":"web/pdf_thumbnail_view.js: 502 lines of code: web/pdf_thumbnail_view.js has 502 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":"web/pdf_thumbnail_view.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7584961dcdf40334e1af33c7345514bcfd11db235e2c2c337aff4f1dee7bc739"}},{"ruleId":"R3","level":"warning","message":{"text":"web/internal/multiline_view.js: 499 lines of code: web/internal/multiline_view.js has 499 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":"web/internal/multiline_view.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e51c08b9c445af46f8e3e66ad481900d9bdedc7e94396543c8f5a45bbd05d68"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/image_resizer.js: 498 lines of code: src/core/image_resizer.js has 498 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image_resizer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"145fcaaa13cd237d159eb2d92130b50aac0045f0cb64ff94939b23097fb53b2a"}},{"ruleId":"R3","level":"warning","message":{"text":"web/pdf_link_service.js: 494 lines of code: web/pdf_link_service.js has 494 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":"web/pdf_link_service.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b8ff585931653a0cb37b88fc95e9512dfa8c50450c9fb7dad9e9a9fd63a8f0"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/text_layer.js: 485 lines of code: src/display/text_layer.js has 485 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/text_layer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e6174856a46494bf38b9991159585c1b6936c7e7137af046d78c16a38ec15e"}},{"ruleId":"R3","level":"warning","message":{"text":"external/cmapscompress/compress.mjs: 481 lines of code: external/cmapscompress/compress.mjs has 481 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":"external/cmapscompress/compress.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ea99772bea7d01e59600dac120ed4a7359b2ec10eed1f501ec72b58c7f9d07"}},{"ruleId":"R3","level":"warning","message":{"text":"web/pdf_scripting_manager.js: 481 lines of code: web/pdf_scripting_manager.js has 481 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":"web/pdf_scripting_manager.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad00504cb54d987fee6902059d943496c51f98cc70749fe9bd2facb4db356fa9"}},{"ruleId":"R3","level":"warning","message":{"text":"web/views_manager.js: 474 lines of code: web/views_manager.js has 474 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":"web/views_manager.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8adf6aa570a41fc9ef2953019535305e1c6bd433b6856286f5b810d04cd71c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/xml_parser.js: 468 lines of code: src/core/xml_parser.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":"src/core/xml_parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df67638f723c4b4675694ec1ecb778474932fa5d2459051b25743186744683f3"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/chunked_stream.js: 460 lines of code: src/core/chunked_stream.js has 460 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/chunked_stream.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"747f87793b9c622c2f187194f135f77a3071dcf1edade895c26e51112aa89ea1"}},{"ruleId":"R3","level":"warning","message":{"text":"web/internal/canvas_context_details_view.js: 456 lines of code: web/internal/canvas_context_details_view.js has 456 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":"web/internal/canvas_context_details_view.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36025cfccfbf238201eb36b5f3d34266b1c6c31f398fe197097b72f53a520484"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/flate_stream.js: 446 lines of code: src/core/flate_stream.js has 446 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/flate_stream.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7ff25e3032796107f2e2c0caa9f814664087a35f5cfe1fab8f5f5faab73694"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/default_appearance.js: 439 lines of code: src/core/default_appearance.js has 439 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/default_appearance.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9fb54a2ecc8ac4681d4e7d43b060e834b574eea1ffd5d27a60aad830579be6"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/pages_mapper.js: 434 lines of code: src/display/pages_mapper.js has 434 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/pages_mapper.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e71975d449bcbf71a01f9dc0e8f3d4cb76911de5efad882754675cd1627a917"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/xfa_layer.js: 431 lines of code: src/display/xfa_layer.js has 431 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/xfa_layer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f099b41b1b2b141b82b6c2d59c3a56ed455c359a529111769c9b1c51e2a0876b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/primitives.js: 426 lines of code: src/core/primitives.js has 426 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/primitives.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a3486b28e114582e732dae3e4ddd3f5615e998b1519a011787d342a84ecb62"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/bidi.js: 424 lines of code: src/core/bidi.js has 424 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/bidi.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8be95116475d7a80880e29e04f4555c42d1706840a935c85418cfbd993ca0e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/display/touch_manager.js: 418 lines of code: src/display/touch_manager.js has 418 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/touch_manager.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfd77025f95cd27002b6f8be0a0271c7e7faeb711a11b8460cf70ccb717af5e"}},{"ruleId":"R3","level":"warning","message":{"text":"web/chromecom.js: 416 lines of code: web/chromecom.js has 416 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":"web/chromecom.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41594a1620d815f04a5bfa005313bac90c31dd401019c6e24e8c4df27952113d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/type1_font.js: 414 lines of code: src/core/type1_font.js has 414 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/type1_font.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eafd6219942a8b87019477c3c34bb6483448d658624c628ad759cde55e093fc"}},{"ruleId":"R3","level":"warning","message":{"text":"web/viewer.js: 411 lines of code: web/viewer.js has 411 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":"web/viewer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc48b90e1695b888f6245d91005e01e6184d76bdd211a5ae7b8c3da3ef0ff45"}},{"ruleId":"R3","level":"warning","message":{"text":"src/core/function.js: 408 lines of code: src/core/function.js has 408 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/function.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cf3fade1405a74806ff31fc854b48fb555c20b0ad2676b540221b8ffe5bb38"}},{"ruleId":"R3","level":"warning","message":{"text":"web/toolbar.js: 405 lines of code: web/toolbar.js has 405 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":"web/toolbar.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"389a4a091f27f27ebe72fc2d4c37b81a4c732d3eca70ecbf675755de637b63a1"}},{"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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b2afd80cad375985f50c7acb012408fb978ab3726f2cf83b429d6f0c17ccd9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/doc.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d5669a545994b15b69c942d5a0ac576442a11237934ef61a912682731a7e5e"}},{"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":"web/signature_manager.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f3e6216832227a8ae5e4dd67533fff1afb73329488c1d25029217abc07e442"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/field.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91ff90a3bcf90612558f57ae797ae2ea99d0ab9fbf05294da845384fc9d4f06"}},{"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":"web/firefoxcom.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5763fe1ae19a86a7beca18cb2efea9a3643002031599d42d24d428d3ef045047"}},{"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":"web/debugger.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"586a0806b585391538dd860ab7cb0d1233b525c5af29f691f7028b87d5c38e84"}},{"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":"web/new_alt_text_manager.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2935acceba7bdf254c1e213516aec0849e2d133dd34e51156d6755cc8253d615"}},{"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":"web/digital_signature_properties_manager.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e4250e21f56d81a197a8087c3b55f246b055d09d9bfc617855d1e7b81dd261"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/app.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b8c8488406581a8c43f426a39fd0eaabb4670cb53111c9aa2230b5c7afafee"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/util.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ab6f91312f02a31c2534c2cdb983170ddd06d23b892c52262fbcb34703d98b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/aform.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4871c6e2619da59bc7f88d1b9a1af15fae1ac8f3a78b9f6aac5f88faca28434"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/renderer_worker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df81980f409fae814e67dc7508b53161c66ece9f81bd2ca0e83903d40a3a2e06"}},{"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":"web/pdf_thumbnail_view.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6162a798a01f4e3c5515378394009b49aa39ef83f2a05596aa566f4b89fc028a"}},{"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":"web/views_manager.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04d23a1bc6a218961c607b5f1e9f706413940c8d5b8d6e7dbade3312590d335"}},{"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":"external/cmapscompress/compress.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bca5a8213ae300d004fbadb7556370c5d9b0c9cf3c5263a77d94cdf1f7644d"}},{"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":"web/chromecom.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64e49e352a83467c35cb4fad59469640eb826d5def9f14ea3f462d266b4168a"}},{"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":"web/toolbar.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae24f34fde884e7a4acf9ddffdf8da8216138a74eff73738ed33059e88150ae"}},{"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":"web/pdf_print_service.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e61b89e00f0404326fdd83521beeae5c4f9df08df1f5fcf20bfc3c441d25a6"}},{"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":"web/pdf_outline_viewer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db64a1d38f761f88940cf53a0f2dcc7afaf92579046afb9a7da69c214554e75"}},{"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":"web/pdf_document_properties.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8bb5f04845ae18094b9fefa8f16dc5e53d002ceb38e5240bfb5ea024e5ae33"}},{"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":"extensions/chromium/pdfHandler.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b9a75eb5df5eb7c0fefad4003291106e4feeee84e38711ff2165db36e8b3dd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/event.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e29c8ca0765e305f9aea8414188ac0f024688318f18ec79f40d00567d56748d"}},{"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":"web/secondary_toolbar.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aeb3b5251c361a1b8c0f5e41d5258926c50c532187830d77b4e78fadad6532c"}},{"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":"web/alt_text_manager.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5de2911b5475b078bcd3784bb7725402a8117cc09c023db09f48f8cfa203a1"}},{"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":"external/chromium/prefs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d226c9745d1c3f44dea1ff7b17aab8ca485ae2433728526b2a0a64e27376c51e"}},{"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":"extensions/chromium/contentscript.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c161eae87914f6a3526a0dcdd501569665f37f4ae2afdda1d74d287ed4ed8c9"}},{"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":"web/menu.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d047653404551840cd5c110964cbb6e06eca12f8132ec77d2913e14e59f053df"}},{"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":"web/pdf_layer_viewer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95ea321ab6ecfd9891693241e31606af8968da76e1691af0576b4e8b808562f"}},{"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":"external/ccov/coverage_search.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e3b73d59f1021e163d8a85bc2b0a44aa711ba063296b7525dfdcced314a2bf"}},{"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":"external/builder/builder.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d2686aa1a7dd9fbb325b3636f3a2a6f9fab112be5004bf49273c442cc40f99"}},{"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":"web/firefox_print_service.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a35b29dae98e28ccee9d6397954e6a8fe84ab6a8454dcfca892bb69f84c8230"}},{"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":"web/pdf_find_bar.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9797a118d525018543b55890eeed7266b3b3925c5656024801651e5e136f6b3d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/initialization.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"331cf2e5fe4b99c3e91fcff8f42ecf0fdfab480b657c030f4725284054a706c7"}},{"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":"external/cmapscompress/optimize.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8276f0eae9703c9ab6bc1c9117c1e9cd2b22e42cb422ee9741c35fdd7fa724"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/constants.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c9c77a9b0b59ed36d8b4320976ddb7dd4a91b2304f63e16327072164daa2b1"}},{"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":"web/genericcom.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bf7d184a5837d70bb049a357d5a9db7baa91f671824c0707a6d6debbd8309a"}},{"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":"web/annotation_editor_params.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca670556526446eb08530849bd89bf4fcdc9374daf72a8c6f70300d0cd8aaea2"}},{"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":"web/pdf_cursor_tools.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c86d6bcc69144dc8316004051bf6217457e288778da6760a06f92f1080f4494"}},{"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":"web/pdf_attachment_viewer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9da28ac136faebcba072f813f7389692eb019e4536dfe93c066e8549adb2203"}},{"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":"web/base_tree_viewer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3d06defb81a5bddb0dc17eccd5f329922b67229863879948abac6dd0311ae1"}},{"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":"external/check_l10n/check_l10n.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72428272a6a416cdd45559491f9a52a0c5b62b1e7bde918d72aeb1c5025e4a9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pdf.sandbox.external.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5bacbe6426d21cf8a5769620f8b13caae51fe36cc2e76737505e8251a269aa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/print_params.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10739e07a2016758700fba86ad51e2240adc7d00382302d1ce95c8eab1b22560"}},{"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":"web/grab_to_pan.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"057c205c1000a96138154534cd60616864b38bd279e8f8487b42dbf5c769b89f"}},{"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":"extensions/chromium/preserve-referer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c61bd2fe761ec75e90a2d3149230580320ad6e212a5fde7f83acfa0c2d1ef8"}},{"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":"extensions/chromium/options/migration.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e8be7b06a78ea21c7f3d2a4327f9d88e2e9a0d6467559d7802c46372aaa042"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pdf.sandbox.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a035b4260da1521c925afc7fade997b8c2e14105bd28484a1ceea394264e62"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/fullscreen.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69320904c36d7ac29bdd9ad968c73910da30c35b9ffc92c44ef0e60c2e6206b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/app_utils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc8362041ff93384932205a6bacd2238e077bc5897d120f68ee680ec93db924"}},{"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":"web/signature_manager-geckoview.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf37be4a54495715bf153c307b4e3aa5894aa512531345acf74edfdd78f6e75f"}},{"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":"external/importL10n/locales.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86acfa43eb017a41cd765582d7cbf82e75233a19a60a4f2e267992956cafaf77"}},{"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":"external/eslint_plugins/prefer-math-clamp.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3813ceb4757967b77ae29cbe4a351737fb22914d0eaf7c93c03cc472232ae8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/color.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"247f5b0aebc3e6f3883e0d6970cec2b81eaa591802ec650326b909a25133d5db"}},{"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":"extensions/chromium/extension-router.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b5859bd3b40efd99bc65863567d032130b511f2a4ddd9f6924a373e61264de"}},{"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":"external/cmapscompress/parse.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"051c5ff55397c5c593943b57466d0deab19c3ee5b42f718d76d85a21e57f63e5"}},{"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":"web/generic_signature_storage.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a17213c4caf4901c1ade1b848201b0015ac3a1a70be02d0f2c591d6257cc81"}},{"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":"web/toolbar-geckoview.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1dc7a4cc6b9793cc474536bedc2eeced256a5a997119ac434ac42fbb57b031"}},{"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":"web/external_services.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e842f64d9915256aaa52fe122d6653c0fe336bc09dd9e1bec77783ae518a08d"}},{"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":"external/builder/test-fixtures_babel.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ea7d34fc76e63afec8fcfd78f6a66e021fa88dae1e85b86968e45d4af0fce2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/thermometer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba30a0b6b21e8ef0f7e21c2efc77ae25ce1cc94dbba017d7731ce5ecaba263f5"}},{"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":"external/builder/test-fixtures.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dbade8a7360521b5cfd54e900a2524c4211bdfbd9e9c764ea5c3e88c451a99"}},{"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":"web/print_utils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"befdcd819cd6fc0f5a5648a75cb01a0e6785b154e4f55dfcdf44587f9f529c06"}},{"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":"web/stubs-geckoview.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9909c485e7f6d3b90290046cfbd3485c93672662f92f94641aef1693a1851460"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/common.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"452e2e7b98c8bae6325d77dbe976875a5e84891a8c1451f5a9864296cb4cfa4b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/console.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79312ec65037d1eedb7cee5a3be6b78f36771776da29daebf39c8c4853e72692"}},{"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":"extensions/chromium/suppress-update.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0953df12def348174e276cd3ed87fe5dfd3873f89f88b32eda75533c7120956"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/stubs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a217f3a38d2a8faedfc0a4e80579608e5d799862119151e171b63a790352677d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/offscreen_canvas_factory.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f902ec96b80b3777acaff1577413dd9b33b46cf2f4c986ffcbb526b39155ba"}},{"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":"extensions/chromium/background.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d627788622bf4bc8c4d921bef69a120c5de82a1ea2a12dcbda361e586a4826"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/worker_filter_factory.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15c4688d43777d33bb6f8cc5202637efd71e9fdaad88420c81aa9b26d934430"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pdf.scripting.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00539610cd7554b4653622105f1828ceac5b93d9fd55b374db287ee203c5fa85"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pdf.renderer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43868bda683fbe404037112a0564e7a9d09258ca3e3559978ec01e8bd9092e2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/license_header.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf2c58334864a1f07123e11e87d486c8ed4220c3cc5985243f18c1e05f87c30"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/license_header_libre.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b63fb886cb34ae6f1992bbebc6fb7283bb34a453a00ffee6fb5ac51f090f0d"}},{"ruleId":"R6","level":"warning","message":{"text":"No lint or typecheck script: test \u2713 \u00B7 lint \u2717 \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":"658a995477a4f3b704a1d0c61d78cffb4c5cc1944c2f896c1bb70ee901a201cf"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027ws\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/webserver.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11f226fc40ff887b9a069b4e8733a2348c1f0f556e1706e44ad080f4ef3cd96"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027cached-iterable\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":"f8c6a7892a80b1befc82ec614ae852d60aa9b2db1d9d46507ffa01bcdc7df66a"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027caniuse-lite\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":"603f632ec766b424c525eada43e0b68a1fb73c01aa80b5488c93794d78d01458"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027core-js\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1916dbc638cfe2461b52f81c0859829b7dbdc20a89f383709475f2d90853d672"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027tsc-alias\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":"7f81dbc72e0c46c4f8110a89220ba353e3eca7ac87f8e092d125b24955fb418a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/webpack/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/webpack/package.json"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a74bdd49f607072f7c73f5cc936cd6c998c3950bc7d0fc394cb254eaf661549"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: test/types/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/types/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"46445b9d79019153379eb5b375f6f485eaf8e73abe632602254189692c1776b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!(signal instanceof AbortSignal) || signal.aborted\u0060 appears character-identically in 2 files \u2014 src/display/editor/comment.js, src/display/editor/toolbar.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/comment.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb4ec83568c61fbc6a64c03bba94d21731f4ce6f2fccc63b3bbbbd3f7228673"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!this._compileNode(second) || !this._compileNode(first)\u0060 appears character-identically in 2 files \u2014 src/core/postscript/js_evaluator.js, src/core/postscript/wasm_compiler.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/js_evaluator.js"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"5250bdd1b73491c64a87906b21163c0433869c491bb30c523364618c713a56a1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!this._isStreamingSupported \u0026\u0026 this._isRangeSupported\u0060 appears character-identically in 2 files \u2014 src/display/fetch_stream.js, src/display/node_stream.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/fetch_stream.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"68113d28e88b4caae0975e9b82526464e66111d48d6c246af018c9074ba0c12e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(\u0022a\u0022 \u003C= char \u0026\u0026 char \u003C= \u0022z\u0022) || (\u0022A\u0022 \u003C= char \u0026\u0026 char \u003C= \u0022Z\u0022)\u0060 appears character-identically in 2 files \u2014 src/scripting_api/aform.js, src/scripting_api/util.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/aform.js"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba5a1a8746932d15fa118e2c13aa67a64d6a2b188b15c01197f55ecf68d6457"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(\u0022a\u0022 \u003C= char \u0026\u0026 char \u003C= \u0022z\u0022) || (\u0022A\u0022 \u003C= char \u0026\u0026 char \u003C= \u0022Z\u0022) || (\u00220\u0022 \u003C= char \u0026\u0026 char \u003C= \u00229\u0022)\u0060 appears character-identically in 2 files \u2014 src/scripting_api/aform.js, src/scripting_api/util.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/aform.js"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fd432e9ed9265f9f02fb3215b471d7ba960794019ef7720fa59f78f7fa91c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(ch \u003E= 0x41 \u0026\u0026 ch \u003C= 0x46) || (ch \u003E= 0x61 \u0026\u0026 ch \u003C= 0x66)\u0060 appears character-identically in 2 files \u2014 src/core/ascii_hex_stream.js, src/core/parser.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/ascii_hex_stream.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9641a5a6a1c92e8dda48573874f279f005b4ffdcce2c8452dda3e5d1c108618a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(e.ctrlKey || e.metaKey) \u0026\u0026 e.key === \u0022Enter\u0022 \u0026\u0026 !saveButton.disabled\u0060 appears character-identically in 3 files \u2014 web/alt_text_manager.js, web/comment_manager.js, web/new_alt_text_manager.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":"web/alt_text_manager.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"1531303aa4e0b0370ac47ceaec3eb6098908dd3f6be405332ae852054b696099"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(typeof PDFJSDev !== \u0022undefined\u0022 \u0026\u0026 PDFJSDev.test(\u0022MOZCENTRAL\u0022)) || FeatureTest.isFloat16ArraySupported\u0060 appears character-identically in 3 files \u2014 src/core/font_renderer.js, src/display/canvas_dependency_tracker.js, src/display/obj_bin_transform_display.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/font_renderer.js"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cc1b1e6127dfe67af4b3237a9bf9deb64ee5becbd29c43a5d67e6b36184afc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Array.isArray(fields) \u0026\u0026 fields.length \u003E 0\u0060 appears character-identically in 2 files \u2014 src/core/document.js, src/core/editor/pdf_editor.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ed36725f24897c8f147bfb2df1d33f1e1753404664ebaf6eba6c8f3970f057"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Array.isArray(labels) \u0026\u0026 this.pdfDocument.numPages === labels.length\u0060 appears character-identically in 2 files \u2014 web/pdf_thumbnail_viewer.js, web/pdf_viewer.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":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"8145c6cf1a50befc413c1800daaf3b2bcdb77c9b0a9af9e0286a7f4bcec87d5f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Array.isArray(value) || ArrayBuffer.isView(value)\u0060 appears character-identically in 2 files \u2014 src/core/primitives.js, src/core/writer.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/primitives.js"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec54039cb43c0dedcf262494458957958bcd1548914aa203bd1e195c063bbaf6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dict.getRaw(\u0022CS\u0022) || dict.getRaw(\u0022ColorSpace\u0022)\u0060 appears character-identically in 2 files \u2014 src/core/image.js, src/core/pattern.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/image.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2c25cea8eb1ae82ba70321e6481f408354f209d748129a107384769da9d11d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060document.readyState === \u0022interactive\u0022 || document.readyState === \u0022complete\u0022\u0060 appears character-identically in 2 files \u2014 web/viewer-geckoview.js, web/viewer.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":"web/viewer-geckoview.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9255a21abb0a8a4aa70f96766ca1f182aa602d0e04284cea23f96d41da57f84"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060drawingDelay \u003E= 0 \u0026\u0026 drawingDelay \u003C 1000\u0060 appears character-identically in 2 files \u2014 web/pdf_page_view.js, web/pdf_viewer.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":"web/pdf_page_view.js"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead9891802eebcf4120e845e692fe86f61c143ebf6facaa82fb9f6da2fe82b45"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.button !== 0 || (event.ctrlKey \u0026\u0026 isMac)\u0060 appears character-identically in 2 files \u2014 src/display/editor/annotation_editor_layer.js, src/display/editor/editor.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/annotation_editor_layer.js"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"e660ed96e949a91d242bd6eeca66acdcaa54a7ef12459373b24cf20e78556d67"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060first.type !== PS_NODE.const || !Number.isInteger(first.value) || !this._compileNode(second)\u0060 appears character-identically in 2 files \u2014 src/core/postscript/js_evaluator.js, src/core/postscript/wasm_compiler.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/postscript/js_evaluator.js"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2197f3b3b82ce742822d85017be092596a028fe9eb6105701ab822abb7d25f15"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060printAnnotationStoragePromise || Promise.resolve()\u0060 appears character-identically in 2 files \u2014 web/firefox_print_service.js, web/pdf_print_service.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":"web/firefox_print_service.js"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"2915dddf9b6f3c98c11ed306973a4c3088c981e87731ce6b626caedc9fdb5aae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060size.width === width \u0026\u0026 size.height === height\u0060 appears character-identically in 2 files \u2014 web/firefox_print_service.js, web/pdf_print_service.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":"web/firefox_print_service.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"276aa1f9c3125cc063c5a30c34e9fcaf6f603705ef45cdac9cafd9053ff0bfcb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.annotationElementId \u0026\u0026 !this.#hasElementChanged(serialized)\u0060 appears character-identically in 3 files \u2014 src/display/editor/freetext.js, src/display/editor/highlight.js, src/display/editor/ink.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/freetext.js"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91b112ad371883dfb38d44946b4d724383d9931130ea06f8bca0fbe91933c2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof PDFJSDev !== \u0022undefined\u0022 \u0026\u0026 !PDFJSDev.test(\u0022GENERIC\u0022)\u0060 appears character-identically in 2 files \u2014 src/display/api.js, web/genericcom.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api.js"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"4199c2bb7faf9d7c68c0ca43de087d28ac843056c56aaad76366e33ee2d17ed2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof PDFJSDev !== \u0022undefined\u0022 \u0026\u0026 !PDFJSDev.test(\u0022TESTING || INTERNAL_VIEWER\u0022)\u0060 appears character-identically in 2 files \u2014 src/core/document.js, src/core/internal_viewer_utils.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":2293}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d0800ae9b315d9b02bc1d988b0266373f92d1eeb33e137083b23b3b603a7d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof PDFJSDev !== \u0022undefined\u0022 \u0026\u0026 !PDFJSDev.test(\u0022TESTING\u0022)\u0060 appears character-identically in 7 files \u2014 src/core/worker.js, src/display/api.js, src/display/renderer_worker.js, src/display/renderer_worker_proxy.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/worker.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2323fcf57fa8652484fa446732232a4aa2f680ab96c287755a74d1b1d44f13"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof PDFJSDev !== \u0022undefined\u0022 \u0026\u0026 PDFJSDev.test(\u0022CHROME\u0022)\u0060 appears character-identically in 2 files \u2014 web/app.js, web/app_options.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":"web/app.js"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"911fed8ee6d5d62150a7acef8ae9ce851bdbe8b5d89012c54ccccfbb1d41baa5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof PDFJSDev !== \u0022undefined\u0022 \u0026\u0026 PDFJSDev.test(\u0022GENERIC\u0022) \u0026\u0026 isNodeJS\u0060 appears character-identically in 3 files \u2014 src/display/api.js, src/display/api_utils.js, src/display/network_stream.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api.js"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad104aace7ddf438970dc4fcf295530bcd9ac4aab8ddaa71207f42a3681f470"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof PDFJSDev !== \u0022undefined\u0022 \u0026\u0026 PDFJSDev.test(\u0022LIB\u0022) \u0026\u0026 typeof document === \u0022undefined\u0022\u0060 appears character-identically in 2 files \u2014 src/display/editor/tools.js, web/ui_utils.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/tools.js"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"3188d053f69fa0c39ff68ce995d310e22d631a0a42cb6ce8c39b78d9f49b3f40"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof PDFJSDev !== \u0022undefined\u0022 \u0026\u0026 PDFJSDev.test(\u0022MOZCENTRAL\u0022)\u0060 appears character-identically in 16 files \u2014 src/core/annotation.js, src/core/wasm_loader.js, src/display/api.js, src/display/api_utils.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb7b2845a83144357ea8b00aff2e076e864d4a005b2c971d35588f84fe4e839"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof PDFJSDev !== \u0022undefined\u0022 \u0026\u0026 PDFJSDev.test(\u0022TESTING\u0022)\u0060 appears character-identically in 12 files \u2014 src/display/annotation_layer.js, src/display/display_utils.js, src/display/editor/editor.js, src/display/editor/freetext.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"262c713972a68255848ffbb4104973f79d9a4f75fa4ab470c0e57e0f846866f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof PDFJSDev !== \u0022undefined\u0022 \u0026\u0026 PDFJSDev.test(\u0022WORKER_THREAD\u0022)\u0060 appears character-identically in 3 files \u2014 src/display/display_utils.js, src/display/font_loader.js, src/display/optional_content_config.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/display_utils.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8ec68943bb35b6b5b38a7326922200bd3d00712e5bc3bfd2aa07c01366683b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof PDFJSDev === \u0022undefined\u0022 || !PDFJSDev.test(\u0022CHROME\u0022)\u0060 appears character-identically in 3 files \u2014 web/app_options.js, web/chromecom.js, web/text_layer_builder.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":"web/app_options.js"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddafb48fedf97d61a89803c6c27dc0737552fed7c34870a868f38ba3221d7d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof PDFJSDev === \u0022undefined\u0022 || !PDFJSDev.test(\u0022MOZCENTRAL\u0022)\u0060 appears character-identically in 8 files \u2014 src/core/annotation.js, src/display/api.js, src/display/object_handler.js, web/app.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":4650}}}],"partialFingerprints":{"codehealthFindingId/v1":"624eac68104c0053045c7375cf0e81c610e9f52712afb76ee30b288eef30fc5d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof PDFJSDev === \u0022undefined\u0022 || PDFJSDev.test(\u0022GENERIC\u0022)\u0060 appears character-identically in 10 files \u2014 src/core/worker.js, src/display/api.js, web/annotation_editor_layer_builder.js, web/app.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/worker.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c814ab2ac04335fa521e919f1f6e7e67c8af6a5caeefd81a5078845d449679a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof PDFJSDev === \u0022undefined\u0022 || PDFJSDev.test(\u0022MOZCENTRAL \u0026\u0026 !GECKOVIEW\u0022)\u0060 appears character-identically in 2 files \u2014 web/app_options.js, web/viewer.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":"web/app_options.js"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4737b0d82a4b83183ae251ea6e3a9f1419cb3a9b04abccbd522227ffd55040"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof PDFJSDev === \u0022undefined\u0022 || PDFJSDev.test(\u0022TESTING || INTERNAL_VIEWER\u0022)\u0060 appears character-identically in 2 files \u2014 src/core/worker.js, src/display/api.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/worker.js"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"33af41086a8d45e499d4dae149cd9d14b45c3d9b0c8ff3961d936269c1cb737d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof PDFJSDev === \u0022undefined\u0022 || PDFJSDev.test(\u0022TESTING || MOZCENTRAL\u0022)\u0060 appears character-identically in 3 files \u2014 src/display/api.js, web/app.js, web/app_options.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api.js"},"region":{"startLine":2846}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d133a42e6c4e9ad0e3188cf7478e59f6a30346d90ae99b205b532d4883af66d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof PDFJSDev === \u0022undefined\u0022 || PDFJSDev.test(\u0022TESTING\u0022)\u0060 appears character-identically in 32 files \u2014 src/core/annotation.js, src/core/chunked_stream.js, src/core/colorspace.js, src/core/core_utils.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/annotation.js"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b6fb0f825ba64ddb99a8015bf457f166d784eb07216431cc1e298928b859f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof window === \u0022undefined\u0022 \u0026\u0026 !isNodeJS \u0026\u0026 typeof self !== \u0022undefined\u0022 \u0026\u0026 typeof self.postMessage === \u0022function\u0022 \u0026\u0026 \u0022onmessage\u0022 in self\u0060 appears character-identically in 2 files \u2014 src/core/worker.js, src/display/renderer_worker.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/worker.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea9af3cde5208363de13eed4b2cff658404c9eae64511d0a74f29448a8cb724"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060val instanceof Uint8Array \u0026\u0026 val.byteLength === val.buffer.byteLength\u0060 appears character-identically in 2 files \u2014 src/display/api_utils.js, src/display/transport_stream.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/api_utils.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac98be053d01619c4bea2c4171da020c5bad40db520ab6304ce8a329a8d5429"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/6 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchData: \u0060fetchData\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/dom_utils.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90325129d944b5ed83107444ebc7073cfacde9e39110615cd77c9d188b50cec"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: workerFetch: \u0060workerFetch\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/wasm_loader.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d37fffd04540bcc75ab99729e3605f492e175e41b3216cace4d6650d3f0886"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: downloadLanguageCodes: \u0060downloadLanguageCodes\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/importL10n/locales.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afdd914ef1db4a7bcf3edddd0ad711f1edaebab194b57f6e80953653cc8e325"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: downloadLanguageFiles: \u0060downloadLanguageFiles\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/importL10n/locales.mjs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"673bca9152907ab5415bd534d448fafab23c533b5d4b030d59cfa2bb82ed3dd2"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: refreshIndex: \u0060refreshIndex\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"external/ccov/coverage_search.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dd4b4daf47b420048339d3014240d86f8b2c305e418a7fe2f5dcdf0acda4ed"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: getStorageNames: \u0060getStorageNames\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/chromium/options/migration.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b052e0e1bc78657e656c3b7c11b799d93e9f386aa21455fb5485d81d9cf6e4e3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gulpfile.mjs"},"region":{"startLine":2925}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ead455168fee9542c27e40101f3287607a62824707586ed88c2a412c3708c0"}},{"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":"web/app.js"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"481a3204b34f56ae206e7d39866d98d03cedbc207afd0eeb72eaafce47f9e7f9"}},{"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":"web/app.js"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"37dbb366f5b8094af976e40c1823f52b51cad894e2fe7c6d3af71e9091d48acb"}},{"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":"web/app.js"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac2a257a8e00ce54370a81856c13873f05158eb90253caebaa696af81de4e70"}},{"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":"web/app.js"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1a8839f2a85466fe9876918ed3c70444819942c6b7eb578623ba80d7b4b799"}},{"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":"web/chromecom.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"be89ff7c961a56193064e74b0689788e7dbe90f7ea6feb4596488c7b12d654c5"}},{"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":"web/genericl10n.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aaa40ec3f74c9b7441f948869f5e19a31579506f4c56222cca29346e19fe41b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/grab_to_pan.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae9fe95636613e6854d89494add55a27c076f4dd213b41db5578696c73b3778"}},{"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":"web/l10n.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"284db531415e7cdc1c4a13561042d5f9cca66563a851de841efae786aa9e3649"}},{"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":"web/pdf_link_service.js"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc8e3865727bd318f3d607dfc66058bcdd4364d9d5fac0f2b13c5b0250f5060"}},{"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":"web/pdf_scripting_manager.js"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c49ec36cf5a41c2f98874247121eb4f547a215fdd4e26d9f3ecd962ed161017"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/pdf_thumbnail_viewer.js"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"873b1592e9b5d4d5cff8b3842f0765bdaea1698effa3e70e9004a9a2ffc83bff"}},{"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":"web/struct_tree_layer_builder.js"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01469d4feb7ce75d668f46f8282cb1d8d02e8cfd3f531a50fb76f4b45b9799d"}},{"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":"web/struct_tree_layer_builder.js"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"53da19c93d3346fc757ce6d7fe538866f1f6dce103c910be897fcae41fbadbc1"}},{"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":"web/internal/debugger.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"910d9cc347f4adb54fa7927fef80cbe25744e235960d2860bd1bc61b785d4b21"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/util.js"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5db43a2131ea9eafd292e80a74ed8589760bd556d24f2bd6b7641e558312a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(noopFn)\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":"src/shared/util.js"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea4e6c98e46b483f10e9c4481ea7711eaa08287bb9bc89aeeff0c54acf134fc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/aform.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfedcb04dbdb577b3160baa11a45d60d71ea7a17c96c83f175ea5060be0efd33"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/scripting_api/app_utils.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"549e432ea1ebb39f3418b02ced072ab9f314744bdd165a11b2c96cbe669a430b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/annotation_layer.js"},"region":{"startLine":3828}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e3b7d8875f0575fd5f99d8ce8487e457eed71c41c055d8d3211027b40d610a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/content_disposition.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"08745833e7fdf375e7c9ac690e0edb83caf813386f6e786ed0663ef7ddeb3273"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/content_disposition.js"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ca4e8ad6f387819c40f23c7379c2dc6c42254a97ccada63d2ae3047ab80e63"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/dom_utils.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"346dd5c940b9fc3c210b161ba2f759f4be6f1328c37970f27b613893eaf49df0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/dom_utils.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd65302dbcfa596835c7a99755f55399c4e9d9d87b893363381429f31ffba28"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/dom_utils.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"987690bc7a0ec8f61a2e44629839ed14b6d34a29f0f655423e82e6b40164b4a1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/dom_utils.js"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcab9b07a76fe7086509e5513e630626ea481fad4ec936eea5b25cff3ff048d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/network_utils.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc27a8fd519bf683cd46b903e0340ad0d924dbde547eb24dff6feb01c712e9a5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/editor/stamp.js"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b89d3425b83ebe70d99321ce1dbb0f3c6008f152262aed3466ebcdafb94d511"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/dataset_reader.js"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9edfa9f0395cb43b8c184a0a06954ce9cdc1ec8d4d9c46c017f2f9dcf9b07a0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/document.js"},"region":{"startLine":2361}}}],"partialFingerprints":{"codehealthFindingId/v1":"411d633ee4b0c6a0c5e4e243f593df8f5434bd449a14540ee8c34f3c25d848b2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/evaluator.js"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67aecf93a85d2c394719e030f6c3e72e8c9a3d9f0b5101c002a5ae1d53336c3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/function.js"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"73dee660fdf86e6fcdbf352c95c057aa2986aa5c0d9243b3551010351a75908f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/internal_viewer_utils.js"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ece10ec9c25bd7f3b16a9d87cb4cbc848d101d074fd527e056f132e396590cf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/type1_font.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"675e8d158aa388f94688549d99d635bf18ee588f46a938f1c5b21f3d6422c957"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/xref.js"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"000dd4a36453c1e5108a2490ca288177d728fba33a4bd458919f48c92886822c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core/editor/pdf_images.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5842566f326baf7bfb865584689922ccbacf5090c1f360b693d7c5a8dcd3b6c2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060checkFile\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gulpfile.mjs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c335183fcafb72bbb042dbd07c7760b16b3bb9b154c045d56a9a4a9ca361c5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060checkDir\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gulpfile.mjs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"7feb3127632f269a51e24a059d6133c5e90bdbb7e82fb5605642b69d2a56cfa6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060waitForSerialized\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/test_utils.mjs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dba7a7630bce5a390e31c8aedb81b64e9257e716354b738524ecb531fce9ab8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060serializeBitmapDimensions\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/integration/test_utils.mjs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa65abbd8e2f7dee8e8f76c5a1f13aec4214607f4dc4702dabfa93e00f321dc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060viewCertificate\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/firefoxcom.js"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"1751b5f5645fdbd1f70300421a7ab01a2394f632d7e65c38a55f7db4b45dc5e5"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1164","guid":"793ece19-b164-f952-a8b3-33dc3b591809","name":"CWE-1164","shortDescription":{"text":"CWE-1164"},"helpUri":"https://cwe.mitre.org/data/definitions/1164.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-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-345","guid":"d80d4b65-bbbe-b65d-958e-7ac466af18f9","name":"Insufficient Verification of Data Authenticity","shortDescription":{"text":"Insufficient Verification of Data Authenticity"},"helpUri":"https://cwe.mitre.org/data/definitions/345.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"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/"}]},{"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-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-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":55,"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."]}]}