{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"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":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"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":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"DM12","name":"Ambient inputs in the domain","shortDescription":{"text":"Ambient inputs in the domain"},"helpUri":"https://codehealth.canine.dev/dimensions/DM12"},{"id":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"id":"DM9","name":"Scattered domain decisions","shortDescription":{"text":"Scattered domain decisions"},"helpUri":"https://codehealth.canine.dev/dimensions/DM9"},{"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":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"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":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"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":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"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":"AbsTransfer.inferGuard (cyclomatic 126): AbsTransfer.inferGuard has cyclomatic complexity 126 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de85bc2f34c80334f119ae6335ed8fb3f22edf29e868025c641646c437e31f5"}},{"ruleId":"D1","level":"warning","message":{"text":"CaseCollector.walk (cyclomatic 125): CaseCollector.walk has cyclomatic complexity 125 (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/main/scala/esmeta/lang/util/CaseCollector.scala"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"30630f4906f265cb7827be0b1b854f522769d1af3d2f3b4710ae5a03e9f710ab"}},{"ruleId":"D1","level":"warning","message":{"text":"AbsTransfer.basicTransfer (cyclomatic 99): AbsTransfer.basicTransfer has cyclomatic complexity 99 (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/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77ac06576f5588e2c18bb14390d294820bcfd75037f2589e873e2ea6e5ece62"}},{"ruleId":"D1","level":"warning","message":{"text":"Interpreter.eval (cyclomatic 84): Interpreter.eval has cyclomatic complexity 84 (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/main/scala/esmeta/interpreter/Interpreter.scala"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c4aef355535e1b733740a72b0cf8ff4b4a31213fd43581b154e101b626f0b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Interpreter.eval (cyclomatic 83): Interpreter.eval has cyclomatic complexity 83 (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/main/scala/esmeta/interpreter/Interpreter.scala"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"42809a034dbe744079b306344242dbc8b4e9bf05cd44f5bb2673544995398675"}},{"ruleId":"D1","level":"warning","message":{"text":"Compiler.compile (cyclomatic 81): Compiler.compile has cyclomatic complexity 81 (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/main/scala/esmeta/compiler/Compiler.scala"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ff7f241c496b37409db896a49b248f266e5a3bbc3272a639b1db72f8ff1616"}},{"ruleId":"D1","level":"warning","message":{"text":"Compiler.compile (cyclomatic 70): Compiler.compile has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/compiler/Compiler.scala"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"27523b88acb9598876f902ed5a37017fd42d6ebbef58fbfa77614425ee058774"}},{"ruleId":"D1","level":"warning","message":{"text":"Stringifier.stepWithUpperRule (cyclomatic 68): Stringifier.stepWithUpperRule has cyclomatic complexity 68 (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/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"743c14b2a7c0cb2bc517e545eb43e241ab183e51314091193d306f264c68fed3"}},{"ruleId":"D1","level":"warning","message":{"text":"Compiler.compile (cyclomatic 67): Compiler.compile has cyclomatic complexity 67 (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/main/scala/esmeta/compiler/Compiler.scala"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a27819fb3b7736c99a5d6c83c5e690e0407d09323d51ba6ddf7ce5503d5150"}},{"ruleId":"D1","level":"warning","message":{"text":"CaseCollector.walk (cyclomatic 66): CaseCollector.walk has cyclomatic complexity 66 (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/main/scala/esmeta/lang/util/CaseCollector.scala"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7948e5fa638ff3642166380eabebc0913263dff9a2fa2f40ca602fbc6c613bf6"}},{"ruleId":"D1","level":"warning","message":{"text":"Translator.compile (cyclomatic 54): Translator.compile has cyclomatic complexity 54 (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/main/scala/esmeta/es/util/polyfill/Translator.scala"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"3285d9d513aabb4789bf9d817a8bba6259fa01188a9bcf6151a2226c66b727f5"}},{"ruleId":"D1","level":"warning","message":{"text":"AbsTransfer.transfer (cyclomatic 53): AbsTransfer.transfer has cyclomatic complexity 53 (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/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"961505378230344538879c3db37b7012f65b480b0bdffd44001e55fdcc59a4ae"}},{"ruleId":"D1","level":"warning","message":{"text":"Unifier.unify (cyclomatic 44): Unifier.unify has cyclomatic complexity 44 (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/main/scala/esmeta/es/util/polyfill/dsl/Unifier.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6d16dfc8533cb321f6ca1ccab15df9ff12cb0ea67fd3889a8dac6956cd4f1d"}},{"ruleId":"D1","level":"warning","message":{"text":"Stringifier.valueTyRule (cyclomatic 44): Stringifier.valueTyRule 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/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfef2e3e8af6577510527d466548983a02c7c36b43518e807b83db00b61e5f74"}},{"ruleId":"D1","level":"warning","message":{"text":"Compiler.compile (cyclomatic 43): Compiler.compile has cyclomatic complexity 43 (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/main/scala/esmeta/compiler/Compiler.scala"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc75ddaaf14652a72cd3009b2218529288c0bd19e455353bba7b307764958e6"}},{"ruleId":"D1","level":"warning","message":{"text":"Translator.compile (cyclomatic 38): Translator.compile has cyclomatic complexity 38 (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: Translator.compile (cyclomatic 39) 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/main/scala/esmeta/es/util/polyfill/Translator.scala"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"c127c660e61286d06e65b948c568b029c9846bc97145cb0e2a51e8be4406d09a"}},{"ruleId":"D1","level":"warning","message":{"text":"Stringifier.condRuleWithPrecedence (cyclomatic 36): Stringifier.condRuleWithPrecedence 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/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"129fb5975d52b111bc6eb3e35679028c95e9692f344ea5d5b0e829a49bfa150c"}},{"ruleId":"D1","level":"warning","message":{"text":"Translator.compile (cyclomatic 29): Translator.compile has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Translator.compile (cyclomatic 39) 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/main/scala/esmeta/es/util/polyfill/Translator.scala"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f9cef310d58bb69fa9294a174ef1c93bb1da682a680d0cc856709e3c57c1ab"}},{"ruleId":"D1","level":"warning","message":{"text":"Unifier.unify (cyclomatic 26): Unifier.unify 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/main/scala/esmeta/es/util/polyfill/dsl/Unifier.scala"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b8c7ad7524ca1f01428f3f26bb18d505227c0d8beb539df8f8cf0c74684863"}},{"ruleId":"D1","level":"warning","message":{"text":"CaseCollector.walk (cyclomatic 26): CaseCollector.walk 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/main/scala/esmeta/lang/util/CaseCollector.scala"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf7a71846bd632530b7b98f81d4151cc84c694dda97ddd3d8a51561e15ab784"}},{"ruleId":"D1","level":"warning","message":{"text":"ValueTy.overlaps (cyclomatic 24): ValueTy.overlaps 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":"src/main/scala/esmeta/ty/ValueTy.scala"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f236fd64c1a6eb5d82071dd50e5badfb22033adf6a9d73a23060a8b22379b33"}},{"ruleId":"D1","level":"warning","message":{"text":"AbsTransfer.syntacticRefine (cyclomatic 23): AbsTransfer.syntacticRefine has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: AbsTransfer.transfer (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"06524a15b3fb15d31c042d921785742488f681e9bcb946f26bada038c6eca211"}},{"ruleId":"D1","level":"warning","message":{"text":"TyChecker.logging (cyclomatic 23): TyChecker.logging 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/main/scala/esmeta/analyzer/tychecker/TyChecker.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bddb9297443190a44744502b9cea23011557b070cda0bb9d7fe787e20a56de7"}},{"ruleId":"D1","level":"warning","message":{"text":"NumberTy.arith (cyclomatic 23): NumberTy.arith has cyclomatic complexity 23 (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/main/scala/esmeta/ty/NumberTy.scala"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"874ec5b2532d6e83fea13de9b09ddb1b01711bd7b20490911b184d760f3ca4a1"}},{"ruleId":"D1","level":"warning","message":{"text":"ValueTy.|| (cyclomatic 23): ValueTy.|| has cyclomatic complexity 23 (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/main/scala/esmeta/ty/ValueTy.scala"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e901ee6cc23c7cf773aceb6cbf17cf06a88be32e1e12d458612ca7ed439b0d27"}},{"ruleId":"D1","level":"warning","message":{"text":"ValueTy.\u0026\u0026 (cyclomatic 23): ValueTy.\u0026\u0026 has cyclomatic complexity 23 (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/main/scala/esmeta/ty/ValueTy.scala"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2afc484a32bbeeaf27e75a3bc9d42228605e892fdb80cafc6fc1db9566dd611"}},{"ruleId":"D1","level":"warning","message":{"text":"AbsValue.convertTo (cyclomatic 22): AbsValue.convertTo 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/main/scala/esmeta/analyzer/tychecker/AbsValue.scala"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"2895ff94def903306c86f880a0a6aed9a0f19f5c201ed0312288b46f671abc45"}},{"ruleId":"D1","level":"warning","message":{"text":"AbsTransfer.transfer (cyclomatic 21): AbsTransfer.transfer has cyclomatic complexity 21 (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: AbsTransfer.transfer (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d14a73bf5e9891d1d510117613d6c121868e7a50f10e3f383f387ef657f138"}},{"ruleId":"D1","level":"warning","message":{"text":"Provenance.|| (cyclomatic 19): Provenance.|| 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/main/scala/esmeta/analyzer/tychecker/TypeGuard.scala"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80f756b37614a4d17d59aa0309178a7dbf1aed9d3084ec9696e04d1a4255ea9"}},{"ruleId":"D1","level":"warning","message":{"text":"Provenance.\u0026\u0026 (cyclomatic 19): Provenance.\u0026\u0026 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/main/scala/esmeta/analyzer/tychecker/TypeGuard.scala"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a74aa5df94f83c4316d86d70e49632a746766ffc6a095a067a079b9cc5d3f9e"}},{"ruleId":"D1","level":"warning","message":{"text":"AbsTransfer.transfer (cyclomatic 18): AbsTransfer.transfer has cyclomatic complexity 18 (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: AbsTransfer.transfer (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e23c3ff2f606cdf588fc3ed43d22f488ac56ae093eaac797d24b8ce7ef2ee5"}},{"ruleId":"D1","level":"warning","message":{"text":"CFGBuilder.translate (cyclomatic 18): CFGBuilder.translate 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/main/scala/esmeta/cfgbuilder/CFGBuilder.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40dc3eca2f1eea27174a1d4ff1dd6d27cf5c8ac75da7fb8c860c2ef11004c56"}},{"ruleId":"D1","level":"warning","message":{"text":"ESParser.appendParser (cyclomatic 18): ESParser.appendParser 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/main/scala/esmeta/parser/ESParser.scala"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"780c58ed26c7059f2e87093cccdc03c6ad612b9734c88b288df19596dd5d8dcf"}},{"ruleId":"D1","level":"warning","message":{"text":"ValueTy.toAtomicTys (cyclomatic 18): ValueTy.toAtomicTys has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ValueTy.contains (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/ty/ValueTy.scala"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f6107a5053ddeb6fa4ab2f411222a98d7e208527cefcdbed5dbd2e2d5a0d6c"}},{"ruleId":"D1","level":"warning","message":{"text":"Unifier.unify (cyclomatic 17): Unifier.unify has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/polyfill/dsl/Unifier.scala"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"729b05bfc2118523d477338f41efa7f7ed321c5e086ffb6b169f4b920f4f6947"}},{"ruleId":"D1","level":"warning","message":{"text":"Interpreter.eval (cyclomatic 17): Interpreter.eval 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: Interpreter.eval (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/interpreter/Interpreter.scala"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"10739c61bd62a722206d2d3afb2e6db61fc06b9c248150ce5dc34ac9e6bcc18a"}},{"ruleId":"D1","level":"warning","message":{"text":"NumberTy./ (cyclomatic 17): NumberTy./ 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/main/scala/esmeta/ty/NumberTy.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dc4dff8948c0d74287c6a6e7205b472bc48e7e0333bd689efeb5cf44cb1a2a"}},{"ruleId":"D1","level":"warning","message":{"text":"RecordTy.\u0026\u0026 (cyclomatic 17): RecordTy.\u0026\u0026 has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/ty/RecordTy.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a1687c37b5f28ead892b940878e3290ef0a3692b3da874943bf73bf8967296"}},{"ruleId":"D1","level":"warning","message":{"text":"ArraySpeciesCreate.AO__ArraySpeciesCreate (cyclomatic 17): ArraySpeciesCreate.AO__ArraySpeciesCreate has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own 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/main/resources/polyfill/runtime/abstract/manual/ArraySpeciesCreate.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f011a72d3b44490db46735e4b4db27a2456e5a95a12fefe37272b7ee56e1a415"}},{"ruleId":"D1","level":"warning","message":{"text":"AbsTransfer.refine (cyclomatic 16): AbsTransfer.refine 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. This is NOT this file\u0027s highest cyclomatic complexity: AbsTransfer.transfer (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"a177c12d6b6bfd2630060c6a3b08ce718dc5a08726d87e5e2ca501f15f164238"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgParser.apply (cyclomatic 16): ArgParser.apply 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/main/scala/esmeta/util/ArgParser.scala"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a149582b49e11cbe5ebdc2c74d4a0edd009568584738b4151af643a42f278e96"}},{"ruleId":"D2","level":"warning","message":{"text":"AbsTransfer.inferGuard (cognitive 383): AbsTransfer.inferGuard has cognitive complexity 383 (threshold 15). Drivers by points: if/else 52 (181 pts), loops 39 (130 pts), match/switch 10 (60 pts), boolean chains 12 (nesting depth added 270). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala holds 16 of the 76 methods over the threshold \u2014 including the worst \u2014 and 851 of the 1780 points over it (48%), 5.4\u00D7 the next-largest file (src/main/scala/esmeta/compiler/Compiler.scala at 159). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3a889ac1a909099049f9e48c6d8af40e448d599fffd73b6a6d4c888db1505b"}},{"ruleId":"D2","level":"warning","message":{"text":"AbsTransfer.basicTransfer (cognitive 153): AbsTransfer.basicTransfer has cognitive complexity 153 (threshold 15). Drivers by points: loops 50 (134 pts), if/else 6 (11 pts), match/switch 3 (8 pts) (nesting depth added 94). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala holds 16 of the 76 methods over the threshold \u2014 including the worst \u2014 and 851 of the 1780 points over it (48%), 5.4\u00D7 the next-largest file (src/main/scala/esmeta/compiler/Compiler.scala at 159). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ed16d82b3af0f916afb42a8c601abb1b632d933ae639a75e7e2c6feb50192d"}},{"ruleId":"D2","level":"warning","message":{"text":"AbsTransfer.transfer (cognitive 144): AbsTransfer.transfer has cognitive complexity 144 (threshold 15). Drivers by points: loops 28 (98 pts), if/else 12 (31 pts), match/switch 4 (14 pts), boolean chains 1 (nesting depth added 99). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala holds 16 of the 76 methods over the threshold \u2014 including the worst \u2014 and 851 of the 1780 points over it (48%), 5.4\u00D7 the next-largest file (src/main/scala/esmeta/compiler/Compiler.scala at 159). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"51202c0c800e6b6d304e6095a6243657a44ef3d67432cbb54d7a2068380b164d"}},{"ruleId":"D2","level":"warning","message":{"text":"Unifier.unify (cognitive 91): Unifier.unify has cognitive complexity 91 (threshold 15). Drivers by points: loops 27 (87 pts), match/switch 2 (3 pts), if/else 1 (nesting depth added 61). 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/main/scala/esmeta/es/util/polyfill/dsl/Unifier.scala"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efa634f6f516e0daca5f7af55a959cd2c34aa9e131c13ee0f962843735fd783"}},{"ruleId":"D2","level":"warning","message":{"text":"CaseCollector.walk (cognitive 79): CaseCollector.walk has cognitive complexity 79 (threshold 15). Drivers by points: if/else 31 (51 pts), match/switch 14 (28 pts) (nesting depth added 34). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/CaseCollector.scala"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2a35d639b43e4b0ef0262fa3d94faddf3acf2e0d00253c6fb593081a82b9ae"}},{"ruleId":"D2","level":"warning","message":{"text":"AbsTransfer.transfer (cognitive 70): AbsTransfer.transfer has cognitive complexity 70 (threshold 15). Drivers by points: loops 11 (49 pts), match/switch 3 (11 pts), if/else 2 (9 pts), boolean chains 1 (nesting depth added 53). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala holds 16 of the 76 methods over the threshold \u2014 including the worst \u2014 and 851 of the 1780 points over it (48%), 5.4\u00D7 the next-largest file (src/main/scala/esmeta/compiler/Compiler.scala at 159). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a0aaf328957ce5a718b9eb1390008d91d69c9a4426ec72d6629f1e0bb47427"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler.compile (cognitive 69): Compiler.compile has cognitive complexity 69 (threshold 15). Drivers by points: if/else 36 (57 pts), match/switch 4 (7 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 26). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/compiler/Compiler.scala"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39b5e6c60457fc8c32476abff58708f56a95963047891a1221b786ed4708626"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler.compile (cognitive 67): Compiler.compile has cognitive complexity 67 (threshold 15). Drivers by points: if/else 19 (31 pts), match/switch 10 (28 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 32). 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/main/scala/esmeta/compiler/Compiler.scala"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90b3007bed99a1c899d0b7dbfd088bda3e52b11e8e2b0910cd2594b706dae77"}},{"ruleId":"D2","level":"warning","message":{"text":"Stringifier.stepWithUpperRule (cognitive 64): Stringifier.stepWithUpperRule has cognitive complexity 64 (threshold 15). Drivers by points: if/else 24 (42 pts), match/switch 7 (14 pts), loops 4 (8 pts) (nesting depth added 29). 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/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9c5a8b3d5c105b74aca9a4d3e60f0d419ebcf00435e27369ac72a339687997"}},{"ruleId":"D2","level":"warning","message":{"text":"AbsTransfer.syntacticRefine (cognitive 63): AbsTransfer.syntacticRefine has cognitive complexity 63 (threshold 15). Drivers by points: if/else 16 (36 pts), loops 4 (14 pts), match/switch 4 (13 pts) (nesting depth added 39). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala holds 16 of the 76 methods over the threshold \u2014 including the worst \u2014 and 851 of the 1780 points over it (48%), 5.4\u00D7 the next-largest file (src/main/scala/esmeta/compiler/Compiler.scala at 159). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"840126591aaa8cdd8b5cc22201b46ae4d28228024503e80227559cde9249c403"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler.compile (cognitive 63): Compiler.compile has cognitive complexity 63 (threshold 15). Drivers by points: if/else 26 (47 pts), match/switch 5 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 28). 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/main/scala/esmeta/compiler/Compiler.scala"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d23198696d72e1cc444da3658e114d680b71415b79d09239381392e1162ff9"}},{"ruleId":"D2","level":"warning","message":{"text":"Stringifier.valueTyRule (cognitive 62): Stringifier.valueTyRule has cognitive complexity 62 (threshold 15). Drivers by points: if/else 25 (36 pts), loops 7 (15 pts), match/switch 6 (7 pts), boolean chains 4 (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/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c989d7a011642817f38f84e4297e094b7851b6d0c026d4f7608b20c50dc192"}},{"ruleId":"D2","level":"warning","message":{"text":"Stringifier.condRuleWithPrecedence (cognitive 49): Stringifier.condRuleWithPrecedence has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (31 pts), match/switch 7 (13 pts), loops 1 (3 pts), boolean chains 2 (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/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7520f9659f447e3dcdd9788c298049a0532c77c1b0af168b537c01919070086"}},{"ruleId":"D2","level":"warning","message":{"text":"Interpreter.eval (cognitive 44): Interpreter.eval has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 8 (15 pts), loops 4 (8 pts), error handling 1 (2 pts) (nesting depth added 18). 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/main/scala/esmeta/interpreter/Interpreter.scala"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"585be56f9f05ce9e994b21b6894209df3eb1bbb5afacde2d6899208888578cc5"}},{"ruleId":"D2","level":"warning","message":{"text":"AbsTransfer.transfer (cognitive 43): AbsTransfer.transfer has cognitive complexity 43 (threshold 15). Drivers by points: loops 9 (27 pts), if/else 6 (15 pts), match/switch 1 (nesting depth added 27). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala holds 16 of the 76 methods over the threshold \u2014 including the worst \u2014 and 851 of the 1780 points over it (48%), 5.4\u00D7 the next-largest file (src/main/scala/esmeta/compiler/Compiler.scala at 159). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3342a3850ad4e5874d31929b08b27075fe71f9334e81da9fa6f18edb0d0e821"}},{"ruleId":"D2","level":"warning","message":{"text":"AbsTransfer.shortCircuit (cognitive 41): AbsTransfer.shortCircuit has cognitive complexity 41 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 5 (15 pts), match/switch 2 (8 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala holds 16 of the 76 methods over the threshold \u2014 including the worst \u2014 and 851 of the 1780 points over it (48%), 5.4\u00D7 the next-largest file (src/main/scala/esmeta/compiler/Compiler.scala at 159). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab73d6b632ffa096e41eff492f4f0af16cb023269bb7cadc736f1e553fd2c171"}},{"ruleId":"D2","level":"warning","message":{"text":"TyChecker.logging (cognitive 41): TyChecker.logging has cognitive complexity 41 (threshold 15). Drivers by points: if/else 23 (28 pts), loops 2 (8 pts), boolean chains 5 (nesting depth added 11). 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/main/scala/esmeta/analyzer/tychecker/TyChecker.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"cace298f1b8c01cecb886c895b09ff0f7b2eced0b095638d5b788aab5db34d76"}},{"ruleId":"D2","level":"warning","message":{"text":"Initialize.addPropBuiltinFuncs (cognitive 37): Initialize.addPropBuiltinFuncs has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 4 (7 pts), match/switch 2 (7 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/Initialize.scala"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"baaede2e297c0989cda69009ff7bef49a0b751688691275886343a54e4d24768"}},{"ruleId":"D2","level":"warning","message":{"text":"AbsTransfer.apply (cognitive 36): AbsTransfer.apply has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 4 (10 pts), match/switch 2 (3 pts) (nesting depth added 23). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala holds 16 of the 76 methods over the threshold \u2014 including the worst \u2014 and 851 of the 1780 points over it (48%), 5.4\u00D7 the next-largest file (src/main/scala/esmeta/compiler/Compiler.scala at 159). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef43c96c9828d7a7fd85673450948c2b9ea16c513f1a6c2552f8b223d2c5da7"}},{"ruleId":"D2","level":"warning","message":{"text":"CaseCollector.walk (cognitive 36): CaseCollector.walk has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 9 (17 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/CaseCollector.scala"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b463351e58e85bc2d67fcc1a7945224469273c527b472ab55fe918c9bea84f28"}},{"ruleId":"D2","level":"warning","message":{"text":"Unifier.unify (cognitive 34): Unifier.unify has cognitive complexity 34 (threshold 15). Drivers by points: loops 8 (25 pts), if/else 4 (5 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/polyfill/dsl/Unifier.scala"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb948a7973c0f61d8abec9483b86090892569ea5de6555228baff7287d13417"}},{"ruleId":"D2","level":"warning","message":{"text":"SetDataRemove.opt.default (cognitive 34): SetDataRemove.opt.default has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 2 (6 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/resources/polyfill/runtime/internal/SetDataRemove.opt.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd567025af3f314820aa307dbacb900bfe2074ba1cec75334ac2c787f869897"}},{"ruleId":"D2","level":"warning","message":{"text":"exports (cognitive 34): exports has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 2 (6 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/resources/polyfill/runtime/internal/SetDataRemove.opt.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5940de16aa4a6d52995b4f052902009848ab814d7ae268022f962e12c0ffb4"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector.handleProperty (cognitive 32): Injector.handleProperty has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 4 (18 pts), loops 3 (10 pts), if/else 4 (nesting depth added 21). 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/main/scala/esmeta/injector/Injector.scala"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1b1c0984b409a8ad8939db5ea711871823c7dccc92577cad161ea798abb5e6"}},{"ruleId":"D2","level":"warning","message":{"text":"NumberTy.arith (cognitive 32): NumberTy.arith has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 17, if/else 9 (13 pts), match/switch 1 (2 pts) (nesting depth added 5). 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/main/scala/esmeta/ty/NumberTy.scala"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79e1f3a2c146d47e9c90e8a65975900ef2a6f31bbf1d95e60c84bdee0fded48"}},{"ruleId":"D2","level":"warning","message":{"text":"Unifier.unify (cognitive 31): Unifier.unify has cognitive complexity 31 (threshold 15). Drivers by points: loops 9 (27 pts), boolean chains 2, if/else 1, match/switch 1 (nesting depth added 18). 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/main/scala/esmeta/es/util/polyfill/dsl/Unifier.scala"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"661a1ccbce77595c4e26621d7a2874829b2326c4718536241784ccb9b724b217"}},{"ruleId":"D2","level":"warning","message":{"text":"CaseCollector.walk (cognitive 31): CaseCollector.walk has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (28 pts), match/switch 2 (3 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/CaseCollector.scala"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fdd1db1673012b1c6a155ce8743cce0ad3f9a96561f83a913d4aae526b1a26"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordTy.\u0026\u0026 (cognitive 31): RecordTy.\u0026\u0026 has cognitive complexity 31 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 4 (8 pts), boolean chains 4, match/switch 1 (nesting depth added 16). 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/main/scala/esmeta/ty/RecordTy.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5fd4416bf31f72c3991013fadf506304edd5d9ec16f1a95a650ca9c7424dc1"}},{"ruleId":"D2","level":"warning","message":{"text":"ValueTy.toAtomicTys (cognitive 27): ValueTy.toAtomicTys has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 3 (5 pts) (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/main/scala/esmeta/ty/ValueTy.scala"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8554e8b7248263b90939eb916393288f04f1a1838a82270e9435a506d447fc2"}},{"ruleId":"D2","level":"warning","message":{"text":"Coverage.check (cognitive 26): Coverage.check has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 2 (4 pts), loops 2, 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":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aea83ad7833986717991a8e8515bda132d940a3dfd9e0a21d1c61e2e3056a1a"}},{"ruleId":"D2","level":"warning","message":{"text":"StatementInserter.walk (cognitive 26): StatementInserter.walk has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 5 (9 pts), loops 2 (5 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/fuzzer/mutator/StatementInserter.scala"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5607a4b245ed56dea17ceaa328bace42ec985eec42fd63ec2472ab1fb7d58643"}},{"ruleId":"D2","level":"warning","message":{"text":"ESParser.appendParser (cognitive 26): ESParser.appendParser has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 5 (11 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/parser/ESParser.scala"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9649200bf9234b74097a87735d55fc025656e74ae175088d440f6c31d24aa3"}},{"ruleId":"D2","level":"warning","message":{"text":"Provenance.\u003C= (cognitive 25): Provenance.\u003C= has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 1 (2 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/main/scala/esmeta/analyzer/tychecker/TypeGuard.scala"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a645692e1393a6c6154dceb0c4032c68e9fb4717626145cb7cfbe92aefa716"}},{"ruleId":"D2","level":"warning","message":{"text":"Provenance.|| (cognitive 25): Provenance.|| has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 4, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/TypeGuard.scala"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6bba1f9ad64b790135c0752910a0bd0f03963552ca8a9679e6360e1e4742c0"}},{"ruleId":"D2","level":"warning","message":{"text":"Provenance.\u0026\u0026 (cognitive 25): Provenance.\u0026\u0026 has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 4, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/TypeGuard.scala"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"53eb4b30424d6142b04edc73d8ad747b32ca454624f16bfc87052c624b54d75c"}},{"ruleId":"D2","level":"warning","message":{"text":"ESParser.insertSemicolon (cognitive 25): ESParser.insertSemicolon has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (6 pts), boolean chains 4 (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/main/scala/esmeta/parser/ESParser.scala"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"b379a6648c36103eb0bf7833650674cbf29d5384bdfe85a8c5b5fc438beb7807"}},{"ruleId":"D2","level":"warning","message":{"text":"WebServer.run (cognitive 25): WebServer.run has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (25 pts) (nesting depth added 18). 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/main/scala/esmeta/web/http/WebServer.scala"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a003a0bf1b1028de71f5d8125620197f9d0b2fd6787880f90a8108f5cb8649b"}},{"ruleId":"D2","level":"warning","message":{"text":"AbsValue.convertTo (cognitive 24): AbsValue.convertTo has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, match/switch 3 (5 pts) (nesting depth added 6). 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/main/scala/esmeta/analyzer/tychecker/AbsValue.scala"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e95868f7f795acdfed7b69dc4ac9f561684a3ff9189ccf86621b7855303229"}},{"ruleId":"D2","level":"warning","message":{"text":"ValueTy.overlaps (cognitive 24): ValueTy.overlaps has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 19, if/else 5. 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/main/scala/esmeta/ty/ValueTy.scala"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f9ea0413294c4f434d9556824e98721bc49bbaca960049acf9afd3c18c7382"}},{"ruleId":"D2","level":"warning","message":{"text":"AO__GetSubstitution (cognitive 24): AO__GetSubstitution has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 3 (10 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/main/resources/polyfill/runtime/abstract/manual/GetSubstitution.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e4ef203249ff755f17fdeaec0aa0fc1e9979aa3757514d9a175398a48b3790"}},{"ruleId":"D2","level":"warning","message":{"text":"AbsTransfer.refineTypeCheck (cognitive 23): AbsTransfer.refineTypeCheck has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (10 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala holds 16 of the 76 methods over the threshold \u2014 including the worst \u2014 and 851 of the 1780 points over it (48%), 5.4\u00D7 the next-largest file (src/main/scala/esmeta/compiler/Compiler.scala at 159). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":1739}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c2a716996993eafb7a73da500bd30296c36cb3bfa57ccc90a78b731fd7f9db"}},{"ruleId":"D2","level":"warning","message":{"text":"DumpStepToNodeId.walk (cognitive 23): DumpStepToNodeId.walk has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 7 (10 pts), boolean chains 1 (nesting depth added 10). 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/main/scala/esmeta/dump/visualizer/DumpStepIdToNodeId.scala"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18aa0f028dca2c49506256b693f4202aa9c68bdf8dd43d5f83a8c82a7e1a126"}},{"ruleId":"D2","level":"warning","message":{"text":"NumberTy./ (cognitive 23): NumberTy./ has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 11, if/else 8 (10 pts), match/switch 1 (2 pts) (nesting depth added 3). 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/main/scala/esmeta/ty/NumberTy.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaeb2c1b410c369f8afb05cf0d0933532baaf0007d9d64f64133cb78734d4ca2"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordTy.update (cognitive 23): RecordTy.update has cognitive complexity 23 (threshold 15). Drivers by points: loops 3 (10 pts), if/else 6 (7 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/ty/RecordTy.scala"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"9404da1c4c78f84a865c74935d6eb10f21f573b2991667ec07aa6a5997d6aae2"}},{"ruleId":"D2","level":"warning","message":{"text":"ValueTy.|| (cognitive 23): ValueTy.|| has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 17, if/else 6. 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/main/scala/esmeta/ty/ValueTy.scala"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b9cf9b0010de81007eaa31ac7d3d3ea9f6f99e552c986a4b827787812a4adc"}},{"ruleId":"D2","level":"warning","message":{"text":"ValueTy.\u0026\u0026 (cognitive 23): ValueTy.\u0026\u0026 has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 17, if/else 6. 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/main/scala/esmeta/ty/ValueTy.scala"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c213dcebad2eb27dddab39b6749e6b21115a906930156d1bc72f3b6528d4b31a"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgParser.apply (cognitive 23): ArgParser.apply has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 6 (9 pts), boolean chains 1, loops 1 (nesting depth added 9). 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/main/scala/esmeta/util/ArgParser.scala"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed6591799fc008e42b59a425fffa978c77943c09bc29d6e7befc749c7fe4539"}},{"ruleId":"D2","level":"warning","message":{"text":"AbsTransfer.logProvenance (cognitive 22): AbsTransfer.logProvenance has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 6 (8 pts), loops 2, boolean chains 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala holds 16 of the 76 methods over the threshold \u2014 including the worst \u2014 and 851 of the 1780 points over it (48%), 5.4\u00D7 the next-largest file (src/main/scala/esmeta/compiler/Compiler.scala at 159). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e4477bf15d995fb80bb3d01ffbfa3284cbede228ba9ace2c99873275be9c26"}},{"ruleId":"D2","level":"warning","message":{"text":"AbsTransfer.transfer (cognitive 22): AbsTransfer.transfer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala holds 16 of the 76 methods over the threshold \u2014 including the worst \u2014 and 851 of the 1780 points over it (48%), 5.4\u00D7 the next-largest file (src/main/scala/esmeta/compiler/Compiler.scala at 159). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2094b8808b1d5149967936bd536c7d51bffba195124a797926b30aa91faa22e"}},{"ruleId":"D2","level":"warning","message":{"text":"FlattenIntoArray.AO__FlattenIntoArray (cognitive 22): FlattenIntoArray.AO__FlattenIntoArray has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (21 pts), 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/main/resources/polyfill/runtime/abstract/manual/FlattenIntoArray.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f540db18c6e68bff30d26e5716a235430cda55a8dbd2b399195e0f58009b1993"}},{"ruleId":"D2","level":"warning","message":{"text":"AbsTransfer.refineLocal (cognitive 21): AbsTransfer.refineLocal has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 3 (6 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala holds 16 of the 76 methods over the threshold \u2014 including the worst \u2014 and 851 of the 1780 points over it (48%), 5.4\u00D7 the next-largest file (src/main/scala/esmeta/compiler/Compiler.scala at 159). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2f88119fc64a8dd092fb62c07a20bc093dd9c2b72e0b878f2c499a6349fb6e"}},{"ruleId":"D2","level":"warning","message":{"text":"AbsTransfer.refineType (cognitive 21): AbsTransfer.refineType has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (7 pts), match/switch 1 (4 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala holds 16 of the 76 methods over the threshold \u2014 including the worst \u2014 and 851 of the 1780 points over it (48%), 5.4\u00D7 the next-largest file (src/main/scala/esmeta/compiler/Compiler.scala at 159). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb80917532e4e9411716307a068858ebe421d546cbb3a28d010efe9a7ae6e89"}},{"ruleId":"D2","level":"warning","message":{"text":"ValueAccessUnwrapper.walk (cognitive 21): ValueAccessUnwrapper.walk has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 7 (10 pts) (nesting depth added 9). 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/main/scala/esmeta/es/util/polyfill/completion/Unwrapper.scala"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd145bd43bde38b8d8e4a886e1fba881fd9ef91fd2d7a066c7b2846f04336d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Unifier.unifySubSteps (cognitive 21): Unifier.unifySubSteps has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (16 pts), if/else 3 (4 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (Unifier.unifyWithASteps) 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/main/scala/esmeta/es/util/polyfill/dsl/Unifier.scala"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"4470fc04eb4eb26b46538d91546da8c53be255b6f304e26c887a506d250cf5a5"}},{"ruleId":"D2","level":"warning","message":{"text":"Unifier.unifyWithASteps (cognitive 21): Unifier.unifyWithASteps has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (16 pts), if/else 3 (4 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (Unifier.unifySubSteps) 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/main/scala/esmeta/es/util/polyfill/dsl/Unifier.scala"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a306a7f78e25819c5935b2b0e116e5e1524eed4076ac0dd64899fa4ac7679c"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector.handlePropKeys (cognitive 21): Injector.handlePropKeys has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 6 (7 pts), error handling 1 (2 pts) (nesting depth added 9). 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/main/scala/esmeta/injector/Injector.scala"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80c38c2796f8045eabdae2cc4b94980c58c51115e24bff2bbb99ae51cf2b1ce"}},{"ruleId":"D2","level":"warning","message":{"text":"ArraySpeciesCreate.AO__ArraySpeciesCreate (cognitive 21): ArraySpeciesCreate.AO__ArraySpeciesCreate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, ternaries 2 (nesting depth added 5). Of this number, 11 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/resources/polyfill/runtime/abstract/manual/ArraySpeciesCreate.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"92af5c4efa0e76d7630b5cbeca0eaa27fea4ba615a41c33911e5375429fb4132"}},{"ruleId":"D2","level":"warning","message":{"text":"MapDataRemove.opt.default (cognitive 21): MapDataRemove.opt.default has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/resources/polyfill/runtime/internal/MapDataRemove.opt.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"047de248f07f3c8365e8305fe67fc2c7e4dd28811ce9aa27058e33bf6d69674b"}},{"ruleId":"D2","level":"warning","message":{"text":"exports (cognitive 21): exports has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/resources/polyfill/runtime/internal/MapDataRemove.opt.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"37592982b17826a36b2bbacd608c03b89f6a68017664e824b364abfa53adb9b2"}},{"ruleId":"D2","level":"warning","message":{"text":"CFGBuilder.translate (cognitive 20): CFGBuilder.translate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 5 (8 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/cfgbuilder/CFGBuilder.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"967a023b98974e85a9b7a89b73ab72fca870d4f67fdf47854b07e40c36bb7a25"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler.compile (cognitive 20): Compiler.compile has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 5 (10 pts) (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/main/scala/esmeta/compiler/Compiler.scala"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8673d1f12b15c0cb78e4ddc50825b923b49336985b343b4a11557d00797b6e3"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleSynthesizer.getCoveredFrom (cognitive 20): SimpleSynthesizer.getCoveredFrom has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (8 pts), if/else 5 (7 pts), match/switch 4 (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/main/scala/esmeta/fuzzer/synthesizer/SimpleSynthesizer.scala"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"820cc09ece8a7bea30a712f313768ad8a0060030fc42bfdb0724e07ddb8bc377"}},{"ruleId":"D2","level":"warning","message":{"text":"ESParser.parse (cognitive 20): ESParser.parse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4 (7 pts), boolean chains 2 (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/main/scala/esmeta/parser/ESParser.scala"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be2c71daf5b9db964bae214e9571431010da054a854eb6c278cbcc0c1039c90"}},{"ruleId":"D2","level":"warning","message":{"text":"YetCheck.apply (cognitive 20): YetCheck.apply has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/phase/YetCheck.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"610f0fa2381fd0795f33bde8ef0ded6977202bb99b72928a2c22193b1a18342a"}},{"ruleId":"D2","level":"warning","message":{"text":"RandomSynthesizer.synSymbol (cognitive 19): RandomSynthesizer.synSymbol has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (5 pts), loops 1 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/fuzzer/synthesizer/RandomSynthesizer.scala"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b146712eb4c680129320a8ae834071838e26e47b93b465cc4aba83a2134da80"}},{"ruleId":"D2","level":"warning","message":{"text":"Interpreter.eval (cognitive 19): Interpreter.eval has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/interpreter/Interpreter.scala"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7549353d30b6ee1fc0da8f611a98398e94060bcf0cf778979a71e8ddd4d6f3a"}},{"ruleId":"D2","level":"warning","message":{"text":"ValueTy.getSingle (cognitive 19): ValueTy.getSingle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, boolean chains 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/main/scala/esmeta/ty/ValueTy.scala"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"830d17c099bcf84ff579c241ff57ebcf47aa1b7246dd0ca57e5d5e2427f52808"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionCheckTransform.apply (cognitive 18): CompletionCheckTransform.apply has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 4 (7 pts) (nesting depth added 6). 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/main/scala/esmeta/es/util/polyfill/completion/rules/completion/CompletionCheckTransform.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2681decfcca2f94a38d725564b2bcda75102fa8e3a0576d397bb22fcd08c4724"}},{"ruleId":"D2","level":"warning","message":{"text":"AbsTransfer.instantiate (cognitive 17): AbsTransfer.instantiate has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (13 pts), match/switch 1 (3 pts), if/else 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala holds 16 of the 76 methods over the threshold \u2014 including the worst \u2014 and 851 of the 1780 points over it (48%), 5.4\u00D7 the next-largest file (src/main/scala/esmeta/compiler/Compiler.scala at 159). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"d772adc199becfcf2fdabf993537087333d77d58f44a643daaf91ed4b058d8c0"}},{"ruleId":"D2","level":"warning","message":{"text":"DumpSecIdToFuncInfo.apply (cognitive 17): DumpSecIdToFuncInfo.apply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (3 pts), match/switch 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/main/scala/esmeta/dump/visualizer/DumpSecIdToFuncInfo.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e6a648f496dfe935d151f41bdfd16e03b63c531c477e31eae9b87646b0d47f"}},{"ruleId":"D2","level":"warning","message":{"text":"Translator.compile (cognitive 17): Translator.compile has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 4 (5 pts), loops 1 (2 pts) (nesting depth added 7). 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/main/scala/esmeta/es/util/polyfill/Translator.scala"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"976478dddc95fc32838d84f9f7b151130c95bf1fe7578bd2ba1bcd40d13d2fb9"}},{"ruleId":"D2","level":"warning","message":{"text":"Unifier.unify (cognitive 17): Unifier.unify has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 5 (7 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/polyfill/dsl/Unifier.scala"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"26298573c8bdc05ba128fc5f89551e0f4c31ffca8d58056c20b21a09a368e5f7"}},{"ruleId":"D2","level":"warning","message":{"text":"DecoderWithType.decodeProduct (cognitive 17): DecoderWithType.decodeProduct has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (5 pts), loops 1 (3 pts), boolean chains 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/main/scala/esmeta/util/BasicJsonProtocol.scala"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc8ef1c31161b78c3bcc43f14666c45b6f0e9c9bf24e113eef53d3df84e5b90"}},{"ruleId":"D2","level":"warning","message":{"text":"AbsTransfer.apply (cognitive 16): AbsTransfer.apply has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 3 (7 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala holds 16 of the 76 methods over the threshold \u2014 including the worst \u2014 and 851 of the 1780 points over it (48%), 5.4\u00D7 the next-largest file (src/main/scala/esmeta/compiler/Compiler.scala at 159). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"91070e33fd31c67a2d798ba8d5ec679038d2b62d0a628407fd757129c477cce9"}},{"ruleId":"D2","level":"warning","message":{"text":"AbsTransfer.refine (cognitive 16): AbsTransfer.refine has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (14 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala holds 16 of the 76 methods over the threshold \u2014 including the worst \u2014 and 851 of the 1780 points over it (48%), 5.4\u00D7 the next-largest file (src/main/scala/esmeta/compiler/Compiler.scala at 159). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"91599bd287460e7821e9cd1f046d77ea14db0558f7e230e4c0cc9eb578e8fb6a"}},{"ruleId":"D2","level":"warning","message":{"text":"Extractor.extractSdoHead (cognitive 16): Extractor.extractSdoHead has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (14 pts), if/else 2 (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/main/scala/esmeta/extractor/Extractor.scala"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec607d2b10a200154002c854bf74c7ef2bece1b8d397098f49a3ff26a7e1c1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tychecker/AbsTransfer.scala: FileTooLong \u2014 1583 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1083 over it, 3.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/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"978e7cb7ad2297c186e24cd0082bb99607145bced8f5b6b6a301283797d39595"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Compiler.compile: MethodTooLong \u2014 compile runs 300 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 200 over it, 3.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/compiler/Compiler.scala"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b182ba899df666000ef7f30444fd993f13d02cd39139c672a5da97a2a464f10d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Stringifier: ClassTooLong \u2014 1048 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 648 over it, 2.62\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/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0e7b89527b7b760055f7b42d63c9d4f5a9079ea1367a3320c9cc16f93ad588"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: util/Parser.scala: FileTooLong \u2014 1169 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 669 over it, 2.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/main/scala/esmeta/lang/util/Parser.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d0d58ab48b356f33b3ba6b9cec815e814e2859fab9eaf856861f0b7b6112aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler/Compiler.scala: FileTooLong \u2014 1099 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: Compiler (31-1332). The bar is 500 significant lines; this is 599 over it, 2.20\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/main/scala/esmeta/compiler/Compiler.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f926ecc13880f9a7362fcb30f8884d84e6054ffd0e4077c7cec4ae82bb652f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: util/Stringifier.scala: FileTooLong \u2014 1055 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: Stringifier (11-1267). The bar is 500 significant lines; this is 555 over it, 2.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/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3ccad5122a9945ae84a74595782201c5aedd3102c0c292509f46d33c8e614a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TyChecker.reachable: MethodTooLong \u2014 reachable runs 209 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 109 over it, 2.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/main/scala/esmeta/analyzer/tychecker/TyChecker.scala"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"043075f571b83acc3586810043d1320bb540f4fb3dc5a2fd65435d6d92d5f40f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TyChecker.reachable: MethodTooLong \u2014 reachable runs 208 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 108 over it, 2.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/TyChecker.scala"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"996d6a6a372fc96d1c97aa485931afd898d2ebaf9e7faef03b3c68154c35c598"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TyChecker.getString: MethodTooLong \u2014 getString runs 207 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 107 over it, 2.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/TyChecker.scala"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2504deb5bd33dfcb44bd4a61791d6330438bab22842f05fddbaf326deb3617cd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Compiler: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.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/main/scala/esmeta/compiler/Compiler.scala"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae10cf565b77e26ee692845f45225bde4787ba29847448d13d3656c4d815d55"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AbsTransfer: 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":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"114a91d7a5b1ba6b508a79ce4201e561115bc18da13d1646ce2960dad4c7d242"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Debugger: 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":"src/main/scala/esmeta/web/Debugger.scala"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ae79d71c4dfcac1c8e95a28d3fa9d562796d3f45e12c79de66ea944fcf0237"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tychecker/TypeGuard.scala: FileTooLong \u2014 836 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 336 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/TypeGuard.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80021e5c69c1078262ec9b865320645315d0bc49ae6edcc49026dc0de0548a77"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BaseUtils: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\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/main/scala/esmeta/util/BaseUtils.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e9d8dbeabd54673d3b484849dc227aebaf9b779037c0cd6f638aba660d0ba5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Stringifier.stepWithUpperRule: MethodTooLong \u2014 stepWithUpperRule 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/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37dd44345229e867791751541d1ff26dd6a798753ba48288d57783265f2aeb2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Walker: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.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/main/scala/esmeta/lang/util/Walker.scala"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32cb05dc0f12859dd8477e0915d54ff4794d3ccbf018005212234b6d76c4903"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UnitWalker: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 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/main/scala/esmeta/lang/util/UnitWalker.scala"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62f8a3261c35423748a2ea7d0fe7592f4db6cab86964df01bc363b8b2ce4663"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IntTy: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 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/main/scala/esmeta/ty/IntTy.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60be96b4b29ff83394337faef0a74dc6fb99546d538ecb9ee7c77eb30107fd3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SystemUtils: 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/main/scala/esmeta/util/SystemUtils.scala"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac5e7e3cdb2fc513bdea89e338576cfcbf3e3dbdc75f00e422d146166c4480d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpreter/Interpreter.scala: FileTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded), about 64% of them inside a single declaration: Interpreter (25-513). The bar is 500 significant lines; this is 104 over it, 1.21\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/interpreter/Interpreter.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a032153a531ad566844da065ca4aa594e6f771f5eea7534b6030e74b1df2b5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MathTy: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/ty/MathTy.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0225c3d9739d8b111c701096a6a46e1d68dd949e9588f62db72e5ce6e454dab6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Stringifier.getTypeRule: MethodTooLong \u2014 getTypeRule 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/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"2410aa0ba805fae7d98439565dff08f0557c4b0eda1bc968d4a2c1776194b345"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Stringifier.condPrecedence: MethodTooLong \u2014 condPrecedence runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6065cd30f3348b589c13380909bc245f867438ee497fe1694a0a51fea3c4e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: polyfill/Translator.scala: FileTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 47 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/polyfill/Translator.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0034d3b21e23a86e91a296d1218b057c67015f1ad13fef5518796504c50cd9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/Debugger.scala: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: Debugger (15-788). The bar is 500 significant lines; this is 45 over it, 1.09\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/web/Debugger.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0459c5f58669796b68c8014c297857c0fcf03ab0826796db45294049e2ae94a6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Stringifier.valueTyRule: MethodTooLong \u2014 valueTyRule 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/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"678055943a219e1930a80f4e75040eab62f3d8c5a1da1296ee4d25c0d1f8cdeb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TyChecker: 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/main/scala/esmeta/analyzer/tychecker/TyChecker.scala"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca30b88c7867c508150a50bb42d022b85ea4e856d81a99b81ca8deb7aae4d821"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Interpreter.eval: MethodTooLong \u2014 eval 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/main/scala/esmeta/interpreter/Interpreter.scala"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"0946ebcfdd427a4768c70d01a7e0f6177e0b24a45e4d649db81f68496457e6e6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Stringifier.condRuleWithPrecedence: MethodTooLong \u2014 condRuleWithPrecedence 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/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"198dade4f00a324507e5a21b18488d296f39a811c6c43525d3adc14f41594a61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/main/scala/esmeta/web/Debugger.scala:278-299 | src/main/scala/esmeta/web/Debugger.scala:320-341 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/scala/esmeta/web/Debugger.scala:278\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/web/Debugger.scala"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c99fa9c371c1cd6f7ac5fbf0e25be0c99353d1976f6f1e2c72549276839115c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/main/scala/esmeta/web/Debugger.scala:272-287 | src/main/scala/esmeta/web/Debugger.scala:314-329 | src/main/scala/esmeta/web/Debugger.scala:407-422 \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/main/scala/esmeta/web/Debugger.scala"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3b2c5afa46df8104d60f1fddd3ebd0f3e9d974118460c620d9dabd79d18b51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala:973-987 | src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala:1004-1018 | src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala:1066-1080 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala:973\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"03391e6bc002920e0d35b2e09ca21ee52daa3880fedf291497c44944ec9663d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/main/scala/esmeta/ty/util/UnitWalker.scala:11-25 | src/main/scala/esmeta/ty/util/Walker.scala:11-25 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/ty/util/UnitWalker.scala"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a51cafeb1ac9b3a10e0f783a92086c7b785f2d271fdd8a211e7988a4e691d04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/main/scala/esmeta/fuzzer/mutator/StatementInserter.scala:82-95 | src/main/scala/esmeta/fuzzer/mutator/StatementInserter.scala:104-117 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/scala/esmeta/fuzzer/mutator/StatementInserter.scala:82\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/fuzzer/mutator/StatementInserter.scala"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1638d1f2bd92b194611d2bcc82764ffdf7028f1d6ddfbe3d2d2eac73fbf891fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/scala/esmeta/ir/util/UnitWalker.scala:9-21 | src/main/scala/esmeta/ir/util/Walker.scala:9-21 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/scala/esmeta/ir/util/UnitWalker.scala:9\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/ir/util/UnitWalker.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d493d4361580354e278f1077871f05ce34b4d11694fbafbf9687eea110aade"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/scala/esmeta/lang/util/UnitWalker.scala:8-20 | src/main/scala/esmeta/lang/util/Walker.scala:8-20 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/UnitWalker.scala"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95c5dcaf1bf9fa3c70df8858d1e67deb7e734a8bf7e8135784bf049f4c8441e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/scala/esmeta/lang/util/UnitWalker.scala:22-31 | src/main/scala/esmeta/lang/util/Walker.scala:22-31 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/UnitWalker.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3958ca85aba09d89aeba2537ed0aeda2e0e8d66d0550f521ad5f3a1200c456b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/scala/esmeta/analyzer/tychecker/TypeGuard.scala:462-469 | src/main/scala/esmeta/analyzer/tychecker/TypeGuard.scala:493-500 \u2014 both copies are in the same file, so extract the block into one function there 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/main/scala/esmeta/analyzer/tychecker/TypeGuard.scala"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e35e8e6e0c922661af638c3ed362fa06cfe4ab8bf0ba32577f5635fafc3027"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/scala/esmeta/dump/visualizer/DumpSecIdToFuncInfo.scala:71-77 | src/main/scala/esmeta/dump/visualizer/DumpSecIdToFuncInfo.scala:97-103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/scala/esmeta/dump/visualizer/DumpSecIdToFuncInfo.scala:71\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/dump/visualizer/DumpSecIdToFuncInfo.scala"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"08942444683520797d9ef990194dc412c98877320bf0a0dc162b25b07b8f407e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/scala/esmeta/es/util/polyfill/Translator.scala:154-159 | src/main/scala/esmeta/es/util/polyfill/Translator.scala:265-270 \u2014 both copies are in the same file, so extract the block into one function there 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/main/scala/esmeta/es/util/polyfill/Translator.scala"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e088f8d76b9e89378af5ebde20e4dd35c635447b15b985a83a88c8e8db8eb5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/scala/esmeta/ty/MathTy.scala:22-33 | src/main/scala/esmeta/ty/NumberTy.scala:185-196 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/ty/MathTy.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb55c3d5005d65e103263d194f91f98fec26ca507d6ea01d7f91394323e94a22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/scala/esmeta/web/http/route/BreakpointRoute.scala:12-20 | src/main/scala/esmeta/web/http/route/ExecRoute.scala:15-23 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/web/http/route/BreakpointRoute.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"154c1586938d539c093abca1739cef6e8399efd3220253b8bc02e6deda125b98"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Debugger (LCOM4 5): Debugger\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/main/scala/esmeta/web/Debugger.scala"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c3dea45276455281b8fbe2b8503f3bf922abed37dd27bd4a8758086deb90b2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Stringifier (LCOM4 4): Stringifier\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/main/scala/esmeta/ty/util/Stringifier.scala"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd23b7d6e55d9fc02ebefd4ec3564de1c7b9a3af26597797ecc660e5bcda459"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/esmeta/compiler/Compiler.scala: src/main/scala/esmeta/compiler/Compiler.scala changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in Compiler.compile at line 599. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 00:27:54 \u002B09:00\u0027 --until=\u00272026-11-04 00:27:54 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/esmeta/compiler/Compiler.scala\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/main/scala/esmeta/compiler/Compiler.scala"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"d211a51edebb9f4e4e69b013a21b449af034db31b48a76458b21b8f58243d4f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/esmeta/lang/util/Stringifier.scala: src/main/scala/esmeta/lang/util/Stringifier.scala changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in Stringifier.stepWithUpperRule at line 92. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 00:27:54 \u002B09:00\u0027 --until=\u00272026-11-04 00:27:54 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/esmeta/lang/util/Stringifier.scala\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/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4887f2f5a4414cdb8e2de2b8f746848fcdf497347a00996279a2240245b165"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/esmeta/lang/util/CaseCollector.scala: src/main/scala/esmeta/lang/util/CaseCollector.scala changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 125 in CaseCollector.walk at line 168. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 00:27:54 \u002B09:00\u0027 --until=\u00272026-11-04 00:27:54 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/esmeta/lang/util/CaseCollector.scala\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/main/scala/esmeta/lang/util/CaseCollector.scala"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e39f2b989932acfb05e69e0ea0ac768d95bfdd3faa1db5cb2147647ce8d038"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/esmeta/interpreter/Interpreter.scala: src/main/scala/esmeta/interpreter/Interpreter.scala changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in Interpreter.eval at line 572. 1 of those changes was a fix/bug commit, and the other 3 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 00:27:54 \u002B09:00\u0027 --until=\u00272026-11-04 00:27:54 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/esmeta/interpreter/Interpreter.scala\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/main/scala/esmeta/interpreter/Interpreter.scala"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"31496b1cb6448c1074a750342df17b3eda5a60d6d8e284cc851ee6d4f3d23b59"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/esmeta/lang/util/UnitWalker.scala: src/main/scala/esmeta/lang/util/UnitWalker.scala changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in UnitWalker.walk at line 133. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 00:27:54 \u002B09:00\u0027 --until=\u00272026-11-04 00:27:54 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/esmeta/lang/util/UnitWalker.scala\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/main/scala/esmeta/lang/util/UnitWalker.scala"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"334b99ccd208a18115c99576e6dad6c2ad72161a77e27da9a5cb8d54f8a80526"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/esmeta/lang/util/Walker.scala: src/main/scala/esmeta/lang/util/Walker.scala changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Walker.walk at line 165. 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-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 00:27:54 \u002B09:00\u0027 --until=\u00272026-11-04 00:27:54 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/esmeta/lang/util/Walker.scala\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/main/scala/esmeta/lang/util/Walker.scala"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5adcad5ccd7fa8d6b9e61bada9801d73176deefa3815df1cbce4affe72ec5fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/main/scala/esmeta/ty/NumberTy.scala: src/main/scala/esmeta/ty/NumberTy.scala changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in NumberTy.arith at line 110. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 00:27:54 \u002B09:00\u0027 --until=\u00272026-11-04 00:27:54 \u002B09:00\u0027 --full-history --no-merges -- src/main/scala/esmeta/ty/NumberTy.scala\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/main/scala/esmeta/ty/NumberTy.scala"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df78bdab46906eaa89515c8055e9ded643500432807c1f0682aa78ed2882892"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 2 significant file(s) lose their only recent owner: src/main/scala/esmeta/dump/visualizer/DumpNodeIdToProgId.scala, src/main/scala/esmeta/phase/DumpDebugger.scala. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"248645ce4b03fdc50bd882574cfea20371c1f00478759e22248cc59d970c7c61"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO refactor after supporting precise stringifier for lang types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/scala/esmeta/lang/TypeSmallTest.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"318fe0e7557255f2932d517049800b55dcd485578ffe900017e2d746fdeb71d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO refactor after supporting walkers for lang \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/scala/esmeta/lang/TypeSmallTest.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba787ffe5ede22b3f5975f0259b91dd52f0222b3d2fe318c28e4f6ca826e34d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO revert \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/scala/esmeta/es/AnalyzeSmallTest.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"692d4b711fd89cceda7594fe825154e370fb5a79cdb98bd2345768d04cae4c12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO ES code analyzer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/scala/esmeta/es/ESTest.scala"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb54e5e702cde908e2f4eddde427328f36034ac6f00cf1a951a064b2ce5b8d50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO analyze ES codes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/scala/esmeta/es/ESTest.scala"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f91f22a977a59366953dc83a2c0d24ddb2d234920ef1cae4b4d0937c916a21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO tests for ES analyzer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/scala/esmeta/es/ESTest.scala"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ee878ff53fb7c41e78723bf68c7ea3d9020cbd0ca52981da3a04c6bb7962ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO handle yet \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/web/Debugger.scala"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6dcc0c9ddcb2bbd27266e4af5ef62a7ec9b158f58125d88c1e287456280de2b"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX should throw exception if count is negative? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/web/Debugger.scala"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4eb8772e9f6a6ea18104f22896ecdb47a88eeeee1808a2f5ef84f982a4d6124"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO revert ESBreakpoint \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/web/Debugger.scala"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"f421697ebedd7e778694b460dae85129e2c3a0ec7d08b1d56947b2d9152f36ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should get these constants in a better way? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/web/Debugger.scala"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac0810974fcd94c062dcd659c0bbb21c26f1eaf33b049aad81833811aa1daca"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX temporary info for debugging debugger itself \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/web/Debugger.scala"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"beef57dc9c0c4a99a8453bc82d1884192a1278b8b3f772062f574a619751b430"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/util/BaseUtils.scala"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"f443411f84e85ad03f466cf06a044f074ff04d8f4dd8350070e37b978c4133eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/parser/ESParser.scala"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"6965aea8c234e1ac28d3dcd8615f5a1640f0b1712008b3587f4c4c8549dfb776"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/parser/ESParser.scala"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9f2eb34d83b18e8d0a655b3af3d2e56e4e058365c74b1b2ab348b756d63baa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/Parser.scala"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"022a6533bd498498e3fd4ff74fc5dfcc21e692e2bc74a40be18e6e8a5ac74081"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b46fefb56656be6626e3dd4f4771f48b9c1f4d3799b9181ac41237d40aa5073"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22808b8dc5159de7ea4829d425670622c4a345c6c9b9d46a77f54d793fa451f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/repl/command/CmdEntry.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f808810a55333689b1c8ab7ea2442f991a5c271f8600364c80cda6d9fc297da"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: add type name (i.e., { name: { ... } }) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/util/BasicJsonProtocol.scala"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be0726a1fed159890d1d4a8aedf5e1555f28eb14b180c896c0ab1dbf0ceb5c9"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: without discriminator \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/util/BasicJsonProtocol.scala"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"68897e24fc672b781daf8939c7bebfe72287c6c8d4d4ee2d4311975d70c5cab1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO check why this is needed and remove it if possible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/ty/RecordTy.scala"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d41d9ee50c226f96bdf4e9a8cfadf8438ae96858caab436fe7bd5c0da16431d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: type errors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/ty/util/JsonProtocol.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da0429e13bacd1bec1c75594d8fce2f68ddd5202c97a3fb7eb4d3b4a260f3ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: type error points \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/ty/util/JsonProtocol.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c3725ec876fd522cdc4a0e2475de636d80a9049d680a064eb5e5159846b550"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO astValue | \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/state/util/Parser.scala"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fad0ad709b1828e6ebfa077cab600d0bad0a74b83097b7b49dfac637188bac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO grammarSymbol | \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/state/util/Parser.scala"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e7b489d567952cfdc46fa84596b1a1000a070a2b7e9c2c75af582a7fa99b4d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: callStack \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/state/util/Parser.scala"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"34477b5d971d7a539ff9644d307b0e27f115a842be33e642f290bda541bf4c37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove this legacy parser later \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/spec/util/Parser.scala"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba33dafebcfe235412e0f83e338e12643530d8fa01f5da7d1446598729da766"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: for tables \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/spec/util/Stringifier.scala"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"daafd4262c06303b282e432678b5280195d90d646c22d82a87c84d8afe11ee72"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO warn unused elements in ignore file \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/phase/Extract.scala"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b273f8479c681724da3c1849addfb3ca1fea8cf2b58fe45fb2089c431aed0a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO handle in a more general way for indirect left-recursion \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/parser/ESParser.scala"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee22f2a0b646e349ac3a993c286de0c563660191e077bc15db3b8f71a3f7e3d"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX \u0060x ?.1 : y\u0060 is \u0060x ? .1 : y\u0060 but not \u0060x ?. 1 : y\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/parser/ESParser.scala"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba62482062e80ed8efa1145ad7b9986c4cc697fd2a9941639a60258957767ec"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX \u0060x ?.1 : y\u0060 is \u0060x ? .1 : y\u0060 but not \u0060x ?. 1 : y\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/parser/ESParser.scala"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b190931a39ed70196d1be0a6fb71937d587dffcf765e406f0eeae989b135969"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO more general rule \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/parser/ESParser.scala"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47116ad77dd712707c57881f1a835b97e583fd20f8143fbd55b40b4d4c01c1e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO more precise \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/parser/Lexer.scala"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba259b99376e19a5ac2642e4b847fa515ad14a9e5440ddbde6dac45b8b4b48c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO more precise \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48134db633be952102e6fd860f09c10ed2dee4c1f0955fedf477798429ff824"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO more precise \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"61885b3f2d7529b4789c3765bf700e1bbad019f281c9bab23f27c2e8061196b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO more precise \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e185da6bebf916d0bec80be39d3832798ec8695f96375a75e8de30fe55385a68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO more precise \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsState.scala"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e59ab92abff2480c110f74dc0569187a2fad619b7459c54139864fb0cc70d93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO automatically extract category \u0022Space_Separator (Zs)\u0022 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/parser/UnicodeParsers.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"35070429e2cc203fb50c9abf636f92fe121151d1731c27448523b21a52f3e4bc"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX use production literal? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/Condition.scala"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5bfa18ae824e484d2af5bfc9c57eda68dfdcd320ee5fcffd9388060589c1ee"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX need to be generalized? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/Expression.scala"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12ea03baeea01fd7cc4230606247e6dd9ec42e1c17958fe8fe0d57d373f8c18"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX need to be generalized? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/Parser.scala"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"0360f32e50e5ea16edc8cbccf02a86745f42af7076b5cd389503b909165e65c8"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX need to be generalized? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/compiler/Compiler.scala"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"0367938486af7dcc95d41e0eb96ddbd11108f98e131073093535f01741196e2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use only \u0022from\u0022 and remove this field \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/Step.scala"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea583ad9ddef7adecbc2181226d2dfc41d2fce604201b5e1d6ad6c855573faab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: simplify/remove config (https://github.com/tc39/ecma262/issues/3648)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/Step.scala"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a96744b702d0d64fec1937e7c4864f1b4ce0b4b7d953676334ec485d17427c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO cleanup spec.html \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/Parser.scala"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c850fe9d87d0e72273a0c439c4de63c0a713c1d79dc417ee53bd259ea9cc305"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO clean-up \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/Parser.scala"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cd5706cfecd123b4264cefb2760d06a89a674829416cfd1f6908765a58a7de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO more details \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/Parser.scala"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7420193577eefb17b0b61c3f6d63e06e31620b4d25ee1787484264510a55508"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO See https://tc39.es/ecma262/2024/#sec-typedarray-objects"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/Parser.scala"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d43cbbffb16634949790f8912c06769827f4c49670bb79031a031a93cadd06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: check existence of spaces \u0026 pass to stringifier \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/Parser.scala"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"21046cd27e5593139ed28574a16ed43aa73ef562b006303d19bec130ee715a8c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: return html class info \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/Parser.scala"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff55d5bea44d8643f2e631c567a0d3a7b118f42b87d36c44e0fe9ca574fa1aff"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX handle Contains, Contains always takes one argument \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"056850b64e67a68056c2a2402805f264c279f5bbd45c0249846d9ac21716d244"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO is/has \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d9323dda7224310e0ed6f441fa5e0b17daf03568f9c638259b56e41e4a7db8"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX not used \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/Stringifier.scala"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"922864d401c043bb53f14053a62e84605aabe38a436908d0d4bab702c235089b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO refactor following code \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/UnitWalker.scala"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"891b432e8ad88950b92310c2182075f2c3dc2c7993127afb19c4e6e8b2f54679"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/ir/util/UnitWalker.scala"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad5291f9b6f50aa58fa190c44cfcc1ba259c6c225eab3d730337e0ad3258a1d"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX fix last space in ECMAScript stringifier \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/interpreter/Interpreter.scala"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f414bec17295e8de2787f25b3476a94d726dd96bd2cbcf0d72269f15b3d3fe"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX ToApproxNumber is handled as ToNumber because the rounding of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/interpreter/Interpreter.scala"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"49640b7ec8c76d02e09006aeb542c32af1dac7e15a1da5ed07b0ea08aeab658d"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX Handle GeneratorStart \u003C-\u003E GeneratorResume arith mismatch \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/interpreter/Interpreter.scala"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"df28e04492e9a20af3e2c91337b0494e0754aadbe8d16f05ccf2764774540a2f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX rounded by DECIMAL128 only when the exact quotient has a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/interpreter/Interpreter.scala"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b60ea12d013775386c9cf37b5c5865cdd5f63240e09f7082d5efca673b978d5"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX approximated by double arithmetic, whose overflow becomes infinity \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/interpreter/Interpreter.scala"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be98e5d0beaca97a2b03990aaa2356e780cbd17617d3713cc109376f52c9d39"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO consider 2\u0027s complement 32-bit strings \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/interpreter/Interpreter.scala"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ee2f654ffbb7033d2d6f66b2749a36b67c17ef7f931ffff1f138863d699fa7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove this check in runtime type checker \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/interpreter/TypeChecker.scala"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd754cbdb4de14fbdeb7d4afb5badbcd1cee031aea277b6a96a9df19fd103627"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO more precise detection \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/injector/Injector.scala"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38d536fb0c97d367d61329c249dce95e6fcf0e690ecb4ae6693ffef7309ebff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@hyp3rflow): ignore exception thrown during executing injected assertions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/injector/util/Stringifier.scala"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59617474671283e0938cfbde633274d43d8e34f9466a2b40405db21c82babd1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: generalize to case where length of args is not 3 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/fuzzer/mutator/StatementInserter.scala"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e223a85560d6b8ce051a77d11fc08f331e6f688ce2833ea32077fab1401dd5c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: automatically generate this list \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/fuzzer/mutator/StatementInserter.scala"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44a53d04d52af1deb0d2235f1151a1769c6593da0ec39d19cf178121863dd87"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX load manually created algorithms \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/extractor/Extractor.scala"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ceaee67d52f97bcf45fb2228c5316aaf3bf68ea3c6f8a7603d66a6cfe566c5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO handle memory model \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/extractor/Extractor.scala"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6224dec7df24378e0e36249c7aad5eb9f14e045e40580b4d7bac72b8b18db1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO more general rules \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/extractor/Extractor.scala"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"94dd8d265510b5768ac7f8e446fe23b2fe8891974459e11e329b21f0f86d32ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO handle \u0060implementation-defined abstract operation\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/extractor/Extractor.scala"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d9d74b56101bd43d1d97e8d8adfea5a4b600e6947db03c2a49cf3b0cddad8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO automatic extraction \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/extractor/Extractor.scala"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc428520ba5bc956d4ecf56eaef5b567776f5a3704d5ba069e49bc7c45bca79"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO automatic extraction \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/extractor/Extractor.scala"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d4fd5c18b8c3ec1d1844b87cc2ab90bf66d64f61151c6f7dc3c48e82590cfd"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX ECMA-262 defines SDOs for productions of other specifications (e.g. ECMA-404)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/extractor/Extractor.scala"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d924d91572adf243ac8d3b0631bd3ad8efb297c76a161add529a9dd2ddbdfecf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove this case if possible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/Ast.scala"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"189b877615fd53df50546f1c0d3659c19db69733c3660a9533a02f9d87a24eb7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO ConformTest.createTest(cfg, finalSt), \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd93a547735fea60351dff70ec6984a75e7f345214d068c99ba72fdecd929ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: impl checkWithBlocking using \u0060blockingScripts\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3eaaa595360e497384b6c0fb8639bd09fbdc5b435eaf07e94a07c5bb568327b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO if (withScriptInfo) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"284dcee55ef46950be101a3a1f5ebd62ddf3774c592b6405f33a07fa2130f159"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO   dumpDir[(String, ScriptInfo)]( \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8ccc7c8863f68576eeb3edab82f816c898370d129caea0454ed760cbd10d89"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO     name = \u0022minimal ECMAScript assertions\u0022, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6caca38e7fa23dc762607cab723c1210d140206eb50648a4e74d45b71cbe8e1e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO     iterable = _minimalInfo, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"406df7c72e7b02232eee5aff48d71eec22ba8490284723770b40be0444116137"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO     dirname = s\u0022$baseDir/minimal-assertion\u0022, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cc7c0ed86a54d75b605d18219932c02c6a8b8bc9cf14c469fbefd92c23ec9a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO     getName = _._1, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"df77411b77518b14081c3a1038cc895d14814255297568d586a619a2bbb05df5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO     getData = { \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0b7e7c375b504e57fd11b3504cf2486e4cdbe749b44325edce5f202130857e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO       case (_, ScriptInfo(test, _, _)) =\u003E \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc240d0a98d19b577b89503949767b5c25ead628fe760b902381c5a68eebdd09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO         Yaml( \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"082870f5dbac942bf36eceb1d9da228dea085c6b720c25b5c3f1755b6c12cc2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO           \u0022tag\u0022 -\u003E test.exitTag.toString, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85b24ea27189a999127c69f6ba8998b224859cb0256117486d03ca108870408"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO           \u0022assertions\u0022 -\u003E test.assertions.map(_.toString), \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"5404afb6c6ad84ef94f1156794c22d18702875585b0ab0c4fc7648f2172f5b95"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO         ) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cffee0aaccfd595e357fa6e1c62e4acf76913608d5e8d529f317150126f9e6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO     }, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad8dcd17cc65f241de369243c1dc8523a487ee3b1dc007501d00b5766ecd9c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO     remove = true, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1682ced9a379a976039c478c5391b6171ffc81fc197e79c3063f54ac224359"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO   ) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"97159d7d08da39b3e41fbbbb0096daf508fa9fc5a79e44b07f368c3d51afe2b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO   log(\u0022Dumped assertions\u0022) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b59fddf52c569ea8a138dbdf1f34fe302f88141710ee6e8060351db01aabf8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO test: ConformTest, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Coverage.scala"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"4039be0f48c8b96c26aee00e47484bcbd00c2c0abe1de06a716f15172319a90d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO race condition: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/Engine.scala"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2ef73808e933ba46e661266c36bdfd090fab569b29a32f630c2d16dd295d60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Single-Runtime Assumption \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/polyfill/Translator.scala"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"3326b1f8da53cdeac55d0e9dc8f3292844f8a6a421f7bf5d78b251d7a9575c47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: handle unicode escape sequences properly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/es/util/polyfill/Translator.scala"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"a289a66e4678bdb78ecf780576053d00f70d318a0e59221067ed1e4215061c1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO change to abstract class after refactoring of error in interp \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/error/InterpreterError.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8d5ba711454314335dc54ef188031c02142ff515c4b8b67f0ab481250911d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: current IR does not support a set data structure. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/compiler/Compiler.scala"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ad4d17b2ef7482bd4e507479d61d31024b92936fab7daf8cdc9f4b06c03f7e"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX BUG in Static Semantics: CharacterValue \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/compiler/Compiler.scala"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f8477e6823dfe44bc2ba858677a7ea3b19029f702d8376f47275f8e654131a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO properly handle table column \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/compiler/Compiler.scala"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71e6229a714e2118b7fd083b9543d13fa1ab51956b046550ccefa53ebdb400d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO ClassTail[0,3].Contains \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/compiler/Compiler.scala"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10cea398b8c825a640943aac67db8df12f6ea4c9d9f434dc4c85a5fb49acc5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0022finite\u0022 is currently used for all three kinds of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/compiler/Compiler.scala"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"3542c37a68bad3ce83599ef2c02db3b2a583ec129b6ea76cb756e5a8e3503ef8"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX assume strict mode \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/compiler/Compiler.scala"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb5b73875a2f2038eff566b3e9173fa1b3147e7d5f933a2a11b2248a3d31ba8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO refactor \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/cfg/Node.scala"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57a77177f24a8f941863313435063a752e094a71ce408515d95beefa5465610"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/cfg/util/DepGraph.scala"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fca441a5855e65cbc0b3e1e6782f0ee67f1d1d9b693289e7be2d2c858ba624"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/cfg/util/DepGraph.scala"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb9dd6cbcb429d3bca1079b2b46054dd38cee216b23483788dc8b0a3bd4a99f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/cfg/util/DepGraph.scala"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b770ee8eb4944d7e8bc164512c348d779f706dc6b39e8cd6a3d2f556ece935"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO handle location option \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/cfg/util/Stringifier.scala"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"baadd09f0e5fe7c527912943f2c7465e933cad2e15c8a58723aa9b4af9c545f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO warning(s\u0022invalid access: $name of $ast\u0022) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsState.scala"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d3b22fe89f273d99fe2bf3e74ee6801da9535c0c2f68741b8239720578e55c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO for { \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsTransfer.scala"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"269d37e64b201821726e3f58f332b563630ab928d19e45fb505c138b4a3e22d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO handle \u0060list of code points\u0060 type \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsValue.scala"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d96292ba93482bac0aa1e2329b7064f46061a3077829853fe2fcc6e3c31dde"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX ignore UndefT case \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/AbsValue.scala"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd11ed7418eaa46d674536cd78e62e613520eab335e440f054de72d521b4b76"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // case IExpand(base, expr) =\u003E XXX: Unsound \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/TyChecker.scala"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cb1ef42003a0d606693290d2fbcef6dc2dd4b77eb972fac455b8104996236a"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // case IDelete(base, expr) =\u003E XXX: Unsound \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/TyChecker.scala"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5bf7d3404b2acee16a288f7462d43204b29ce5cfbf34d829c8b26814a2bf4c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: None -\u003E erased symexpr \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/TypeGuard.scala"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ad48680c70a45e98cf59ef10bbd3b679b9323c4a5594cebbcb559faf5bb9e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check later \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/analyzer/tychecker/TypeGuard.scala"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"b175cd4e0d825c95fe650080d7162b6108ca299f5bb5e920e721879fe28e7163"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022a. Set C to ? Get(C, %Symbol.species%).\u0022 repeats the code it sits on: 4 of its 4 words (set, get, symbol, species) are already in \u0060C = AO__Get(C, Symbol.species);\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/main/resources/polyfill/runtime/abstract/manual/ArraySpeciesCreate.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"140b91d34642406c027da55f288da261f88cf0f9c5c4aeb0cd2b1ceb356d936f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022b. If C is null, set C to undefined.\u0022 repeats the code it sits on: 3 of its 3 words (null, set, undefined) are already in \u0060if (C === null) C = undefined;\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/main/resources/polyfill/runtime/abstract/manual/ArraySpeciesCreate.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f1516bd4a4385e056df78357135b9f8b09588cc2b61414e4281a3f31f77640"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022v. If shouldFlatten is true, then\u0022 repeats the code it sits on: 3 of its 3 words (should, flatten, true) are already in \u0060if (shouldFlatten === true)\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/main/resources/polyfill/runtime/abstract/manual/FlattenIntoArray.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b687675ad1bb1a7bd83b2e38875bbf7c3f00be49d7dcc4281f1aa8cea9b485c"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 1 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (39900 LoC, 1177 module-visible types across 54 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"703b990f6d9a60db46de372b4bc3713bc769740b61be7dfed2b23b523664ac12"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"04cc6ef8b2713c5ae671a21c5adfc62ed3d32eec231bd27236ea49e066082d50"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"729e5bc298ad01143d3c74eded9450e85148cb8c1a021945ef116207704fc7f2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e2e429ff51605a7d4f4d4e56e68683ec2a23066d19fcca1c3469e90b2910f619"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"96f88121b035a898a6759141862415469563ae4858d3bd2449d90d5e5ba04a57"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc26593caf509b487cb3dff9d1a587737a02c72fc5e13e59c1a151f7d6412ad4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"baa151beff35ac46ee2536907cc918a207da07c42b004fec4c9aab8d58a6df6d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"36277bee0c8295bb8eb3bc0beb5fb978eebe1486d553ab0cd28084b35ebb8343"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bed8b6c4565c1ed5674880a2f12068c218ac86975baec7fb73cc9eae0bbdfa13"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fc22d3f11d84eda67ddc05ec9f2a88629a95fedc96bb65c2ad0abda1b665b7f6"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd2ab60f0744f0fa3ded8d666143bf909ab8a2e8348ad2ddd8a93156d3adc94a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a29df3c4b73b38337ac0c48c825ef6aace52faedb76536737648711426349e1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7edfd8f4f5bf8e12eaa030a7c42ab1e660cfefd97a58fe598164ecb96a02e3c9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbae55df5f85e32ca32b5237b845c7388ab1f1cff2e732654830f8f06acc6881"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"39451de74587221725a7677ec27f1c71876743158c7e193edfb70880489a1ef1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a188f821ace7c289cd01be0e09a03424d371748a196d67097e5ac79796e8b848"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2c4166be79e9aa7e837c513683b5086ecf29b436e3296997c673c6fc80abe02f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c6afb4b947beb3d287a081164ac7f69d7c0cd7979facb6c979c05c98e8df708"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c57b0f8369f27e25e776ff705e5c6f0a1bc35ef22e4bbcd739564d7735059a7e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62db435dd92914f7c1a58851da542e4961e41471635a9df48f2dc438a7828d39"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8fc967f9f4c8acc440d0b167deee13842320c74dec95ec75914b131be30161d2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62703f0ac3dadb070847cd2d71643dfd78704ba38aeefa89eb00cbc6efea77d7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03cfc608b7505d8dc94ee3fdd87c60fc4b81c056accce29e6d18478679e48443"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b253ee94d476c6d0f4ff3b945d2255a18586af308bdba600c569ffe858c5be88"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b4a6e56d4656188d6422a1011d0b2d447971e825ca98cf27e2fb5f9337987cc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15df622b3c2821a6c6dae9f118586d1877fcc1b3129d048dc39990df7b1d6318"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e95f43841a583e37816c7b8e73ed88b237c9ceeb70998d2d85d0b9fef68e4aa7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cbbd7039b05ddcf8247f75c53a46ddcabdd9694d92000b7f8887245272989ad5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a04472c4ff571199f8bc92fb3c62b08d5e7a8ff0b6346cc49132f1fb318a3952"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"7994daa2da59cfa797cfa249740bc37fdd50d79dc208133a424f5ff41f227749"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81ea43997ebc19400b78e9ccdb8445d91ffe79d18b49523ee24467fa4d5cdf09"},"properties":{"dependency":{"package":"jsoup","version":"1.18.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1c02027445a30a7a835529c7c644a4c3de206033bfd0a96d5fb7a35b96959bdc"},"properties":{"dependency":{"package":"http4s-ember-server_3","version":"0.23.30","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 2 of 131 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 131 of the 307 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: src/main/scala/esmeta/cfg/util/DotPrinter.scala, src/main/scala/esmeta/analyzer/tychecker/Effect.scala. 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":"src/main/scala/esmeta/cfg/util/DotPrinter.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b99564a2892503639262724aad02a3bec10ce6c52f8fdd0950cd07f9650a39"}},{"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/main/scala/esmeta/analyzer/tychecker/Effect.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9c486e56380ab13f1f3882dfa60bf39bfd61762e8ce6a32f63bf621f6e979a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: UnitWalker.scala \u2194 Walker.scala: \u0060src/main/scala/esmeta/lang/util/UnitWalker.scala\u0060 and \u0060src/main/scala/esmeta/lang/util/Walker.scala\u0060 change together 98% of the time (90 of the 92 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 90 shared commits counted here, the most recent 3 are \u0060f96e01b2\u0060 Change order in IRemove; \u0060bd65da77\u0060 Support \u0060array-find-from-last\u0060 feature (#226); \u0060c450e9f6\u0060 Update for ES2024 (#224) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/lang/util/UnitWalker.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb4a1ad736a9ed30b6831f5eecda19444d7c9fdc8b86cba268a80ef12a65808"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: UnitWalker.scala \u2194 Walker.scala: \u0060src/main/scala/esmeta/ir/util/UnitWalker.scala\u0060 and \u0060src/main/scala/esmeta/ir/util/Walker.scala\u0060 change together 84% of the time (26 of the 31 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 26 shared commits counted here, the most recent 3 are \u0060a82421c1\u0060 Replace \u0060EDuplicated\u0060 with \u0060__DUPLICATED__\u0060 aux function (#239); \u0060abb5198a\u0060 Replace \u0060IRemove\u0060 Instruction with \u0060__REMOVE_ELEM__\u0060 aux function  (#\u2026; \u0060841f827d\u0060 Replace \u0060EIsArrayIndex\u0060 with \u0060__IS_ARRAY_INDEX__\u0060 aux function (#235) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/ir/util/UnitWalker.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc329fc9ade6f5389760b072365c820751a3be482c16e48b9f7a9cf21b731225"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: Stringifier.scala \u2192 Compiler.scala, UnitWalker.scala, Walker.scala: \u0060src/main/scala/esmeta/ir/util/Stringifier.scala\u0060 changes together with 3 other files \u2014 \u0060src/main/scala/esmeta/compiler/Compiler.scala\u0060, \u0060src/main/scala/esmeta/ir/util/UnitWalker.scala\u0060, \u0060src/main/scala/esmeta/ir/util/Walker.scala\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/ir/util/Stringifier.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d88415fafcb5a01a4877ad002d9a68c1a0256bac5e7eb0da365ec02a86e571"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: Interpreter.scala \u2192 Stringifier.scala, UnitWalker.scala, Walker.scala, Condition.scala: \u0060src/main/scala/esmeta/interpreter/Interpreter.scala\u0060 changes together with 4 other files \u2014 \u0060src/main/scala/esmeta/ir/util/Stringifier.scala\u0060, \u0060src/main/scala/esmeta/ir/util/UnitWalker.scala\u0060, \u0060src/main/scala/esmeta/ir/util/Walker.scala\u0060, \u0060src/main/scala/esmeta/lang/Condition.scala\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/interpreter/Interpreter.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2f2fbb5df13f2d8e55f0e87cfae278567e223902389576fd6d40e192a40251"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: Stringifier.scala \u2194 UnitWalker.scala: \u0060src/main/scala/esmeta/cfg/util/Stringifier.scala\u0060 and \u0060src/main/scala/esmeta/ir/util/UnitWalker.scala\u0060 change together 50% of the time (20 of the 40 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 20 shared commits counted here, the most recent 3 are \u006097b2de4d\u0060 Refactored branch instructions with renaming ILoop into IWhile (#232); \u00603d5683b4\u0060 Supported return types of abstract algorithms (#57); \u006064b71742\u0060 Added build-cfg phase \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/cfg/util/Stringifier.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0333d1625652dc355ea814681bb258daae3ba75748ece9a40f9ba0a0d476d273"}},{"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":"81d0799af757bba1afbed34637d383ea39ed22bd8ff8ec5b09c5aa413595d701"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58e7d349bd99124160900bde747c06419544d176bc674aa97314dc3569848a97"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cbd7be50daf29ec12ad8fd6a120fad47e5548c285e52050f38defdaa27ba4a89"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1ccffb13426597bb8e98d05fdf5c8e9adfc41caf9627b0ab28bc5883e14c1f5d"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060tests/polyfill/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/polyfill/package.json"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"371b032a80daa91a0dc942b3090bfa8cc7ba03053e541439ef55bcbc14619d4c"}},{"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":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 197 plain JS \u2014 the untyped files are src/main/resources/assertions.js, src/main/resources/polyfill/runtime/abstract/manual/ArrayCreate.js, src/main/resources/polyfill/runtime/abstract/manual/ArraySpeciesCreate.js, src/main/resources/polyfill/runtime/abstract/manual/BigIntLessThan.js, src/main/resources/polyfill/runtime/abstract/manual/Call.js, src/main/resources/polyfill/runtime/abstract/manual/CanBeHeldWeakly.js (\u002B191 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): src/main/resources/polyfill/runtime/abstract/manual/CreateMapIterator.opt.js:9 \u00B7 src/main/resources/polyfill/runtime/abstract/manual/CreateSetIterator.opt.js:9 \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/main/resources/polyfill/runtime/abstract/manual/CreateMapIterator.opt.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b66db10d68dd769024686695073bf9383c0b7a9526cd485fa0fc33c2298155"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/main/resources/polyfill/runtime/abstract/manual/CreateMapIterator.js:7 \u00B7 src/main/resources/polyfill/runtime/abstract/manual/CreateSetIterator.js:11 \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/main/resources/polyfill/runtime/abstract/manual/CreateMapIterator.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f61e80da8b0b85ca9aec86f06882ab54e10be8503db31cde4ef5053ddc2e6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/main/resources/polyfill/runtime/internal/MapDataRemove.opt.js:19 \u00B7 src/main/resources/polyfill/runtime/internal/SetDataRemove.opt.js:22 \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/main/resources/polyfill/runtime/internal/MapDataRemove.opt.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"560aa2cb0bac1898cfe95fb2ccd5becade93e70d656d06e1176a931325af65ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/main/resources/polyfill/runtime/abstract/manual/CreateMapIterator.js:46 \u00B7 src/main/resources/polyfill/runtime/abstract/manual/CreateMapIterator.opt.js:41 \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/main/resources/polyfill/runtime/abstract/manual/CreateMapIterator.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2094e53e60bdbb2347ae511887c414f29e25b32e7719595c18397e80b8eece7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/main/resources/polyfill/runtime/abstract/manual/CreateMapIterator.opt.js:55 \u00B7 src/main/resources/polyfill/runtime/abstract/manual/CreateSetIterator.opt.js:54 \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/main/resources/polyfill/runtime/abstract/manual/CreateMapIterator.opt.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a4c618197fd55b11b92ef055bfa807c9bb0aeeb053a8b68b6f9c295c2175f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/main/resources/polyfill/runtime/abstract/manual/CreateSetIterator.js:54 \u00B7 src/main/resources/polyfill/runtime/abstract/manual/CreateSetIterator.opt.js:40 \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/main/resources/polyfill/runtime/abstract/manual/CreateSetIterator.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11928091674f26f58df947cbaf6b138f7a916a1913327a92411fee5a4ef3156"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/main/resources/assertions.js:91 \u00B7 src/main/resources/assertions.js:109 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/resources/assertions.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e37f87eb77419f0df8efcf91bcad7710d348285a44cad719830ca4f34c88ee7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/main/resources/polyfill/runtime/internal/MapDataIterate.opt.js:4 \u00B7 src/main/resources/polyfill/runtime/internal/SetDataIterate.opt.js:5 \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/main/resources/polyfill/runtime/internal/MapDataIterate.opt.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"048ea2e0d643d7350a65fc63f542f2f931f27b77d1672a7b8d8673f0325cbbc4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): src/main/resources/polyfill/runtime/internal/MapDataGet.opt.js:3 \u00B7 src/main/resources/polyfill/runtime/internal/MapDataHas.opt.js:3 \u00B7 src/main/resources/polyfill/runtime/internal/MapDataRemove.opt.js:3 \u00B7 src/main/resources/polyfill/runtime/internal/SetDataHas.opt.js:3 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/resources/polyfill/runtime/internal/MapDataGet.opt.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b2923d4bb59ac90729f4d64915d6ad5259bce8343b57ae4042709f3c6397b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 40, cognitive 62): main has cyclomatic complexity 40 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/polyfill/run.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6ea7c9e6184684947bd7304e16827e5f1a252199773d57ee3b96640579592b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runConfig (cyclomatic 14, cognitive 25): runConfig has cyclomatic complexity 14 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/polyfill/run.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3fb9543623ef4596e9ce5fd30623841333343d480bec65ee09ed041e315b70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AO__GetSubstitution (cyclomatic 13, cognitive 24): AO__GetSubstitution has cyclomatic complexity 13 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/resources/polyfill/runtime/abstract/manual/GetSubstitution.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3fc2ea1fc8f96b31bacf0f1116bbb9d1a322a1d156a483777b61b65f19bc57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function next (cyclomatic 13, cognitive 12): next 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/main/resources/polyfill/runtime/abstract/manual/CreateMapIterator.opt.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad028f1bf05e46ea81df9fd4bbb72711d1130e97634c2474db646b82ea38859"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exports (cyclomatic 12, cognitive 12): exports 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/main/resources/polyfill/runtime/internal/getFastkey.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6323472c600a9f856f5a33d9ef36f1eca398acbfee98d5a7ee00d7e2d7942ea2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function next (cyclomatic 12, cognitive 11): next 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/main/resources/polyfill/runtime/abstract/manual/CreateSetIterator.opt.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"433dee6e5887f5189f83bc62782a763c7e41e52af82df57782d72439219bc041"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exports (cyclomatic 11, cognitive 34): exports has cyclomatic complexity 11 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/resources/polyfill/runtime/internal/SetDataRemove.opt.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9c4ce9495e05dae4d84873f64e74c04ac8ae5d71d70c25f291b692d5c6f274"}},{"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":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027$verifyProperty\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/resources/assertions.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e2de0b1d8157906592e55621cb3254be69b33d810c92ae2c6d754d4540e68a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027$delay\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/resources/assertions.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe59404c8eb55a9227ededd59db655c62528c9920d9b11029d9bec2ffd880e3"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027test262-harness\u0027: Declared in tests/polyfill/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":"1a8b3f2f1838390201007cc08fc68e24da64e820b2e7a76e43abfa4e468bdbc8"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: This repository runs an HTTP server and nothing in its Scala source or committed configuration secures the transport: no HTTPS served (akka/pekko-http \u0060ConnectionContext.httpsServer\u0060/\u0060enableHttps\u0060, an http4s builder\u0027s \u0060withTLS\u0060, Jetty\u0027s \u0060SslContextFactory\u0060, zio-http\u0027s \u0060SSLConfig\u0060, Play\u0027s \u0060https.port\u0060), no \u0060Strict-Transport-Security\u0060 header, HSTS middleware or Play \u0060RedirectHttpsFilter\u0060, no \u0060X-Forwarded-Proto\u0060 read or Play \u0060play.http.forwarded.trustedProxies\u0060 for a TLS-terminating proxy \u2014 so its traffic may cross the network in clear text. (\u22122.0 on this card.) The server: src/main/scala/esmeta/web/http/WebServer.scala:10 \u2014 \u0060EmberServerBuilder\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8697c7a8b4c37084f15e81b8ec84d4cf62954730be74a0816d39b2127a21fd9b"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, \u2026) is set on a response this repository\u0027s Scala server sends \u2014 defense in depth, even when a proxy could set them. (\u22122.0 on this card.) The server: src/main/scala/esmeta/web/http/WebServer.scala:10 \u2014 \u0060EmberServerBuilder\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd19c680309417e132c0be93c2002123f0664b42afe6172b1319da65a6a57ba7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!O || typeof O !== \u0022object\u0022 || !hasOwn.call(O, STATE)\u0060 appears character-identically in 2 files \u2014 src/main/resources/polyfill/runtime/abstract/manual/CreateMapIterator.opt.js, src/main/resources/polyfill/runtime/abstract/manual/CreateSetIterator.opt.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/main/resources/polyfill/runtime/abstract/manual/CreateMapIterator.opt.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"619408fdc0dc5b0c21a795be371e481d71c809a4c49efc725ac00254592f5c1a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060argument === undefined || argument === null\u0060 appears character-identically in 2 files \u2014 src/main/resources/polyfill/runtime/abstract/manual/RequireObjectCoercible.js, src/main/resources/polyfill/runtime/abstract/manual/ToObject.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/main/resources/polyfill/runtime/abstract/manual/RequireObjectCoercible.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd5b3160e74ffaf861c25d0d4a51bab122e42564cc73bd6a1dd2108b773b39e"}},{"ruleId":"X18","level":"warning","message":{"text":"Disposable created and abandoned in the function that made it: \u0060Source.fromFile(\u2026)\u0060 opens something that has to be given back \u2014 a file descriptor, a socket, a directory handle \u2014 and its only use reads \u0060.mkString\u0060 through it and drops it, so this expression both creates the value and is the last place that can release it, and does not. Every call leaks one more open handle until the collector happens to reach it: \u0060Too many open files\u0060 under load, and on Windows a file that cannot be replaced or deleted while it is held. Open it with \u0060scala.util.Using.resource(Source.fromFile(\u2026)) { r =\u003E \u2026 }\u0060, which releases it on every path including a throw, or hold it and call \u0060.close()\u0060 in a \u0060finally\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/util/ArgParser.scala"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f367e259d79a5fad350919f75071c91e051d3e4f6bbe11fc5bf9bc27bedd0c34"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case e: Throwable\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/scala/esmeta/util/BaseUtils.scala"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1290d921f81c0809545dac3fbcd3dd0cb20b11bef1ac30f6fb4049675ac1693"}},{"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/main/resources/assertions.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"862aec933336bc8d35b955a49584e3a8e3066170c10229c4771846a5392d2def"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/resources/assertions.js"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9725502052458f5a2e32d1e05017cf6b2c141f525e360a08c554a6701c49f368"}},{"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/main/resources/polyfill/runtime/abstract/manual/CreateBuiltinFunction.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18c74b7e5679eecae43f756b0fd8de1ddbd5d6370e284c56911e6b0216f1605"}},{"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/main/resources/polyfill/runtime/abstract/manual/CreateBuiltinFunction.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"829e2751dfe8fae70603c01c283f0c3d70b73be45c0646ac4796b17d8c7eaec4"}},{"ruleId":"X5","level":"note","message":{"text":"Scala\u0027s null is not held to the type system everywhere: No build over this repository\u0027s 321 Scala product file(s) passes \u0060-Yexplicit-nulls\u0060, enables WartRemover\u0027s \u0060Null\u0060 wart or runs Scalafix\u0027s \u0060DisableSyntax.noNulls\u0060, so every reference type admits null and nothing reports a \u0060null\u0060 written into the code or returned from a Java API \u2014 the first one to reach a method call is a \u0060NullPointerException\u0060. \u0060Option\u0060 by convention is a habit no tool here holds the code to."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"23e7c3c6da50151f07723c64ca4f881fd5903e713d143161a7c0594ad7ba29cc"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"Reliance on Component That is Not Updateable","shortDescription":{"text":"Reliance on Component That is Not Updateable"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.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-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"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-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"}]}],"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":37,"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."]}]}