{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"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":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"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":"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":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"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":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF2","name":"Allocation hygiene","shortDescription":{"text":"Allocation hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF2"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"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":"index.html.jsonnetHint (cyclomatic 104): index.html.jsonnetHint has cyclomatic complexity 104 (threshold 15). Of this number, 100 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a668a4fb81579bcd1ff3550dfc05ec5866594f0855e9e248dc68e5e14773ac"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprTransform.rec (cyclomatic 83): ExprTransform.rec has cyclomatic complexity 83 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/ExprTransform.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2090d2cd182a82db46e946b5a6a727bf6b6d90ffbbaddf52a3eea1e5ea76e945"}},{"ruleId":"D1","level":"warning","message":{"text":"Materializer.hasSelfRefExpr (cyclomatic 81): Materializer.hasSelfRefExpr 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":"sjsonnet/src/sjsonnet/Materializer.scala"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f904b9f240c59ae2cc9135302dec83a1b578f1e47faabb659e13f1469d2b31"}},{"ruleId":"D1","level":"warning","message":{"text":"Format.format (cyclomatic 71): Format.format has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Format.scala"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"d554befc4ddb03e0ae4fa7d851fad7529e23b74eb36b7a37fecb60f6d2744dd5"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator.visitBinaryOp (cyclomatic 62): Evaluator.visitBinaryOp has cyclomatic complexity 62 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3851b2f745923b7bb681a27c90c26cf2be71fec6e3755bf13cb0e3cda8b47a"}},{"ruleId":"D1","level":"warning","message":{"text":"Format.scanFormat (cyclomatic 57): Format.scanFormat has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Format.scala"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea47dc8457ec594258bc532beb9aed16621e775e0088c8dd5408ecdde05b88f"}},{"ruleId":"D1","level":"warning","message":{"text":"Platform.yamlNodeToJson (cyclomatic 55): Platform.yamlNodeToJson has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-jvm/sjsonnet/Platform.scala"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef064f1d23f00032057d24c210b289b3d1f38c6044fe5eb16cd970b634427508"}},{"ruleId":"D1","level":"warning","message":{"text":"SjsonnetMainBase.main0 (cyclomatic 42): SjsonnetMainBase.main0 has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"427fb9e9e2950f2eedfe164ed9cb6b356490605f6168ed3e53f4cd313ee09c6b"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator.tryInlineArith (cyclomatic 42): Evaluator.tryInlineArith has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"408aecf0cce82ed476064d924be18633594abb65d058fc6bbd761ec40e9e29a9"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticOptimizer.transform (cyclomatic 41): StaticOptimizer.transform has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d84440bdf12b91f2bdbfc5e31830cb4b2a2477a01cb33eefb52ba546aa1979"}},{"ruleId":"D1","level":"warning","message":{"text":"SjsonnetMainBase.mainConfigured (cyclomatic 39): SjsonnetMainBase.mainConfigured has cyclomatic complexity 39 (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":"sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c331c3025a6e6f0728a6d0691124c509cd417e32ee90fc7bf3f89b9640228d"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator.visitMemberList (cyclomatic 39): Evaluator.visitMemberList has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc49fd6f54c3cb73de2dab79d1377c4047466415bf2b9423fc6a3faded4b270e"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.expr (cyclomatic 37): Parser.expr has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Parser.scala"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fc07cf725348c09b70ec439ab0cdf8f3f67a5d4561c6a5262ee0f46b95074d"}},{"ruleId":"D1","level":"warning","message":{"text":"Obj.valueRaw (cyclomatic 37): Obj.valueRaw has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Val.scala"},"region":{"startLine":2498}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f60f5a96a23385a63c0838432d80bd6ec73f7dac4dedc4f48123616cf44f76"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticOptimizer.tryFoldBinaryOp (cyclomatic 36): StaticOptimizer.tryFoldBinaryOp has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d07059484e398f3ecc6637d348846bd00a494fbf43c5647f111765c843f0d09"}},{"ruleId":"D1","level":"warning","message":{"text":"PrettyYamlRenderer.isYamlDateExact (cyclomatic 34): PrettyYamlRenderer.isYamlDateExact has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7ac3fffe7eefdab9f544a08790fd4a5606f82dd07ceb546fe01117338c73dd"}},{"ruleId":"D1","level":"warning","message":{"text":"Platform.nodeToJson (cyclomatic 33): Platform.nodeToJson has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-native/sjsonnet/Platform.scala"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"188ece08fa643e0e2ea9fccfbf97a5cc0c9bd0dd46b05086c734e9e5e582e35f"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator.visitExprWithTailCallSupport (cyclomatic 32): Evaluator.visitExprWithTailCallSupport has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"749f630bfefc99e99d7c427d9be473228a1fbe9f2c9c0c4cdabe3d55750aa738"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticOptimizer.tryFoldAsDouble (cyclomatic 31): StaticOptimizer.tryFoldAsDouble has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d6200e6e21d95e9146931be2764211e55543fc3851a703710b4c6237e831de"}},{"ruleId":"D1","level":"warning","message":{"text":"Platform.nodeToJson (cyclomatic 30): Platform.nodeToJson has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"2940a154995f37f68ceb4d10d9eea2348eb976b7a15fd1c8075570c0b48a70e5"}},{"ruleId":"D1","level":"warning","message":{"text":"PrettyYamlRenderer.writeDoubleQuoted (cyclomatic 29): PrettyYamlRenderer.writeDoubleQuoted has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59e2290103582a51253b4d3ea3746d899f18b674b06e12173cd4f660f46fecd"}},{"ruleId":"D1","level":"warning","message":{"text":"PrettyYamlRenderer.isYamlNumberExact (cyclomatic 29): PrettyYamlRenderer.isYamlNumberExact has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3156758d6be1158153b0858aef3acb57659dacdbd82d0589d6e613d7c9fff3"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.detectCodeMirrorMode (cyclomatic 29): index.html.detectCodeMirrorMode has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"534bc6633ced0309b94937d05d3acda46577e41f56535d8cf755b89730a7ecc6"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator.equal (cyclomatic 27): Evaluator.equal has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Evaluator.visitExprCold (cyclomatic 31) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":2142}}}],"partialFingerprints":{"codehealthFindingId/v1":"6433d261c59cf407c1c3d46949bcc532b112dc59461b6e274a683ba8be1ea281"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.expr2 (cyclomatic 27): Parser.expr2 has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Parser.scala"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"b764b28b1c46710e0ad126843454a559aa915d1c0a2438c10d1e7c7c9863b067"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticOptimizer.markTailCalls (cyclomatic 27): StaticOptimizer.markTailCalls has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"616c7b327a0f0fdbc3dd45483e23cbd00db8ccf593fad81821ed6d95f4dfb16e"}},{"ruleId":"D1","level":"warning","message":{"text":"Join.evalRhs (cyclomatic 27): Join.evalRhs has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/StringModule.scala"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"544aec360138de4c834dab02b750ec44836852a553cd8ba27704ce147c272a7c"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator.visitBinaryOpAsDouble (cyclomatic 26): Evaluator.visitBinaryOpAsDouble has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Evaluator.visitExprCold (cyclomatic 31) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefeb4b154b76fdcb99be9872f9fb4cff2b3230d7230c90d85cb1e66980fd674"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticOptimizer.hasNonRecursiveExit (cyclomatic 25): StaticOptimizer.hasNonRecursiveExit has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c1bf8b3e20d62ba7f72c1461f983a85c546f3d0dd318fc9e4910fce347d47b"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator.visitObjComp (cyclomatic 23): Evaluator.visitObjComp 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: Evaluator.visitExprCold (cyclomatic 31) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":1939}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3814a75582374bb588b29d6fcca7426d607393edf317eacb55131d065cf9ebf"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.objinside (cyclomatic 23): Parser.objinside has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Parser.scala"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"f906e334d7edb145308c64cfe7415995dcfac54053b40e10097fb52a28ef4984"}},{"ruleId":"D1","level":"warning","message":{"text":"PrettyYamlRenderer.isYamlOctalHex (cyclomatic 23): PrettyYamlRenderer.isYamlOctalHex has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db804b59626f18cd60909c64bc75fcf7a01b51dbd8035a1354867895bf20ee4"}},{"ruleId":"D1","level":"warning","message":{"text":"PythonRenderer.formatPythonFloat (cyclomatic 23): PythonRenderer.formatPythonFloat 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":"sjsonnet/src/sjsonnet/Renderer.scala"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11b577e11c4c2c913e8b4c3421b223d698400daf0886e5b9db8094086c4b466"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator.isInvariantExpr (cyclomatic 21): Evaluator.isInvariantExpr has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Evaluator.visitExprCold (cyclomatic 31) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"3711cb9e36dc68a991ae7e08c3b3789a930f1016d3ebfbd0a81dd37192834896"}},{"ruleId":"D1","level":"warning","message":{"text":"SetModule.sortArrSlow (cyclomatic 21): SetModule.sortArrSlow has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/SetModule.scala"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"6277136a7624eddd675f3576b4c86e0cc9e44a48fb944311082c88e8abe84af3"}},{"ruleId":"D1","level":"warning","message":{"text":"Platform.yamlScalarPrefixStart (cyclomatic 20): Platform.yamlScalarPrefixStart has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b58c39a8f84a4a7e7cc155f881c480167221e6ab8efaf98d596e184091e381"}},{"ruleId":"D1","level":"warning","message":{"text":"Platform.yamlScalarPrefixStart (cyclomatic 20): Platform.yamlScalarPrefixStart has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-jvm/sjsonnet/Platform.scala"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d492521ba20f2799b44e9eda922eb1be504e1d44e1cced84f0aebbacd18482"}},{"ruleId":"D1","level":"warning","message":{"text":"Platform.yamlScalarPrefixStart (cyclomatic 20): Platform.yamlScalarPrefixStart has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-native/sjsonnet/Platform.scala"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"de767159af8d22b377303413ae5a66292187e887d5115a2e35c34a651f4b7509"}},{"ruleId":"D1","level":"warning","message":{"text":"Func.apply (cyclomatic 20): Func.apply has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Val.scala"},"region":{"startLine":2822}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ffb826975d51b6e6f5f7fca8b38d66f6f27c059355fca2a3f0c3c51023e1fc"}},{"ruleId":"D1","level":"warning","message":{"text":"DecimalFormat.format (cyclomatic 19): DecimalFormat.format 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":"sjsonnet/src/sjsonnet/DecimalFormat.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f52867c47ff80c3490d27ea759c8029dbbdb25fca0c59303055bead9bb98cfe"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator.visitComp (cyclomatic 19): Evaluator.visitComp has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Evaluator.visitExprCold (cyclomatic 31) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d38efe14cdd74963c3823e0857ca02f179aedb0ef44133d8b1c9a7fe9e0b4b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Materializer.materializeStackless (cyclomatic 19): Materializer.materializeStackless 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":"sjsonnet/src/sjsonnet/Materializer.scala"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1737aa842620e5bbf058577b59029f7ea10573084c34c5b4ce39a1685066a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.tripleBarStringBodyBulk (cyclomatic 19): Parser.tripleBarStringBodyBulk 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":"sjsonnet/src/sjsonnet/Parser.scala"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"78141c07de6c3ff92020409bc35f2054b1725d70f0a7b09a4e0bc3862f4c9142"}},{"ruleId":"D1","level":"warning","message":{"text":"Materializer.hasSelfRefInMemberList (cyclomatic 18): Materializer.hasSelfRefInMemberList has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Materializer.scala"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb35534a3892fb617a29cc1efa7bbc56898958f0e44a46a9e3b228008e8545d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.getMimeType (cyclomatic 18): index.html.getMimeType has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"6056dd9f8022a906044838257037f313752eeb583d539250ef524e6fe87050cc"}},{"ruleId":"D1","level":"warning","message":{"text":"Util.slice (cyclomatic 17): Util.slice 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Util.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf14e0f1910fa36ecc381d79f85e69e4db09785a39cdb80e4aa123afc880648"}},{"ruleId":"D1","level":"warning","message":{"text":"ByteRenderer.materializeChild (cyclomatic 16): ByteRenderer.materializeChild 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":"sjsonnet/src/sjsonnet/ByteRenderer.scala"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"f019ace72ab2ac75e2a9ff1854a7b8019e0624d515470889b6d89be38c93694d"}},{"ruleId":"D1","level":"warning","message":{"text":"Error.formatError (cyclomatic 16): Error.formatError has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Error.scala"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d54a6f9664e42c9203c69509d80bc981416e4bcb9d6119617203125677625ff"}},{"ruleId":"D1","level":"warning","message":{"text":"PrettyYamlRenderer.isYamlFloatFromDot (cyclomatic 16): PrettyYamlRenderer.isYamlFloatFromDot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"f193f80f20756a555d28cb40857552b4b6945311aaa0e51bd61cf54ec7a7e05a"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticOptimizer.rebindApply (cyclomatic 16): StaticOptimizer.rebindApply 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":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e601f3962726f75601f5ef1a472907c09c9db46f8dc716a7cab98b9e19278b"}},{"ruleId":"D1","level":"warning","message":{"text":"Obj.addSuper (cyclomatic 16): Obj.addSuper has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Val.scala"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb095094d8487630da83506526c64efd550cc52af3bf975a727b262ab9de600a"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayModule.tryStringBuilderFromBinaryOp (cyclomatic 16): ArrayModule.tryStringBuilderFromBinaryOp has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"111e90d87ad2e26d21f8cd169df144ad8b43a631f59ace0ff2c0bc8180e6978b"}},{"ruleId":"D1","level":"warning","message":{"text":"Filter.evalRhs (cyclomatic 16): Filter.evalRhs has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"7269530d21ab301c318606de230534f6616ded4053595c741db91d57d1f2d3c2"}},{"ruleId":"D1","level":"warning","message":{"text":"ManifestModule.isXmlNameStartChar (cyclomatic 16): ManifestModule.isXmlNameStartChar has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/ManifestModule.scala"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f56a02e71779f728a28f9fe08636809aa8d54b9bc0122c8a748f5c3c32b4c76"}},{"ruleId":"D1","level":"warning","message":{"text":"ManifestTomlEx.renderTableInternal (cyclomatic 16): ManifestTomlEx.renderTableInternal has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/ManifestModule.scala"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"a623d2506faee9fa071dec67f10ba2b002050c7a88653a14da0e37d955740532"}},{"ruleId":"D1","level":"warning","message":{"text":"Clamp.apply (cyclomatic 16): Clamp.apply has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/MathModule.scala"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ba5323bf871e7c16217e7bd9f0f0773db6dff42977e4ee243bad36f4f44194"}},{"ruleId":"D2","level":"warning","message":{"text":"Format.format (cognitive 172): Format.format has cognitive complexity 172 (threshold 15). Drivers by points: if/else 50 (139 pts), match/switch 9 (25 pts), boolean chains 7, loops 1 (nesting depth added 105). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Format.scala"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"9865119811806ffcc89399f7cd297c1f67bf52c9997e3820dc9273d02d8562fa"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.jsonnetHint (cognitive 168): index.html.jsonnetHint has cognitive complexity 168 (threshold 15). Drivers by points: if/else 45 (97 pts), loops 15 (37 pts), boolean chains 32, ternaries 1 (2 pts) (nesting depth added 75). Of this number, 162 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9f02d13c39e929e873acc61cd961dc90b2a933f8c00a4ed85cee8da4b07cda"}},{"ruleId":"D2","level":"warning","message":{"text":"SjsonnetMainBase.main0 (cognitive 141): SjsonnetMainBase.main0 has cognitive complexity 141 (threshold 15). Drivers by points: if/else 35 (83 pts), loops 9 (45 pts), match/switch 3 (8 pts), boolean chains 5 (nesting depth added 89). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the 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":"sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"20206c635c77b9adbfc86e9454fef2dbdfbb32b4635c9c9423b9e8dbff793eed"}},{"ruleId":"D2","level":"warning","message":{"text":"Platform.yamlNodeToJson (cognitive 121): Platform.yamlNodeToJson has cognitive complexity 121 (threshold 15). Drivers by points: if/else 44 (81 pts), match/switch 5 (15 pts), loops 4 (13 pts), boolean chains 12 (nesting depth added 56). 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":"sjsonnet/src-jvm/sjsonnet/Platform.scala"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ff8e024e0f219d172c202611af6c159c526a7e1ea6d9d9a07b09c368028797"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprTransform.rec (cognitive 115): ExprTransform.rec has cognitive complexity 115 (threshold 15). Drivers by points: if/else 63 (94 pts), boolean chains 20, match/switch 1 (nesting depth added 31). 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":"sjsonnet/src/sjsonnet/ExprTransform.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bfae6266176e6e584d03d964603c3181f8c28515abf922d09f8b14d24414b5"}},{"ruleId":"D2","level":"warning","message":{"text":"Obj.valueRaw (cognitive 112): Obj.valueRaw has cognitive complexity 112 (threshold 15). Drivers by points: if/else 32 (78 pts), match/switch 4 (19 pts), boolean chains 12, loops 1 (3 pts) (nesting depth added 63). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Val.scala"},"region":{"startLine":2498}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0d71422a9d9875c3c18116c7eec9417fc3c61467ac178330b8eb903056fc6f"}},{"ruleId":"D2","level":"warning","message":{"text":"Format.scanFormat (cognitive 104): Format.scanFormat has cognitive complexity 104 (threshold 15). Drivers by points: if/else 37 (67 pts), loops 6 (18 pts), boolean chains 16, match/switch 1 (3 pts) (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Format.scala"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacf736303d5724ebaa7cfe1cb9fd2bce8dfcb191ff21d803a601f2fb5b70ebd"}},{"ruleId":"D2","level":"warning","message":{"text":"SjsonnetMainBase.mainConfigured (cognitive 82): SjsonnetMainBase.mainConfigured has cognitive complexity 82 (threshold 15). Drivers by points: if/else 18 (31 pts), match/switch 11 (23 pts), loops 5 (20 pts), error handling 4 (7 pts), boolean chains 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65c38668b3529f7ae39494ad123d72bcb34b4fe826ce3ccde6175c9c9fe7a58"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.visitMemberList (cognitive 76): Evaluator.visitMemberList has cognitive complexity 76 (threshold 15). Drivers by points: if/else 36 (56 pts), loops 4 (7 pts), match/switch 3 (7 pts), boolean chains 6 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d11a942eac8d0ebec60e4386aa1840d10a9caaceb21ae053af2d50b9f46269"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.visitBinaryOp (cognitive 73): Evaluator.visitBinaryOp has cognitive complexity 73 (threshold 15). Drivers by points: if/else 27 (49 pts), match/switch 10 (21 pts), boolean chains 3 (nesting depth added 33). 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":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"084c57c77d01758a2d98d674a640d410d9b654a3c6e8e1a35ee5a9a44998b8b5"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.visitExprWithTailCallSupport (cognitive 64): Evaluator.visitExprWithTailCallSupport has cognitive complexity 64 (threshold 15). Drivers by points: if/else 24 (42 pts), match/switch 8 (19 pts), loops 1 (3 pts) (nesting depth added 31). 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":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d010d9bbdb813f5afa0b6a3edb9649e66f4e6be8fbd6c6fca1bcdca7e391b0"}},{"ruleId":"D2","level":"warning","message":{"text":"Join.evalRhs (cognitive 64): Join.evalRhs has cognitive complexity 64 (threshold 15). Drivers by points: if/else 18 (43 pts), match/switch 4 (11 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 37). 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":"sjsonnet/src/sjsonnet/stdlib/StringModule.scala"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24689f5ce3c60833a12cc482f6355e8ff416440a971ac2b112a68efd2f9ddd2"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.visitComp (cognitive 60): Evaluator.visitComp has cognitive complexity 60 (threshold 15). Drivers by points: if/else 17 (42 pts), match/switch 5 (16 pts), boolean chains 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"2144d80711e15cc6187198bbd4ab2557296e1d0a07ade8a8b804963a23d8a532"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.equal (cognitive 59): Evaluator.equal has cognitive complexity 59 (threshold 15). Drivers by points: if/else 16 (42 pts), match/switch 5 (9 pts), loops 2 (6 pts), boolean chains 2 (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":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":2142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bdea74e1f67360bc8b14e9f01336ad7e0b944a3515dd14f2008da87172a48e"}},{"ruleId":"D2","level":"warning","message":{"text":"Func.apply (cognitive 58): Func.apply has cognitive complexity 58 (threshold 15). Drivers by points: if/else 22 (50 pts), loops 2 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Val.scala"},"region":{"startLine":2822}}}],"partialFingerprints":{"codehealthFindingId/v1":"6463a8289f547afdd26b95f86edcde590c5f9a9b5d3e890e5b572f510b18c377"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.tryInlineArith (cognitive 56): Evaluator.tryInlineArith has cognitive complexity 56 (threshold 15). Drivers by points: if/else 29 (45 pts), boolean chains 10, 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":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b28ad475f9ac18d050a7fd879ff70bd15978b82a0f50d27e5701ca6e14ca54"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.visitObjComp (cognitive 54): Evaluator.visitObjComp has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (39 pts), loops 3 (10 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":1939}}}],"partialFingerprints":{"codehealthFindingId/v1":"986969a0d2c5fa694ac9f51f5c78c9523b011725fd4eb9377f960f8af20406cb"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.objinside (cognitive 54): Parser.objinside has cognitive complexity 54 (threshold 15). Drivers by points: if/else 23 (39 pts), match/switch 5 (12 pts), boolean chains 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Parser.scala"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad542baaea2c7cbd21c9a54a40439999c2d43aa10a86bc7a5267c8eeb12d0a6"}},{"ruleId":"D2","level":"warning","message":{"text":"SetModule.sortArrSlow (cognitive 54): SetModule.sortArrSlow has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (33 pts), loops 6 (21 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/SetModule.scala"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c493a6039d932bd71528d03e711b2eaebb9ee69ca5c58e75f34b8f436d64ef3"}},{"ruleId":"D2","level":"warning","message":{"text":"DecimalFormat.format (cognitive 52): DecimalFormat.format has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (38 pts), loops 3 (11 pts), boolean chains 2, match/switch 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":"sjsonnet/src/sjsonnet/DecimalFormat.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7be6a15baaba00963741f30f674266804957c83fb9729e705851195312e423f"}},{"ruleId":"D2","level":"warning","message":{"text":"Materializer.materializeStackless (cognitive 50): Materializer.materializeStackless has cognitive complexity 50 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 4 (12 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Materializer.scala"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba21bb117f64cf627acac67e97319868713f84f47d87b6f81d6b24b56d6a97ff"}},{"ruleId":"D2","level":"warning","message":{"text":"Filter.evalRhs (cognitive 50): Filter.evalRhs has cognitive complexity 50 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 6 (20 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e158c2f3bcd9263c83c3e5fedb77a901421b5408214195211bbaa7adc7c3e91"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticOptimizer.tryFoldBinaryOp (cognitive 46): StaticOptimizer.tryFoldBinaryOp has cognitive complexity 46 (threshold 15). Drivers by points: match/switch 12 (23 pts), if/else 17 (21 pts), boolean chains 1, error handling 1 (nesting depth added 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. 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":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ac3d5508354ca25ff1a173e655a4ee99ff1a453327288f47632c48e78ec24a"}},{"ruleId":"D2","level":"warning","message":{"text":"Materializer.hasSelfRefExpr (cognitive 45): Materializer.hasSelfRefExpr has cognitive complexity 45 (threshold 15). Drivers by points: boolean chains 32, if/else 6 (8 pts), match/switch 3 (5 pts) (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Materializer.scala"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"52761704db67e6da4a5fb8d512551ac806f7d60da3c4ae93c5dc8b244c2345be"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.tripleBarStringBodyBulk (cognitive 45): Parser.tripleBarStringBodyBulk has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 3 (11 pts), boolean chains 8, match/switch 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Parser.scala"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"2309f4ddf29093df12e70d6274e7763f73719a07b62f92e4f36ed74c46925f8d"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonRenderer.formatPythonFloat (cognitive 45): PythonRenderer.formatPythonFloat has cognitive complexity 45 (threshold 15). Drivers by points: if/else 28 (36 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 10). 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":"sjsonnet/src/sjsonnet/Renderer.scala"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"96faba748f01854c840aed515c11c65ff646380af82d37b814861360f8829436"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticOptimizer.tryFoldAsDouble (cognitive 43): StaticOptimizer.tryFoldAsDouble has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (36 pts), match/switch 3 (5 pts), boolean chains 1, error handling 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"782933623bc077771bc384319785fe113a6fd38a9ec20c1c03b015a46213fd7f"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayModule.tryStringBuilderFromBinaryOp (cognitive 42): ArrayModule.tryStringBuilderFromBinaryOp has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 4 (10 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"47bf3b4570d7aa10269baf8b9a9477121f70c6998157202884a8d3c6d4624241"}},{"ruleId":"D2","level":"warning","message":{"text":"Platform.nodeToJson (cognitive 41): Platform.nodeToJson has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 4 (11 pts), boolean chains 6, loops 2 (4 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":"sjsonnet/src-native/sjsonnet/Platform.scala"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0773a1eddc01efd43006a1a5a2f5c573af1d19157dc0cc6a0714c81a315177e"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyYamlRenderer.writeDoubleQuoted (cognitive 40): PrettyYamlRenderer.writeDoubleQuoted has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 9, match/switch 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"f475cac060fc3bab17c0b04362b51c4243bf086085e3660cf52990d5affc39e7"}},{"ruleId":"D2","level":"warning","message":{"text":"ManifestTomlEx.renderTableInternal (cognitive 40): ManifestTomlEx.renderTableInternal has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 4 (7 pts), match/switch 1 (3 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":"sjsonnet/src/sjsonnet/stdlib/ManifestModule.scala"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99223582781fbfb8a3315839b97401e1e770c75d23af0ed84724dd137d6b41b"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyYamlRenderer.isYamlNumberExact (cognitive 39): PrettyYamlRenderer.isYamlNumberExact has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 13, loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bfa965b799a5b224a9d1b1ef9ea4f9dd1a578ea86b5c15992e64c1bc9ad09f"}},{"ruleId":"D2","level":"warning","message":{"text":"Materializer.hasSelfRefInMemberList (cognitive 38): Materializer.hasSelfRefInMemberList has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 3 (6 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Materializer.scala"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7d09c11c458fe36a9a59d8e43ae73c98c221620850b43e00d3e0ffb06614f6"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyYamlRenderer.isYamlDateExact (cognitive 37): PrettyYamlRenderer.isYamlDateExact has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 12, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eeaadf0f921ddb32f90cf3ba4a5cce0e74bdc0e928862941757207ba15b9faa"}},{"ruleId":"D2","level":"warning","message":{"text":"Error.formatError (cognitive 36): Error.formatError has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 5 (13 pts), boolean chains 3, 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":"sjsonnet/src/sjsonnet/Error.scala"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a2549fba4612f4c3e551e627e5d2d28f80ceb317d3c80fb009f385eeca19d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Platform.nodeToJson (cognitive 35): Platform.nodeToJson has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 3 (7 pts), boolean chains 6, loops 2 (4 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"920843caed469a15c14ad1cb2e02803226df6f081bd266f89b944f42959cc57d"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticOptimizer.transform (cognitive 35): StaticOptimizer.transform has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 7 (13 pts), error handling 3 (7 pts), boolean chains 2 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a43c78d4d32d4e18973ca870c763fc9780da032377a9cfc9cb5eda38921928"}},{"ruleId":"D2","level":"warning","message":{"text":"Obj.addSuper (cognitive 34): Obj.addSuper has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Val.scala"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"10473a227fc32014cb89984f8960ffa503f20fb4cbb8f8c6324ce017242c8da5"}},{"ruleId":"D2","level":"warning","message":{"text":"Util.sliceStr (cognitive 33): Util.sliceStr has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (6 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Util.scala"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e457ebe00916b78145229e5c1ff1dfa92bd035fab2860b8e7b70725df225b1c1"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyYamlRenderer.isYamlOctalHex (cognitive 32): PrettyYamlRenderer.isYamlOctalHex has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 10, loops 2 (4 pts), match/switch 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":"sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca407761af9fe81954ebfdf06070cef71908dfa83ed88f8ef64bf928a74c954a"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticOptimizer.markTailCalls (cognitive 32): StaticOptimizer.markTailCalls has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 7, match/switch 2 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"b624f7fb8de7e13777bc3e5a4146e88c6a0413235cb896bafbe4f81a67b27fec"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.visitBinaryOpAsDouble (cognitive 31): Evaluator.visitBinaryOpAsDouble has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 1, match/switch 1 (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":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"29dcd845a4b1f69b242c80be1c4fac6f8f4c97fbfa2b29a0cc9ffddef44dbb7b"}},{"ruleId":"D2","level":"warning","message":{"text":"ScopedExprTransform.nestedConsecutiveBindings (cognitive 30): ScopedExprTransform.nestedConsecutiveBindings has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/ScopedExprTransform.scala"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc8b656f314545b3d7c98e0af1234f51f422e52df0f544ea455f170df445704"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticOptimizer.rebindApply (cognitive 30): StaticOptimizer.rebindApply has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 8 (22 pts), if/else 8 (nesting depth added 14). 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":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6b00e28bc4ea0a32ec8fc862362169493347d25498bd335bb8f4e24fbf43ed"}},{"ruleId":"D2","level":"warning","message":{"text":"Platform.yamlScalarPrefixStart (cognitive 27): Platform.yamlScalarPrefixStart has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 8, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8a8a990e1eaef7fced7267466de5987948f1d07ac23f1d1c1a38ef03c729f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Platform.yamlScalarPrefixStart (cognitive 27): Platform.yamlScalarPrefixStart has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 8, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-jvm/sjsonnet/Platform.scala"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9edf13c89956962c3d18623c3f10ae618029c66ddbebc22393387a0f9b7bbe0"}},{"ruleId":"D2","level":"warning","message":{"text":"Platform.yamlScalarPrefixStart (cognitive 27): Platform.yamlScalarPrefixStart has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 8, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-native/sjsonnet/Platform.scala"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c034aa48b4a6a1886fd95e28f03523071e61f3bb92d3591046b860fe923a6a"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.visitLookup (cognitive 27): Evaluator.visitLookup has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 4 (7 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":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcc886c5b2fc59a88891e5c122dd27e9d803a907ace35ccbc382a6eaf336717"}},{"ruleId":"D2","level":"warning","message":{"text":"Obj.value (cognitive 27): Obj.value has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Val.scala"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0528807ab1cd5f46ae600edc5e0a534b808862e05343dc5cddcfda7d65a4f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.visitCompFused (cognitive 26): Evaluator.visitCompFused has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (8 pts), match/switch 3 (5 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":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb991f16af79d82dccb7d2aaaefd90a4986836b4596e647a11ba49b2366a5d7"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticOptimizer.hasNonRecursiveExit (cognitive 26): StaticOptimizer.hasNonRecursiveExit has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 7 (12 pts), boolean chains 7, if/else 7 (nesting depth added 5). 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":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3474f78a0ce7f21ece2031d5a62575d2da13dd8c843da996cbb1acd8c61f5e7"}},{"ruleId":"D2","level":"warning","message":{"text":"Clamp.apply (cognitive 26): Clamp.apply has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/MathModule.scala"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc3eb05f0650571087978a5bffe0935c595ab842976293a04131719edc90672"}},{"ruleId":"D2","level":"warning","message":{"text":"StringModule.parseHexNat (cognitive 26): StringModule.parseHexNat has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/StringModule.scala"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07fa0362a1bdbc2a416579f408b97098790b08c77c3345a9ba314a568937c6b"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayModule.tryStringBuilderFromIfElse (cognitive 25): ArrayModule.tryStringBuilderFromIfElse has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (17 pts), if/else 6, boolean chains 2 (nesting depth added 11). 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":"sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac586c1a52e8bfb469e0cfcd726a6d5fb2de3b346fb57aa4446107af837c24f6"}},{"ruleId":"D2","level":"warning","message":{"text":"StringModule.lastSplitIndex (cognitive 25): StringModule.lastSplitIndex has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/StringModule.scala"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c564815e07bd2f3c4ebc08fe45e9420d4e4db0d06e27887da1d96a71835729"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.compare (cognitive 24): Evaluator.compare has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (10 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":2100}}}],"partialFingerprints":{"codehealthFindingId/v1":"777b58cc63e39981bbd1354ee9d7843f57135d9cbb67eab38719e5e1ae4cb8b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Join.joinedRepeatedString (cognitive 24): Join.joinedRepeatedString has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (8 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/StringModule.scala"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"38eb9f756e05e42a58ef35452fc3d783915b0dfd6f68d10863369e69efabc6dc"}},{"ruleId":"D2","level":"warning","message":{"text":"Format.formatGeneric (cognitive 23): Format.formatGeneric has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Format.scala"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ba565a6fed9c98b4607604ebeaac79c7bf3c5a288e4586e863c3e574360901"}},{"ruleId":"D2","level":"warning","message":{"text":"Substr.evalRhs (cognitive 23): Substr.evalRhs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/StringModule.scala"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1765f3fd5ef304919c638210bce43a7350130e376c30e80fa32fa7bfb4739f0"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.detectCodeMirrorMode (cognitive 23): index.html.detectCodeMirrorMode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15, boolean chains 8. 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":"playground/index.html"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd53d4c3aa5fda4048e853f608efbee92811a697e8420e4a33c6f2171baeacc"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.importLoader (cognitive 23): index.html.importLoader has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":2304}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc0a69d81cbbb69d831d1be3d80760b90b48001eafc9f9b832fedd6eac749aa"}},{"ruleId":"D2","level":"warning","message":{"text":"Format.widen (cognitive 22): Format.widen has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Format.scala"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"5581ad76c804df66134423a5920bbe8593aa39f0ea8f9121c9eeefc0c6c7afc3"}},{"ruleId":"D2","level":"warning","message":{"text":"Materializer.materializeInlineObj (cognitive 22): Materializer.materializeInlineObj has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Materializer.scala"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"34518263d533e5d06dd8108a3c03887a27696c6b30057840fd96b82d7a714ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.expr (cognitive 22): Parser.expr has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 6 (9 pts), loops 1 (nesting depth added 11). 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":"sjsonnet/src/sjsonnet/Parser.scala"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd16f4f84d94c4a9578a6ce76c860392aa22d487b0c1d2eba642de79751e5b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.visitComp (cognitive 21): Evaluator.visitComp has cognitive complexity 21 (threshold 15). Drivers by points: loops 3 (8 pts), match/switch 3 (7 pts), if/else 3 (6 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"66693d226b16c68829c7d75c715f0d14ab86641c2b3d2e6adc72005b99ff353f"}},{"ruleId":"D2","level":"warning","message":{"text":"Materializer.quickSortInlineOrder (cognitive 21): Materializer.quickSortInlineOrder has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (9 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Materializer.scala"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"798a66efc4867196ad7c1c4ec4fa5f1f432875673ed2498503972a00ad2c0272"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.number (cognitive 21): Parser.number has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Parser.scala"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a434f20f9cf965ba17578085f9a718fee893b9940c47f36e96eebc81bfacb03"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.describeWhitespace (cognitive 21): Parser.describeWhitespace has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Parser.scala"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be96b3e309f1b1d5206e75f58305537d895fef87988e44886d93173b4ac29d7"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticOptimizer.rebind (cognitive 21): StaticOptimizer.rebind has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"4faf386a37e56502b255ba78c2500c6286968c83a9890e8df21773f3437f5ae9"}},{"ruleId":"D2","level":"warning","message":{"text":"FastLongRenderer.writePositiveIntDigits (cognitive 20): FastLongRenderer.writePositiveIntDigits has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (20 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":"sjsonnet/src/sjsonnet/FastLongRenderer.scala"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"641e318246a7ab1c0f1e755b6c2102f68d76382c890e1b09595ead96d87d4b42"}},{"ruleId":"D2","level":"warning","message":{"text":"LazyViewArr.asLazyArray (cognitive 20): LazyViewArr.asLazyArray has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Val.scala"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8212236b1932621a8634fd1625a71b1dd0be8e563513a6db7b7cdb7f73b2be8"}},{"ruleId":"D2","level":"warning","message":{"text":"Func.computeEffectiveIdentity (cognitive 20): Func.computeEffectiveIdentity has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (5 pts), loops 3 (4 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Val.scala"},"region":{"startLine":2733}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bbebb5c2540675cade3edd31673784163c4749b8058d66939e895cffd86b64"}},{"ruleId":"D2","level":"warning","message":{"text":"Join.joinPresizedStringArray (cognitive 20): Join.joinPresizedStringArray has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (4 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/StringModule.scala"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"486d8e7806dca6f63e78f629d5876f0669d9667b5200e35283453fb927aa7638"}},{"ruleId":"D2","level":"warning","message":{"text":"SjsonnetMainBase.parseBindings (cognitive 19): SjsonnetMainBase.parseBindings has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffe8f9d8d6441ad75607c5c3853810b60d9552e89ad52e907fa9feabd9ff9e1"}},{"ruleId":"D2","level":"warning","message":{"text":"Interpreter.evaluateImpl (cognitive 19): Interpreter.evaluateImpl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (7 pts), error handling 4 (6 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Interpreter.scala"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eae45dede1ab12ba07881f54b0386a560ac410d14867dc87878b7217c1e5cec"}},{"ruleId":"D2","level":"warning","message":{"text":"Foldl.evalRhs (cognitive 19): Foldl.evalRhs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts), match/switch 2 (3 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":"sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"f495b4cf1d9424d9df9e7a04bd5305510b434b8933f308706550a41b8668e742"}},{"ruleId":"D2","level":"warning","message":{"text":"Join.joinDirectStringArray (cognitive 19): Join.joinDirectStringArray has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/StringModule.scala"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea362053a9d7b7d47e63355f2c33ad430d554f1f3a27e850f46e5adc61f1831"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.compilePureCompBody (cognitive 18): Evaluator.compilePureCompBody has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f8297a9681fcf31a699bdd82dd0d007021801442b8467776fe01677ebc9b38"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyYamlRenderer.isYamlFloatFromDot (cognitive 18): PrettyYamlRenderer.isYamlFloatFromDot has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (7 pts), loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fb1f7c737d075a84139ab8b0223cc9b1cd9dd71f0cc10732013c0b5fe5d824"}},{"ruleId":"D2","level":"warning","message":{"text":"ScopedExprTransform.transform (cognitive 18): ScopedExprTransform.transform has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, match/switch 1 (nesting depth added 4). 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":"sjsonnet/src/sjsonnet/ScopedExprTransform.scala"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db8e69e1082dcb5a9dd381c62d789c2df9623401d3da35cb28f11887b2804ff"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticOptimizer.transformBind (cognitive 18): StaticOptimizer.transformBind has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54507d72b299074673ee42bbb6393359355fab8c30f76fb93fe8f3ff7cf68ce"}},{"ruleId":"D2","level":"warning","message":{"text":"Util.slice (cognitive 18): Util.slice has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 5, boolean chains 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Util.scala"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4840be8c40c134fe02d692b82e6356d367472b87897bde5dc111a2e829d89599"}},{"ruleId":"D2","level":"warning","message":{"text":"SetModule.setUnionDefaultKeyF (cognitive 18): SetModule.setUnionDefaultKeyF has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3, 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":"sjsonnet/src/sjsonnet/stdlib/SetModule.scala"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b8b3ae2c38ddb1b493f995bd7073dfceffb13ea1c8943acdac925c6236081f"}},{"ruleId":"D2","level":"warning","message":{"text":"SetModule.setInterDefaultKeyF (cognitive 18): SetModule.setInterDefaultKeyF has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/SetModule.scala"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"111446b26794b37833ea08c5abd8735fc869918a0a9aabf3c2c6dd57a5aa713d"}},{"ruleId":"D2","level":"warning","message":{"text":"SetModule.setDiffDefaultKeyF (cognitive 18): SetModule.setDiffDefaultKeyF has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/SetModule.scala"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"7664b014a3dd807227ddb08e5764f88b42ec1ed75fef20b2b02cbb8e02f2b8dc"}},{"ruleId":"D2","level":"warning","message":{"text":"StringModule.splitLimitRBounded (cognitive 18): StringModule.splitLimitRBounded has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/StringModule.scala"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5a37ddee7d6dfb407df69afee8e75f72d6e830478762b70a40ca6e5348722d"}},{"ruleId":"D2","level":"warning","message":{"text":"StripUtils.stripLookup (cognitive 18): StripUtils.stripLookup has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/StringModule.scala"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d728c99dfa21479d2dc2374709d1909c92d376ceb62bae0acddd43a3db5af42"}},{"ruleId":"D2","level":"warning","message":{"text":"SjsonnetClientMain.run (cognitive 18): SjsonnetClientMain.run has cognitive complexity 18 (threshold 15). Drivers by points: error handling 3 (7 pts), if/else 4 (6 pts), boolean chains 2, loops 2, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/client/src/sjsonnet/client/SjsonnetClientMain.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0640685210fa645e1ada309a8a63eda45ee293e9cc5515e98ea1f70c30741e"}},{"ruleId":"D2","level":"warning","message":{"text":"SjsonnetMain.toBytesFromJs (cognitive 17): SjsonnetMain.toBytesFromJs has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (4 pts), error handling 1 (3 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":"sjsonnet/src-js/sjsonnet/SjsonnetMain.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2e04b9e47b36322e820cac12fcdcd0fcb33139f4dc194d16062ec14ec5d203"}},{"ruleId":"D2","level":"warning","message":{"text":"ByteRenderer.materializeDirectInlineObj (cognitive 17): ByteRenderer.materializeDirectInlineObj has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 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":"sjsonnet/src/sjsonnet/ByteRenderer.scala"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f75cbf93597355c25833b3bda6f38ed5a37090cc9d62ba4706a590eeeee0edd"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator.compilePureDoubleExpr (cognitive 17): Evaluator.compilePureDoubleExpr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"889d953eced82fe605bd42ce85b424a7042650dc4491f42ce4a32741e1ee917c"}},{"ruleId":"D2","level":"warning","message":{"text":"StringModule.splitLimit (cognitive 17): StringModule.splitLimit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/StringModule.scala"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"218e0baaf3f98afc68ba92a3148510fa7d6e21f9a125068db7e28f5f652b6b45"}},{"ruleId":"D2","level":"warning","message":{"text":"StringModule.splitLimitR (cognitive 17): StringModule.splitLimitR has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/StringModule.scala"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04d8c524c37023bd79e23d25bffe5fe3b8e613c62779c1000f54e15d0142a71"}},{"ruleId":"D2","level":"warning","message":{"text":"Format.formatSimpleNamedString (cognitive 16): Format.formatSimpleNamedString has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Format.scala"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cc9eac7324251dd4b3476c15e0662b2c1271f136605270ccae664bb5ab6e16"}},{"ruleId":"D2","level":"warning","message":{"text":"Materializer.materializeSortedInlineObj (cognitive 16): Materializer.materializeSortedInlineObj has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Materializer.scala"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"3177ead55c04780444866c1a150a626077c34f533cb095c3c859753416d06f44"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.params (cognitive 16): Parser.params has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Parser.scala"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb3a1d8caf34bf38a9a0cc193dbd62f2adab298a4637e7ab7c7ba722e71c599"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyYamlRenderer.writeWrappedString (cognitive 16): PrettyYamlRenderer.writeWrappedString has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce476311f15ca7102382da92bae94dcd775c9c26648d4330a99012ab53d421f"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticOptimizer.tryStaticApply (cognitive 16): StaticOptimizer.tryStaticApply has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 2 (5 pts), error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4bee58f436200c72c5867795626626dac724b4fb48560405ac5347d2106153"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayModule.linearBytePattern (cognitive 16): ArrayModule.linearBytePattern has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (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":"sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9203bec68aca7e2aafdd3435afbb834344e05fee172eb139e400bb94d4bdecd9"}},{"ruleId":"D2","level":"warning","message":{"text":"SetModule.sortArr (cognitive 16): SetModule.sortArr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/SetModule.scala"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"554384a1f2e27386e3b2050f2533d5c524fab3aee170604e290b3ebbe5587aab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sjsonnet/Val.scala: FileTooLong \u2014 1976 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1476 over it, 3.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Val.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7aaf76fff6edb13421c7b7472d3856adb7c06b07851183d55c20c3b16003150"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sjsonnet/Evaluator.scala: FileTooLong \u2014 1707 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: Evaluator (20-2207). The bar is 500 significant lines; this is 1207 over it, 3.41\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab6d8995248758f672f1ef801bce13423a17b0f58d738f949e0d39244ba1536"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 89 methods. The bar is 30 methods; this is 59 over it, 2.97\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":"sjsonnet/src/sjsonnet/Parser.scala"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0186dcaa3f821380ac7cee9b3cccb1544457a0794f555a6dfc3ee67b71219957"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Evaluator: TooManyMethods \u2014 78 methods. The bar is 30 methods; this is 48 over it, 2.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d28afff4e006e10e71b45f44ca2b31cf3b09be0a814ce767661328c7ac92b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sjsonnet/Format.scala: FileTooLong \u2014 914 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 414 over it, 1.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Format.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae78a501b5ffc5c674a78823da98111ab380c9ad2f064d43ce335ceb0c55b37"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Platform: 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":"sjsonnet/src-native/sjsonnet/Platform.scala"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"198123c642bccaa70ff317474a8efb15d07bab0fe8bdd19ac5c644d453fab4bb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Platform: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-jvm/sjsonnet/Platform.scala"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e089e54564beb0ac7187313295146cae75f95454874a09bd16c3c4c09508a1e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stdlib/ArrayModule.scala: FileTooLong \u2014 808 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 308 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b90afd7b021c2698c77e58bf9f9f2ac60175e7ddd04ec5570d8c481302f0f79"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Platform: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d547a808962393cbc6359cbe979c59a8adb96fe642b42d955bcdc5d303106686"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sjsonnet/Parser.scala: FileTooLong \u2014 757 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 257 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Parser.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28278066b0c505972faf170682292a71f03a4c604bbd71ea11957816e5141b00"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sjsonnet/Materializer.scala: FileTooLong \u2014 754 significant lines (blank, comment-only and punctuation-only lines excluded), about 64% of them inside a single declaration: Materializer (24-647). The bar is 500 significant lines; this is 254 over it, 1.51\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":"sjsonnet/src/sjsonnet/Materializer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e717f360e3d7be872211c8a046383336e5fa31cb3ac036ddb19c440e21d938b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Format: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Format.scala"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"376f95a433810031c33d8d5caee92c37f223461a83392fe28c74af8ba37ab62c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StaticOptimizer: ClassTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 140 over it, 1.35\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b1c08cc9540fc0704136d85229654e0d796fa6943a4cb90d7cd5b6312af174"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sjsonnet/SjsonnetMainBase.scala: FileTooLong \u2014 648 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 148 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9746137ec4c67e0a336ecb31c94fe92a15a186fc6bb8e70a47e0cc23991595af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sjsonnet/StaticOptimizer.scala: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: StaticOptimizer (24-832). The bar is 500 significant lines; this is 46 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":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f6474973a90dc041c69ec4b9ac7086e70e568e8caa054c2120de7c05c9a57c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sjsonnet/Renderer.scala: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Renderer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"619e109816b185f28d839a3cb161590f97cd269ebfb78958e26e662f9c8dd5bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 16 shared lines): sjsonnet/src-js/sjsonnet/Platform.scala:362-388 | sjsonnet/src-jvm/sjsonnet/Platform.scala:401-427 | sjsonnet/src-native/sjsonnet/Platform.scala:333-359 \u2014 These 3 members are variants of one another: a block of 16 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d23871391572a166a6d7bb3edeb0e65798f7d3b52e9fcca4b78dfed90a57d33"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (44 shared lines): sjsonnet/src-js/sjsonnet/Platform.scala:152-213 | sjsonnet/src-native/sjsonnet/Platform.scala:115-184 \u2014 These two members are variants of one another: 44 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"522c1d377b921b42d0cad67d1b7ed003f4771b4ccde67f67f69bed787311d66e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): sjsonnet/src-js/sjsonnet/Platform.scala:277-295 | sjsonnet/src-js/sjsonnet/Platform.scala:297-315 | sjsonnet/src-jvm/sjsonnet/Platform.scala:369-383 | sjsonnet/src-jvm/sjsonnet/Platform.scala:385-399 | sjsonnet/src-native/sjsonnet/Platform.scala:248-266 | sjsonnet/src-native/sjsonnet/Platform.scala:268-286 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e4f1a2bff2383470564b5682979b1a17fbdce786b3f600d190bef069c916f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): sjsonnet/src/sjsonnet/Evaluator.scala:976-996 | sjsonnet/src/sjsonnet/Evaluator.scala:998-1013 | sjsonnet/src/sjsonnet/Evaluator.scala:1015-1032 | sjsonnet/src/sjsonnet/Evaluator.scala:1034-1058 | sjsonnet/src/sjsonnet/Evaluator.scala:1060-1089 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"925d135d77d46b20a16d8cf2b6a9ebcc2e28438ffbb35b39d3cdb3fd490a566b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): sjsonnet/src-js/sjsonnet/Platform.scala:483-515 | sjsonnet/src-native/sjsonnet/Platform.scala:454-486 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/Platform.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/Platform.scala\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf2f0e7a8db7717cdd9b2ab82a29663c72e7e12934405d7eb56b611bc931da0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): sjsonnet/src-js/sjsonnet/Platform.scala:447-476 | sjsonnet/src-native/sjsonnet/Platform.scala:418-447 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/Platform.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/Platform.scala\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c0502193403db30dbb2da2573061f9b268d4424806a08dbb86ea506de33419"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): sjsonnet/src-js/sjsonnet/Platform.scala:195-213 | sjsonnet/src-native/sjsonnet/Platform.scala:166-184 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/Platform.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/Platform.scala\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sjsonnet/src-js/sjsonnet/Platform.scala:195\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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdc6c3311f9d5646e0b4a934835e4d3cea6c1330b5e7520de871c33d28016f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:184-201 | sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:231-248 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:184\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad83efd065403c3b1acca2b89f9ed95dda5df5aca5767efb8403fccacdf9ee30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): sjsonnet/src-js/sjsonnet/Platform.scala:219-235 | sjsonnet/src-native/sjsonnet/Platform.scala:190-206 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/Platform.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/Platform.scala\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5de9f41b00d42864182ab7b3a47c306fb08ec3afc5df50a7f90f982cbe9d3bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): sjsonnet/src/sjsonnet/Format.scala:706-719 | sjsonnet/src/sjsonnet/Format.scala:737-751 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060sjsonnet/src/sjsonnet/Format.scala:703\u0060 calls \u0060withStarWidth\u0060, \u0060value\u0060 and \u0060sjsonnet/src/sjsonnet/Format.scala:736\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Format.scala"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb48493fa22ea89f8f60751e2bf21d4dd22da8c1011c621c670a3b9ed3cac389"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): sjsonnet/src/sjsonnet/BaseByteRenderer.scala:83-96 | sjsonnet/src/sjsonnet/BaseCharRenderer.scala:121-134 \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 \u0060sjsonnet/src/sjsonnet/BaseByteRenderer.scala:83\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/BaseByteRenderer.scala"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"651ac1946c62b4a7cddff22da474a1039ce7f15a04e8e466419df21f56e969f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): sjsonnet/src/sjsonnet/BaseByteRenderer.scala:458-471 | sjsonnet/src/sjsonnet/ByteRenderer.scala:88-101 \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 \u0060sjsonnet/src/sjsonnet/BaseByteRenderer.scala:458\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":"sjsonnet/src/sjsonnet/BaseByteRenderer.scala"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e8a82c70545456e655d87b03308a7f0dab22696454cad0b7926aa6a7274d2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): sjsonnet/src/sjsonnet/Format.scala:689-702 | sjsonnet/src/sjsonnet/Format.scala:723-736 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060sjsonnet/src/sjsonnet/Format.scala:703\u0060 calls \u0060withStarWidth\u0060, \u0060value\u0060 and \u0060sjsonnet/src/sjsonnet/Format.scala:737\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Format.scala"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcf4a6e91167a79f725c59da789b616f98f3c007aba4a27e83fba1f660f8f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sjsonnet/src/sjsonnet/BaseByteRenderer.scala:150-162 | sjsonnet/src/sjsonnet/BaseCharRenderer.scala:188-200 \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":"sjsonnet/src/sjsonnet/BaseByteRenderer.scala"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b503db5c7b71d8927735f5574b373b7a40516a001182d5bc49f7a8f32f641c6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sjsonnet/src/sjsonnet/Evaluator.scala:329-341 | sjsonnet/src/sjsonnet/Evaluator.scala:1637-1649 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src/sjsonnet/Evaluator.scala:329\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"2380ce866a499f018afa262a41c75eb6358e7d059096d49d8fdabdfdd62a30a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): sjsonnet/src/sjsonnet/Evaluator.scala:1036-1046 | sjsonnet/src/sjsonnet/Evaluator.scala:1062-1074 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src/sjsonnet/Evaluator.scala:1036\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1ccc0cbdb43d8e6cadcff170ed75c46b9f7ed4a17991b1b594bae14033517f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sjsonnet/src/sjsonnet/stdlib/SetModule.scala:144-156 | sjsonnet/src/sjsonnet/stdlib/SetModule.scala:193-205 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src/sjsonnet/stdlib/SetModule.scala:144\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060sjsonnet/src/sjsonnet/stdlib/SetModule.scala:142\u0060 calls \u0060out\u0060, \u0060b\u0060 and \u0060sjsonnet/src/sjsonnet/stdlib/SetModule.scala:192\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/SetModule.scala"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f63dcda03b64d5171d6731164453a16f5d97eacb95a87ba440d27f58a9800d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 5): sjsonnet/src/sjsonnet/Evaluator.scala:977-988 | sjsonnet/src/sjsonnet/Evaluator.scala:999-1007 | sjsonnet/src/sjsonnet/Evaluator.scala:1016-1024 | sjsonnet/src/sjsonnet/Evaluator.scala:1035-1044 | sjsonnet/src/sjsonnet/Evaluator.scala:1061-1070 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sjsonnet/src/sjsonnet/Evaluator.scala:977\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c5ac1d5102f41315526e5a8df9e4826e784c2f2ae94bce7dbd30170caf109c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): sjsonnet/src-js/sjsonnet/Platform.scala:401-412 | sjsonnet/src-jvm/sjsonnet/Platform.scala:440-451 | sjsonnet/src-native/sjsonnet/Platform.scala:372-383 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96e1e1bd42a1a5262c737bef0305e81f697cde61f7e84e0cc83dee9476aafc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): sjsonnet/src-js/sjsonnet/Platform.scala:425-436 | sjsonnet/src-jvm/sjsonnet/Platform.scala:464-475 | sjsonnet/src-native/sjsonnet/Platform.scala:396-407 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cccc22f2360055618a4d992cd24015ba40505eb98d7c812c52bc240b53b7c5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sjsonnet/src-js/sjsonnet/Platform.scala:250-261 | sjsonnet/src-native/sjsonnet/Platform.scala:221-232 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/Platform.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/Platform.scala\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6f7a05533dfefc5013e12fbf12fe4ee3cc30000c45d4405b18ebf7e095f05a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): sjsonnet/src/sjsonnet/Val.scala:2512-2522 | sjsonnet/src/sjsonnet/Val.scala:2538-2548 | sjsonnet/src/sjsonnet/Val.scala:2559-2569 \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":"sjsonnet/src/sjsonnet/Val.scala"},"region":{"startLine":2512}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2be4c3984e22516761e35e6d54b548fdec7135f1c770421bf6364057dc92c25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:1116-1126 | sjsonnet/src/sjsonnet/stdlib/SetModule.scala:481-491 | sjsonnet/src/sjsonnet/stdlib/StringModule.scala:1320-1330 \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 all 3 call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad27cd3d910ec18d60343117a78c8ff8e1400e0b8788d0a048aa0c4128dd6322"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sjsonnet/src-js/sjsonnet/Platform.scala:156-166 | sjsonnet/src-native/sjsonnet/Platform.scala:119-129 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/Platform.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/Platform.scala\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sjsonnet/src-js/sjsonnet/Platform.scala:156\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f458b67652042835e5ad0ff8a929eca0700611399e12767a822dde7516d1054a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sjsonnet/src-js/sjsonnet/Platform.scala:344-354 | sjsonnet/src-native/sjsonnet/Platform.scala:315-325 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/Platform.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/Platform.scala\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a032a9aa47f1dbbc20e65076ff0aa9dafc4b0fa459dec333c140a128bb8087"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): sjsonnet/src/sjsonnet/ByteRenderer.scala:477-486 | sjsonnet/src/sjsonnet/Materializer.scala:201-211 \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 \u0060sjsonnet/src/sjsonnet/ByteRenderer.scala:477\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/ByteRenderer.scala"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0963e0fb6488c73bd0deb8fadf7048ff49ccf526e5a99e9cc64e109f53f2bf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sjsonnet/src/sjsonnet/Val.scala:1001-1011 | sjsonnet/src/sjsonnet/Val.scala:1327-1337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Val.scala"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed92f0852a8a63085b456b45a06cdd4f91a6ea9c4422e84ab551b09baaca2890"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sjsonnet/src-js/sjsonnet/Platform.scala:238-247 | sjsonnet/src-native/sjsonnet/Platform.scala:209-218 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/Platform.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/Platform.scala\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c98cd451f32bab8514a6473bbb9951238fd8ab8e5f488a46476f3861219750"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:345-354 | sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:379-389 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:345\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":"sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92eecfeb33c79286bc26cbd75ccc5f8c0bd9798f036955d2e955ae302a499c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sjsonnet/src/sjsonnet/stdlib/DeepArrayTraversal.scala:101-110 | sjsonnet/src/sjsonnet/stdlib/DeepArrayTraversal.scala:148-157 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src/sjsonnet/stdlib/DeepArrayTraversal.scala:101\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/DeepArrayTraversal.scala"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"871226bc92d87408a4eee1a8a385ed19265e2e155402ebf754493a296f634183"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): sjsonnet/src-js/sjsonnet/Platform.scala:278-286 | sjsonnet/src-js/sjsonnet/Platform.scala:298-306 | sjsonnet/src-jvm/sjsonnet/Platform.scala:370-378 | sjsonnet/src-jvm/sjsonnet/Platform.scala:386-394 | sjsonnet/src-native/sjsonnet/Platform.scala:249-257 | sjsonnet/src-native/sjsonnet/Platform.scala:269-277 \u2014 there are 6 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sjsonnet/src-js/sjsonnet/Platform.scala:278\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"81234e3dce8900b6753ed04711365fb75363f3bb25f120b31ca1d2398eee91d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sjsonnet/src/sjsonnet/Materializer.scala:170-178 | sjsonnet/src/sjsonnet/Materializer.scala:223-231 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src/sjsonnet/Materializer.scala:170\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":"sjsonnet/src/sjsonnet/Materializer.scala"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e47a7fa20e24126b75ba3b38cac748efd1d392758c5b5f811d59594435a11bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:335-343 | sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:368-376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:335\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e128c41fbcb28e91757a5bddd11f08f91a4859b367292b130653d6aba5a1d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sjsonnet/src/sjsonnet/stdlib/DeepArrayTraversal.scala:129-137 | sjsonnet/src/sjsonnet/stdlib/DeepArrayTraversal.scala:207-215 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src/sjsonnet/stdlib/DeepArrayTraversal.scala:129\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/DeepArrayTraversal.scala"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b85370499ac1eba02abfbb2a7981ad6021857d40cddb5ccda1962c7f1bfecb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sjsonnet/src/sjsonnet/stdlib/SetModule.scala:128-136 | sjsonnet/src/sjsonnet/stdlib/SetModule.scala:181-189 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src/sjsonnet/stdlib/SetModule.scala:128\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060sjsonnet/src/sjsonnet/stdlib/SetModule.scala:137\u0060 calls \u0060out\u0060, \u0060a\u0060 and \u0060sjsonnet/src/sjsonnet/stdlib/SetModule.scala:190\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/SetModule.scala"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e72455b807ca65c4871b5e16e5e18984c1f77336dd83e0f703a9db1af51e3df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): sjsonnet/src-js/sjsonnet/Platform.scala:363-370 | sjsonnet/src-jvm/sjsonnet/Platform.scala:402-409 | sjsonnet/src-native/sjsonnet/Platform.scala:334-341 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sjsonnet/src-js/sjsonnet/Platform.scala:363\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae33856a8b3f76e458de30ec887f92674c93e1b5fae25e5acfacd6040c88d848"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): sjsonnet/src-js/sjsonnet/Platform.scala:381-388 | sjsonnet/src-jvm/sjsonnet/Platform.scala:420-427 | sjsonnet/src-native/sjsonnet/Platform.scala:352-359 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sjsonnet/src-js/sjsonnet/Platform.scala:381\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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a190cc5aea2d49ce08b075863b08f271f6b1e4e15f55b0b8f21e7efecc9885"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): sjsonnet/src/sjsonnet/stdlib/ObjectModule.scala:84-91 | sjsonnet/src/sjsonnet/stdlib/ObjectModule.scala:104-111 | sjsonnet/src/sjsonnet/stdlib/ObjectModule.scala:119-126 \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 \u0060sjsonnet/src/sjsonnet/stdlib/ObjectModule.scala:84\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":"sjsonnet/src/sjsonnet/stdlib/ObjectModule.scala"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a235562473f16e018e3bb2f58fe129fbe9d61f93ee50b3933f5f5e614b32b15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sjsonnet/src-js/sjsonnet/CharSWAR.scala:17-24 | sjsonnet/src-native/sjsonnet/CharSWAR.scala:67-74 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/CharSWAR.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/CharSWAR.scala\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/CharSWAR.scala"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c25d05c4cc924dbd9da3240744f6c3c7072051c2bf8a5da36cfcabfe4d48460"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sjsonnet/src-js/sjsonnet/Platform.scala:177-184 | sjsonnet/src-native/sjsonnet/Platform.scala:141-148 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/Platform.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/Platform.scala\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sjsonnet/src-js/sjsonnet/Platform.scala:177\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060sjsonnet/src-native/sjsonnet/Platform.scala:151\u0060 calls \u0060Num\u0060 and \u0060sjsonnet/src-js/sjsonnet/Platform.scala:187\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b148d76db17729590919c482033b9f3e97412b5624c9d15c0fde9b28a0f48876"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sjsonnet/src-js/sjsonnet/Platform.scala:288-295 | sjsonnet/src-native/sjsonnet/Platform.scala:259-266 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/Platform.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/Platform.scala\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sjsonnet/src-js/sjsonnet/Platform.scala:288\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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec326a07336a2109b26ec00b64ce1abc421f3d3c7101af2c6a696b2a9a432b0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sjsonnet/src-js/sjsonnet/Platform.scala:308-315 | sjsonnet/src-native/sjsonnet/Platform.scala:279-286 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/Platform.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/Platform.scala\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sjsonnet/src-js/sjsonnet/Platform.scala:308\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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d09503c39b171d614209db05d107f9cdd919169a779577430609e54e48d872c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): sjsonnet/src/sjsonnet/Evaluator.scala:1895-1902 | sjsonnet/src/sjsonnet/Evaluator.scala:2020-2026 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src/sjsonnet/Evaluator.scala:1895\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":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":1895}}}],"partialFingerprints":{"codehealthFindingId/v1":"1544ebcaa53005b05cc1a6226c39e585cc78dbd054fecfb5f5ba022d69238395"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): sjsonnet/src-js/sjsonnet/SjsonnetMain.scala:76-82 | sjsonnet/src-js/sjsonnet/SjsonnetMain.scala:155-160 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src-js/sjsonnet/SjsonnetMain.scala:76\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/SjsonnetMain.scala"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d443839e856c066bb18ee12c89cec74027df416c4c65613b373801a5e06ac3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): sjsonnet/src/sjsonnet/Evaluator.scala:1796-1802 | sjsonnet/src/sjsonnet/Evaluator.scala:1945-1950 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"85473f756f435ec9d31f3d2bf3a18971db70f56091cb275e1e18d43953ca5ff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sjsonnet/src/sjsonnet/Materializer.scala:183-189 | sjsonnet/src/sjsonnet/Materializer.scala:236-242 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src/sjsonnet/Materializer.scala:183\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":"sjsonnet/src/sjsonnet/Materializer.scala"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"325e440847d7b93abe1ab8c84c1fcde2ed6cb4e12f9d6bfef9c86173b565ae58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:686-692 | sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:710-716 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:686\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":"sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3a604d707f1d33227bbb98b7205bf7e078aa3a264292c59d9cebd822913b1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:743-749 | sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:755-761 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala:743\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":"sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc11106fd31311fd52e07026ed26970a7c9fadc0096e70443c98f393c3e59379"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): sjsonnet/src/sjsonnet/FastLongRenderer.scala:110-115 | sjsonnet/src/sjsonnet/FastLongRenderer.scala:122-127 | sjsonnet/src/sjsonnet/FastLongRenderer.scala:136-141 \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":"sjsonnet/src/sjsonnet/FastLongRenderer.scala"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"456192541187af5c520479754a0eda2e6d9733ad0a4441ba388396ec653dba56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sjsonnet/src-js/sjsonnet/Platform.scala:169-174 | sjsonnet/src-native/sjsonnet/Platform.scala:133-138 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/Platform.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/Platform.scala\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sjsonnet/src-js/sjsonnet/Platform.scala:169\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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f121d1d9a06a8a2c1ec8f0a5f799ecb2adce27aa46d55cadd90935fdb9dbf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sjsonnet/src/sjsonnet/Error.scala:56-61 | sjsonnet/src/sjsonnet/Profiler.scala:99-104 \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 \u0060sjsonnet/src/sjsonnet/Error.scala:56\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":"sjsonnet/src/sjsonnet/Error.scala"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7497d797eeb4ca831b426f7bbfdfa655ae2cbba3f0c1979e70429feacb5ab2ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sjsonnet/src/sjsonnet/Evaluator.scala:892-897 | sjsonnet/src/sjsonnet/Evaluator.scala:1374-1379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sjsonnet/src/sjsonnet/Evaluator.scala:892\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":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9c315a55085c515a1a4e37fb20ae6f1907006d8fda4be34208a88d86b4eb7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sjsonnet/src/sjsonnet/Val.scala:1733-1738 | sjsonnet/src/sjsonnet/Val.scala:1752-1757 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src/sjsonnet/Val.scala:1733\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Val.scala"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"3273bd7c0ec8ce7d2efa242ea2cc26555f5a4e06935d1049470da68b026aba1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sjsonnet/src/sjsonnet/stdlib/StringModule.scala:1178-1183 | sjsonnet/src/sjsonnet/stdlib/StringModule.scala:1192-1197 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src/sjsonnet/stdlib/StringModule.scala:1178\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/stdlib/StringModule.scala"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"22becd0035b0b448572ef0aaed5d850d063aa2ee88be1a4676a4c1ee89ddf874"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sjsonnet/src/sjsonnet/Evaluator.scala:886-890 | sjsonnet/src/sjsonnet/Evaluator.scala:1361-1366 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src/sjsonnet/Evaluator.scala:886\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"802d4a5f136ebeff8a0fe6efc53874a4c06423134e50506d6e2831b6dafbc6d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sjsonnet/src/sjsonnet/Evaluator.scala:1125-1129 | sjsonnet/src/sjsonnet/Evaluator.scala:1139-1146 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src/sjsonnet/Evaluator.scala:1125\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"218ffbe45c0c0248963d4ebf8e015bc92b19760a87a0f62d59045e63192daeaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sjsonnet/src/sjsonnet/ExprTransform.scala:42-46 | sjsonnet/src/sjsonnet/ExprTransform.scala:73-77 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/ExprTransform.scala"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47f582b2535aa51b6700d03695925e944a04ff0ec338278712058d04e4b2707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sjsonnet/src-js/java/util/BitSet.scala:9-16 | sjsonnet/src-native/java/util/BitSet.scala:9-16 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/java/util/BitSet.scala\u0060 and \u0060sjsonnet/src-native/java/util/BitSet.scala\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/java/util/BitSet.scala"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"457fcdf8e64dbdccb9bf3639418f54a7d991e4a9a99c047c7b643d3f1d0eaf0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sjsonnet/src-js/sjsonnet/stdlib/PlatformBase64.scala:12-23 | sjsonnet/src-jvm/sjsonnet/stdlib/PlatformBase64.scala:12-31 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/stdlib/PlatformBase64.scala"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e336c3a4061b7b4143512dfdf0f38905240126eed143cb6534c474d3637dfab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sjsonnet/src-js/sjsonnet/CharSWAR.scala:28-36 | sjsonnet/src-native/sjsonnet/CharSWAR.scala:173-181 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/CharSWAR.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/CharSWAR.scala\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/CharSWAR.scala"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a9cf8af776d1470096f088dc5041910fd1cd64baaaf55194a5b4a52860ee6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sjsonnet/src-js/sjsonnet/CharSWAR.scala:39-47 | sjsonnet/src-native/sjsonnet/CharSWAR.scala:183-191 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/CharSWAR.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/CharSWAR.scala\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/CharSWAR.scala"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5953158e6319ce06b5ee33023dd137c0c082c35cc57dfec5a218f1e08e6d91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sjsonnet/src-js/sjsonnet/CharSWAR.scala:49-57 | sjsonnet/src-native/sjsonnet/CharSWAR.scala:193-201 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/CharSWAR.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/CharSWAR.scala\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/CharSWAR.scala"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7b6297a0eb8892de78b6b821e6ea54165784ebb3505c79ea15391dd223f5d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sjsonnet/src-js/sjsonnet/Platform.scala:91-102 | sjsonnet/src-native/sjsonnet/Platform.scala:37-48 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/Platform.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/Platform.scala\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"210a1593169c5af76ead3ee81ec36c975251c81b3c4554e16ff113025309b093"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): sjsonnet/src-js/sjsonnet/Platform.scala:135-140 | sjsonnet/src-jvm/sjsonnet/Platform.scala:153-158 | sjsonnet/src-native/sjsonnet/Platform.scala:98-103 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd7d8e9c1dd95d4e862c85c09daa7a9504c6c56351e3da094eb85bf7eafcb07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sjsonnet/src-js/sjsonnet/Platform.scala:263-268 | sjsonnet/src-native/sjsonnet/Platform.scala:234-239 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/Platform.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/Platform.scala\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d5aaf6b44546bd31166f09cec36e8eb40e2068c596b4214af858693b688aef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sjsonnet/src-js/sjsonnet/Platform.scala:270-275 | sjsonnet/src-native/sjsonnet/Platform.scala:241-246 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/Platform.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/Platform.scala\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"98afd28a60859ea6c2bfe7e9e746b464180262b903e15173c364acf2d216e3a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sjsonnet/src-js/sjsonnet/Platform.scala:317-324 | sjsonnet/src-native/sjsonnet/Platform.scala:288-295 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/Platform.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/Platform.scala\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"304c5cc067c4f5adc3d27a4262f3e1f021ff8c2d107085496cb34d0ce3992ce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sjsonnet/src-js/sjsonnet/Platform.scala:356-360 | sjsonnet/src-native/sjsonnet/Platform.scala:327-331 \u2014 before extracting anything, compare \u0060sjsonnet/src-js/sjsonnet/Platform.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/Platform.scala\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 274 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"070d318361e46766498bbafa339b2aea1809a828fc1088c9e600661f00a551d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): sjsonnet/src-js/sjsonnet/Platform.scala:390-398 | sjsonnet/src-jvm/sjsonnet/Platform.scala:429-437 | sjsonnet/src-native/sjsonnet/Platform.scala:361-369 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd43f5a9b5ec6716679e89fe84a06e0d797274fa87d3779bf502700af7a764d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sjsonnet/src-jvm/sjsonnet/Platform.scala:57-67 | sjsonnet/src-native/sjsonnet/Platform.scala:62-72 \u2014 before extracting anything, compare \u0060sjsonnet/src-jvm/sjsonnet/Platform.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/Platform.scala\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-jvm/sjsonnet/Platform.scala"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae9350ce232c069ba3eaab217fa44f780a71ed17cbcda7a7390effba6e1be47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sjsonnet/src-jvm/sjsonnet/Platform.scala:557-565 | sjsonnet/src-native/sjsonnet/Platform.scala:525-533 \u2014 before extracting anything, compare \u0060sjsonnet/src-jvm/sjsonnet/Platform.scala\u0060 and \u0060sjsonnet/src-native/sjsonnet/Platform.scala\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: \u0060Pattern\u0060 names \u0060com.google.re2j.Pattern\u0060 in one and \u0060scala.scalanative.regex.Pattern\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-jvm/sjsonnet/Platform.scala"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a1aaad6184353e1de5c3517fb4edf7104a5bb82480c89e73ac179225299578"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): sjsonnet/src/sjsonnet/BaseCharRenderer.scala:140-149 | sjsonnet/src/sjsonnet/BaseCharRenderer.scala:163-172 | sjsonnet/src/sjsonnet/Renderer.scala:195-204 | sjsonnet/src/sjsonnet/Renderer.scala:218-227 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/BaseCharRenderer.scala"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"879d9ed9f63fbea24b632a14bac3e91ecbf0edf83f36e3a0a2b33959ed634f4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sjsonnet/src/sjsonnet/BaseCharRenderer.scala:151-161 | sjsonnet/src/sjsonnet/Renderer.scala:206-216 \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":"sjsonnet/src/sjsonnet/BaseCharRenderer.scala"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"31411a5535d24efaab8e78e184d2dd1b6c5e0ce31d43e7601d4498459818909e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sjsonnet/src/sjsonnet/Evaluator.scala:913-919 | sjsonnet/src/sjsonnet/Evaluator.scala:1424-1430 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src/sjsonnet/Evaluator.scala:913\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":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"793c63ca5d3734693bafb9a05a1f602e5c4f003a1b4f4ac151016386e7984e1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sjsonnet/src/sjsonnet/Evaluator.scala:1719-1723 | sjsonnet/src/sjsonnet/Evaluator.scala:1728-1732 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src/sjsonnet/Evaluator.scala:1719\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"2789bef6b4f490e2fed47abce000b3eb55b1c3ecaabbb5ac562146287fc1c04c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala:605-609 | sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala:628-632 \u2014 both copies are in the same file, so extract the block 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 \u0060sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala:605\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/PrettyYamlRenderer.scala"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a6f6f1c5b148435e46b5ce5a8a4929ccf9e78459146aff679cb8b92134f8cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): bench/src/sjsonnet/bench/MainBenchmark.scala:54-58 | bench/src/sjsonnet/bench/RegressionBenchmark.scala:17-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/src/sjsonnet/bench/MainBenchmark.scala"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"21919a277a4e5521da0d5e6112c36026429c7968af92b27b517acc45fa2faabe"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: sjsonnet.jvm.client: sjsonnet.jvm.client: abstractness 0.20, instability 0.00, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f84a979f94e637c905921ad3c1a13b8c62287c1c824ad9c1f8979303247f164b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TomlRenderer (LCOM4 5): TomlRenderer\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":"sjsonnet/src/sjsonnet/TomlRenderer.scala"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f9b557b0585a88cbb721f6631bf715d6512bfb83660e75d0e1050f3e8f7a1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sjsonnet/src/sjsonnet/Format.scala: sjsonnet/src/sjsonnet/Format.scala changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in Format.format at line 627. 7 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 12:31:21 -07:00\u0027 --until=\u00272026-10-20 12:31:21 -07:00\u0027 --full-history --no-merges -- sjsonnet/src/sjsonnet/Format.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":"sjsonnet/src/sjsonnet/Format.scala"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"e031fc96a87eee5f9f20b0f47577fd5ef301725b791210b956d984c5617f9fc0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala: sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in SjsonnetMainBase.main0 at line 130. 1 of those changes was a fix/bug commit, and the other 2 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 12:31:21 -07:00\u0027 --until=\u00272026-10-20 12:31:21 -07:00\u0027 --full-history --no-merges -- sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.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":"sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"447e9269ca941ee7caefca6fc96fdfce88645f78046ca01a73497e7bb6eed1df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sjsonnet/src/sjsonnet/Parser.scala: sjsonnet/src/sjsonnet/Parser.scala changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Parser.objinside at line 836. 2 of those changes were fix/bug commits, 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 12:31:21 -07:00\u0027 --until=\u00272026-10-20 12:31:21 -07:00\u0027 --full-history --no-merges -- sjsonnet/src/sjsonnet/Parser.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":"sjsonnet/src/sjsonnet/Parser.scala"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"301900439a91aeaa3842dc6c38e81cd85eff6362e4fd5d52e0b4d4cd96f2e3eb"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 23 significant file(s) lose their only recent owner: sjsonnet/src/sjsonnet/stdlib/StringModule.scala, sjsonnet/src/sjsonnet/Format.scala, sjsonnet/src/sjsonnet/stdlib/ManifestModule.scala, sjsonnet/src/sjsonnet/Renderer.scala, sjsonnet/src/sjsonnet/stdlib/SetModule.scala, sjsonnet/src/sjsonnet/stdlib/MathModule.scala, sjsonnet/src/sjsonnet/ByteRenderer.scala, sjsonnet/src/sjsonnet/Util.scala (\u002B15 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1abcffced7fa3aeb73be9a270da69bf062e37fca6b1f8484a687a182c350d2ea"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (24 single-owned of 60 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 60 of the 96 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: sjsonnet/src/sjsonnet/DebugStats.scala."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: how to turn off the mill sandbox? \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":"sjsonnet/test/src-jvm-native/sjsonnet/PrettyYamlRendererTests.scala"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75425a79bddff182cb1d73d482dce0b0dd5bdd0b38671d2960f4514dc344383"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Get rid of the /dev/stdin special-casing (everywhere!) once we use scala-native \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":"sjsonnet/src-jvm-native/sjsonnet/SjsonnetMainBase.scala"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecb3a3c274480e25c541df5a1f88a537f0df74437609a37d039b6c921e8cbd6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove the \u0060toSeq\u0060 once this is fixed in scala3 \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":"sjsonnet/src/sjsonnet/stdlib/ManifestModule.scala"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c1950482bcb6018d1d831b39d39b85684d840ec260ed311f7e58d54a52a8d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove the \u0060toSeq\u0060 once this is fixed in scala3 \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":"sjsonnet/src/sjsonnet/stdlib/ManifestModule.scala"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8a07e82fc92e8db85f1c4bf716e132fc18c3b6a7a7cd8330cd7ae04194cd68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove the \u0060toSeq\u0060 once this is fixed in scala3 \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":"sjsonnet/src/sjsonnet/stdlib/ManifestModule.scala"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b9aca6f27cd4e6a40f82e2bb0e6b75e5c470fa6bf10e8b14785f52bc1739e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove the \u0060toSeq\u0060 once this is fixed in scala3 \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":"sjsonnet/src/sjsonnet/stdlib/ManifestModule.scala"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"305057d2dc47c52bba132aba966b00e9376e43ef4bde785fd2a770cc6399517c"}},{"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":"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 (27716 LoC, 299 module-visible types across 17 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":"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":"e0d1dd769024213fe5d10cece51ab379c996d6edddc665be517e3c5f84aaa462"},"properties":{"dependency":{"package":"lz4-java","version":"1.10.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 60 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; 60 of the 96 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: sjsonnet/client/src/sjsonnet/client/Util.java. 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":"sjsonnet/client/src/sjsonnet/client/Util.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6927ffa7bcd7d2e05bab776ba190b810bc6c4096ea7f0148cbcb18b58a70ee02"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: BaseByteRenderer.scala \u2194 BaseCharRenderer.scala: \u0060sjsonnet/src/sjsonnet/BaseByteRenderer.scala\u0060 and \u0060sjsonnet/src/sjsonnet/BaseCharRenderer.scala\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). 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 6 shared commits counted here, the most recent 3 are \u006016e868e8\u0060 perf: speed up direct long rendering (#1087); \u00603abe44a3\u0060 Make mutable scratch buffers a part of the Renderer (#1050); \u0060ee9e0849\u0060 fix: escapeStringJson escapes DEL and C1 control characters (#1005) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/BaseByteRenderer.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53d50b628c3a124b2d98db797c02b13f622c9545e466c231289a59dcae9afdd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: Config.scala \u2194 Settings.scala: \u0060sjsonnet/src-jvm-native/sjsonnet/Config.scala\u0060 and \u0060sjsonnet/src/sjsonnet/Settings.scala\u0060 change together 59% of the time (10 of the 17 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 10 shared commits counted here, the most recent 3 are \u006087d30a55\u0060 Align CLI behavior with go-jsonnet (#1068); \u0060b9aad586\u0060 perf: promote hot-path evaluator to default; remove dual-evaluator fl\u2026; \u006046e11e8f\u0060 Add --max-stack / -s flag to limit stack depth (#637) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-jvm-native/sjsonnet/Config.scala"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac76cf87b6c1fc9e9b0d657dcf8ddb4a1761a7c9ba8cf3970637118028c937bc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84d627442493677c0bbf0869acab80b0adeaca4022f9f6738efe85d5ffdee28"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fe25ff877455001b5cce495020fb4f5cca0eb3ce76d7c36a45e5425a8cde3e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce1445b8a336822db7e61b1b999514b6a95483d7d65b361bc2dd4cb92c86c92"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5eee5a7624bda8cec0268f7526c25a4fa247589f36f44c7dc0104402b1c2299"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.vars-panel .panel-header .toggle-icon\u0060 moves (\u0060transition: transform 0.2s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"603261516d717772df58f8609d3e4539b0353b2783e6451fa08b45c2d10a77e8"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.2:1): \u0060.status-indicator\u0060 sets color: #6c6f85 on background-color: #ccd0da \u2014 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"546c130c7310ff367d9559aa8e07e73c7dc0f2da18be7565cc61988ade7810d2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.1:1): \u0060.panel-header\u0060 sets color: #6c6f85 on background-color: #e6e9ef \u2014 4.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"100b789efc00310f168d2860d419f34da4b22e9f1c38acb96e0feae7e5edbd34"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.2:1): \u0060.panel-header .download-btn\u0060 sets color: #6c6f85 on background-color: #ccd0da \u2014 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8ad9ea4a4ac0caaae4798de03672bcaa12265d1d7bfee91379be302102a35b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.2:1): \u0060.file-item\u0060 sets color: #6c6f85 on background-color: #ccd0da \u2014 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b30a0217774a87e649b7a1d8b8050978a1b2c74ffb5100fb577382796d1e07"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.3:1): \u0060.file-item.active\u0060 sets color: #1e66f5 on background-color: #eff1f5 \u2014 4.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f3653559b4aa37717b5cfc695c36b378068d639bbc04a3df9b169b4df46051"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.2:1): \u0060.toolbar-btn\u0060 sets color: #6c6f85 on background-color: #ccd0da \u2014 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"6717fdf49348f2002d505913e20d6b044c56799f2c017c5500112e901125a8a2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.3:1): \u0060.toolbar-btn:hover\u0060 sets color: #1e66f5 on background-color: #eff1f5 \u2014 4.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"a097ea95747807cb004730cc009591899157b5be721205798cac3c6fc1152b53"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.2:1): \u0060.copy-btn\u0060 sets color: #6c6f85 on background-color: #ccd0da \u2014 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cc4d96710e032a5215d029ee44b64cde6227798c09bfac8eea9e4f30536276"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.3:1): \u0060.CodeMirror-hint-active\u0060 sets color: #1e1e2e on background-color: #1e66f5 \u2014 3.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"2120b18cdddda927075b5824e43017beef5e9a42868f0390392548fad16c8a00"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.3:1): \u0060.output-tab.active\u0060 sets color: #1e66f5 on background-color: #eff1f5 \u2014 4.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f5c0163e8f0fe84dafddd2573b4e01a3f042ae4ff37cec2a1659afdacb57ea"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.2:1): \u0060.var-section-header\u0060 sets color: #1e66f5 on background-color: #ccd0da \u2014 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0ab7aea5af590217830dd7945bdd746db95723681ee326a4f31111b96d0d25"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no accessibility linting at author time and no automated accessibility check in tests or CI. Add your UI toolkit\u0027s own accessibility assertion to the test suite (Flutter \u0060meetsGuideline\u0060, Espresso \u0060AccessibilityChecks\u0060, XCTest \u0060performAccessibilityAudit\u0060), then gate that test in the pipeline. What was searched, so you can tell an absence from a miss: the 1 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is \u0060???\u0060: \u0060transformField\u0060 is a shipped member whose whole body is still \u0060???\u0060, and nothing in the repository overrides it \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/ScopedExprTransform.scala"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98769fe5ba370598c1df6a60745fc03d63ff13abdd62eebaa011393cfdfb2de"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060appendMemoryStats\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ed8153ea7fb5129ce0e86d0cd8a6d218b98173b7d7c2e97861bd08582ce275"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060appendMemoryStats\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src-native/sjsonnet/Platform.scala"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"0890ba1517cbb464633745a1a81d7ea80ab64d0635fa49796bed45b99d55dc41"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is ??? / NotImplementedError: \u0060transformField\u0060 is a shipped method whose whole body is \u0060???\u0060 (or throws NotImplementedError), and nothing in the repository overrides it \u2014 scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/ScopedExprTransform.scala"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1126f544caf0172e50b82936a87d49c71adb239813335f497b5e472115fc952"}},{"ruleId":"IC1","level":"note","message":{"text":"Blanket warning suppression: A bare \u0060// scalastyle:off\u0060, \u0060// scalafix:off\u0060 or \u0060@nowarn\u0060 (or Wartremover\u0027s \u0060warts.All\u0060) switches every rule or warning off \u2014 hidden debt. Suppress the specific rule on the specific line, with a justification, instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/ScopedExprTransform.scala"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac098fdd9bb40a788ee00bead0de70eb2c62aec2b653b0c34b8ad58ac5405133"}},{"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":"M3","level":"note","message":{"text":"No src/ separation: Production code isn\u0027t grouped under a src/ folder \u2014 it\u0027s spread across several top-level directories, so there\u0027s no one place that says \u0027this is the product\u0027."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f5b24e313364d10170a5c2542959902fe0d26ed70edef3eaa10ec5bcdb1d"}},{"ruleId":"P10","level":"note","message":{"text":"Large public API surface: 8/10 types (80%) declared in the published library are public. For a library, every public type is a stability contract \u2014 keep implementation types off the surface and expose only the intended API."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ed2ba843444ae377c17142f58f714e281e4bd3f183ab100ee1fbef389875d3e6"}},{"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 SAST: No static application security testing detected. For this repository\u0027s stack, add scalafix or scapegoat (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 5051 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/pr-build.yaml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"S1","level":"warning","message":{"text":"Third-party script without Subresource Integrity: \u0060https://cdnjs.cloudflare.com/ajax/libs/codemirror/5.65.16/codemirror.min.js\u0060 is executed by this page with no Subresource Integrity. Whoever can answer that request \u2014 the CDN, anyone who compromises it, anyone on the network path \u2014 runs arbitrary script in this page\u0027s origin, with its session. 14 such include(s) across the repository\u0027s markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"playground/index.html"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f90172ef880cb96d795d5e383a4b6e1e5abf57c0fa473a6ed6cd469f038c9a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isDefaultKeyF(keyF) \u0026\u0026 !keyF.isInstanceOf[Val.Func]\u0060 appears character-identically in 2 files \u2014 sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala, sjsonnet/src/sjsonnet/stdlib/SetModule.scala. 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":"sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f90a0b9cdd50790786e7f415e79891b81a8039adeb76530a5e68b5eebd12e3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(c == \u0027\u0022\u0027 || c == \u0027\\\u0027\u0027) \u0026\u0026 isYamlScalarQuoteStart(input, start, i)\u0060 appears character-identically in 3 files \u2014 sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.scala. 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b6c7ee659bffe17cde942de4754bce34f856a0f6b9b7aae0c146ebe86ec65d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060b \u003C 32 || b == \u0027\u0022\u0027 || b == \u0027\\\\\u0027 || b == 0x7f\u0060 appears character-identically in 2 files \u2014 sjsonnet/src-js/sjsonnet/CharSWAR.scala, sjsonnet/src-native/sjsonnet/CharSWAR.scala. 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":"sjsonnet/src-js/sjsonnet/CharSWAR.scala"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfcd782cb4c18c8b5ec3ade211010add37b103a2696e9735e29b049508967d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c \u003C 32 || c == \u0027\u0022\u0027 || c == \u0027\\\\\u0027 || (c \u003E= 0x7f \u0026\u0026 c \u003C= 0x9f)\u0060 appears character-identically in 2 files \u2014 sjsonnet/src-js/sjsonnet/CharSWAR.scala, sjsonnet/src-native/sjsonnet/CharSWAR.scala. 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":"sjsonnet/src-js/sjsonnet/CharSWAR.scala"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b0854c196decf4e125b1bbb272a878bdcc736598428001cee222ed63c4fb50"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c \u003C 32 || c == \u0027\u0022\u0027 || c == \u0027\\\\\u0027 || c \u003E= 0x7f\u0060 appears character-identically in 2 files \u2014 sjsonnet/src-js/sjsonnet/CharSWAR.scala, sjsonnet/src-native/sjsonnet/CharSWAR.scala. 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":"sjsonnet/src-js/sjsonnet/CharSWAR.scala"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ab3d74b6f3663b483ba980e68dea6025576e4f7795a21597b0e7798958f315"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c == \u0027#\u0027 \u0026\u0026 (i == from || input.charAt(i - 1).isWhitespace)\u0060 appears character-identically in 3 files \u2014 sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.scala. 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6aee5d730c0e9a7ffc40fdc8aaf1032ae715e2a1202ba8724b2b976c53fa144"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c == \u0027\u003C\u0027 \u0026\u0026 i \u003E from \u0026\u0026 input.charAt(i - 1) == \u0027!\u0027\u0060 appears character-identically in 3 files \u2014 sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.scala. 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f785876aa569a502db30d35fa2f4827a8aa7b747fb5ca40dba55018de4430e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c == \u0027[\u0027 || c == \u0027]\u0027 || c == \u0027{\u0027 || c == \u0027}\u0027 || c == \u0027,\u0027 || c == \u0027:\u0027\u0060 appears character-identically in 3 files \u2014 sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.scala. 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"4898aa1e9a4659fd6fad483255f48916ce827fd144e775372588be74df6dbe10"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060canNormalizeResolvedFloat || canNormalizePlainCoreString\u0060 appears character-identically in 3 files \u2014 sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.scala. 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f449777b554de68c3eb7bb6c744a17b14695cb3924cd5ceaeb3167e37d8992"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060count \u003E 0 \u0026\u0026 s.length \u003C= Int.MaxValue / count\u0060 appears character-identically in 2 files \u2014 sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.scala. 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"86eb033bb82fa111a888066a77d8df36b9946a7f06f602428b4be7aac820881e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060currentLineHasTag || previousPropertyLineHasTag\u0060 appears character-identically in 2 files \u2014 sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.scala. 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac04943643c5f0985b7256b857754afa5a76481640a92b07d3d59fded689c72e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060d.isNaN || d.isInfinite || Math.floor(d) != d\u0060 appears character-identically in 3 files \u2014 sjsonnet/src/sjsonnet/Util.scala, sjsonnet/src/sjsonnet/stdlib/ArrayModule.scala, sjsonnet/src/sjsonnet/stdlib/StringModule.scala. 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":"sjsonnet/src/sjsonnet/Util.scala"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78318465290efd6cea6dc85348c20d5de23e662a2074ab6a865a43d9a9106c4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.getMessage != null \u0026\u0026 e.getMessage.startsWith(\u0022There is no anchor for\u0022)\u0060 appears character-identically in 2 files \u2014 sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.scala. 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdfdd3c332c38cdaa1eae513b6aa51b4ddb9956ccf48e543dfd968d4563af03"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C prefix.length \u0026\u0026 !prefix.charAt(i).isWhitespace\u0060 appears character-identically in 3 files \u2014 sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.scala. 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"1458c8e4f28fc7bcfe8aed50628b0fa61d6b762a1e0a730bcd2442d0619bfe86"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C prefix.length \u0026\u0026 prefix.charAt(i).isWhitespace\u0060 appears character-identically in 3 files \u2014 sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.scala. 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c277b3f31c962a4cfa0829b7105a994f53d9442ff9ec72e0a32d6d877c75c4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C quoteIndex \u0026\u0026 !input.charAt(i).isWhitespace\u0060 appears character-identically in 3 files \u2014 sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.scala. 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"70cf08b6c9994c810b2fe184001b664913d92702a32eaa0e60a499c1a4fa250f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C quoteIndex \u0026\u0026 input.charAt(i).isWhitespace\u0060 appears character-identically in 3 files \u2014 sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.scala. 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac13446bb5656fc528f381a70428f390cecf215cab72c88a5ad71964c1153ec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C until \u0026\u0026 input.charAt(i).isWhitespace\u0060 appears character-identically in 2 files \u2014 sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.scala. 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fd6b890c77e650ea0c375594501371ef2427b92f4ed511a2654261f7cade4f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060indentCache != null \u0026\u0026 depth \u003C BaseCharRenderer.MaxCachedDepth\u0060 appears character-identically in 2 files \u2014 sjsonnet/src/sjsonnet/BaseCharRenderer.scala, sjsonnet/src/sjsonnet/Renderer.scala. 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":"sjsonnet/src/sjsonnet/BaseCharRenderer.scala"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95183ebf2203f18bfbd209101652f7c39532b08fa0da1e62605a4b9de1f857c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isCoreNonFinite \u0026\u0026 sn.tag == Tag.str \u0026\u0026 isPlainScalar(sn, input) \u0026\u0026 !hasExplicitStringTag(sn, input)\u0060 appears character-identically in 2 files \u2014 sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.scala. 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7eb3fcd7f1cd6a2d7873caac60a525b37358320889786c59f2bbdefd3a94665"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isWhitespaceOnly(input, lineStart, scanEnd) \u0026\u0026 previousPropertyLineHasExplicitFloatTag(input, lineStart)\u0060 appears character-identically in 2 files \u2014 sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.scala. 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f99ecc86e93bbd2fc00b26798ede9b28976ab003e57615d6b7ba01df7c486f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isWhitespaceOnly(input, lineStart, scanEnd) \u0026\u0026 previousPropertyLineHasExplicitStringTag(input, lineStart)\u0060 appears character-identically in 2 files \u2014 sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.scala. 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72086a29b5ab650b190c67be7f27e266fa701157753d4dfd75bf62ed451f895"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060quoted != \u0027\u0022\u0027 || !isEscapedDoubleQuote(input, i, from)\u0060 appears character-identically in 3 files \u2014 sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.scala. 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94f5154a71164bede88b497e0966f0ff14c6ee871555f865f05f7b1122818c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060quoted == \u0027\\\u0027\u0027 \u0026\u0026 i \u002B 1 \u003C until \u0026\u0026 input.charAt(i \u002B 1) == \u0027\\\u0027\u0027\u0060 appears character-identically in 3 files \u2014 sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.scala. 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fe8d8422d994fa87e502abe05ab11512f7bef835aa2a2a01c86b961cc03b8d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060regexMatches(YamlNonFiniteInfPattern, value) || regexMatches(YamlNonFiniteNaNPattern, value)\u0060 appears character-identically in 3 files \u2014 sjsonnet/src-js/sjsonnet/Platform.scala, sjsonnet/src-jvm/sjsonnet/Platform.scala, sjsonnet/src-native/sjsonnet/Platform.scala. 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":"sjsonnet/src-js/sjsonnet/Platform.scala"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a25da6639a1ea4ff13c692deec340dc6177d3ce7aa15091836db1b1c0a25379"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060reverse\u0060 is public and takes \u0060v: ujson.Value\u0060 from its caller, and it calls itself at line 594 with a piece of \u0060v\u0060, not as a tail call the compiler turns into a loop \u2014 and nowhere in \u0060reverse\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. On the JVM\u0027s default 1 MB thread stack a walk like this one throws \u0060StackOverflowError\u0060 from about 500\u20132,000 levels on a cold first call and 6,000\u201317,000 once warmed up (OpenJDK 21 and 25), while \u0060ujson.read\u0060, Jackson\u0027s \u0060readTree\u0060 before 2.15 and circe before 0.14.16 accept any nesting (2,000,000 levels from 4 MB) and circe 0.14.16 accepts 4,096 \u2014 on a cold JVM even play-json\u0027s cap of 1,000 is past the point the walk fails. \u0060StackOverflowError\u0060 is not \u0060NonFatal\u0060: \u0060Try\u0060, \u0060case NonFatal(e)\u0060 and \u0060recover\u0060 do not stop it, and in a \u0060Future\u0060 on the global execution context it leaves the future forever incomplete. Thread a depth argument through \u0060reverse\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Materializer.scala"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"b188043566cae37be0d90cc6bffa0795c3ac1983d3cf9cd4c816dcc2de166d01"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060toExpr\u0060 is public and takes \u0060v: ujson.Value\u0060 from its caller, and it calls itself at line 621 with a piece of \u0060v\u0060, not as a tail call the compiler turns into a loop \u2014 and nowhere in \u0060toExpr\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. On the JVM\u0027s default 1 MB thread stack a walk like this one throws \u0060StackOverflowError\u0060 from about 500\u20132,000 levels on a cold first call and 6,000\u201317,000 once warmed up (OpenJDK 21 and 25), while \u0060ujson.read\u0060, Jackson\u0027s \u0060readTree\u0060 before 2.15 and circe before 0.14.16 accept any nesting (2,000,000 levels from 4 MB) and circe 0.14.16 accepts 4,096 \u2014 on a cold JVM even play-json\u0027s cap of 1,000 is past the point the walk fails. \u0060StackOverflowError\u0060 is not \u0060NonFatal\u0060: \u0060Try\u0060, \u0060case NonFatal(e)\u0060 and \u0060recover\u0060 do not stop it, and in a \u0060Future\u0060 on the global execution context it leaves the future forever incomplete. Thread a depth argument through \u0060toExpr\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sjsonnet/src/sjsonnet/Materializer.scala"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"15407880e03f6c726fe1d813b0c2a03cbfb881703e17bf8ff4b2dc4c8f4f1f42"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\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":"sjsonnet/src-js/sjsonnet/SjsonnetMain.scala"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6660078cecc7de674f19e97d03f6e1fd8045a91568b0ce5f3e8a60f49cb292"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(_)\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":"sjsonnet/src/sjsonnet/Evaluator.scala"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98c4836a217094f798984bf08fc21b2dac4a58caf6cf33f4cbc6d38b5b8616c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\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":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"368b07741d1abae1b2eba629503e280c53988dbd230c24bae0001b25ae5b2172"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\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":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"897e0265ed36a71c4f17e89abeb7c56998e6d4c1912b5713033a1cd610eebccf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\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":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adb62461034a06dad62d938b7fce7c13d6e1feafa3aa1a9face6afffcb1a46a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\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":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a16c258dfb012654647c24589ca6325d3a6aaba6c52b5cab883117d02cf5a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\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":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7269e1e4765432a7f141f32d529d8c42dafc810ea85f6cc61c4b8412800e1b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\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":"sjsonnet/src/sjsonnet/StaticOptimizer.scala"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c278b8b991914121c6d65ce0e839605fddfb907dcc9affce06d85d6a61c216"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case _: Exception\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":"sjsonnet/src/sjsonnet/stdlib/StringModule.scala"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf14ac82611aae895ebc9cdaf62543a554f750ecb66df3576f90d34d07c3494"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060case NonFatal(e)\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":"sjsonnet/server/src/sjsonnet/SjsonnetServerMain.scala"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86c7ac89daee46526babb8fb2e49e5eb1fba96ba996d4af5cb669955805539a"}},{"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":"sjsonnet/client/src/sjsonnet/client/Locks.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47135379416cf4c9d510130e0fbb82662471e43c3e307eaeabde7fbad220274"}},{"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":"sjsonnet/client/src/sjsonnet/client/Locks.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f5fcca911cfed1ae998d59d1c1e67b03aa42652cf75c09db373454271ccc53"}},{"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":"sjsonnet/client/src/sjsonnet/client/Locks.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2679189efaba0413ddc3a0e5424245fe4943c76b6f6c74227cf51d2bc37866a5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (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":"sjsonnet/client/src/sjsonnet/client/SjsonnetClientMain.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d46f8e3253deaf80812d43e80d7790ef9ad7954fb4d2469eba93625d6148629"}},{"ruleId":"X5","level":"note","message":{"text":"Scala\u0027s null is not held to the type system everywhere: No build over this repository\u0027s 74 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-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-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]}],"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":1,"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."]}]}